Where is the nearest non-regular pencil?
From MaRDI portal
Publication:1124796
Recommendations
Cites work
- A generalized state-space for singular systems
- A variable projection method for solving separable nonlinear least squares problems
- AB-algorithm and its modifications for the spectral problems of linear pencils of matrices
- Accurate Solutions of Ill-Posed Problems in control theory
- An Algorithm for Generalized Matrix Eigenvalue Problems
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Computing stable eigendecompositions of matrix pencils
- Descriptor Systems Without Controllability at Infinity
- Efficient implementation of a variable projection algorithm for nonlinear least squares problems
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3652729 (Why is no real title available?)
- scientific article; zbMATH DE number 3716709 (Why is no real title available?)
- scientific article; zbMATH DE number 44365 (Why is no real title available?)
- scientific article; zbMATH DE number 766259 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- Kronecker's canonical form and the QZ algorithm
- Necessary and sufficient conditions for the existence of a positive definite solution of the matrix equation \(X+A^*X^{-1}A=Q\)
- Newton-Type Minimization via the Lanczos Method
- On condition numbers and the distance to the nearest ill-posed problem
- On the existence of a positive definite solution of the matrix equation \(X+A^ T X^{-1} A=I\)
- On the Sensitivity of the Eigenvalue Problem Ax = \lambda Bx
- On the stability radius of a generalized state-space system
- Positive solutions to \(X=A-BX^{-1}B^*\)
- Preconditioning of Truncated-Newton Methods
- Regularization of Descriptor Systems by Derivative and Proportional State Feedback
- Regularization of descriptor systems by output feedback
- Regularization of Linear Descriptor Systems with Variable Coefficients
- RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular A - \lambda B Pencils
- Robust pole assignment in singular control systems
- Solvability conditions, consistency, and weak consistency for linear differential-algebraic equations and time-invariant singular systems: The general case
- The AB-algorithm and its properties
- The Combination Shift QZ Algorithm
- The computation of Kronecker's canonical form of a singular pencil
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
- 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
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The Set of 2-by-3 Matrix Pencils — Kronecker Structures and Their Transitions under Perturbations
- Unitary Triangularization of a Nonsymmetric Matrix
Cited in
(28)- More on pseudospectra for polynomial eigenvalue problems and applications in control theory
- The gap distance to the set of singular matrix pencils
- The structured controllability radii of higher order systems
- A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs
- Distance problems for dissipative Hamiltonian systems and related matrix polynomials
- Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization
- Computation of the nearest structured matrix triplet with common null space
- Computing lower rank approximations of matrix polynomials
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
- On the distance to singularity via low rank perturbations
- Parameter-dependent rank-one perturbations of singular Hermitian or symmetric pencils
- Robust stability of differential-algebraic equations
- Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
- On the Nearest Singular Matrix Pencil
- 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
- Nearest rank deficient matrix polynomials
- Homotopic deviation theory for regular matrix pencils
- A Riemannian optimization method to compute the nearest singular pencil
- Structured linear stability problems
- Solving matrix nearness problems via Hamiltonian systems, matrix factorization, and optimization
- Approximating the closest structured singular matrix polynomial
- On the numerical approximation of the distance to singularity for matrix-valued functions
- Spectral theory of infinite dimensional dissipative Hamiltonian systems
- Riemann-oracle: a general-purpose Riemannian optimizer to solve nearness problems in matrix theory
- Linear relations and the Kronecker canonical form
- Ralph Byers 1955--2007
This page was built for publication: Where is the nearest non-regular pencil?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124796)
