Where is the nearest non-regular pencil?

DOI10.1016/S0024-3795(98)10122-2zbMath0935.15013MaRDI QIDQ1124796

Chunyang He, Ralph Byers, Volker Mehrmann

Publication date: 28 November 1999

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

zbMATH Keywords

linear least squares problemmatrix pencilCourant-Fischer theoremnearest nonregular pencilsmallest norm de-regularizing perturbation

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Matrix pencils (15A22)

Related Items

Computation of the nearest structured matrix triplet with common null space ⋮ Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ On the Nearest Singular Matrix Pencil ⋮ Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems ⋮ The structured controllability radii of higher order systems ⋮ Linear relations and the Kronecker canonical form ⋮ Parameter-Dependent Rank-One Perturbations of Singular Hermitian Or Symmetric Pencils ⋮ Nearest rank deficient matrix polynomials ⋮ The gap distance to the set of singular matrix pencils ⋮ Ralph Byers 1955--2007 ⋮ A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs ⋮ Robust Stability of Differential-Algebraic Equations ⋮ Distance problems for dissipative Hamiltonian systems and related matrix polynomials ⋮ Computing lower rank approximations of matrix polynomials ⋮ On the distance to singularity via low rank perturbations ⋮ Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation ⋮ Structured Backward Errors for Eigenvalues of Linear Port-Hamiltonian Descriptor Systems ⋮ Estimation of Structured Distances to Singularity for Matrix Pencils with Symmetry Structures: A Linear Algebra--Based Approach ⋮ Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization ⋮ More on pseudospectra for polynomial eigenvalue problems and applications in control theory

Uses Software

• LAPACK
• tn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computation of Kronecker's canonical form of a singular pencil
• AB-algorithm and its modifications for the spectral problems of linear pencils of matrices
• Positive solutions to \(X=A-BX^{-1}B^*\)
• On condition numbers and the distance to the nearest ill-posed problem
• Computing stable eigendecompositions of matrix pencils
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• Robust pole assignment in singular control systems
• Kronecker's canonical form and the QZ algorithm
• Solvability conditions, consistency, and weak consistency for linear differential-algebraic equations and time-invariant singular systems: The general case
• On the stability radius of a generalized state-space system
• On the existence of a positive definite solution of the matrix equation \(X+A^ T X^{-1} A=I\)
• Necessary and sufficient conditions for the existence of a positive definite solution of the matrix equation \(X+A^*X^{-1}A=Q\)
• The AB-algorithm and its properties
• Regularization of Linear Descriptor Systems with Variable Coefficients
• Newton-Type Minimization via the Lanczos Method
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• A generalized state-space for singular systems
• Preconditioning of Truncated-Newton Methods
• RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
• Accurate Solutions of Ill-Posed Problems in control theory
• Regularization of Descriptor Systems by Derivative and Proportional State Feedback
• A variable projection method for solving separable nonlinear least squares problems
• The Combination Shift $QZ$ Algorithm
• Regularization of descriptor systems by output feedback
• Descriptor Systems Without Controllability at Infinity
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
• Efficient implementation of a variable projection algorithm for nonlinear least squares problems
• The Set of 2-by-3 Matrix Pencils — Kronecker Structures and Their Transitions under Perturbations
• On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
• An Algorithm for Generalized Matrix Eigenvalue Problems
• The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
• Unitary Triangularization of a Nonsymmetric Matrix