Residual cutting method for elliptic boundary value problems: Application to Poisson's equation (Q1375489)

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 1100736
Language Label Description Also known as
default for all languages
No label defined
    English
    Residual cutting method for elliptic boundary value problems: Application to Poisson's equation
    scientific article; zbMATH DE number 1100736

      Statements

      Residual cutting method for elliptic boundary value problems: Application to Poisson's equation (English)
      0 references
      0 references
      0 references
      0 references
      12 May 1998
      0 references
      The paper is concerned with an iterative solver for elliptic boundary value problems. The main idea of the method is to present the current solutions increments as a linear combination of the approximate solution of the corresponding residual equation obtained as a result of \(M\) internal iterations and increments corresponding to \(L\) previous iterations. The coefficients of the combination (the residual cutting coefficients) are then determined as the least squares solutions of the next residual equation. It is proved that the process converges if some not very restrictive condition is met. Computational examples for the Poisson equation showing fast convergence with relatively small values of \(M\) and \(L\) are presented. The application of the method to ill-posed Neumann problems is discussed and demonstrated.
      0 references
      elliptic boundary value problems
      0 references
      iterative methods
      0 references
      least squares solutions
      0 references
      Poisson equation
      0 references
      Neumann problem
      0 references
      residual cutting method
      0 references
      convergence
      0 references

      Identifiers

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