Numerical Solution of Biot Poroelastic Equations in Quasi-Static State Using Shared Memory Systems Full article
| Journal |
Lobachevskii Journal of Mathematics
ISSN: 1995-0802 , E-ISSN: 1818-9962 |
||
|---|---|---|---|
| Output data | Year: 2025, Volume: 46, Number: 8, Pages: 3845–3855 Pages count : 11 DOI: 10.1134/S1995080225609592 | ||
| Tags | poroelasticity, finite differences, shared memory algorithms | ||
| Authors |
|
||
| Affiliations |
|
Funding (2)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0015 |
| 2 | Russian Science Foundation | 19-77-20004-П |
Abstract:
We presented a numerical algorithm to solve Biot equations in a quasi-static state to upscale the anelastic properties of fractured-porous fluid-filled media. Biot equation couples elastic displacements and the relative fluid displacements in porous media. To solve the system of linear
equations approximating the coupled model we suggest using the Krylov-type iterative method with field-split preconditioner. To construct the preconditioner we solve two independent decoupled problems of the smaller size. They are static elastic equations and equations governing relative fluid motion. Both sparse systems are solved with direct solvers. We focused on the applicability of the Elbrus processors to solve the discussed problem. We illustrate that Elbrus-based systems are capable of solving real-life simulations and dealing with large-scale problems. Moreover, Elbrusbased computations exhibited similar scalability under shared memory parallelization as those on Intel- and AMD-based architectures.
Cite:
Solovyev S.A.
, Lisitsa V.V.
Numerical Solution of Biot Poroelastic Equations in Quasi-Static State Using Shared Memory Systems
Lobachevskii Journal of Mathematics. 2025. V.46. N8. P.3845–3855. DOI: 10.1134/S1995080225609592
Numerical Solution of Biot Poroelastic Equations in Quasi-Static State Using Shared Memory Systems
Lobachevskii Journal of Mathematics. 2025. V.46. N8. P.3845–3855. DOI: 10.1134/S1995080225609592
Dates:
| Submitted: | Apr 5, 2025 |
| Published print: | May 30, 2025 |
| Accepted: | Jan 9, 2026 |
| Published online: | Jan 9, 2026 |
Identifiers:
No identifiers
Citing:
Пока нет цитирований