اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal error estimates for Legendre expansions of singular functions with fractional derivatives of bounded variation
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a new fractional Taylor formula for singular functions whose Caputo fractional derivatives are of bounded variation. It bridges and ``interpolates the usual Taylor formulas with two consecutive integer orders. This enables us to obtain an analogous formula for the Legendre expansion coefficient of this type of singular functions, and further derive the optimal (weighted) $L^infty$-estimates and $L^2$-estimates of the Legendre polynomial approximations. This set of results can enrich the existing theory for $p$ and $hp$ methods for singular problems, and answer some open questions posed in some recent literature.
قيم البحث
اقرأ أيضاً
This work discusses the finite element discretization of an optimal control problem for the linear wave equation with time-dependent controls of bounded variation. The main focus lies on the convergence analysis of the discretization method. The stat
e equation is discretized by a space-time finite element method. The controls are not discretized. Under suitable assumptions optimal convergence rates for the error in the state and control variable are proven. Based on a conditional gradient method the solution of the semi-discretized optimal control problem is computed. The theoretical convergence rates are confirmed in a numerical example.
In this paper, we investigate fast algorithms to approximate the Caputo derivative $^C_0D_t^alpha u(t)$ when $alpha$ is small. We focus on two fast algorithms, i.e. FIR and FIDR, both relying on the sum-of-exponential approximation to reduce the cost
of evaluating the history part. FIR is the numerical scheme originally proposed in [16], and FIDR is an alternative scheme we propose in this work, and the latter shows superiority when $alpha$ is small. With quantitative estimates, we prove that given a certain error threshold, the computational cost of evaluating the history part of the Caputo derivative can be decreased as $alpha$ gets small. Hence, only minimal cost for the fast evaluation is required in the small $alpha$ regime, which matches prevailing protocols in engineering practice. We also present a stability and error analysis of FIDR for solving linear fractional diffusion equations. Finally, we carry out systematic numerical studies for the performances of both FIR and FIDR schemes, where we explore the trade-off between accuracy and efficiency when $alpha$ is small.
We consider a discretization of Caputo derivatives resulted from deconvolving a scheme for the corresponding Volterra integral. Properties of this discretization, including signs of the coefficients, comparison principles, and stability of the corres
ponding implicit schemes, are proved by its linkage to Volterra integrals with completely monotone kernels. We then apply the backward scheme corresponding to this discretization to two time fractional dissipative problems, and these implicit schemes are helpful for the analysis of the corresponding problems. In particular, we show that the overdamped generalized Langevin equation with fractional noise has a unique limiting measure for strongly convex potentials and establish the convergence of numerical solutions to the strong solutions of time fractional gradient flows. The proposed scheme and schemes derived using the same philosophy can be useful for many other applications as well.
The Richards equation is commonly used to model the flow of water and air through soil, and it serves as a gateway equation for multiphase flows through porous media. It is a nonlinear advection-reaction-diffusion equation that exhibits both paraboli
c-hyperbolic and parabolic-elliptic kinds of degeneracies. In this study, we provide reliable, fully computable, and locally space-time efficient a posteriori error bounds for numerical approximations of the fully degenerate Richards equation. For showing global reliability, a nonlocal-in-time error estimate is derived individually for the time-integrated $H^1(H^{-1})$, $L^2(L^2)$, and the $L^2(H^1)$ errors. A maximum principle and a degeneracy estimator are employed for the last one. Global and local space-time efficiency error bounds are then obtained in a standard $H^1(H^{-1})cap L^2(H^1)$ norm. The reliability and efficiency norms employed coincide when there is no nonlinearity. Moreover, error contributors such as flux nonconformity, time discretization, quadrature, linearization, and data oscillation are identified and separated. The estimates are also valid in a setting where iterative linearization with inexact solvers is considered. Numerical tests are conducted for nondegenerate and degenerate cases having exact solutions, as well as for a realistic case. It is shown that the estimators correctly identify the errors up to a factor of the order of unity.
The logarithmic nonlinearity has been used in many partial differential equations (PDEs) for modeling problems in various applications.Due to the singularity of the logarithmic function, it introducestremendous difficulties in establishing mathematic
al theories, as well asin designing and analyzing numerical methods for PDEs with such nonlinearity. Here we take the logarithmic Schrodinger equation (LogSE)as a prototype model. Instead of regularizing $f(rho)=ln rho$ in theLogSE directly and globally as being done in the literature, we propose a local energy regularization (LER) for the LogSE byfirst regularizing $F(rho)=rholn rho -rho$ locally near $rho=0^+$ with a polynomial approximation in the energy functional of the LogSE and then obtaining an energy regularized logarithmic Schrodinger equation (ERLogSE) via energy variation. Linear convergence is established between the solutions of ERLogSE and LogSE in terms of a small regularization parameter $0<epll1$. Moreover, the conserved energy of the ERLogSE converges to that of LogSE quadratically, which significantly improvesthe linear convergence rate of the regularization method in the literature. Error estimates are alsopresented for solving the ERLogSE by using Lie-Trotter splittingintegrators. Numerical results are reported to confirm our errorestimates of the LER and of the time-splitting integrators for theERLogSE. Finally our results suggest that the LER performs better than regularizing the logarithmic nonlinearity in the LogSE directly.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
