A three-dimensional explicit preconditioned solver

Authors:
G. A. Gravvanis;E. A. Lipitakis
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
1996

Citing 2
Cited 1

Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors

Mathematics and Computers in Simulation
CGS, a fast Lanczos-type solver for nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing

On the Solution of Boundary Value Problems by Using Fast Generalized Approximate Inverse Banded Matrix Techniques

The Journal of Supercomputing

Quantified Score

Hi-index	0.09

Visualization

Abstract

A new class of Generalized Approximate Inverse Matrix (GAIM) techniques, based on the concept of LU-sparse factorization procedures, is introduced for computing explicitly generalized approximate inverses of large sparse unsymmetric matrices of regular structure, without inverting the decomposition factors. Explicit preconditioned iterative methods, in conjunction with modified forms of the GAIM techniques, are presented for solving numerically boundary value problems in three dimensions. The numerical implementation of these algorithms is presented and Fortran subroutines are given