|Title:||Verification methods for dense and sparse systems of equations||Language:||English||Authors:||Rump, Siegfried M.||Issue Date:||1994||Source:||J. Herzberger, ed., Topics in validated computations, pp. 63-136, 1994||Abstract (english):||In this paper we describe verification methods for dense and large sparse systems of linear and nonlinear equations. Most of the methods described have been developed by the author. Other methods are mentioned, but is is not intended to give an overview over existing methods. Many of the results are published in similar form in research papers or books. In this monograph we want to give a concise and compact treatment of some fundamental concepts of the subject. Moreover, many new results are included not being published elsewhere. Among them are the following. A new test for regularity of an interval matrix is given. It is shown that it is significantly better for classes of matrices. Inclusion theorems are formulated for continuous functions not necessarily being differentiable. Some extension of a nonlinear function w.r.t. a point x is used which may be a slope, Jacobian or other. More narrow inclusions and a wider range of applicability (significantly wider input tolerances) are achieved by (i) using slopes rather than Jacobians, (ii) improvement of slopes for transcendental functions, (iii) a two-step approach proving existence in a small and uniqueness in a large interval thus allowing for proving uniqueness in much wider domains and significantly improving the speed, (iv) use of an Einzelschrittverfahren, (v) computing an inclusion of the difference w.r.t. an approximate solution. Methods for problems with parameter dependent input intervals are given yielding inner and outer inclusions. An improvement of the quality of inner inclusions is described. Methods for parametrized sparse nonlinear systems are given for expansion matrix being (i) M-matrix, (ii) symmetric positive definite, (iii) symmetric, (v) general. A fast interval library having been developed at the author's institute is presented being significantly faster compared to existing libraries. A common principle of all presented algorithms is the combination of floating point and interval algorithms. Using this synergism yields powerful algorithms with automatic result verification.||URI:||http://tubdok.tub.tuhh.de/handle/11420/327||DOI:||10.15480/882.325||Institute:||Zuverlässiges Rechnen E-19||Type:||InBuch (Kapitel / Teil einer Monographie)||License:||http://doku.b.tu-harburg.de/doku/lic_ohne_pod.php|
|Appears in Collections:||Publications with fulltext|
Show full item record
checked on Sep 28, 2020
checked on Sep 28, 2020
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.