flexible GMRES from ITSOL developed by Yousef Saad. More...

#include "slu_sdefs.h"

Include dependency graph for sfgmr.c:

Macros
#define	epsmac 1.0e-16

Functions
float	sdot_ (int , float[], int , float[], int *)

float	snrm2_ (int , float[], int )

int	sfgmr (int n, void(smatvec)(float, float[], float, float[]), void(spsolve)(int, float[], float[]), float rhs, float sol, double tol, int im, int itmax, FILE fits)
	Simple version of the ARMS preconditioned FGMRES algorithm. More...

Macro Definition Documentation

◆ epsmac

#define epsmac 1.0e-16

Function Documentation

◆ sdot_()

float sdot_	(	int *	,
		float	[],
		int *	,
		float	[],
		int *
	)

◆ sfgmr()

int sfgmr	(	int	n,
		void(*)(float, float[], float, float[])	smatvec,
		void(*)(int, float[], float[])	spsolve,
		float *	rhs,
		float *	sol,
		double	tol,
		int	im,
		int *	itmax,
		FILE *	fits
	)

Y. S. Dec. 2000. – Apr. 2008

internal work arrays: vv = work array of length [im+1][n] (used to store the Arnoldi basis) hh = work array of length [im][im+1] (Householder matrix) z = work array of length [im][n] to store preconditioned vectors

Parameters

[in]	n	Dimension of vectors and matrices.
[in]	smatvec	Operation for matrix-vector multiplication.
[in]	spsolve	(right) preconditioning operation. Can be a NULL pointer (GMRES without preconditioner)
[in]	rhs	Real vector of length n containing the right hand side.
[in,out]	sol	In: Real vector of length n containing an initial guess to the solution on input. Out: Contains an approximate solution (upon successful return).
[in]	tol	Tolerance for stopping iteration
[in]	im	Krylov subspace dimension
[in,out]	itmax	In: max number of iterations allowed. Out: number of steps required to converge.
[in]	fits	If NULL, no output. If not NULL, file handle to output "resid vs time and its".

Returns: Whether the algorithm finished successfully.

Here is the call graph for this function:

◆ snrm2_()

float snrm2_	(	int *	,
		float	[],
		int *
	)