A novel parallel approach for solving some free boundary value problems
Abstract
This paper introduces a novel, efficient class of parallel direct and indirect iterative schemes to solve general obstacle and free boundary value problems. The uniqueness of the solution for the direct parallel method is established under the assumption that the model problem yields an M-matrix. The convergence analysis of the indirect approach is predicated on minimizing the discrete energy functional at each iterative stage of the linear approximation process. Under the aforementioned setting, we establish theoretical convergence results for both smooth and nonsmooth energy functionals defined over a convex set, in the sense of Ferris and Mangasarian \cite{ferris1994parallel}. For the numerical computation of the one-dimensional obstacle problem, we adopt a direct generalized parallel approach based on the SPIKE algorithm \cite{polizzi2006parallel}. To accelerate convergence and reduce computational complexity, a fast recursive version of the scheme is generalized to the nonsmooth case. For two- and three-dimensional obstacle problems, we employ a directional splitting method that treats each directional subproblem as a one-dimensional obstacle minimization problem. By framing the energy functional minimization as a parabolic time-dependent problem and utilizing an Armijo time-stepping rule during the solution update process, we successfully obtain results for higher-dimensional obstacles. Additionally, this study explores the possibility of extending the algorithm into a constrained quadratic programming optimization solver. We also evaluate the framework on image deblurring phenomena under the aforementioned setting, successfully recovering the original images. Finally, numerical illustrations are provided to validate the theoretical results.
Related
- H2(Ω) A Priori Error Bounds for Boundary-Adapted PINNs Solving Elliptic Dirichlet Problems
- Editorial for the Special Issue of Fractal and Fractional “Advances in Fractional Initial and Boundary Value Problems”
- Boundary Value Problems for the SU(∞)-Toda Equation via the Onofri Inequality
- Modified Decomposition Algorithms for Fractional Delay Boundary Value Problems
- Neumann Boundary Value Problems on p-Adic Analytic Manifolds
BibTeX
@misc{singh2026novel,
title = {{A novel parallel approach for solving some free boundary value problems}},
author = {Peeyush Singh and Amboru Yalmanda},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.03214},
eprint = {2609.03214},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.03214},
}
RIS
TY - UNPB
TI - A novel parallel approach for solving some free boundary value problems
AU - Peeyush Singh
AU - Amboru Yalmanda
PY - 2026
DA - 2026/09/02
PB - arXiv
DO - 10.48550/arxiv.2609.03214
UR - https://arxiv.org/abs/2609.03214
AB - This paper introduces a novel, efficient class of parallel direct and indirect iterative schemes to solve general obstacle and free boundary value problems. The uniqueness of the solution for the direct parallel method is established under the assumption that the model problem yields an M-matrix. The convergence analysis of the indirect approach is predicated on minimizing the discrete energy functional at each iterative stage of the linear approximation process. Under the aforementioned setting, we establish theoretical convergence results for both smooth and nonsmooth energy functionals defined over a convex set, in the sense of Ferris and Mangasarian \cite{ferris1994parallel}. For the numerical computation of the one-dimensional obstacle problem, we adopt a direct generalized parallel approach based on the SPIKE algorithm \cite{polizzi2006parallel}. To accelerate convergence and reduce computational complexity, a fast recursive version of the scheme is generalized to the nonsmooth case. For two- and three-dimensional obstacle problems, we employ a directional splitting method that treats each directional subproblem as a one-dimensional obstacle minimization problem. By framing the energy functional minimization as a parabolic time-dependent problem and utilizing an Armijo time-stepping rule during the solution update process, we successfully obtain results for higher-dimensional obstacles. Additionally, this study explores the possibility of extending the algorithm into a constrained quadratic programming optimization solver. We also evaluate the framework on image deblurring phenomena under the aforementioned setting, successfully recovering the original images. Finally, numerical illustrations are provided to validate the theoretical results.
ER -