𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the determination of a tridiagonal matrix from its spectrum and a submatrix

✍ Scribed by P. Deift; T. Nanda

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
525 KB
Volume
60
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the numerical inversion
An algorithm for the numerical inversion of a tridiagonal matrix
✍ Kumar, Surendra ;Shashi, ;PethΓΆ, Árpad πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.

A submatrix algorithm for the matrix-vec
A submatrix algorithm for the matrix-vector multiplication of very large matrices
✍ Roland Lindh; Per-Γ…rke Malmquist πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 179 KB

In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix, Tikl, and the vector is the first-order density matrix, yi. This form

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