Reduction to Tridiagonal Form and Minimal Realizations

DOI10.1137/0613036MaRDI QIDQ4005091zbMATH OpenOpenAlexFDO

Authors Beresford N. Parlett

Publication date 27 September 1992

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0613036

zbMATH Keywords

condition numberGram-Schmidt processKrylow sequencesLanczos algorithmminimal realizationsorthogonal polynomialsreduction to tridiagonal formthree-term recurrence relationstime-invarianttime-invariant linear dynamical systemstridiagonal matrix

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical optimization and variational techniques (65K10) Canonical structure (93B10)

Recommendations

• Reduction of a General Matrix to Tridiagonal Form
• A Finite Procedure for the Tridiagonalization of a General Matrix
• Generalized biorthogonal bases and tridiagonalisation of matrices
• On tridiagonal matrices unitarily equivalent to normal matrices
• QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices

Cited in

(54)

• On orthogonal reduction to Hessenberg form with small bandwidth
• Deflation in Krylov subspace methods and distance to uncontrollability
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Symmetric matrix pencils
• Direct block tridiagonalization of single-input single-output systems
• The Lanczos algorithm and Hankel matrix factorization
• Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
• A parallel preconditioning technique for boundary value methods
• An analysis of the composite step biconjugate gradient method
• Generalized biorthogonal bases and tridiagonalisation of matrices
• Iterative solution of linear systems in the 20th century
• Transpose-free multiple Lanczos and its application in Padé approximation
• Krylov space methods on state-space control models
• Efficent computation of eigenvalues of randomly generated matrices
• Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
• Polynomial roots: The ultimate answer?
• Formal orthogonal polynomials and Hankel/Toeplitz duality
• The methods of Vorobyev and Lanczos
• Model reduction of state space systems via an implicitly restarted Lanczos method
• A rational Lanczos algorithm for model reduction
• A linear system solver based on a modified Krylov subspace method for breakdown recovery
• High performance algorithms for Toeplitz and block Toeplitz matrices
• Robust and retunable state realizations of transfer functions with known poles and zeros
• The Lanczos algorithm and complex Gauss quadrature
• Tridiagonalization of systems of coupled linear differential equations with variable coefficients by a Lanczos-like method
• An inverse eigenvalue problem for doubly periodic pseudo-Jacobi matrices
• A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
• The second-order biorthogonalization procedure and its application to quadratic eigenvalue problems
• Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
• A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
• A Lanczos-like method for non-autonomous linear ordinary differential equations
• Rank reduction, factorization and conjugation
• vibro -Lanczos, a symmetric Lanczos solver for vibro-acoustic simulations
• On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
• A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
• Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
• scientific article; zbMATH DE number 671773 (Why is no real title available?)
• scientific article; zbMATH DE number 1990732 (Why is no real title available?)
• A Lanczos-type method for multiple starting vectors
• Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
• Design of reduced-order, H₂ optimal controllers using a homotopy algorithm
• A Finite Procedure for the Tridiagonalization of a General Matrix
• Low-Rank Modification of the Unsymmetric Lanczos Algorithm
• Numerical impluimentation of a new algorithm for polynomials with multiple roots
• On reduction of \(k\)-almost normal and \(k\)-almost conjugate normal matrices to a block tridiagonal form
• Lyapunov, Lanczos, and inertia
• A comparative study of iterative solutions to linear systems arising in quantum mechanics
• A unified approach to Krylov subspace methods for solving linear systems
• Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
• Regularized reduced order Lippmann-Schwinger-Lanczos method for inverse scattering problems in the frequency domain
• The nonsymmetric Lanczos algorithm and controllability
• The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
• Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
• On tridiagonal matrices unitarily equivalent to normal matrices

This page was built for publication: Reduction to Tridiagonal Form and Minimal Realizations

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