✦ LIBER ✦

Computing the Smallest Eigenpair of a Symmetric Positive Definite Toeplitz Matrix

✍ Scribed by Mastronardi, Nicola; Boley, Daniel

Book ID: 118188944
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 295 KB
Volume: 20
Category: Article
ISSN: 1064-8275
DOI: 10.1137/s106482759732229x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing a Lower Bound of the Smallest

Computing a Lower Bound of the Smallest Eigenvalue of a Symmetric Positive-Definite Toeplitz Matrix

✍ Laudadio, T.; Mastronardi, N.; Van Barel, M. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 236 KB

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

Computing the Minimum Eigenvalue of a Sy

Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix

✍ Cybenko, George; Van Loan, Charles 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics ⚖ 824 KB

Computation of the Smallest Even and Odd

Computation of the Smallest Even and Odd Eigenvalues of a Symmetric Positive-Definite Toeplitz Matrix

✍ Melman, A. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 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

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