Calculating uncertainty intervals in approximate equation systems
From MaRDI portal
In contrast to interval arithmetic and linear programming the author considers an integer (binary) programming approach to the problem of finding intervals of uncertainty in systems of approximate linear equations.
Recommendations
Cites work
- A Note on Linear Programming and Integer Feasibility
- Admissible Solutions of Linear Systems with Not Sharply Defined Coefficients
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Discrete Programming by the Filter Method
- Enumerative Methods in Integer Programming
- scientific article; zbMATH DE number 4013856 (Why is no real title available?)
- 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 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 761488 (Why is no real title available?)
- scientific article; zbMATH DE number 804135 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3380080 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Integer Programming by Implicit Enumeration and Balas’ Method
- Interval Arithmetic in Matrix Computations, Part I
- Interval Arithmetic in Matrix Computations, Part II
- On the Solution Set of a Linear System with Inaccurate Coefficients
Cited in
(3)
This page was built for publication: Calculating uncertainty intervals in approximate equation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294585)