C语言实现GMRES算法解决大型稀疏对称矩阵问题

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>

void gmres(double *r, double *x ,double *b,int R,double *data,int *indices,int *ptr)
{
int i,j,k,d,f,m=5;
double *t,*y,*h1,*w,beta=0,*V,*g,*H,*h,*s,*c,*omega_data,*omega1_data,*inv_H_data;
int *omega_indices,*omega_ptr,*omega1_indices,*omega1_ptr,*inv_H_indices,*inv_H_ptr;
y = (double*)malloc(sizeof(double) * m);
t = (double*)malloc(sizeof(double) * R);
w = (double*)malloc(sizeof(double) * R);
g = (double*)malloc(sizeof(double) * (m+1));
V = (double*)malloc(sizeof(double) * R*(m+1));
H = (double*)malloc(sizeof(double) * ((m+3)*m)/2);
h = (double*)malloc(sizeof(double) * (m+1));
s = (double*)malloc(sizeof(double) * (m+1));
c = (double*)malloc(sizeof(double) * (m+1));
h1 = (double*)malloc(sizeof(double) * 2);
omega1_data = (double*)malloc(sizeof(double) * (((m+3)*m)/2+m+1));
omega1_indices = (int*)malloc(sizeof(int) * (((m+3)*m)/2+m+1));
omega1_ptr = (int*)malloc(sizeof(int) * (m+2));
omega_data = (double*)malloc(sizeof(double) * (m+3));
omega_indices = (int*)malloc(sizeof(int) * (m+3));
omega_ptr = (int*)malloc(sizeof(int) * (m+2));
inv_H_data = (double*)malloc(sizeof(double) * (((m+1)*m)/2));
inv_H_indices =  (int*)malloc(sizeof(int) * (((m+1)*m)/2));
inv_H_ptr = (int*)malloc(sizeof(int) * (m+1));

//初始化
for(i=0;i<R;i++)
{
t[i]=0;
w[i]=0;
}

for(i=0;i<m+1;i++)
{
g[i]=0;
h[i]=0;
}

for(i=0;i<R*(m+1);i++)
{
V[i]=0;
}

for(i=0;i<((m+3)*m)/2;i++)
{
H[i]=0;
}

for(i=0;i<(m+3);i++)
{
omega_data[i]=1;
}

for(i=2;i<(m+3);i++)
{