Metraipolis › archive › dc_cd19b8a0ba7a
A novel parallel approach for solving some free boundary value problems — arXiv:2609.03214
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03214
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T02:33:08.775Z
- SHA-256 of the archived text
b3f29b49ba902c181af4221318b5a89eaacbbbbd88728660eab68bbfa96bbf86- Stable URL of this page
https://metraipolis.com/documento/dc_cd19b8a0ba7a
How to cite
A novel parallel approach for solving some free boundary value problems — arXiv:2609.03214 — arXiv (en), https://arxiv.org/abs/2609.03214 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd19b8a0ba7a (Metraipolis archive dc_cd19b8a0ba7a, sha256 b3f29b49ba902c181af4221318b5a89eaacbbbbd88728660eab68bbfa96bbf86)
BibTeX
@misc{dccd19b8a0ba7a,
title = {A novel parallel approach for solving some free boundary value problems — arXiv:2609.03214},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03214},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd19b8a0ba7a; sha256 b3f29b49ba902c181af4221318b5a89eaacbbbbd88728660eab68bbfa96bbf86},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03214. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.03214 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:09:02.068Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).