On the Nearest Singular Matrix Pencil
From MaRDI portal
Recommendations
- On computing nearest singular Hankel matrices
- scientific article; zbMATH DE number 1497168
- An algorithm for computing the spectral structure of a singular linear matrix pencil
- On generalized inverses of singular matrix pencils
- The gap distance to the set of singular matrix pencils
- Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Combinatorial Analysis of Singular Matrix Pencils
Cites work
- An efficient algorithm for computing the generalized null space decomposition
- ARPACK Users' Guide
- Derivatives and Perturbations of Eigenvectors
- Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
- Differential-algebraic equations. A projector based analysis
- Differential-algebraic systems. Analytical aspects and circuit applications
- Distance problems for linear dynamical systems
- Dynamical Low‐Rank Approximation
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3484411 (Why is no real title available?)
- scientific article; zbMATH DE number 735180 (Why is no real title available?)
- scientific article; zbMATH DE number 979834 (Why is no real title available?)
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- scientific article; zbMATH DE number 4115838 (Why is no real title available?)
- scientific article; zbMATH DE number 852526 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 2229937 (Why is no real title available?)
- Linearization of DAEs along trajectories
- Low rank differential equations for Hamiltonian matrix nearness problems
- Low-rank dynamics for computing extremal points of real pseudospectra
- On the distance to singularity via low rank perturbations
- Perturbation theory for linear operators.
- The numerical solution of differential-algebraic systems by Runge-Kutta methods
- Where is the nearest non-regular pencil?
Cited in
(27)- Where is the nearest non-regular pencil?
- The gap distance to the set of singular matrix pencils
- An efficient method for non-negative low-rank completion
- 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
- Measuring the stability of spectral clustering
- Computing lower rank approximations of matrix polynomials
- Computing the closest real normal matrix and normal completion
- A gradient system for low rank matrix completion
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- Parameter-dependent rank-one perturbations of singular Hermitian or symmetric pencils
- On Wilkinson's problem for matrix pencils
- scientific article; zbMATH DE number 2062313 (Why is no real title available?)
- Constrained graph partitioning via matrix differential equations
- On computing nearest singular Hankel matrices
- 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
- Stabilization of a matrix via a low-rank-adaptive ODE
- 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
- A low-rank ODE for spectral clustering stability
- On the numerical approximation of the distance to singularity for matrix-valued functions
This page was built for publication: On the Nearest Singular Matrix Pencil
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348228)
