Numerical analysis shows efficient convergence of iterative methods for linear systems in computational mathematics.
We present the numerical solution of the one-dimensional Poisson problem using sparse matrix structures and iterative methods. We analyze the performance of the Gauss–Seidel and Successive Over-Relaxation (SOR) methods applied to the resulting linear systems obtained via finite difference discretization. Numerical experiments illustrate the convergence behavior and efficiency of these methods.
No takes yet. Share an insight, caveat, or question.
Silva et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: