Accelerated monotone iterations for numerical solutions of nonlinear elliptic boundary value problems (Q1879559)

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 2102412
Language Label Description Also known as
default for all languages
No label defined
    English
    Accelerated monotone iterations for numerical solutions of nonlinear elliptic boundary value problems
    scientific article; zbMATH DE number 2102412

      Statements

      Accelerated monotone iterations for numerical solutions of nonlinear elliptic boundary value problems (English)
      0 references
      0 references
      23 September 2004
      0 references
      The paper is devoted to monotone iterations for nonlinear grid systems of type \(Au=F(u)\) where \(A\) is an \(M\)-matrix and \(F_i\in C^1\) (such systems are of importance for numerical solution of nonlinear elliptic boundary value problems). The author investigates iterations of the type \((A+C^n)u^{n+1}=C^n u^n+F(u^n)\) where \(C^n\) is a suitable nonnegative diagonal matrix. Monotonic convergence takes place to a unique solution; moreover, the convergence is quadratic. If the system has multiple solutions, the convergence to a maximal and a minimal solution is proved. A one-dimensional differential equation from chemical engineering is considered as an illustration with significant reduction in the number of iterations.
      0 references
      nonlinear elliptic equations
      0 references
      grid approximations
      0 references
      monotone iterations
      0 references
      quadratic convergence
      0 references
      upper and lower solutions
      0 references
      numerical example
      0 references
      multiple solutions
      0 references
      chemical engineering
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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