On some algebraic problems in connection with general eigenvalue algorithms

DOI10.1016/0024-3795(79)90175-7MaRDI QIDQ1260147zbMATH OpenOpenAlexFDO

Authors Ludwig Elsner

Publication date 1979

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(79)90175-7

zbMATH Keywords

Lebesgue measurebilinear formsymmetric matrixskew symmetric matrixquadratic matrix

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Quadratic and bilinear forms, inner products (15A63)

Cites work

• scientific article; zbMATH DE number 3125713 (Why is no real title available?)
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3671576 (Why is no real title available?)
• scientific article; zbMATH DE number 3204642 (Why is no real title available?)
• scientific article; zbMATH DE number 3408803 (Why is no real title available?)
• Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
• Generalized inverses. Theory and applications.
• Numerical linear algorithms and group theory

Cited in

(27)

• Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
• Finite dimensional Wiener-Hopf equations and factorizations of matrices
• Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
• Convergence of algorithms of decomposition type for the eigenvalue problem
• Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
• Two connections between the \(SR\) and \(HR\) eigenvalue algorithms
• Nearly optimal scaling in the SR decomposition
• Pairs of shift invariant subspaces of matrices and noncanonical factorization
• Factorization of block matrices
• The algebra of elimination
• An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
• Bruhat canonical form for linear systems
• Minimum deviation, quasi-LU factorization of nonsingular matrices
• Matrix factorizations for symplectic QR-like methods
• The shift-inverted \(J\)-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations
• Topological properties of J-orthogonal matrices
• Symplectic factorizations and parallel iterative algorithms for tridiagonal systems of equations
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
• Schur-like forms for matrix Lie groups, Lie algebras and Jordan algebras
• G-matrices, \(J\)-orthogonal matrices, and their sign patterns.
• Classification of linear time-varying difference equations under kinematic similarity
• Normal forms of generic triangular band matrices and Jordan forms of nilpotent completions
• Representation theory of the reflection equation algebra. II: Theory of shapes.
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• Fast transforms: banded matrices with banded inverses
• SR and SZ algorithms for the symplectic (butterfly) eigenproblem
• A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper \(J\)-Hessenberg form and related topics

This page was built for publication: On some algebraic problems in connection with general eigenvalue algorithms

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