Pages that link to "Item:Q5348228"
From MaRDI portal
The following pages link to On the Nearest Singular Matrix Pencil (Q5348228):
Displaying 20 items.
- Where is the nearest non-regular pencil? (Q1124796) (← links)
- The gap distance to the set of singular matrix pencils (Q1715834) (← links)
- An efficient method for non-negative low-rank completion (Q1986538) (← links)
- A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs (Q2000635) (← links)
- Distance problems for dissipative Hamiltonian systems and related matrix polynomials (Q2029856) (← links)
- Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization (Q2114103) (← links)
- Computation of the nearest structured matrix triplet with common null space (Q2153947) (← links)
- Measuring the stability of spectral clustering (Q2228130) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- Computing the closest real normal matrix and normal completion (Q2305554) (← links)
- A gradient system for low rank matrix completion (Q2305876) (← links)
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
- Parameter-Dependent Rank-One Perturbations of Singular Hermitian Or Symmetric Pencils (Q2957680) (← links)
- On Wilkinson's problem for matrix pencils (Q3457762) (← links)
- Constrained Graph Partitioning via Matrix Differential Equations (Q4615297) (← links)
- Structured Backward Errors for Eigenvalues of Linear Port-Hamiltonian Descriptor Systems (Q5854657) (← links)
- Estimation of Structured Distances to Singularity for Matrix Pencils with Symmetry Structures: A Linear Algebra--Based Approach (Q5863876) (← links)
- Nearest rank deficient matrix polynomials (Q6173924) (← links)
- Stabilization of a matrix via a low-rank-adaptive ODE (Q6623107) (← links)
- A Riemannian optimization method to compute the nearest singular pencil (Q6641762) (← links)
