𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix

✍ Scribed by Fang Yunlan; Zheng Huirao; Hu Xiao

Publisher
Wuhan University
Year
1997
Tongue
English
Weight
315 KB
Volume
2
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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