Point monotonicity of maps and its applications in numerical computation (Q702637)

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 2128824
Language Label Description Also known as
default for all languages
No label defined
    English
    Point monotonicity of maps and its applications in numerical computation
    scientific article; zbMATH DE number 2128824

      Statements

      Point monotonicity of maps and its applications in numerical computation (English)
      0 references
      0 references
      0 references
      17 January 2005
      0 references
      Let \(I\subset \mathbb{R}\) be a nonempty set. A function \(f:I\rightarrow \mathbb{R}\) is said to be {monotone at} \(z\) if for every \(x\in I\) we have \[ (x-z)(f(x)-f(z))\geq 0 \] and {strictly monotone at }\(z\) if the previous inequality holds with `\(\geq\)' replaced by `\(>\)', for any \(x\in I\), \(x\neq z.\) The paper is concerned with the application of this concepts to the convergence of some numerical methods.
      0 references
      monotone map
      0 references
      Levenberg-Marquardt method
      0 references
      convergence
      0 references
      extended and generalized monotone maps
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references