Sparse pattern selection strategies for robust Frobenius-norm minimization preconditioners in electromagnetism

Numerical Linear Algebra with Applications

Volumn 7, Issue 7-8, 2000, Pages 667-685

  Carpentieri, B ^a   Duff, I S ^a,b   Giraud, L ^a  

^a CERFACS   (France)

^b RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Electromagnetic scattering applications; Frobenius norm minimization method; Non zero pattern selection strategies; Preconditioning techniques

Indexed keywords

EID: 0034359574     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1506(200010/12)7:7/8<667::aid-nla218>3.0.co;2-x     Document Type: Article

References (29)

1. Peterson AF, Ray SL, Mittra R. Computational Methods for Electromagnetics. IEEE Press, 1997.
2. Carpentieri B, Duff IS, Giraud L. Experiments with sparse preconditioning of dense problems from electromagnetic applications. Technical Report TR/PA/00/04, CERFACS, Toulouse, France, 1999.
3. Dembart B, Epton MA. Low frequency multipole translation theory for the Helmholtz equation. Technical Report SSGTECH-98-013, The Boeing Company, Seattle, WA, 1998.
4. Dembart B, Epton MA. Spherical harmonic analysis and synthesis for the fast multipole method. Technical Report SSGTECH-98-014, The Boeing Company, Seattle, WA, 1998.
5. Dembart B, Yip E. Matrix assembly in FMM-MoM codes. Technical Report ISSTECH-97-002, The Boeing Company, Seattle, WA, 1997.
6. Chen K. On a class of preconditioning methods for dense linear systems from boundary elements. SIAM Journal on Scientific Computing, 1998; 20(2): 684-698.
7. Bendali A. Approximation par éléments finis de surface de problemes de diffraction des ondes électro-magnétiques. PhD thesis, Université Paris VI, 1984.
8. Saad Y, Schultz MH. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 1986; 7: 856-869.
9. van der Vorst HA. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 1992; 13: 631-644.
10. Freund RW, Nachtigal NM. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numerische Mathematik, 1991; 60(3): 315-339.
11. Freund RW. A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM Journal on Scientific Computing, 1993; 14(2): 470-482.
12. Benson MW. Iterative solution of large scale linear systems. Master's thesis, Lakehead University, Thunder Bay, Canada, 1973.
13. Benson MW, Frederickson PO. Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems. Utilitas Mathematica, 1982; 22: 127-140.
14. Benson MW, Krettmann J, Wright M. Parallel algorithms for the solution of certain large sparse linear systems. International Journal of Computational Mathematics, 1984; 16: 245-260.
15. Frederickson PO. Fast approximate inversion of large sparse linear systems. Mathematics Report 7, Lakehead University, Thunder Bay, Canada, 1975.
16. Alléon G, Benzi M, Giraud L. Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics. Numerical Algorithms, 1997; bf16: 1-15.
17. Chow E. A priori sparsity patterns for parallel sparse approximate inverse preconditioners. Technical Report UCRL-JC-130719, Lawrence Livermore National Laboratory, Livermore, CA, 1998. SIAM Journal on Scientific Computing, 2000; 21:1804-1822.
18. Demko S, Moss WF, Smith PW. Decay rates for inverses of band matrices. Mathematics of Computation, 1984; 43: 491-499.
19. Eijkhout V, Polman B. Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices. Linear Algebra and its Applications, 1988; 109: 247-277.
20. Meurant G. A review on the inverse of symmetric tridiagonal and block tridiagonal matrices. SIAM Journal on Matrix Analysis and Applications 1992; 13: 707-728.
21. Kolotilina LYu. Explicit preconditioning of systems of linear algebraic equations with dense matrices. Journal of Soviet Mathematics, 1988; 43: 2566-2573. English translation of a paper first published in Zapisli Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo im. V. A. Steklova AN SSSR 1986; 154: 90-100.
22. Kolotilina LYu. Explicit preconditioning of systems of linear algebraic equations with dense matrices. Journal of Soviet Mathematics, 1988; 43: 2566-2573. English translation of a paper first published in Zapisli Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo im. V. A. Steklova AN SSSR 1986; 154: 90-100.
23. Grote M, Huckle T. Parallel preconditionings with sparse approximate inverses. SIAM Journal on Scientific Computing, 1997; 18:838-853.
24. Rahola J. Experiments on iterative methods and the fast multipole method in electromagnetic scattering calculations. Technical Report TR/PA/98/49, CERFACS, Toulouse, France, 1998.
25. Gould NIM, Scott JA. Sparse approximate-inverse preconditioners using norm-minimization techniques. SIAM Journal on Scientific Computing, 1998; 19(2): 605-625.
26. Frayssé V, Giraud L, Gratton S. A set of GMRES routines for real and complex arithmetics. Technical Report TR/PA/97/49, CERFACS, Toulouse, France, 1997.
27. A collection of Fortran codes for large scale scientific computation, 2000. http://www.numerical.rl.ac.uk/hsl
28. Freund RW, Nachtigal NM. QMRPACK: a package of QMR algorithms. ACM Transactions on Mathematical Software, 1996; 22: 46-77.
29. Chow E, Saad Y. Approximate inverse preconditionings via sparse-sparse iterations. SIAM Journal on Scientific Computing, 1998; 19(3): 995-1023.