✦ LIBER ✦

Tridiagonalization of band symmetric matrices for vector computers

✍ Scribed by T.Z. Kalamboukis

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 245 KB
Volume: 19
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90004-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simultaneous tridiagonalization of two s

Simultaneous tridiagonalization of two symmetric matrices

✍ Seamus D. Garvey; Françoise Tisseur; Michael I. Friswell; John E. T. Penny; Uwe 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

Eigenvalue computation of large symmetri

Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors

✍ H.Y. Chang; S. Utku; M. Salama 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 722 KB

A pivoting strategy for symmetric tridia

A pivoting strategy for symmetric tridiagonal matrices

✍ James R. Bunch; Roummel F. Marcia 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

A simplified pivoting strategy for symme

A simplified pivoting strategy for symmetric tridiagonal matrices

✍ James R. Bunch; Roummel F. Marcia 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

Computations with symmetric, positive de

Computations with symmetric, positive definite and band matrices on a parallel vector processor

✍ Zahari Zlatev; Phuong Vu; Jerzy Wasniewski; Kjeld Schaumburg 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 959 KB

Exponentials of symmetric matrices throu

Exponentials of symmetric matrices through tridiagonal reductions

✍ Ya Yan Lu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 473 KB

A simple and efficient numerical algorithm for computing the exponential of a symmetric matrix is developed in this Paper. For an n x n matrix. the required number ot operations is around 10/3 n3. It is based on the orthogonal reduction to a tridiagonal form and the Chebyshev uniform approximation o