Abstract
Some of the applications of interval mathematics to the solution of systems of linear and nonlinear algebraic equations and to the solution of unconstrained nonlinear optimization problems are briefly surveyed. Optimization problems often require interval algorithms for bounding the solutions of systems of linear algebraic and for determining the nonexistence, existence and uniqueness of solutions of the systems. Interval arithmetic is slow compared to real arithmetic.
Cite
CITATION STYLE
Wolfe, M. A. (2000). Interval mathematics, algebraic equations and optimization. Journal of Computational and Applied Mathematics, 124(1–2), 263–280. https://doi.org/10.1016/S0377-0427(00)00421-0
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.