Answers are grounded in this paper and cite their sources.
Previous article Next article A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary MatrixP. J. EberleinP. J. Eberleinhttps://doi.org/10.1137/0110007PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] H. H. Goldstine, , F. J. Murray and , J. von Neumann, The Jacobi method for real symmetric matrices, J. Assoc. Comput. Mach., 6 (1959), 59–96 MR0102171 0092.12806 CrossrefISIGoogle Scholar[2] Peter Henrici, On the speed of convergence of cyclic and quasicyclic Jacobi methods for computing eigenvalues of Hermitian matrices, J. Soc. Indust. Appl. Math., 6 (1958), 144–162 10.1137/0106008 MR0095582 0097.32601 LinkISIGoogle Scholar[3] J. Greenstadt, A method for finding roots of arbitrary matrices, Math. Tables Aids Comput., 9 (1955), 47–52 MR0073283 0065.24801 CrossrefGoogle Scholar[4] Mark Lotkin, Characteristic values of arbitrary matrices, Quart. Appl. Math., 14 (1956), 267–275 MR0090576 0073.33804 CrossrefGoogle Scholar[5] Robert L. Causey, Computing eigenvalues of non-Hermitian matrices by methods of Jacobi type, J. Soc. Indust. Appl. Math., 6 (1958), 172–181 10.1137/0106010 MR0103583 0097.32701 LinkISIGoogle Scholar[6] John Greenstadt, Some numerical experiments in triangularizing matrices, Numer. Math., 4 (1962), 187–195 10.1007/BF01386312 MR0149652 0109.09101 CrossrefGoogle Scholar[7] L. Mirsky, On the minimization of matrix norms, Amer. Math. Monthly, 65 (1958), 106–107 MR0096686 CrossrefGoogle Scholar[8] H. H. Goldstine and , L. P. Horwitz, A procedure for the diagonalization of normal matrices, J. Assoc. Comput. Mach., 6 (1959), 176–195 MR0101617 0090.10002 CrossrefISIGoogle Scholar[9] Peter Henrici, Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices, Numer. Math., 4 (1962), 24–40 10.1007/BF01386294 MR0135706 0102.01502 CrossrefGoogle Scholar[10] Robert Gregory, correspondence Google Scholar[11] Mark Lotkin, Determination of characteristic values, Quart. Appl. Math., 17 (1959), 237–244 MR0105804 0089.11901 CrossrefGoogle Scholar[12] J. H. Wilkinson, Error analysis of floating-point computation, Numer. Math., 2 (1960), 319–340 10.1007/BF01386233 MR0116477 0091.29605 CrossrefGoogle Scholar[13] Paul A. White, The computation of eigenvalues and eigenvectors of a matrix, J. Soc. Indust. Appl. Math., 6 (1958), 393–437 10.1137/0106027 MR0100350 0085.33303 LinkISIGoogle Scholar[14] K. A. Semendiaev, The determination of latent roots and invariant manifolds of matrices by means of iterations, NBS Rep. 1402, U. S. Department of Commerce National Bureau of Standards, Washington, D. C., 1952i+59 MR0046140 0049.09104 Google Scholar[15] Werner L. Frank, Computing eigenvalues of complex matrices by determinant evaluation and by methods of Danilewski and Wielandt, J. Soc. Indust. Appl. Math., 6 (1958), 378–392 10.1137/0106026 MR0103586 0198.20804 LinkISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails On Asymptotic Convergence of Nonsymmetric Jacobi AlgorithmsChristian Mehl19 March 2008 | SIAM Journal on Matrix Analysis and Applications, Vol. 30, No. 1AbstractPDF (239 KB)Jacobi-like Algorithms for the Indefinite Generalized Hermitian Eigenvalue ProblemChristian Mehl31 July 2006 | SIAM Journal on Matrix Analysis and Applications, Vol. 25, No. 4AbstractPDF (231 KB)Jacobi's Algorithm on Compact Lie AlgebrasM. Kleinsteuber, U. Helmke, and K. Huper31 July 2006 | SIAM Journal on Matrix Analysis and Applications, Vol. 26, No. 1AbstractPDF (293 KB)Numerical Methods for Simultaneous DiagonalizationAngelika Bunse-Gerstner, Ralph Byers, and Volker Mehrmann31 July 2006 | SIAM Journal on Matrix Analysis and Applications, Vol. 14, No. 4AbstractPDF (2386 KB)A Chart of Numerical Methods for Structured Eigenvalue ProblemsAngelika Bunse-Gerstner, Ralph Byers, and Volker Mehrmann17 July 2006 | SIAM Journal on Matrix Analysis and Applications, Vol. 13, No. 2AbstractPDF (3614 KB)On the Generalized Schur Decomposition of a Matrix Pencil for Parallel ComputationA. Bunse-Gerstner and H. Fassbender13 July 2006 | SIAM Journal on Scientific and Statistical Computing, Vol. 12, No. 4AbstractPDF (2511 KB)Parallel Algorithms for Dense Linear Algebra ComputationsK. A. Gallivan, R. J. Plemmons, and A. H. Sameh18 July 2006 | SIAM Review, Vol. 32, No. 1AbstractPDF (10106 KB)On the Convergence of the Cyclic Jacobi Method for Parallel Block OrderingsGautam Shroff and Robert Schreiber17 July 2006 | SIAM Journal on Matrix Analysis and Applications, Vol. 10, No. 3AbstractPDF (2343 KB)A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian MatrixG. W. Stewart14 July 2006 | SIAM Journal on Scientific and Statistical Computing, Vol. 6, No. 4AbstractPDF (1122 KB)Use of the Singular Value Decomposition with the Manteuffel Algorithm for Nonsymmetric Linear SystemsPaul E. Saylor14 July 2006 | SIAM Journal on Scientific and Statistical Computing, Vol. 1, No. 2AbstractPDF (1084 KB)A Survey of Parallel Algorithms in Numerical Linear AlgebraDon Heller17 February 2012 | SIAM Review, Vol. 20, No. 4AbstractPDF (4759 KB)A Note on the Matrices Denoted BₙP. J. Eberlein12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 20, No. 1AbstractPDF (378 KB)Today’s Computational Methods of Linear AlgebraGeorge E. Forsythe18 July 2006 | SIAM Review, Vol. 9, No. 3AbstractPDF (3431 KB) Volume 10, Issue 1| 1962Journal of the Society for Industrial and Applied Mathematics History Submitted:07 July 1961Published online:13 July 2006 InformationCopyright © 1962 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0110007Article page range:pp. 74-88ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics
No takes yet. Share an insight, caveat, or question.
P. J. Eberlein (1962) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: