用于生物运输网络有限元离散化的鲁棒且可扩展的非线性求解器
Robust and scalable nonlinear solvers for finite element discretizations of biological transportation networks
AI总结:
本文提出了一种鲁棒且可扩展的非线性有限元求解器,用于模拟由非凸能量成本泛函梯度流最小化驱动的生物运输网络,展示了求解器的鲁棒性和性能,验证了线性预条件器在模型退化情况下的稳定性。
摘要:
我们开发了用于生物运输网络模拟的鲁棒且可扩展的完全隐式非线性有限元求解器,该模拟由非凸能量成本泛函的梯度流最小化驱动。我们的方法采用离散的空间来表示导率张量,从而确保在整个最小化过程中保持其半正定性,这源于使用后向欧拉方案进行梯度流动力学的时间积分。在二维和三维中的广泛测试展示了求解器的鲁棒性和性能,突显了涌现网络结构对网格分辨率和拓扑的敏感性,并验证了线性预条件器在模型退化情况下的稳定性。该实现实现了在大规模高性能计算平台上接近最优的并行扩展性。据我们所知,网络形成系统从未在三维中被模拟过。因此,我们的三维结果是首次。
英文摘要:
We develop robust and scalable fully implicit nonlinear finite element solvers for the simulations of biological transportation networks driven by the gradient flow minimization of a non-convex energy cost functional. Our approach employs a discontinuous space for the conductivity tensor that allows us to guarantee the preservation of its positive semi-definiteness throughout the entire minimization procedure arising from the time integration of the gradient flow dynamics using a backward Euler scheme. Extensive tests in two and three dimensions demonstrate the robustness and performance of the solver, highlight the sensitivity of the emergent network structures to mesh resolution and topology, and validate the resilience of the linear preconditioner to the ill-conditioning of the model. The implementation achieves near-optimal parallel scaling on large-scale, high-performance computing platforms. To the best of our knowledge, the network formation system has never been simulated in three dimensions before. Consequently, our three-dimensional results are the first of their kind.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。