用弱形式隐空间动力学加速时变偏微分方程优化,大幅降低计算成本。
Time-Dependent PDE-Constrained Optimization via Weak-Form Latent Dynamics

- 通过弱形式隐空间建模压缩高维解轨迹,构建低维参数化动力学
- 在多个基准问题上实现最高五阶数量级的加速,且对噪声数据鲁棒
- 适合需要大量求解的复杂时变PDE系统设计与控制场景
受高维时变偏微分方程约束的优化问题需反复进行前向求解和灵敏度分析,导致高保真优化在多查询设计与控制场景中计算开销巨大。本文提出一种基于弱形式隐空间动力学识别(WLaSDI)的降维建模框架,用于加速基于梯度的PDE约束优化。该方法将高维解轨迹压缩至低维隐空间,并通过弱形式系统辨识构建参数化隐空间动力学。相比显式数值微分,弱形式对噪声数据更鲁棒,可生成更可靠的代理动力学用于优化。我们推导了基于学习隐动力学的直接灵敏度与伴随梯度表达式,实现设计参数的可扩展梯度评估。框架在三个时变基准问题上验证:辐射传热最优靶腔设计、双流体不稳定性Vlasov-Poisson系统、无粘Burgers方程。结果表明,WLaSDI能准确生成最优设计,在噪声训练数据下仍保持鲁棒性,并实现显著计算加速,相较全阶优化最高提速五阶数量级。证明弱形式隐动力学为复杂时变PDE系统的梯度优化提供了高效且抗噪的代理基础。
原文摘要 · Abstract (English)
Optimization problems constrained by high-dimensional, time-dependent partial differential equations require repeated forward and sensitivity solves, making high-fidelity optimization computationally prohibitive in many-query design and control settings. We present a weak-form latent-space reduced-order modeling framework for accelerating gradient-based PDE-constrained optimization. The proposed approach builds on Weak-form Latent Space Dynamics Identification (WLaSDI), which compresses high-dimensional solution trajectories into a low-dimensional latent representation and identifies parametric latent dynamics using weak-form system identification. By avoiding explicit numerical differentiation of training trajectories, the weak-form improves robustness to noisy data and yields more reliable surrogate dynamics for optimization. We formulate the resulting reduced PDE-constrained optimization problem and derive both direct-sensitivity and adjoint-based gradient expressions for the learned latent dynamics, enabling scalable gradient evaluation with respect to design parameters. The framework is demonstrated on three time-dependent benchmark problems: thermal radiative transfer for optimal hohlraum design, the two-stream instability Vlasov-Poisson system, and the inviscid Burgers equation. Across these examples, WLaSDI produces accurate optimal designs, remains robust under noisy training data, and delivers substantial computational savings, including speedups of up to five orders of magnitude relative to full-order optimization. These results demonstrate that weak-form latent dynamics provide an efficient and noise-robust surrogate foundation for gradient-based optimization of complex time-dependent PDE systems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。