Interval Linear Algebra and Computational Complexity
From MaRDI portal
Recommendations
- Complexity theory of numerical linear algebra
- Complexity of some linear problems with interval data
- scientific article; zbMATH DE number 3936517
- The computational complexity of some problems of linear algebra
- Computability in linear algebra
- The computational complexity of some problems of linear algebra (extended abstract)
- Complexity Lower Bounds using Linear Algebra
- Linear programming, complexity theory and elementary functional analysis
- scientific article; zbMATH DE number 903770
- Linear algebra in \({\mathbb R^n}\). Theory, algorithms and complexity
Cites work
- scientific article; zbMATH DE number 1595639 (Why is no real title available?)
- scientific article; zbMATH DE number 3945249 (Why is no real title available?)
- scientific article; zbMATH DE number 714516 (Why is no real title available?)
- scientific article; zbMATH DE number 733109 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 804126 (Why is no real title available?)
- scientific article; zbMATH DE number 869736 (Why is no real title available?)
- scientific article; zbMATH DE number 7374771 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
- A new technique in systems analysis under interval uncertainty and ambiguity
- AE solutions and AE solvability to general interval linear systems
- An algorithm for checking stability of symmetric interval matrices
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Complexity issues for the symmetric interval eigenvalue problem
- Computational Complexity
- Computational complexity and feasibility of data processing and interval computations
- Computing exact bounds on elements of an inverse interval matrix is NP-hard
- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
- Enclosing solutions of overdetermined systems of linear interval equations
- Explicit inverse of an interval matrix with unit midpoint
- Forty necessary and sufficient conditions for regularity of interval matrices: A survey
- Interval Matrices: Singularity and Real Eigenvalues
- Interval Methods for Systems of Equations
- Introduction to Interval Analysis
- Inverse Interval Matrix
- Inverse interval matrix: a survey
- Large-Scale Scientific Computing
- Linear Optimization Problems with Inexact Data
- Mathematical problems for the next century
- New operator and method for solving real preconditioned interval linear equations
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- On full-rank interval matrices
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Perron vectors of an irreducible nonnegative interval matrix
- Positive Definiteness and Stability of Interval Matrices
- Several NP-hard problems arising in robust stability analysis
- Solving overdetermined systems of interval linear equations
- Sufficient Conditions for Regularity and Singularity of Interval Matrices
- Systems of linear interval equations
- Tight bounds on the radius of nonsingularity
Cited in
(5)- Enclosure for the polynomial eigenvalue problems of complex Hermitian interval matrices and their appearances in dynamical phenomenon having bounded uncertainty
- Complexity of computing interval matrix powers for special classes of matrices.
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- On preconditioning and solving an extended class of interval parametric linear systems
- Stability of the linear complementarity problem properties under interval uncertainty
This page was built for publication: Interval Linear Algebra and Computational Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554518)
