✦ LIBER ✦

Computer algorithms for calculating efficient initial vectors for subspace iteration method

✍ Scribed by Tsu-Chien Cheu; C. Philip Johnson; Roy R. Craig Jr.

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 510 KB
Volume: 24
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.1620241003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative method for improving decima

An iterative method for improving decimal calculations on computers

✍ Jose-Luis Sanchez; Higinio Mora; Jeronimo Mora; Fco. Javier Ferrandez; Antonio J 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 933 KB

Vector Monte-Carlo methods for calculati

Vector Monte-Carlo methods for calculating iterations of integral operator resolvents

✍ G.A. Mikhailov 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 649 KB

An algorithm for calculating intramolecu

An algorithm for calculating intramolecular angle-dependent forces on vector computers

✍ J.H. Dunn; S.G. Lambrakos; P.G. Moore; M. Nagumo 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 133 KB

An algorithm for calculating intramolecu

An algorithm for calculating intramolecular angle-dependent forces on vector computers

✍ J.H. Dunn; S.G. Lambrakos; P.G. Moore; M. Nagumo 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 627 KB

An iterative method for large sparse lin

An iterative method for large sparse linear systems on a vector computer

✍ V. Ruggiero; E. Galligani 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Linear combination of Lanczos vectors: A

Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations

✍ T. Koslowski; W. Von Niessen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i