✦ LIBER ✦

Linear complexity algorithm for semiseparable matrices

✍ Scribed by Israel Koltracht

Publisher: SP Birkhäuser Verlag Basel
Year: 1997
Tongue: English
Weight: 234 KB
Volume: 29
Category: Article
ISSN: 0378-620X
DOI: 10.1007/bf01320704

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear complexity algorithms for semisep

Linear complexity algorithms for semiseparable matrices

✍ I. Gohberg; T. Kailath; I. Koltracht 📂 Article 📅 1985 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 687 KB

Inversion formulas and linear complexity

Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices

✍ Y. Eidelman; I. Gohberg 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 494 KB

Fast algorithms for hierarchically semis

Fast algorithms for hierarchically semiseparable matrices

✍ Jianlin Xia; Shivkumar Chandrasekaran; Ming Gu; Xiaoye S. Li 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

An implicit QR algorithm for symmetric s

An implicit QR algorithm for symmetric semiseparable matrices

✍ Raf Vandebril; Marc Van Barel; Nicola Mastronardi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB

Fast inversion algorithms for diagonal p

Fast inversion algorithms for diagonal plus semiseparable matrices

✍ Y. Eidelman; I. Gohberg 📂 Article 📅 1997 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 782 KB

A look-ahead block schur algorithm for d

A look-ahead block schur algorithm for diagonal plus semiseparable matrices

✍ Y. Eidelman; I. Gohberg 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 533 KB

A look-ahead recumive algorithm for the block triangular factorization of matrices represented as a sum of diagonal and semiseparable ones is derived. This factorization is used for fast solving of the corresponding linear system. For the case of sizes of diagonal blocks not depending on dimension o