Pages that link to "Item:Q2557538"
From MaRDI portal
The following pages link to Note on matrices with a very ill-conditioned eigenproblem (Q2557538):
Displaying 37 items.
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- Distance bounds for prescribed multiple eigenvalues of matrix polynomials (Q414693) (← links)
- Matrix polynomials with specified eigenvalues (Q472455) (← links)
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity (Q537877) (← links)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- On neighbouring matrices with quadratic elementary divisors (Q797259) (← links)
- Anti-Hadamard matrices (Q800988) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- Nearest matrix with prescribed eigenvalues and its applications (Q908369) (← links)
- The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue (Q947607) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- Stochastic perturbations and smooth condition numbers (Q964920) (← links)
- On condition numbers of polynomial eigenvalue problems (Q972167) (← links)
- Pseudospectra, critical points and multiple eigenvalues of matrix polynomials (Q999799) (← links)
- On condition numbers and the distance to the nearest ill-posed problem (Q1079333) (← links)
- Computing stable eigendecompositions of matrices (Q1092606) (← links)
- On estimating the condition of eigenvalues and eigenvectors (Q1094815) (← links)
- The geometry of ill-conditioning (Q1100848) (← links)
- Realistic error bounds for a simple eigenvalue and its associated eigenvector (Q1146499) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- On condition numbers of a nondefective multiple eigenvalue (Q1189637) (← links)
- Compatibility of symplectic structures adapted to noncommutatively integrable systems (Q1299172) (← links)
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs (Q1369687) (← links)
- On the distance from a matrix polynomial to matrix polynomials with some prescribed eigenvalues (Q1637993) (← links)
- On sensitivity of eigenvalues and eigendecompositions of matrices (Q1763838) (← links)
- Distance evaluation to the set of matrices with multiple eigenvalues (Q2109985) (← links)
- The verification of multiplicity support of a defective eigenvalue of a real matrix (Q2247117) (← links)
- General formulas for the smoothed analysis of condition numbers (Q2499745) (← links)
- On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue (Q2794398) (← links)
- On the distance from a matrix polynomial to matrix polynomials with <i>k</i> prescribed distinct eigenvalues (Q2979454) (← links)
- The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011) (← links)
- Iterative refinement for defective subspaces of differential operators (Q3790552) (← links)
- The Probability That a Numerical Analysis Problem is Difficult (Q3805780) (← links)
- Finite element methods for variational eigenvalue problems (Q4608453) (← links)
- How well-conditioned can the eigenvector problem be? (Q5070539) (← links)
- Sensitivity Analysis of Nonlinear Eigenproblems (Q5232112) (← links)
- Nearest linearly structured polynomial matrix with some prescribed distinct eigenvalues (Q5888884) (← links)
