๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices

โœ Scribed by Bar-On, Ilan; Codenotti, Bruno; Leoncini, Mauro

Book ID
118215402
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
334 KB
Volume
18
Category
Article
ISSN
0895-4798

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel QR Algorithm for the Symmetri
A Parallel QR Algorithm for the Symmetrical Tridiagonal Eigenvalue Problem
โœ L. Kaufman ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 478 KB

The implicit QR algorithm is a serial iterative algorithm for determining all the eigenvalues of an \(n \times n\) symmetric tridiagonal matrix \(A\). About \(3 n\) iterations, each requiring the serial application of about \(n\) similarity planar transformations, are required to reduce \(A\) to dia