Where is the nearest non-regular pencil?
type: Item
instance of: scholarly article
title: Where is the nearest non-regular pencil?
zbMATH Open document ID: 0935.15013
DOI: 10.1016/S0024-3795(98)10122-2
author: Ralph Byers
author: Chunyang He
author: Volker Mehrmann
published in: Linear Algebra and its Applications
publication date: 1999-11-28T00:00:00Z
Mathematics Subject Classification ID: 15A22
Mathematics Subject Classification ID: 15A60
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 1371034
zbMATH Keywords: nearest nonregular pencil
zbMATH Keywords: smallest norm de-regularizing perturbation
zbMATH Keywords: matrix pencil
zbMATH Keywords: linear least squares problem
zbMATH Keywords: Courant-Fischer theorem
describes a project that uses: tn
describes a project that uses: LAPACK
MaRDI profile type: Publication
cites work: Q4841244
cites work: Positive solutions to \(X=A-BX^{-1}B^*\)
cites work: An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
cites work: Q3993493
cites work: Regularization of Descriptor Systems by Derivative and Proportional State Feedback
cites work: Regularization of descriptor systems by output feedback
cites work: Descriptor Systems Without Controllability at Infinity
cites work: Regularization of Linear Descriptor Systems with Variable Coefficients
cites work: On the stability radius of a generalized state-space system
cites work: Q3852479
cites work: On condition numbers and the distance to the nearest ill-posed problem
cites work: The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
cites work: Computing stable eigendecompositions of matrix pencils
cites work: Accurate Solutions of Ill-Posed Problems in control theory
cites work: The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
cites work: The Set of 2-by-3 Matrix Pencils — Kronecker Structures and Their Transitions under Perturbations
cites work: On the existence of a positive definite solution of the matrix equation \(X+A^ T X^{-1} A=I\)
cites work: Necessary and sufficient conditions for the existence of a positive definite solution of the matrix equation \(X+A^*X^{-1}A=Q\)
cites work: The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
cites work: Q3254327
cites work: Solvability conditions, consistency, and weak consistency for linear differential-algebraic equations and time-invariant singular systems: The general case
cites work: Q3359644
cites work: The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
cites work: Unitary Triangularization of a Nonsymmetric Matrix
cites work: RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
cites work: A variable projection method for solving separable nonlinear least squares problems
cites work: Robust pole assignment in singular control systems
cites work: Q4836698
cites work: Efficient implementation of a variable projection algorithm for nonlinear least squares problems
cites work: The AB-algorithm and its properties
cites work: AB-algorithm and its modifications for the spectral problems of linear pencils of matrices
cites work: An Algorithm for Generalized Matrix Eigenvalue Problems
cites work: Newton-Type Minimization via the Lanczos Method
cites work: Preconditioning of Truncated-Newton Methods
cites work: On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
cites work: The computation of Kronecker's canonical form of a singular pencil
cites work: A generalized state-space for singular systems
cites work: The Combination Shift $QZ$ Algorithm
cites work: Q3907012
cites work: Kronecker's canonical form and the QZ algorithm
Wikidata QID: Q127771468
description: scientific article; zbMATH DE number 1371034