## Abstract We consider symmetric preconditioning strategies for the iterative solution of dense complex symmetric nonβHermitian systems arising in computational electromagnetics. In particular, we report on the numerical behaviour of the classical incomplete Cholesky factorization as well as some
β¦ LIBER β¦
Multipole-based preconditioners for large sparse linear systems
β Scribed by Sreekanth R. Sambavaram; Vivek Sarin; Ahmed Sameh; Ananth Grama
- Book ID
- 104304271
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 141 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Sparse symmetric preconditioners for den
β
B. Carpentieri; I. S. Duff; L. Giraud; M. Magolu monga Made
π
Article
π
2004
π
John Wiley and Sons
π
English
β 232 KB
A Sparse Approximate Inverse Preconditio
β
Benzi, Michele; Tuma, Miroslav
π
Article
π
1998
π
Society for Industrial and Applied Mathematics
π
English
β 902 KB
A Restricted Additive Schwarz Preconditi
β
Cai, Xiao-Chuan; Sarkis, Marcus
π
Article
π
1999
π
Society for Industrial and Applied Mathematics
π
English
β 474 KB
Parallel frontal solvers for large spars
β
Scott, Jennifer A.
π
Article
π
2003
π
Association for Computing Machinery
π
English
β 127 KB
Parallel frontal solvers for large spars
β
Scott, Jennifer A.
π
Article
π
2003
π
Association for Computing Machinery
π
English
β 127 KB
Many applications in science and engineering give rise to large sparse linear systems of equations that need to be solved as efficiently as possible. As the size of the problems of interest increases, it can become necessary to consider exploiting multiprocessors to solve these systems. We report on
A modified SSOR preconditioner for spars
β
X. Chen; K. C. Toh; K. K. Phoon
π
Article
π
2006
π
John Wiley and Sons
π
English
β 216 KB