arXiv (All)
open access
A novel parallel approach for solving some free boundary value problems
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A parallel algorithm for generating Pareto-optimal radiosurgery treatment plans.#174530
- Using Parallel Processing for Problem Solving#242079
- Iterative geometric design for architecture#1100278
- Extending Contract Verification for Parallel Programming Models to Fortran#124011
- A Comparison of Mixed-Integer Linear Programming and Metaheuristics in Parallel Short-Form Construction#1135421
Record · ID 925572
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive