𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A method for eigenvalues of sparse λ-matrices

✍ Scribed by Wei H. Yang

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
308 KB
Volume
19
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Calculation of clustered eigenvalues of
Calculation of clustered eigenvalues of large matrices using variance minimization method
✍ Besal�, Emili; Bofill, Josep Maria 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB 👁 2 views

The autoadjusting perturbation theory method is presented and developed to calculate eigenpairs of a square matrix. The procedures to simultaneously compute a cluster of eigenpairs by variance minimization are also given. Finally, numerical examples are reported.

Conjugate Gradient and Lanczos Methods f
Conjugate Gradient and Lanczos Methods for Sparse Matrices on Distributed Memory Multiprocessors
✍ A. Basermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Conjugate gradient methods for solving sparse systems of linear equations and Lanczos algorithms for sparse symmetric eigenvalue problems play an important role in numerical methods for solving discretized partial differential equations. When these iterative solvers are parallelized on a multiproces

Eigenvalue bounds for some classes of P-
Eigenvalue bounds for some classes of P-matrices
✍ J. M. Peña 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract Eigenvalue bounds are provided. It is proved that the minimal eigenvalue of a __Z__‐matrix strictly diagonally dominant with positive diagonals lies between the minimal and the maximal row sums. A similar upper bound does not hold for the minimal eigenvalue of a matrix strictly diagonal