Verified solution of large systems and global optimization problems (Q1900761)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 808371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verified solution of large systems and global optimization problems |
scientific article; zbMATH DE number 808371 |
Statements
Verified solution of large systems and global optimization problems (English)
0 references
13 July 1997
0 references
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.
0 references
banded sparse systems
0 references
global optimization
0 references
result verification
0 references
interval arithmetic
0 references
numerical results
0 references
error bounds
0 references
test examples
0 references
0 references
0 references
0.8176719546318054
0 references
