A Method for Finding Roots of Arbitrary Matrices

DOI10.2307/2002135MaRDI QIDQ5849800zbMATH OpenOpenAlexFDO

Authors John Greenstadt

Publication date 1955

Published in Mathematical Tables and Other Aids to Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2002135

zbMATH Keywords

linear algebra, polynomials

Cited in

(10)

• Some numerical experiments in triangularizing matrices
• Verfahren für die Bestimmung von Eigenwerten und Eigenvektoren von symmetrisch nicht-hermiteschen Matrizen
• Eigenvalue computation in the 20th century
• Nearest -stable matrix via Riemannian optimization
• A computational method for determining quadratic Lyapunov functions for non-linear systems
• Iterative refinement of Schur decompositions
• Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
• The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
• On the quadratic convergence of a generalization of the Jacobi Method to arbitrary matrices
• On triangularization of complex matrices by two-dimensional unitary transformations

This page was built for publication: A Method for Finding Roots of Arbitrary Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5849800)