Interval Methods for Systems of Equations
From MaRDI portal
automatic differentiationHansen-Sengupta operatorHull computationhull inverseinclusion algebrasinterval arithmeticinterval Gauss eliminationinterval Gauss-Seidel iterationinterval hullsinterval mathematicsKrawczyk operatorKrawczyk's methodM- and H-matricesmonographNewton operatorpreconditioningrange of functionsslope arithmeticsublinear mappingssystems of interval equationstextbook
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Interval and finite arithmetic (65G30) Numerical computation of solutions to systems of equations (65H10)
Recommendations
Cited in
(only showing first 100 items - show all)- A framework for existence tests based on the topological degree and homotopy
- Slope enclosures for functions given by two or more branches
- Components identification based method for box constrained variational inequality problems with almost linear functions
- Enclosing all zeros of an analytic function - a rigorous approach
- Efficient handling of universally quantified inequalities
- Bounding the zeros of an interval equation
- Enhancing numerical constraint propagation using multiple inclusion representations
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Componentwise inclusion and exclusion sets for solutions of quadratic equations in finite dimensional spaces
- Iterative methods for systems of equations with interval coefficients and linear form
- 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
- Ten methods to bound multiple roots of polynomials
- Lower bound functions for polynomials
- The hull of preconditioned interval linear equations
- Accelerating filtering techniques for numeric CSPs
- A new concept of fixed point in metric and normed interval spaces
- Enclosing the solution set of parametric interval matrix equation \(A(p)X = B(p)\)
- Maximum compatibility method for data fitting under interval uncertainty
- On parameter loci of the Hénon family
- A computational study of global optimization solvers on two trust region subproblems
- Beyond the Melnikov method. II: Multidimensional setting
- Certificates of infeasibility via nonsmooth optimization
- Is an interval the right result of arithmetic operations on intervals?
- Some properties of the lower bound of optimal values in interval convex quadratic programming
- Global optimization of disjunctive programs
- A certified branch \& bound approach for reliability-based optimization problems
- Invertibility properties of singular integral operators associated with the Lamé and Stokes systems on infinite sectors in two dimensions
- raSAT: an SMT solver for polynomial constraints
- A new method for computing a \(p\)-solution to parametric interval linear systems with affine-linear and nonlinear dependencies
- A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms
- Domain reduction techniques for global NLP and MINLP optimization
- A proof of Jones' conjecture
- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation
- Approximating a solution set of nonlinear inequalities
- Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY
- On interval portfolio selection problem
- Properties of interval-valued function space under the gH-difference and their application to semi-linear interval differential equations
- Solving fully interval linear systems of equations using tolerable solution criteria
- Validated solutions of initial value problems for ordinary differential equations
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- Parallel methods for verified global optimization practice and theory
- Rigorous convex underestimators for general twice-differentiable problems
- Interval solutions for interval algebraic equations
- On the solution sets of particular classes of linear interval systems
- 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
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- A new approach to obtain algebraic solution of interval linear systems
- Efficient solution of interval optimization problem
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
- Epsilon-inflation with contractive interval functions
- A new approach to interval-valued probability measures, a formal method for consolidating the languages of information deficiency: foundations
- Rank one interval enclosure of the parametric united solution set
- Interval tensors and their application in solving multi-linear systems of equations
- A computer-assisted proof of symbolic dynamics in Hyperion's rotation
- Central configurations in planar n-body problem with equal masses for n=5,6,7
- Quasi-decidability of a fragment of the first-order theory of real numbers
- Solving interval systems of equations obtained during the numerical solution of boundary value problems
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Solving interval linear least squares problems by PPS-methods
- Linear interval parametric approach to testing pseudoconvexity
- A general branch-and-bound framework for continuous global multiobjective optimization
This page was built for publication: Interval Methods for Systems of Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3998722)
