No label defined (Q3346727)

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

      Statements

      1984
      0 references
      double-mean process
      0 references
      Schwab-Borchardt algorithm
      0 references
      [For the entire collection see Zbl 0544.00012.] The authors discuss the double-mean process \(a_{n+1}=M(a_ n,b_ n)\), \(b_{n+1}=M'(a_ n,b_ n)\), in which, given positive \(a_ 0\) and \(b_ 0\), the sequences \((a_ n)\) and \((b_ n)\) are generated recursively. M and M' are continuous mappings from \({\mathbb{R}}^+\times {\mathbb{R}}^+\) into \({\mathbb{R}}^+\) which satisfy the three conditions min(a,b)\(\leq M(a,b)\leq \max (a,b)\), \(M(a,b)=M(b,a)\), \(a=M(a,b)\Rightarrow a=b.\) A survey of published results on this process is presented including the result that if M and M' are sufficiently smooth, the two sequences converge quadratically to a common limit, as in the 'original' case studied by Gauss where M and M' are the arithmetic and geometric means. Results are also given for the superficially similar process \(a_{n+1}=M(a_ n,b_ n)\), \(b_{n+1}=M'(a_{n+1},b_ n)\), in which we have linear convergence to a common limit. This includes the Schwab- Borchardt algorithm as a special case.
      0 references

      Identifiers