2002
DOI: 10.1002/cnm.568
|View full text |Cite
|
Sign up to set email alerts
|

Numerical performance of preconditioning techniques for the solution of complex sparse linear systems

Abstract: Preconditioning techniques based on ILU decomposition, on Frobenius norm minimization and on factorized sparse approximate inverse are considered. These algorithms are applied with conjugate gradient-type methods, namely Bi-CGSTAB, QMR and TFQMR for the solution of complex, large, sparse linear systems. The results of numerical experiments in scalar environment with matrices arising from transport in porous media, quantum chemistry, structural dynamics and electromagnetism are analysed. The preconditioner that… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 24 publications
0
4
0
Order By: Relevance
“…While solving the above real system by a preconditioned conjugate gradient solver shows acceptable convergence for this particular problem, it should be noted this does not necessarily hold for general complex systems arising from finite element discretizations of HelmholtzÕs equation because the resulting system is not always positive definite. Several iterative solvers for such complex systems have been developed and examined for different problems [28][29][30].…”
Section: The Finite Element Methodsmentioning
confidence: 99%
“…While solving the above real system by a preconditioned conjugate gradient solver shows acceptable convergence for this particular problem, it should be noted this does not necessarily hold for general complex systems arising from finite element discretizations of HelmholtzÕs equation because the resulting system is not always positive definite. Several iterative solvers for such complex systems have been developed and examined for different problems [28][29][30].…”
Section: The Finite Element Methodsmentioning
confidence: 99%
“…Suitable iterative solvers for sparse complex symmetric matrix systems other than GM-RES include BiCG-Stab, [170], QMR [67] and TF-QMR [68] methods. Some numerical comparisons of the alternative iterative solvers are reported in [128] and elsewhere. The best combination of iterative solver and preconditioner seems to be problem dependent.…”
Section: Iterative Solution Methodsmentioning
confidence: 99%
“…those studied in Adams (2007), Elman et al (2001), Erlangga et al (2004), Haber & Ascher (2001), Howle & Vavasis (2005), Poirier (2000) and Reitzinger et al (2003), there has been some work on the use of generalpurpose techniques such as SSOR, polynomial preconditioning, incomplete factorizations and sparse approximate inverses (see, e.g. Freund, 1990;Horesh et al, 2006;Mazzia & Pini, 2003;Mazzia & McCoy, 1999). Somewhere in between, we mention the work of Magolu monga Made (2001, e.g.…”
Section: Previous Workmentioning
confidence: 99%