2011Chinese Journal of Radio ScienceRequires access

Sparse approximate inverse preconditioners based on a revised Cholesky factorization

Sheng Xin-qing

Open publisher page 0 citations

Abstract

Sparse approximate inverse(SAI)preconditioner based on a revised Cholesky factorization is presented in this paper.The traditional Cholesky factorization is firstly revised to cope with the matrix arising from electric field integral equations,which is a complex symmetric matrix,then this revised Cholesky factorization is applied to construct SAI preconditioner for the multilevel fast multipole algorithm(MLFMA).Numerical experiments show that SAI preconditioner constructed by the revised Cholesky factorization performs more efficiently than the previous SAI constructed from QR factorization.

About this research paper

What this paper is about

Sparse approximate inverse(SAI)preconditioner based on a revised Cholesky factorization is presented in this paper.The traditional Cholesky factorization is firstly revised to cope with the matrix arising from electric field integral equations,which is a complex symmetric matrix,then this revised Cholesky factorization is applied to construct SAI preconditioner for the multilevel fast multipole algorithm(MLFMA).Numerical experiments show that SAI preconditioner constructed by the revised Cholesky factorization performs more efficiently than the previous SAI constructed from QR factorization.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Sparse approximate inverse(SAI)preconditioner based on a revised Cholesky factorization is presented in this paper.The traditional Cholesky factorization is firstly revised to cope with the matrix arising from electric field integral equations,which is a complex symmetric matrix,then this revised Cholesky factorization is applied to construct SAI preconditioner for the multilevel fast multipole algorithm(MLFMA).Numerical experiments show that SAI preconditioner constructed by the revised Cholesky factorization performs more efficiently than the previous SAI constructed from QR factorization.

Key concepts: Cholesky decomposition, Incomplete Cholesky factorization, Preconditioner, Minimum degree algorithm, Incomplete LU factorization, Factorization, Mathematics, Matrix (chemical analysis)

Related papers

Back to paper searchBrowse research topicsOriginal source
Sparse approximate inverse preconditioners based on a revised Cholesky factorization — Research Paper | ScholarLens