Pages that link to "Item:Q1802197"
From MaRDI portal
The following pages link to Checking robust nonsingularity is NP-hard (Q1802197):
Displaying 50 items.
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- Regularity radius and real eigenvalue range (Q272632) (← links)
- Radii of solvability and unsolvability of linear systems (Q277137) (← links)
- A note on regularity and positive definiteness of interval matrices (Q432241) (← links)
- Fast interval matrix multiplication (Q451807) (← links)
- Branch and bound algorithm with applications to robust stability (Q513164) (← links)
- An algorithm for addressing the real interval eigenvalue problem (Q629549) (← links)
- Strong NP-completeness of a matrix similarity problem (Q671534) (← links)
- A theorem of the alternatives for the equation \(|Ax|-|B||x|=b\) (Q691395) (← links)
- Regularity of interval matrices and theorems of the alternatives (Q811946) (← links)
- Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding. (Q954610) (← links)
- On the computation of structured singular values and pseudospectra (Q962178) (← links)
- On computational complexity of invalidating structured uncertainty models (Q1128693) (← links)
- On the complexity of the robust stability problem for linear parameter varying systems (Q1129709) (← links)
- Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis (Q1272556) (← links)
- Several NP-hard problems arising in robust stability analysis (Q1312298) (← links)
- The P-matrix problem is co-NP-complete (Q1330899) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- Enclosing solutions of linear interval equations is NP-hard (Q1340883) (← links)
- Inversion error, condition number, and approximate inverses of uncertain matrices (Q1348090) (← links)
- Static output feedback -- a survey (Q1354848) (← links)
- Complexity issues in robust stability of linear delay-differential systems (Q1356632) (← links)
- Theorems of Perron-Frobenius type for matrices without sign restrictions (Q1372955) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- The boundedness of all products of a pair of matrices is undecidable (Q1583220) (← links)
- A characterization of convex cones of matrices with constant regular inertia (Q1590643) (← links)
- A probabilistic framework for problems with real structured uncertainty in systems and control (Q1614384) (← links)
- Real eigenvalue bounds of standard and generalized real interval eigenvalue problems (Q1646087) (← links)
- A survey of extreme point results for robustness of control systems (Q1802011) (← links)
- Componentwise pseudospectrum of a matrix (Q1826729) (← links)
- A pair of matrices sharing common Lyapunov solutions--A closer look (Q1863523) (← links)
- On \(P\)-matrices (Q1870055) (← links)
- Worst-case and average \(\mathcal{H}_2\) performance analysis against real constant parametric uncertainty (Q1893036) (← links)
- Checking bounds on solutions of linear interval equations is NP-hard (Q1894514) (← links)
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix (Q1894653) (← links)
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322) (← links)
- Approximate linear algebra is intractable (Q1906787) (← links)
- Checking robust nonsingularity of tridiagonal matrices in linear time (Q1914863) (← links)
- Rank one interval enclosure of the parametric united solution set (Q1999716) (← links)
- Linear interval parametric approach to testing pseudoconvexity (Q2022238) (← links)
- Stability of the linear complementarity problem properties under interval uncertainty (Q2051193) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Complexity of computing interval matrix powers for special classes of matrices. (Q2216226) (← links)
- Computing the spectral decomposition of interval matrices and a study on interval matrix powers (Q2242816) (← links)
- On the complexity of matrix rank and rigidity (Q2268340) (← links)
- Low-rank matrix approximation in the infinity norm (Q2273885) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- On the stability of a convex set of matrices (Q2369054) (← links)
- A survey of randomized algorithms for control synthesis and performance verification (Q2371305) (← links)
- Relations between various methods for solving linear interval and parametric equations (Q2419042) (← links)
