This contribution is dedicated to the exploration of exponential operator splitting methods for the time integration of evolution equations. It entails the review of previous achievements as well as the depiction of novel results. The standard class of splitting methods involving real coefficients is contrasted with an alternative approach that relies on the incorporation of complex coefficients. In view of long-term computations for linear evolution equations, it is expedient to distinguish symmetric, symmetric-conjugate, and alternating-conjugate schemes. The scope of applications comprises high-order reaction-diffusion equations and complex Ginzburg-Landau equations, which are of relevance in the theories of patterns and superconductivity. Time-dependent Gross-Pitaevskii equations and their parabolic counterparts, which model the dynamics of Bose-Einstein condensates and arise in ground state computations, are formally included as special cases. Numerical experiments confirm the validity of theoretical stability conditions and global error bounds as well as the benefits of higher-order complex splitting methods in comparison with standard schemes.
相關內容
In recent years, stochastic effects have become increasingly relevant for describing fluid behaviour, particularly in the context of turbulence. The most important model for inviscid fluids in computational fluid dynamics are the Euler equations of gas dynamics which we focus on in this paper. To take stochastic effects into account, we incorporate a stochastic forcing term in the momentum equation of the Euler system. To solve the extended system, we apply an entropy dissipative discontinuous Galerkin spectral element method including the Finite Volume setting, adjust it to the stochastic Euler equations and analyze its convergence properties. Our analysis is grounded in the concept of dissipative martingale solutions, as recently introduced by Moyo (J. Diff. Equ. 365, 408-464, 2023). Assuming no vacuum formation and bounded total energy, we proof that our scheme converges in law to a dissipative martingale solution. During the lifespan of a pathwise strong solution, we achieve convergence of at least order 1/2, measured by the expected $L^1$ norm of the relative energy. The results built a counterpart of corresponding results in the deterministic case. In numerical simulations, we show the robustness of our scheme, visualise different stochastic realizations and analyze our theoretical findings.
This work considers the Galerkin approximation and analysis for a hyperbolic integrodifferential equation, where the non-positive variable-sign kernel and nonlinear-nonlocal damping with both the weak and viscous damping effects are involved. We derive the long-time stability of the solution and its finite-time uniqueness. For the semi-discrete-in-space Galerkin scheme, we derive the long-time stability of the semi-discrete numerical solution and its finite-time error estimate by technical splitting of intricate terms. Then we further apply the centering difference method and the interpolating quadrature to construct a fully discrete Galerkin scheme and prove the long-time stability of the numerical solution and its finite-time error estimate by designing a new semi-norm. Numerical experiments are performed to verify the theoretical findings.
In this contribution, we address the numerical solutions of high-order asymptotic equivalent partial differential equations with the results of a lattice Boltzmann scheme for an inhomogeneous advection problem in one spatial dimension. We first derive a family of equivalent partial differential equations at various orders, and we compare the lattice Boltzmann experimental results with a spectral approximation of the differential equations. For an unsteady situation, we show that the initialization scheme at a sufficiently high order of the microscopic moments plays a crucial role to observe an asymptotic error consistent with the order of approximation. For a stationary long-time limit, we observe that the measured asymptotic error converges with a reduced order of precision compared to the one suggested by asymptotic analysis.
A finite element method is introduced to track interface evolution governed by the level set equation. The method solves for the level set indicator function in a narrow band around the interface. An extension procedure, which is essential for a narrow band level set method, is introduced based on a finite element $L^2$- or $H^1$-projection combined with the ghost-penalty method. This procedure is formulated as a linear variational problem in a narrow band around the surface, making it computationally efficient and suitable for rigorous error analysis. The extension method is combined with a discontinuous Galerkin space discretization and a BDF time-stepping scheme. The paper analyzes the stability and accuracy of the extension procedure and evaluates the performance of the resulting narrow band finite element method for the level set equation through numerical experiments.
We present weak approximations schemes of any order for the Heston model that are obtained by using the method developed by Alfonsi and Bally (2021). This method consists in combining approximation schemes calculated on different random grids to increase the order of convergence. We apply this method with either the Ninomiya-Victoir scheme (2008) or a second-order scheme that samples exactly the volatility component, and we show rigorously that we can achieve then any order of convergence. We give numerical illustrations on financial examples that validate the theoretical order of convergence. We also present promising numerical results for the multifactor/rough Heston model and hint at applications to other models, including the Bates model and the double Heston model.
We consider linear second order differential equation y''= f with zero Dirichlet boundary conditions. At the continuous level this problem is solvable using the Green function, and this technique has a counterpart on the discrete level. The discrete solution is represented via an application of a matrix -- the Green matrix -- to the discretised right-hand side, and we propose an algorithm for fast construction of the Green matrix. In particular, we discretise the original problem using the spectral collocation method based on the Chebyshev--Gauss--Lobatto points, and using the discrete cosine transformation we show that the corresponding Green matrix is fast to construct even for large number of collocation points/high polynomial degree. Furthermore, we show that the action of the discrete solution operator (Green matrix) to the corresponding right-hand side can be implemented in a matrix-free fashion.
We develop and analyze stochastic inexact Gauss-Newton methods for nonlinear least-squares problems and for nonlinear systems ofequations. Random models are formed using suitable sampling strategies for the matrices involved in the deterministic models. The analysis of the expected number of iterations needed in the worst case to achieve a desired level of accuracy in the first-order optimality condition provides guidelines for applying sampling and enforcing, with \minor{a} fixed probability, a suitable accuracy in the random approximations. Results of the numerical validation of the algorithms are presented.
We consider the problem of estimating the error when solving a system of differential algebraic equations. Richardson extrapolation is a classical technique that can be used to judge when computational errors are irrelevant and estimate the discretization error. We have simulated molecular dynamics with constraints using the GROMACS library and found that the output is not always amenable to Richardson extrapolation. We derive and illustrate Richardson extrapolation using a variety of numerical experiments. We identify two necessary conditions that are not always satisfied by the GROMACS library.
Mass lumping techniques are commonly employed in explicit time integration schemes for problems in structural dynamics and both avoid solving costly linear systems with the consistent mass matrix and increase the critical time step. In isogeometric analysis, the critical time step is constrained by so-called "outlier" frequencies, representing the inaccurate high frequency part of the spectrum. Removing or dampening these high frequencies is paramount for fast explicit solution techniques. In this work, we propose mass lumping and outlier removal techniques for nontrivial geometries, including multipatch and trimmed geometries. Our lumping strategies provably do not deteriorate (and often improve) the CFL condition of the original problem and are combined with deflation techniques to remove persistent outlier frequencies. Numerical experiments reveal the advantages of the method, especially for simulations covering large time spans where they may halve the number of iterations with little or no effect on the numerical solution.
Many articles have recently been devoted to Mahler equations, partly because of their links with other branches of mathematics such as automata theory. Hahn series (a generalization of the Puiseux series allowing arbitrary exponents of the indeterminate as long as the set that supports them is well-ordered) play a central role in the theory of Mahler equations. In this paper, we address the following fundamental question: is there an algorithm to calculate the Hahn series solutions of a given linear Mahler equation? What makes this question interesting is the fact that the Hahn series appearing in this context can have complicated supports with infinitely many accumulation points. Our (positive) answer to the above question involves among other things the construction of a computable well-ordered receptacle for the supports of the potential Hahn series solutions.
小貼士
登錄享
相關主題
注冊地址： 北京市海淀區羊坊店路18號2幢3層301-191