Computing eigenspaces with specified eigenvalues of a regular matrix pair (A,B) and condition estimation: Theory, algorithms and software
From MaRDI portal
Publication:1815708
DOI10.1007/BF02142813zbMATH Open0859.65036MaRDI QIDQ1815708FDOQ1815708
Publication date: 25 March 1997
Published in: Numerical Algorithms (Search for Journal in Brave)
Recommendations
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- On estimating the condition of eigenvalues and eigenvectors
- On computing condition numbers for the nonsymmetric eigenproblem
- scientific article; zbMATH DE number 3969998
eigenvalueserror boundsnumerical examplescomplexitycondition numberseigenspacesmatrix pencilsbackward stabilitySylvester equationdeflating subspacesgeneralized Schur formreordering algorithmsmatrix pair
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Matrix pencils (15A22)
Cites Work
- Title not available (Why is that?)
- Algorithm 674
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kronecker's canonical form and the QZ algorithm
- A Schur method for solving algebraic Riccati equations
- Perturbation expansions for invariant subspaces
- On computing condition numbers for the nonsymmetric eigenproblem
- Condition Estimates
- On the Compatibility of a Given Solution With the Data of a Linear System
- On condition numbers and the distance to the nearest ill-posed problem
- Computing stable eigendecompositions of matrix pencils
- Backward perturbation analysis of certain characteristic subspaces
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Generalized Schur methods with condition estimators for solving the generalized Sylvester equation
- A Perturbation Analysis of the Generalized Sylvester Equation $( AR - LB,DR - LE ) = ( C,F )$
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- An Algorithm for Generalized Matrix Eigenvalue Problems
- A Generalized Eigenvalue Approach for Solving Riccati Equations
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- On swapping diagonal blocks in real Schur form
- Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
- The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
- Perturbation theory and backward error for \(AX - XB = C\)
- Factorizations of Transfer Functions
- Algorithm 590: DSUBSP and EXCHQZ : FORTRAN Subroutines for Computing Deflating Subspaces with Specified Spectrum
Cited In (25)
- Solution algorithm to a class of monetary rational equilibrium macromodels with optimal monetary policy design
- Circular trichotomy of the spectrum of regular matrix pencils
- Fast solution of unsymmetric banded Toeplitz systems by means of spectral factorizations and Woodbury's formula
- Robustness analysis of uncertain discrete‐time systems with dissipation inequalities and integral quadratic constraints
- Lyapunov-based stability of delayed linear differential algebraic systems
- On Modifications to the Spectral Dichotomy Algorithm
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- Pseudospectra of linear matrix pencils by block diagonalization
- A numerical evaluation of solvers for the periodic Riccati differential equation
- Computing periodic deflating subspaces associated with a specified set of eigenvalues
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices
- A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation
- Robust \(H_{\infty}\) control of spacecraft rendezvous on elliptical orbit
- An implicit filter for rational Krylov using core transformations
- Efficient computation of the spectral projections of regular matrix pairs
- Using the generalized Schur form to solve a multivariate linear rational expectations model
- Perturbation theory of structured matrix pencils with no spillover
- On pole-swapping algorithms for the eigenvalue problem
- Some new algorithms for the spectral dichotomy methods
- On estimating the separation of two periodic matrix sequences
- Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
- A Rational QZ Method
- Numerical solution and perturbation theory for generalized Lyapunov equations
Uses Software
This page was built for publication: Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815708)
