Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Eberlein (1970)
Solution to the complex eigenproblem by a norm reducing Jacobi type methodNumerische Mathematik, 14
H. Rutishauser (1966)
The Jacobi method for real symmetric matricesNumerische Mathematik, 9
RUTISHAUSER H (1966)
The Jacobi method for real symmetric matricesNumer. Malh., 9
A. Householder (1964)
The Theory of Matrices in Numerical Analysis
H. Jahn (1948)
IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORYQuarterly Journal of Mechanics and Applied Mathematics, 1
(1965)
The Algebraic Eige*~value Problem
EBP EI~ (1962)
A Jacobi-like method for the automatic computation of eigenvalues and eigenvectors of an arbitrary matrixSIAM J., 10
P. Eberlein, J. Boothroyd (1968)
Solution to the Eigenproblem by a norm reducing Jacobi type methodNumerische Mathematik, 11
(1971)
Error bounds for invariant subspaces of closed operators
J. Ortega, W. Rheinboldt (2014)
Iterative solution of nonlinear equations in several variables
R. Varga, J. Gillis (1961)
Matrix Iterative Analysis
Axel Ruhe (1968)
On the quadratic convergence of a generalization of the Jacobi Method to arbitrary matricesBIT Numerical Mathematics, 8
(1961)
Journal of the Association for Computing MachineryNature, 190
J. Wilkinson (1966)
The algebraic eigenvalue problem
A. Collar (1948)
SOME NOTES ON JAHN'S METHOD FOR THE IMPROVEMENT OF APPROXIMATE LATENT ROOTS AND VECTORS OF A SQUARE MATRIXQuarterly Journal of Mechanics and Applied Mathematics, 1
(1971)
Eds. Handbook for Automatic Computation, Volume II, Linear Algebra
G. Stewart (1971)
Error Bounds for Approximate Invariant Subspaces of Closed Linear OperatorsSIAM Journal on Numerical Analysis, 8
H. Goldstine, F. Murray, J. Neumann (1959)
The Jacobi Method for Real Symmetric MatricesJ. ACM, 6
P. Ebertein (1962)
A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary MatrixJournal of The Society for Industrial and Applied Mathematics, 10
Calculating Dominant the Eigenvectors Matrices of Diagonally M. M. B L E V I N S AND G. W. STEWART The University of Texas at Austin, Austin, Texas ABSTRACT. An algorithm is proposed for calculating the eigenvectors of a diagonally dominant matrix all of whose elements are known to high relative accuracy. Eigenvectors corresponding to pathologically close eigenvalues are treated by computing the invariant subspace that they span. If the off-diagonal elements of the matrix are sufficiently small, the method is superior to standard techniques, and indeed it may produce a complete set of eigenvectors with an amount of work proportional to the square of the order of the matrix. An analysis is given of the effects of perturbations in the matrix on the eigenvectors. KEY WORDSAND PHRASES: eigenvalue, eigenvector, diagonal dominance, diagonally dominant CR CATEOORIES: 5.14 1. Introduction L e t A be a real m a t r i x of order n, and write A in the form A = D+E, where D = diag (81, ~2, " " , &) is the diagonal of A and E has zero diagonal elements. We shall say t h a t A is diagonally d o m
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Apr 1, 1974
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.