✦ LIBER ✦

A Newton's method for finding the eigenvalues and eigenvectors of a matrix

✍ Scribed by V.N. Kublanovskaya

Publisher: Elsevier Science
Year: 1972
Weight: 616 KB
Volume: 12
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(72)90137-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new relaxation method for obtaining th

A new relaxation method for obtaining the lowest eigenvalue and eigenvector of a matrix equation

✍ Yoshiaki Muda 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Derivatives of eigenvalues and eigenvect

Derivatives of eigenvalues and eigenvectors of a general complex matrix

✍ Durbha V. Murthy; Raphael T. Haftka 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 950 KB

Newton's Method for a Generalized Invers

Newton's Method for a Generalized Inverse Eigenvalue Problem

✍ Hua Dai; Peter Lancaster 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 2 views

A kind of generalized inverse eigenvalue problem is proposed which includes the additive, multiplicative and classical inverse eigenvalue problems as special cases. Newton's method is applied, and a local convergence analysis is given for both the distinct and the multiple eigenvalue cases. When the

On a class of algorithms for finding the

On a class of algorithms for finding the maximum eigenvalue and corresponding eigenvector of an irreducible non-negative matrix

✍ Fam Van At 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 483 KB

One method of finding the maximum eigenv

One method of finding the maximum eigenvalue of a symmetric matrix

✍ G.P. Prokopov 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 350 KB

A Flexible Method for Calculating Eigenv

A Flexible Method for Calculating Eigenvalues and Eigenvectors for the Internal Rotor Problem

✍ K.P. Lawley 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 255 KB

The general utility of a discretized variable basis for the internal rotor eigenvalue problem, especially when coupled with an algebraic determinantal approach, is demonstrated. The computational routines are simple recursive ones and the incorporation of symmetry constraints is straightforward. The