An algorithm for numerical determination of the structure of a general matrix
From MaRDI portal
Publication:5670140
DOI10.1007/BF01936867zbMath0255.65023MaRDI QIDQ5670140
Publication date: 1970
Published in: BIT (Search for Journal in Brave)
Related Items (20)
THE METHOD OF SPLITTING OPERATORS AND LYAPUNOV MAJORANTS IN PERTURBATION LINEAR ALGEBRA AND CONTROL ⋮ Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison. ⋮ Computing stable eigendecompositions of matrices ⋮ On estimating the condition of eigenvalues and eigenvectors ⋮ Sensitivity and Computation of a Defective Eigenvalue ⋮ The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms ⋮ Rational Krylov for eigenvalue computation and model order reduction ⋮ Matlab code for sorting real Schur forms ⋮ Perturbation bounds for means of eigenvalues and invariant subspaces ⋮ On the theory of degenerate systems of ordinary differential equations ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ Computing the Jordan Structure of an Eigenvalue ⋮ Computational methods of linear algebra ⋮ Bounds for condition numbers of triangular and trapezoid matrices ⋮ The verification of multiplicity support of a defective eigenvalue of a real matrix ⋮ On swapping diagonal blocks in real Schur form ⋮ A fast algorithm for index of annihilation computations ⋮ A new block method for computing the Hamiltonian Schur form ⋮ The numerical Jordan form ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The QR and QL algorithms for symmetric matrices
- Properties of a matrix with a very ill-conditioned eigenproblem
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The Calculation of the Eigenvectors of a General Complex Matrix by Inverse Iteration
- Rigorous Machine Bounds for the Eigensystem of a General Complex Matrix
- Least squares, singular values and matrix approximations
- Computing Invariant Subspaces of a General Matrix when the Eigensystem is Poorly Conditioned
- Perturbation bounds for means of eigenvalues and invariant subspaces
- A Note on Pseudoinverses
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
This page was built for publication: An algorithm for numerical determination of the structure of a general matrix