A Procedure for the Diagonalization of Normal Matrices

DOI10.1145/320964.320975zbMath0090.10002MaRDI QIDQ3263065

Lawrence P. Horwitz, H. H. Goldstine

Publication date: 1959

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/320964.320975

zbMATH Keywords

numerical analysis

Related Items

On the quadratic convergence of the Jabobi method for normal matrices, On the quadratic convergence of a generalization of the Jacobi Method to arbitrary matrices, On Jacobi and Jacobi-Like Algorithms for a Parallel Computer, Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems, Minimization of the Frobenius norm of a complex matrix using planar similarities, Minimizing the Euclidean norm of a complex matrix by plane similarities, A continuous Jacobi-like approach to the simultaneous reduction of real matrices, A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix, A sort-Jacobi algorithm for semisimple Lie algebras, A new Jacobi-like method for joint diagonalization of arbitrary non-defective matrices, The normal \(\Delta\) H-matrices with connection to some Jacobi-like methods, Closest normal matrix finally found, Zur besten normalen Approximation komplexer Matrizen in der Euklidischen Norm. (On the best normal approximation of complex matrices in the Euclidean norm), On a new class of elementary matrices, A norm-reducing Jacobi-like algorithm for the eigenvalues of non-normal matrices, A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil