Bounding solutions of systems of equations using interval analysis
From MaRDI portal
Publication:1150255
DOI10.1007/BF01933165zbMath0455.65037MaRDI QIDQ1150255
Saumyendra Sengupta, Eldon R. Hansen
Publication date: 1981
Published in: BIT (Search for Journal in Brave)
Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)
Related Items
Finding all solutions of nonlinear equations using the dual simplex method, Safe starting regions by fixed points and tightening, Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method, Interval Taylor forms, Contractor programming, Application of the Krawczyk-Moore-Jones algorithm to electric circuit analysis and its further development, Semidefinite programming for uncertain linear equations in static analysis of structures, An interval global optimization algorithm for a class of functions with several variables, Solving minimax problems by interval methods, A general iterative sparse linear solver and its parallelization for interval Newton methods, Optimizing INTBIS on the CRAY Y-MP, On the Moore test for coupled equations, Topographical global initialization for finding all solutions of nonlinear systems with constraints, Existence test for solution of nonlinear systems applying affine arithmetic, On the application of certain interval iteration methods to solving a system of nonlinear algebraic equations, Low complexity k-dimensional Taylor forms, Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations, On interval operators obtained by splitting the Lipschitz matrix, Solving interval constraints by linearization in computer-aided design, An interval Newton method, Validation and enclosure of solutions of linear complementarity problems, A class of componentwise Krawczyk-Moore type iteration methods, Interval solution of nonlinear equations using linear programming, \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}, Nonsmooth exclusion test for finding all solutions of nonlinear equations, Robot workspace approximation with modified bicentered Krawczyk method, General convex relaxations of implicit functions and inverse functions, Interval Newton/generalized bisection when there are singularities near roots, Interval-based projection method for under-constrained numerical systems, A reinforcement learning approach to interval constraint propagation, A modification of krawczyk's algorithm, A new hybrid algorithm based on chaotic maps for solving systems of nonlinear equations, New spherical 4-designs, Finding all solutions of a class of nonlinear equations using an improved LP test, Global optimization to prescribed accuracy, Mathematically rigorous global optimization in floating-point arithmetic, A dynamical interval Newton method, LP narrowing: A new strategy for finding all solutions of nonlinear equations, Bounds for Lagrange multipliers and optimal points, Nonlinear equations and optimization, A globally convergent interval method for computing and bounding real roots, Interval Newton method: Hansen-Greenberg approach - some procedural improvements, A gentle introduction to Numerica, Centered forms and interval operators, Motivations for an arbitrary precision interval arithmetic and the MPFI library
Cites Work
- Unnamed Item
- Unnamed Item
- Interval forms of Newtons method
- On the solution of linear algebraic equations with interval coefficients
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- A Modification of Krawczyk’s Algorithm
- A globally convergent interval method for computing and bounding real roots
- Interval Arithmetic in Matrix Computations, Part II
- On Solving Systems of Equations Using Interval Arithmetic
