Verified solution of large systems and global optimization problems
type: Item
instance of: scholarly article
title: Verified solution of large systems and global optimization problems
zbMATH Open document ID: 0866.65035
DOI: 10.1016/0377-0427(94)00092-F
published in: Journal of Computational and Applied Mathematics
publication date: 1997-07-13T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65G30
zbMATH DE Number: 808371
zbMATH Keywords: banded sparse systems
zbMATH Keywords: global optimization
zbMATH Keywords: result verification
zbMATH Keywords: interval arithmetic
zbMATH Keywords: numerical results
zbMATH Keywords: error bounds
zbMATH Keywords: test examples
author: Siegfried M. Rump
reviewed by: Eugene L. Allgower
describes a project that uses: PROFIL/BIAS
describes a project that uses: BRENT
describes a project that uses: LINPACK
describes a project that uses: PASCAL-XSC
MaRDI profile type: Publication
cites work: Fast local convergence with single and multistep methods for nonlinear equations
cites work: Q4191512
cites work: Q3345690
cites work: A stochastic method for global optimization
cites work: Q3787350
cites work: Q5657612
cites work: Q3314867
cites work: Q4068464
cites work: Q5591853
cites work: Q4878822
cites work: Condition Estimates
cites work: On Solving Systems of Equations Using Interval Arithmetic
cites work: Q4004279
cites work: Q3997222
cites work: Q4868537
cites work: Q4295107
cites work: Q4308281
cites work: Q4849608
cites work: Q3999735
cites work: Q4847666
cites work: PROFIL/BIAS - A fast interval library
cites work: Q3799547
cites work: Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
cites work: Q4122689
cites work: Q3948528
cites work: Q3694581
cites work: On computing the range of a rational function of n variables over a bounded region
cites work: A numerical verification method for the existence of weak solutions for nonlinear boundary value problems
cites work: Interval Methods for Systems of Equations
cites work: Constrained global optimization: algorithms and applications
cites work: Numerical existence proofs and explicit bounds for solutions of nonlinear elliptic boundary value problems
cites work: Automatic differentiation: techniques and applications
cites work: Q4040272
cites work: Q3878653
cites work: Solving nonlinear systems with least significant bit accuracy
cites work: Q3750040
cites work: Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations
cites work: Q3293635
cites work: Q5599376
cites work: Modern Error Analysis
description: scientific article; zbMATH DE number 808371