Numerical parallel algorithm for solving two-dimensional elliptic equation with variable coefficients.

2026

Closed access Metadata (CSL-JSON)
DOI 10.69793/ijmcs/03.2026/murat
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In this paper, we develop a parallel numerical algorithm for solving a boundary value problem for a two-dimensional elliptic equation with variable coefficients using the matrix sweep method. The stability and convergence of the resulting finite-difference scheme are investigated. A series of computational experiments were conducted to study the performance of the parallel algorithm. A fivefold speedup was achieved on a 16-core processor.