On some algebraic problems in connection with general eigenvalue algorithms
From MaRDI portal
Publication:1260147
DOI10.1016/0024-3795(79)90175-7zbMATH Open0412.15019OpenAlexW2037215355MaRDI QIDQ1260147FDOQ1260147
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
Hermitian, skew-Hermitian, and related matrices (15B57) Quadratic and bilinear forms, inner products (15A63)
Cites Work
- Title not available (Why is that?)
- Generalized inverses. Theory and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical linear algorithms and group theory
- Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (27)
- 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
- Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
- Convergence of algorithms of decomposition type for the eigenvalue problem
- 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
- Representation theory of the reflection equation algebra. II: Theory of shapes.
- Normal forms of generic triangular band matrices and Jordan forms of nilpotent completions
- 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
- Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
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)