Where is the nearest non-regular pencil?

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

Volker Mehrmann, Ralph Byers, Chunyang He

Publication date: 28 November 1999

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

zbMATH Keywords

linear least squares problem; matrix pencil; Courant-Fischer theorem; nearest nonregular pencil; smallest norm de-regularizing perturbation

Mathematics Subject Classification ID

15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory

15A22: Matrix pencils

Related Items

Ralph Byers 1955--2007, 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