✦ LIBER ✦

A fast algorithm for block Toeplitz systems with tensor structure

✍ Scribed by Xiao-Qing Jin

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 331 KB
Volume: 73
Category: Article
ISSN: 0096-3003
DOI: 10.1016/0096-3003(94)00243-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New fast algorithms for systems with Han

New fast algorithms for systems with Hankel and Toeplitz matrices

✍ E.E. Tyrtyshnikov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 389 KB

Efficient algorithms for the solution of

Efficient algorithms for the solution of block linear systems with Toeplitz entries

✍ George-Othon Glentis; Nicholas Kalouptsidis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 839 KB

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

A direct method for solving block-Toepli

A direct method for solving block-Toeplitz with near-circulant-block systems with applications to hybrid manufacturing systems

✍ Wai-Ki Ching; Michael K. Ng; Wai-On Yuen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

An LDU decomposition algorithm for a blo

An LDU decomposition algorithm for a block Toeplitz matrix having a parallel and pipelined computing structure

✍ Youji Iiguni; Hideaki Sakai; Hidekatsu Tokumaru 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 585 KB

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