𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast cholesky factorization algorithm for s. p. d block-Toeplitz matrices

✍ Scribed by Zhang Li; Zheng Hui-rao; Xie Jin-li; Wang Wei

Publisher
Wuhan University
Year
1999
Tongue
English
Weight
264 KB
Volume
4
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithm for matrix–vector multipl
Fast algorithm for matrix–vector multiply of asymmetric multilevel block-Toeplitz matrices in 3-D scattering
✍ Benjamin E. Barrowes; Fernando L. Teixeira; Jin A. Kong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract A new __O__(__N__ log __N__) FFT‐based method to expedite matrix–vector multiplies involving multilevel block‐Toeplitz (MBT) matrices is presented. The method is also a minimal memory method with __O__(__N__) memory requirements because only nonredundant entries of the MBT matrix are st

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

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