𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sparse approximate inverse and multilevel block ILU preconditioning techniques for general sparse matrices

✍ Scribed by Jun Zhang

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
312 KB
Volume
35
Category
Article
ISSN
0168-9274

No coin nor oath required. For personal study only.

✦ Synopsis

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 (BILUM) and offers a convenient means to control the fill-in elements when large size blocks (subdomains) are used to form block independent set. Moreover, the new implementation of BILUM with a sparse approximate inverse strategy affords maximum parallelism for operations within each level as well as for the coarsest level solution. Thus it has two advantages over the standard BILUM preconditioner: the ability to control sparsity and increased parallelism. Numerical experiments are used to show the effectiveness and efficiency of the proposed variant of BILUM.

πŸ“œ SIMILAR VOLUMES

Parallel two level block ILU preconditio
Parallel two level block ILU preconditioning techniques for solving large sparse linear systems
✍ Chi Shen; Jun Zhang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 244 KB

We discuss issues related to domain decomposition and multilevel preconditioning techniques which are often employed for solving large sparse linear systems in parallel computations. We implement a parallel preconditioner for solving general sparse linear systems based on a two level block ILU facto

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

An efficient sparse approximate inverse
An efficient sparse approximate inverse preconditioning for FMM implementation
✍ P. L. Rui; R. S. Chen πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

## 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)

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

Sparse approximate inverse preconditione
Sparse approximate inverse preconditioned CG-FFT algorithm with block toeplitz matrix for fast analysis of microstrip circuits
✍ R. S. Chen; K. F. Tsang; Edward K. N. Yung πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

## Abstract In this paper, the multifrontal method is employed to precondition the conjugate gradient (CG) algorithm with the block Toeplitz matrix based fast Fourier transform (FFT) technique for dense matrix equations from the mixed potential integral equation (MPIE) to enhance the computational