An iterative method for solving elliptic BVP in one-dimension

Abstract

This paper presents a decomposition method for solving elliptic boundary value problems in one-dimension. The method is an improvement to an existing technique for approximating elliptic systems. It is demonstrated to be computationally superior to the original formulation as less computations are required to obtain an approximation of the same accuracy. Convergence of the method is justified and supported by some theoretical results. We show that for a sufficiently smooth forcing data, the method always converge for a relatively small truncation order. The method is tested using some problems with exact solutions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…