Numerical analysis of penalty-based ensemble methods

被引:0
|
作者
Fang, Rui [1 ]
机构
[1] Univ Pittsburgh, Dept Math, Pittsburgh, PA 15260 USA
基金
美国国家科学基金会;
关键词
Navier-Stokes equations; Ensemble calculation; Penalty methods; Numerical analysis; Finite element methods; FINITE-ELEMENT-METHOD; CHAOTIC ADVECTION; ERROR ANALYSIS; STOKES; ALGORITHM;
D O I
10.1007/s11075-025-02014-y
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The inherent chaos in fluid flow and the uncertainties in initial conditions restrict the ability to make accurate predictions. Small errors that occur in the initial conditions can grow exponentially until they saturate at O\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {O}$$\end{document}(1). Ensemble forecasting averages multiple runs with slightly different initial conditions and other data to produce more accurate results and extend the predictability horizon. However, they can be computationally expensive. We develop a penalty-based ensemble method with a shared coefficient matrix to reduce required memory and computational cost, allowing larger ensemble sizes. Penalty methods relax the incompressibility condition to decouple the pressure and velocity, reducing memory requirements. This report gives stability proof and an error estimate of the penalty-based ensemble method for the Navier-Stokes equations. In addition, we extend the method from deterministic Navier-Stokes equations to Navier-Stokes equations with random variables using Monte Carlo sampling. We validate the method's accuracy and efficiency with three numerical experiments.
引用
收藏
页数:34
相关论文
共 50 条
  • [21] Convergence analysis of penalty based numerical methods for constrained inequality problems
    Han, Weimin
    Sofonea, Mircea
    NUMERISCHE MATHEMATIK, 2019, 142 (04) : 917 - 940
  • [22] Convergence analysis of penalty based numerical methods for constrained inequality problems
    Weimin Han
    Mircea Sofonea
    Numerische Mathematik, 2019, 142 : 917 - 940
  • [23] Sensitivity Analysis of Penalty-based Boundary Intersection on Aggregation-based EMO Algorithms
    Mohammadi, Asad
    Omidvar, Mohammad Nabi
    Li, Xiaodong
    Deb, Kalyanmoy
    2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 2891 - 2898
  • [24] A penalty-based algorithm proposal for engineering optimization problems
    Oztas, Gulin Zeynep
    Erdem, Sabri
    NEURAL COMPUTING & APPLICATIONS, 2023, 35 (10): : 7635 - 7658
  • [25] Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem
    Aksakalli, Vural
    Ari, Ibrahim
    INFORMS JOURNAL ON COMPUTING, 2014, 26 (02) : 370 - 384
  • [26] Adaptive Penalty-Based Distributed Stochastic Convex Optimization
    Towfic, Zaid J.
    Sayed, Ali H.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (15) : 3924 - 3938
  • [27] A penalty-based Tabu search for constrained covering arrays
    Galinier, Philippe
    Kpodjedo, Segla
    Antoniol, Giulio
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, : 1288 - 1294
  • [28] An adaptive penalty-based learning extension for the backpropagation family
    Jansen, Boris
    Nakayama, Kenji
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (08) : 2140 - 2148
  • [29] Penalty-Based Volt/VAr Optimization in Complex Coordinates
    Jabr, Rabih A.
    Dzafic, Izudin
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2022, 37 (03) : 2432 - 2440
  • [30] Penalty-based smoothness conditions in convex variational regularization
    Hofmann, Bernd
    Kindermann, Stefan
    Mathe, Peter
    JOURNAL OF INVERSE AND ILL-POSED PROBLEMS, 2019, 27 (02): : 283 - 300