Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Reliable computing 3 (1997), S. 5-16 
    ISSN: 1573-1340
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A method is described for calculating verified error bounds for zeros of a system of nonlinear equations f(x) = 0 with continuous f : R" → R". We do not require existence of partial derivatives of f, and the function f may even be known only up to some finite precision ε 〉 0. An inclusion may contain infinitely many zeros of f. An example of a continuous but nowhere differentiable function is given.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Reliable computing 4 (1998), S. 191-197 
    ISSN: 1573-1340
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Interval (two-sided) estimates developed by John Wallis in the 17 century can be considered as an important step towards development of Newton-Leibniz's calculus.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Reliable computing 4 (1998), S. 371-375 
    ISSN: 1573-1340
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The epsilon-inflation proved to be useful and necessary in many verification algorithms. Different definitions of an epsilon-inflation are possible, depending on the context. Recently, certain theoretical justifications and optimality results were proved for an epsilon-inflation without absolute term. In this note we show that in currently used interval iterations the epsilon-inflation without absolute term does not serve the purpose it is defined for. A new epsilon-inflation is proposed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    BIT 39 (1999), S. 534-554 
    ISSN: 1572-9125
    Keywords: Interval arithmetic ; parallel computer ; BLAS ; midpoint-radius ; infimum-supremum
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Infimum-supremum interval arithmetic is widely used because of ease of implementation and narrow results. In this note we show that the overestimation of midpoint-radius interval arithmetic compared to power set operations is uniformly bounded by a factor 1.5 in radius. This is true for the four basic operations as well as for vector and matrix operations, over real and over complex numbers. Moreover, we describe an implementation of midpoint-radius interval arithmetic entirely using BLAS. Therefore, in particular, matrix operations are very fast on almost any computer, with minimal effort for the implementation. Especially, with the new definition it is seemingly the first time that full advantage can be taken of the speed of vector and parallel architectures. The algorithms have been implemented in the Matlab interval toolbox INTLAB.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    BIT 39 (1999), S. 143-151 
    ISSN: 1572-9125
    Keywords: Componentwise distance ; condition number ; ill-posed ; least squares ; pseudoinverse ; underdetermined linear systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The condition number of a problem measures the sensitivity of the answer to small changes in the input, where “small” refers to some distance measure. A problem is called ill-conditioned if the condition number is large, and it is called ill-posed if the condition number is infinity. It is known that for many problems the (normwise) distance to the nearest ill-posed problem is proportional to the reciprocal of the condition number. Recently it has been shown that for linear systems and matrix inversion this is also true for componentwise distances. In this note we show that this is no longer true for least squares problems and other problems involving rectangular matrices. Problems are identified which are arbitrarily ill-conditioned (in a componentwise sense) whereas any componentwise relative perturbation less than 1 cannot produce an ill-posed problem. Bounds are given using additional information on the matrix.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Title: Software Engineering im Scientific Computing; Beiträge eines Workshops in Hamburg 6.-8. Juni 1995
    Contributer: Mackens, Wolfgang , Rump, Siegfried M.
    Publisher: Braunschweig u.a. :Vieweg,
    Year of publication: 1996
    Pages: 315 S.
    Series Statement: Angewandte Mathematik/Informatik
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...