No label defined (Q3327636)

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 3860302
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3860302

      Statements

      1981
      0 references
      successive approximations
      0 references
      normed space
      0 references
      number of iterative steps
      0 references
      Let \(z_ 0,...,z_ n\) be successive approximations of a numerically computed quantity z being an element of a normed space. If r is a given positive number it is important to determine a positive integer n such that \(\| z_ n-z\|<r.\) The authors assume the existence of a continuous function f:[0,\(\infty)\to [0,\infty)\) such that \(0<f(x)<x\) for \(x>0\) and \(\| z_{k+1}-z\| \leq f(\| z_ k-z\|)\) for \(k\in {\mathbb{N}}_ 0\), where \({\mathbb{N}}_ 0\) stands for the set of all nonnegative integers. In such a case (and if f is an increasing function) the problem reduces to determination of numbers \(n_ f(r,x)\), \(x>r\), where \(n_ f(r,x)\) denotes the number of elements of the iterative sequence \((f^ k(x):k\in {\mathbb{N}}_ 0)\) belonging to the interval [r,x). The larger part of the paper deals with various properties of the function \(n_ f\) under such assumptions as strict monotonicity of the function f, convexity of f, and existence of the derivative f'(0). In particular, the main results of the paper give various estimations of the number \(n_ f(r,x)\) using values of the function f and its right derivatives at the endpoints of the interval (r,x) and at zero. These estimations can be practically used to determine (''a priori'') the number of iterative steps in the numerical computations.
      0 references
      0 references
      0 references

      Identifiers