✦ LIBER ✦

Divide and conquer methods for block tridiagonal systems

✍ Scribed by Volker Mehrmann

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 967 KB
Volume: 19
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(93)90037-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Overlapping block methods for solving tr

Overlapping block methods for solving tridiagonal systems on transputer arrays

✍ R. Wait; N.G. Brown 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Invariant imbedding for block tridiagona

Invariant imbedding for block tridiagonal systems

✍ P. Hillion 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

A divide and conquer method for polynomi

A divide and conquer method for polynomial zeros

✍ T.L. Freeman; R.W. Brankin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Chronological decomposition heuristic fo

Chronological decomposition heuristic for scheduling: Divide and conquer method

✍ Jeffrey Dean Kelly 📂 Article 📅 2002 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 153 KB 👁 1 views

A BSP Recursive Divide and Conquer Algor

A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix

✍ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study

Iterative decomposition methods for solv

Iterative decomposition methods for solving systems of equations with a block-tridiagonal matrix

✍ I.D. Bliadze; G.V. Meladze 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 534 KB