Verified solution of large systems and global optimization problems
Interval arithmetic type methods are discussed for the solution of large banded or sparse linear systems and for global unconstrained optimization problems. The advantage of these methods is that error bounds for the computed solution are obtained without the significant overestimation which often occurs in floating point algorithms. Numerical results on well known test examples are given.
scientific article; zbMATH DE number 808371
scientific article