Nearest rank deficient matrix polynomials
DOI10.1016/j.laa.2023.05.019zbMath1515.65105OpenAlexW4378212619MaRDI QIDQ6173924
Publication date: 13 July 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2023.05.019
block Toeplitz matrixstructured singular valuesingular matrix polynomialnormal rank deficient matrix polynomial
Numerical optimization and variational techniques (65K10) Eigenvalues, singular values, and eigenvectors (15A18) Matrices over function rings in one or more variables (15A54) Vector spaces, linear dependence, rank, lineability (15A03) Numerical linear algebra (65F99) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth optimization via quasi-Newton methods
- Spectral equivalence of matrix polynomials and the index sum theorem
- Differential-algebraic equations. A projector based analysis
- Pseudospectra, critical points and multiple eigenvalues of matrix polynomials
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Perturbation of linear control systems
- Where is the nearest non-regular pencil?
- On the stability radius of a generalized state-space system
- The algebraic structure of pencils and block Toeplitz matrices
- Backward perturbation analysis of certain characteristic subspaces
- The complex structured singular value
- On the distance to singularity via low rank perturbations
- Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
- Distance Problems for Linear Dynamical Systems
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- On the Segré, Weyr characteristics of right (left) regular matrix pencils
- Right, left characteristic sequences and column, row minimal indices of a singular pencil
- On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
- Computational complexity of μ calculation
- Computing the Nearest Rank-Deficient Matrix Polynomial
- Nearest Matrix Polynomials With a Specified Elementary Divisor
- On the Nearest Singular Matrix Pencil
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
This page was built for publication: Nearest rank deficient matrix polynomials
