✦ LIBER ✦

Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix

✍ Scribed by Heinrich Voss

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 541 KB
Volume: 287
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10147-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A projection method for computing the mi

A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix

✍ Wolfgang Mackens; Heinrich Voss 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 773 KB

A projection method for computing the minimal eigenvalue of a symmetric and positive definite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in [12] (W. Mackens, H. Voss, SIAM J. Matrix Anal. Appl. 18 (1997) Q-534). Global and cubic convergence is proved. Rand

A fast algorithm for computing the small

A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix

✍ N. Mastronardi; M. Van Barel; R. Vandebril 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

MinimaL eigenvalue of a real symmetric p

MinimaL eigenvalue of a real symmetric positive definite Toeplitz matrix

✍ M.A. Shalaby 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 368 KB

A Schur-based algorithm for computing bo

A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix

✍ N. Mastronardi; M. Van Barel; R. Vandebril 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Computation of eigenvalues and eigenvect

Computation of eigenvalues and eigenvectors of a symmetric quindiagonal matrix

✍ David J. Evans 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 556 KB

A recursive algorithm for the implicit derivation of the determinant of a symmetric quindiagonal matrix is developed in terms of its leading principal minors. The algorithm is shown to yield a Sturmian sequence of polynomials from which the eigenvalues can be obtained by use of the bisection process

Estimating the extremal eigenvalues of a

Estimating the extremal eigenvalues of a symmetric matrix

✍ V. Pan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Almtraet--Lower and upper bounds on the absolute values of the eigenvalues of an n x n real symmetric matrix A are given by (trace A ,,)t/m for both negative and positive even m. (The bounds are within a factor of 2 from the eigenvalues already for m > log 2 n.) We present algorithms for computing t