Calculation of exact bounds for the solution set of linear interval systems
From MaRDI portal
Publication:5961705
Recommendations
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
- Checking bounds on solutions of linear interval equations is NP-hard
- Enclosing solutions of linear interval equations is NP-hard
- scientific article; zbMATH DE number 804135
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3766957 (Why is no real title available?)
- scientific article; zbMATH DE number 3471507 (Why is no real title available?)
- scientific article; zbMATH DE number 524107 (Why is no real title available?)
- scientific article; zbMATH DE number 714516 (Why is no real title available?)
- scientific article; zbMATH DE number 714524 (Why is no real title available?)
- scientific article; zbMATH DE number 733109 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 802437 (Why is no real title available?)
- scientific article; zbMATH DE number 3410518 (Why is no real title available?)
- A Quadratically Convergent Krawczyk-Like Algorithm
- An Interval Arithmetic Approach for the Construction of an Almost Globally Convergent Method for the Solution of the Nonlinear Poisson Equation on the Unit Square
- Checking bounds on solutions of linear interval equations is NP-hard
- Checking robust nonsingularity is NP-hard
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Die Überschätzung des Wertebereichs einer Funktion in der Intervallrechnung mit Anwendungen auf lineare Gleichungssysteme
- Enclosing solutions of linear interval equations is NP-hard
- Interval iteration for zeros of systems of equations
- Interval linear systems with symmetric matrices, skew-symmetric matrices and dependencies in the right hand side
- On the Solution Set of a Linear System with Inaccurate Coefficients
- Optimale Lösung von Intervallgleichungssystemen
- Systems of linear interval equations
Cited in
(30)- Regularity radius: properties, approximation and a not a priori exponential algorithm
- The vertex solution theorem and its coupled framework for static analysis of structures with interval parameters
- A general method for enclosing solutions of interval linear equations
- Interval tensors and their application in solving multi-linear systems of equations
- Direct methods for linear systems with inexact input data
- Calculation of a sharp Lipschitz constant for a system of linear inequalities
- Inner estimation of the united solution set of interval linear algebraic system
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- An algorithm for computing the hull of the solution set of interval linear equations
- scientific article; zbMATH DE number 2032311 (Why is no real title available?)
- Solving interval linear programming problems with equality constraints using extended interval enclosure solutions
- Interval linear systems: the state of the art
- A new methodology for solving fuzzy systems of equations: thick fuzzy sets based approach
- Extremal results for algebraic linear interval systems
- scientific article; zbMATH DE number 5836227 (Why is no real title available?)
- Interval estimations of solution sets to real-valued systems of linear or non-linear equations
- Centered solutions for uncertain linear equations
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
- On regular and singular interval systems
- Checking bounds on solutions of linear interval equations is NP-hard
- On the solution sets of particular classes of linear interval systems
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- On solving vague systems of linear equations with pattern-shaped columns
- On solvability recognition for interval linear systems of equations
- Inverse of a fuzzy matrix of fuzzy numbers
- Inverse linear programming with interval coefficients
- Parametric deconvolution of positive spike trains.
- On the optimal solution set in interval linear programming
- The bounds on components of the solution for consistent linear systems
- On \(P\)-matrices
This page was built for publication: Calculation of exact bounds for the solution set of linear interval systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961705)
