اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRadial basis function methods for the Rosenau equation and other higher order PDEs
240
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Meshfree methods based on radial basis function (RBF) approximation are of interest for numerical solution of partial differential equations (PDEs) because they are flexible with respect to the geometry of the computational domain, they can provide high order convergence, they are not more complicated for problems with many space dimensions and they allow for local refinement. The aim of this paper is to show that the solution of the Rosenau equation, as an example of an initial-boundary value problem with multiple boundary conditions, can be implemented using RBF approximation methods. We extend the fictitious point method and the resampling method to work in combination with an RBF collocation method. Both approaches are implemented in one and two space dimensions. The accuracy of the RBF fictitious point method is analysed partly theoretically and partly numerically. The error estimates indicate that a high order of convergence can be achieved for the Rosenau equation. The numerical experiments show that both methods perform well. In the one-dimensional case, the accuracy of the RBF approaches is compared with that of a pseudospectral resampling method, showing similar or slightly better accuracy for the RBF methods. In the two-dimensional case, the Rosenau problem is solved both in a square domain and in a starfish-shaped domain, to illustrate the capability of the RBF-based methods to handle irregular geometries.
قيم البحث
اقرأ أيضاً
In this work, we investigate (energy) stability of global radial basis function (RBF) methods for linear advection problems. Classically, boundary conditions (BC) are enforced strongly in RBF methods. By now it is well-known that this can lead to sta
bility problems, however. Here, we follow a different path and propose two novel RBF approaches which are based on a weak enforcement of BCs. By using the concept of flux reconstruction and simultaneous approximation terms (SATs), respectively, we are able to prove that both new RBF schemes are strongly (energy) stable. Numerical results in one and two spatial dimensions for both scalar equations and systems are presented, supporting our theoretical analysis.
Recently, collocation based radial basis function (RBF) partition of unity methods (PUM) for solving partial differential equations have been formulated and investigated numerically and theoretically. When combined with stable evaluation methods such
as the RBF-QR method, high order convergence rates can be achieved and sustained under refinement. However, some numerical issues remain. The method is sensitive to the node layout, and condition numbers increase with the refinement level. Here, we propose a modified formulation based on least squares approximation. We show that the sensitivity to node layout is removed and that conditioning can be controlled through oversampling. We derive theoretical error estimates both for the collocation and least squares RBF-PUM. Numerical experiments are performed for the Poisson equation in two and three space dimensions for regular and irregular geometries. The convergence experiments confirm the theoretical estimates, and the least squares formulation is shown to be 5-10 times faster than the collocation formulation for the same accuracy.
It is well understood that boundary conditions (BCs) may cause global radial basis function (RBF) methods to become unstable for hyperbolic conservation laws (CLs). Here we investigate this phenomenon and identify the strong enforcement of BCs as the
mechanism triggering such stability issues. Based on this observation we propose a technique to weakly enforce BCs in RBF methods. In the case of hyperbolic CLs, this is achieved by carefully building RBF methods from the weak form of the CL, rather than the typically enforced strong form. Furthermore, we demonstrate that global RBF methods may violate conservation, yielding physically unreasonable solutions when the approximation does not take into account these considerations. Numerical experiments validate our theoretical results.
The Allen-Cahn equation is solved numerically by operator splitting Fourier spectral methods. The basic idea of the operator splitting method is to decompose the original problem into sub-equations and compose the approximate solution of the original
equation using the solutions of the subproblems. Unlike the first and the second order methods, each of the heat and the free-energy evolution operators has at least one backward evaluation in higher order methods. We investigate the effect of negative time steps on a general form of third order schemes and suggest three third order methods for better stability and accuracy. Two fourth order methods are also presented. The traveling wave solution and a spinodal decomposition problem are used to demonstrate numerical properties and the order of convergence of the proposed methods.
Numerical methods for stochastic partial differential equations typically estimate moments of the solution from sampled paths. Instead, we shall directly target the deterministic equations satisfied by the first and second moments, as well as the cov
ariance. In the first part, we focus on stochastic ordinary differential equations. For the canonical examples with additive noise (Ornstein-Uhlenbeck process) or multiplicative noise (geometric Brownian motion) we derive these deterministic equations in variational form and discuss their well-posedness in detail. Notably, the second moment equation in the multiplicative case is naturally posed on projective-injective tensor product spaces as trial-test spaces. We construct Petrov-Galerkin discretizations based on tensor product piecewise polynomials and analyze their stability and convergence in these natural norms. In the second part, we proceed with parabolic stochastic partial differential equations with affine multiplicative noise. We prove well-posedness of the deterministic variational problem for the second moment, improving an earlier result. We then propose conforming space-time Petrov-Galerkin discretizations, which we show to be stable and quasi-optimal. In both parts, the outcomes are illustrated by numerical examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
