Tyt. z nagłówka.Bibliogr. s. 248-249.A technique for computing an ILU preconditioner based on the factored approximate inverse (FAPINV) algorithm is presented. We show that this algorithm is well-defined for H-matrices. Moreover, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Numerical experiments on some test matrices are given to show the efficiency of the new ILU preconditioner.Dostępny również w formie drukowanej.KEYWORDS: system of linear equations, preconditioner, FAPINV, ILU preconditioner, H-matrix, GMRES
Although some preconditioners are available for solving dense linear systems, there are still many m...
a b s t r a c t In this paper a new ILU factorization preconditioner for solving large sparse linear...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
A technique for computing an ILU preconditioner based on the factored approximate inverse (FAPINV) a...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
In this paper we consider the Krylov subspace based method introduced in [Fasano, 2005a], for iterat...
Iterative ILU factorizations are constructed, analyzed and applied as preconditioners to solve both ...
Incomplete LU (ILU) preconditioning is typically used when an iterative solver is applied on an asym...
In this paper we consider the Krylov subspace based method introduced in [Fasano, 2005a], for iterat...
In this paper we consider the parameter dependent class of preconditioners M#ℎ(a, delta,D) defined i...
AbstractThe main idea of this paper is in determination of the pattern of nonzero elements of the LU...
In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the c...
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a gen...
A novel parallel preconditioner combining a generalized Factored Sparse Approximate Inverse (FSAI) w...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
Although some preconditioners are available for solving dense linear systems, there are still many m...
a b s t r a c t In this paper a new ILU factorization preconditioner for solving large sparse linear...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
A technique for computing an ILU preconditioner based on the factored approximate inverse (FAPINV) a...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
In this paper we consider the Krylov subspace based method introduced in [Fasano, 2005a], for iterat...
Iterative ILU factorizations are constructed, analyzed and applied as preconditioners to solve both ...
Incomplete LU (ILU) preconditioning is typically used when an iterative solver is applied on an asym...
In this paper we consider the Krylov subspace based method introduced in [Fasano, 2005a], for iterat...
In this paper we consider the parameter dependent class of preconditioners M#ℎ(a, delta,D) defined i...
AbstractThe main idea of this paper is in determination of the pattern of nonzero elements of the LU...
In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the c...
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a gen...
A novel parallel preconditioner combining a generalized Factored Sparse Approximate Inverse (FSAI) w...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
Although some preconditioners are available for solving dense linear systems, there are still many m...
a b s t r a c t In this paper a new ILU factorization preconditioner for solving large sparse linear...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...