𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient sparse approximate inverse preconditioning for FMM implementation

✍ Scribed by P. L. Rui; R. S. Chen

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
199 KB
Volume
49
Category
Article
ISSN
0895-2477

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

For efficiently solving large dense complex linear systems that arise in electric field integral equations (EFIE) of electromagnetic scattering problems, the fast multipole method (FMM) is used to accelerate the matrix‐vector product operations, and the sparse approximate inverse (SAI) preconditioning technique is employed to speed up the convergence rate of the Krylov iterations. A good quality SAI preconditioner in the FMM context is constructed based on the near‐field matrix of the EFIE. The main purpose of this paper is to show that the quality of the SAI preconditioner can be greatly improved by use of information from FMM implementation. Numerical experiments indicate that the resulted SAI preconditioner is very effective with FMM and can reduce the overall simulation time significantly. Β© 2007 Wiley Periodicals, Inc. Microwave Opt Technol Lett 49: 1746–1750, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.22538

πŸ“œ SIMILAR VOLUMES

Sparse approximate inverse and multileve
Sparse approximate inverse and multilevel block ILU preconditioning techniques for general sparse matrices
✍ Jun Zhang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 312 KB

We investigate the use of sparse approximate inverse techniques in a multilevel block ILU preconditioner to design a robust and efficient parallelizable preconditioner for solving general sparse matrices. The resulting preconditioner retains robustness of the multilevel block ILU preconditioner (BIL

Factorized sparse approximate inverse pr
Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
✍ L. Yu. Kolotilina; A. A. Nikishin; A. Yu. Yeremin πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 78 KB πŸ‘ 2 views

This paper continues the theoretical and numerical study of the so-called factorized sparse approximate inverse (FSAI) preconditionings of symmetric positive-definite matrices and considers two new approaches to improving them. The first one is based on the a posteriori sparsification of an already

A two-phase preconditioning strategy of
A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
✍ Eun-Joo Lee; Jun Zhang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 445 KB

A two-phase preconditioning strategy based on a factored sparse approximate inverse is proposed for solving sparse indefinite matrices. In each phase, the strategy first makes the original matrix diagonally dominant to enhance the stability by a shifting method, and constructs an inverse approximati

Sparse approximate inverse preconditioni
Sparse approximate inverse preconditioning of deflated block-GMRES algorithm for the fast monostatic RCS calculation
✍ P. L. Rui; R. S. Chen πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 177 KB

## Abstract A sparse approximate inverse (SAI) preconditioning of deflated block‐generalized minimal residual (GMRES) algorithm is proposed to solve large dense linear systems with multiple right‐hand sides arising from monostatic radar cross section (RCS) calculations. The multilevel fast multipol

Wavelet-based sparse approximate inverse
Wavelet-based sparse approximate inverse preconditioned CG algorithm for fast analysis of microstrip circuits
✍ R. S. Chen; K. F. Tsang; Lei Mo πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 156 KB

## Abstract In this paper, the wavelet transform technique is used to transform dense matrix equations from the mixed potential integral equation (MPIE) to obtain sparse matrix equations, after dropping elements smaller than the threshold. The multifrontal method is employed to solve the resultant