Interval Methods for Systems of Equations
From MaRDI portal
Publication:3998722
DOI10.1017/CBO9780511526473zbMath0715.65030MaRDI QIDQ3998722
Publication date: 17 September 1992
monograph; textbook; preconditioning; automatic differentiation; Krawczyk operator; interval arithmetic; Newton operator; interval mathematics; Krawczyk's method; sublinear mappings; interval Gauss elimination; range of functions; interval Gauss-Seidel iteration; interval hulls; Hansen-Sengupta operator; Hull computation; hull inverse; inclusion algebras; M- and H-matrices; slope arithmetic; systems of interval equations
65H10: Numerical computation of solutions to systems of equations
65G30: Interval and finite arithmetic
65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis
65F10: Iterative numerical methods for linear systems
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Computation of Topological Degree Using Interval Arithmetic, and Applications, Rigorous solution of linear programming problems with uncertain data, A note on checking regularity of interval matrices, Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard, Preconditioning linearized equations, On certain computable tests and componentwise error bounds, A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices, Estimation of the sensitivity of linear and nonlinear algebraic problems, A geometric approach for computing a posteriori error bounds for the solution of a linear system, Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems, On the solution of interval linear systems, What can interval analysis do for global optimization?, Some remarks on two interval-arithmetic modifications of the Newton method, \(H\)-splittings and two-stage iterative methods, Bounding the set of solutions of a perturbed global optimization problem, Bounds for eigenvalues of parameter-dependent matrices, Rigorously computed orbits of dynamical systems without the wrapping effect, On proving existence of feasible points in equality constrained optimization problems, An interval version of PROMETHEE for the comparison of building products' design with ill-defined data on environmental quality, Structured perturbations and symmetric matrices, Experiments using interval analysis for solving a circuit design problem, Global optimization using interval arithmetic, Global, rigorous and realistic bounds for the solution of dissipative differential equations. I: Theory, The cluster problem in multivariate global optimization, Safe starting regions by fixed points and tightening, Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method, Enclosing solutions of linear interval equations is NP-hard, On a class of enclosure methods for initial value problems, Enclosing solutions of an inverse Sturm-Liouville problem with finite data, Eigenvector sets for intervals of matrices, A sufficient condition for non-overestimation in interval arithmetic, Interval solution of nonlinear equations using linear programming, Validated solutions of initial value problems for ordinary differential equations, Parallel methods for verified global optimization practice and theory, Rigorous convex underestimators for general twice-differentiable problems, The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix, A combined method for enclosing all solutions of nonlinear systems of polynomial equations, Verified solution of large systems and global optimization problems, A parallel complex zero finder, Finding all solutions of nonlinearly constrained systems of equations, On the selection of subdivision directions in interval branch-and-bound methods for global optimization, A branch-and-bound algorithm for bound constrained optimization problems without derivatives, A numerically rigorous proof of curve veering in an eigenvalue problem for differential equations, Checking robust nonsingularity of tridiagonal matrices in linear time, Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic, On the computational complexity of the solution of linear systems with moduli, Enclosing solutions of overdetermined systems of linear interval equations, Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems, Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers, Low redundancy polynomial checks for numerical computation, Epsilon-inflation with contractive interval functions, Second-order sufficient optimality conditions for local and global nonlinear programming, New results on verified global optimization
