The ADER Approach for Approximating Hyperbolic Equations to Very High Accuracy

被引:2
|
作者
Toro, Eleuterio F. [1 ]
Titarev, Vladimir [2 ]
Dumbser, Michael [1 ]
Iske, Armin [3 ]
Goetz, Claus R. [3 ]
Castro, Cristobal E. [4 ]
Montecinos, Gino, I [5 ]
Dematte, Riccardo [6 ]
机构
[1] Univ Trento, Lab Appl Math, DICAM, Trento, Italy
[2] Russian Acad Sci, Fed Res Ctr Comp Sci & Control, Moscow, Russia
[3] Univ Hamburg, Dept Math, D-20146 Hamburg, Germany
[4] Univ Tarapaca, Fac Ingn, Dept Ingn Mecan, Arica, Chile
[5] Univ La Frontera, Dept Math Engn, Temuco 01145, Chile
[6] Univ Cambridge, Dept Phys, Cambridge, England
关键词
Hyperbolic equations; Very-high accuracy; ADER method; Generalized Riemann problem; Efficiency; DISCONTINUOUS GALERKIN SCHEMES; ESSENTIALLY NONOSCILLATORY SCHEMES; GENERALIZED RIEMANN PROBLEM; FINITE-VOLUME SCHEMES; HIGH-ORDER; CONSERVATION-LAWS; UNSTRUCTURED MESHES; ELEMENT-METHOD; SYSTEMS; SOLVERS;
D O I
10.1007/978-3-031-55260-1_5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Sixty years ago, Godunov introduced his method for solving the Euler equations of gas dynamics, thus creating the Godunov's school of thought for the numerical approximation of hyperbolic equations. The building block of the original first-order Godunov upwind method is the solution of the conventional piecewise constant data Riemann problem. The ADER methodology is a high-order, non-linear fully discrete one-step extension of Godunov's method. The building block of an ADER scheme of order m + 1 in space and time is the generalized Riemann problem GRP(m), in which source terms are admitted and the initial data is represented by polynomials of arbitrary degree m, or other functions. There are by now several methods available to solve theupper GRP(m). The ADER fully discrete methodology operates in both the finite volume and DG frameworks, containing all orders of accuracy. Here we review some key aspects of ADER and conclude with a practical example that highlights the key point of very high-order methods: for small errors they are orders-of-magnitude more efficient than low order methods.
引用
收藏
页码:83 / 105
页数:23
相关论文
共 50 条
  • [1] Fast high order ADER schemes for linear hyperbolic equations
    Schwartzkopff, T
    Dumbser, M
    Munz, CD
    JOURNAL OF COMPUTATIONAL PHYSICS, 2004, 197 (02) : 532 - 539
  • [2] ADER: A High-Order Approach for Linear Hyperbolic Systems in 2D
    Schwartzkopff, T.
    Munz, C. D.
    Toro, E. F.
    JOURNAL OF SCIENTIFIC COMPUTING, 2002, 17 (1-4) : 231 - 240
  • [3] ADER: A High-Order Approach for Linear Hyperbolic Systems in 2D
    T. Schwartzkopff
    C. D. Munz
    E. F. Toro
    Journal of Scientific Computing, 2002, 17 : 231 - 240
  • [4] DIFFERENCE SCHEMES FOR HYPERBOLIC EQUATIONS WITH HIGH ORDER OF ACCURACY
    LAX, PD
    WENDROFF, B
    COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 1964, 17 (03) : 381 - &
  • [5] Very High Accuracy Hyperbolic Tangent Function Implementation in FPGAs
    Hajduk, Zbigniew
    Dec, Grzegorz Rafal
    IEEE ACCESS, 2023, 11 : 23701 - 23713
  • [6] AENO: a Novel Reconstruction Method in Conjunction with ADER Schemes for Hyperbolic Equations
    Eleuterio F. Toro
    Andrea Santacá
    Gino I. Montecinos
    Morena Celant
    Lucas O. Müller
    Communications on Applied Mathematics and Computation, 2023, 5 : 776 - 852
  • [7] AENO: a Novel Reconstruction Method in Conjunction with ADER Schemes for Hyperbolic Equations
    Toro, Eleuterio F.
    Santaca, Andrea
    Montecinos, Gino, I
    Celant, Morena
    Muller, Lucas O.
    COMMUNICATIONS ON APPLIED MATHEMATICS AND COMPUTATION, 2023, 5 (02) : 776 - 852
  • [8] Approximating Moving Point Sources in Hyperbolic Partial Differential Equations
    Ylva Ljungberg Rydin
    Martin Almquist
    Journal of Scientific Computing, 2025, 103 (2)
  • [9] ADER schemes and high order coupling on networks of hyperbolic conservation laws
    Borsche, Raul
    Kall, Jochen
    JOURNAL OF COMPUTATIONAL PHYSICS, 2014, 273 : 658 - 670
  • [10] ADER: Arbitrary High Order Godunov Approach
    Titarev, V. A.
    Toro, E. F.
    JOURNAL OF SCIENTIFIC COMPUTING, 2002, 17 (1-4) : 609 - 618