In this article a new approach in solving time fractional partial differential equations is introduced, that is, the ARA-residual power series method. The main idea of this technique, depends on applying the ARA-transform and using Taylor's expansion to construct approximate series solutions. The procedure of getting the approximate solutions for nonlinear time fractional partial differential equations is a difficult mission, the ARA-residual power series method over comes this trouble throughout expressing the solution in a series form then obtain the series coefficients using the idea of the residual function and the concept of the limit at infinity. This method is efficient and applicable to solve a wide family of time fractional partial differential equations. Four attractive applications are considered to show the speed and the strength of the proposed method in constructing solitary series solutions of the target equations.
相關內容
We consider linear first-order systems of ordinary differential equations (ODEs) in port-Hamiltonian (pH) form. Physical parameters are remodelled as random variables to conduct an uncertainty quantification. A stochastic Galerkin projection yields a larger deterministic system of ODEs, which does not exhibit a pH form in general. We apply transformations of the original systems such that the stochastic Galerkin projection becomes structure-preserving. Furthermore, we investigate meaning and properties of the Hamiltonian function belonging to the stochastic Galerkin system. A large number of random variables implies a highdimensional stochastic Galerkin system, which suggests itself to apply model order reduction (MOR) generating a low-dimensional system of ODEs. We discuss structure preservation in projection-based MOR, where the smaller systems of ODEs feature pH form again. Results of numerical computations are presented using two test examples.
In this study, we investigate an anisotropic weakly over-penalised symmetric interior penalty method for the Stokes equation. Our approach is a simple discontinuous Galerkin method similar to the Crouzeix--Raviart finite element method. As our primary contribution, we show a new proof for the consistency term, which allows us to obtain an estimate of the anisotropic consistency error. The key idea of the proof is to apply the relation between the Raviart--Thomas finite element space and a discontinuous space. While inf-sup stable schemes of the discontinuous Galerkin method on shape-regular mesh partitions have been widely discussed, our results show that the Stokes element satisfies the inf-sup condition on anisotropic meshes. Furthermore, we also provide an error estimate in an energy norm on anisotropic meshes. In numerical experiments, we compare calculation results for standard and anisotropic mesh partitions, and the results show the effectiveness of using anisotropic meshes for problems with boundary layers.
We propose a Hermite spectral method for the inelastic Boltzmann equation, which makes two-dimensional periodic problem computation affordable by the hardware nowadays. The new algorithm is based on a Hermite expansion, where the expansion coefficients for the VHS model are reduced into several summations and can be derived exactly. Moreover, a new collision model is built with a combination of the quadratic collision operator and a linearized collision operator, which helps us to balance the computational cost and the accuracy. Various numerical experiments, including spatially two-dimensional simulations, demonstrate the accuracy and efficiency of this numerical scheme.
Stochastic space-time fractional diffusion equations often appear in the modeling of the heat propagation in non-homogeneous medium. In this paper, we firstly investigate the Mittag--Leffler Euler integrator of a class of stochastic space-time fractional diffusion equations, whose super-convergence order is obtained by developing a helpful decomposition way for the time-fractional integral. Here, the developed decomposition way is the key to dealing with the singularity of the solution operator. Moreover, we study the Freidlin--Wentzell type large deviation principles of the underlying equation and its Mittag--Leffler Euler integrator based on the weak convergence approach. In particular, we prove that the large deviation rate function of the Mittag--Leffler Euler integrator $\Gamma$-converges to that of the underlying equation.
The hazard function represents one of the main quantities of interest in the analysis of survival data. We propose a general approach for modelling the dynamics of the hazard function using systems of autonomous ordinary differential equations (ODEs). This modelling approach can be used to provide qualitative and quantitative analyses of the evolution of the hazard function over time. Our proposal capitalises on the extensive literature of ODEs which, in particular, allow for establishing basic rules or laws on the dynamics of the hazard function via the use of autonomous ODEs. We show how to implement the proposed modelling framework in cases where there is an analytic solution to the system of ODEs or where an ODE solver is required to obtain a numerical solution. We focus on the use of a Bayesian modelling approach, but the proposed methodology can also be coupled with maximum likelihood estimation. A simulation study is presented to illustrate the performance of these models and the interplay of sample size and censoring. Two case studies using real data are presented to illustrate the use of the proposed approach and to highlight the interpretability of the corresponding models. We conclude with a discussion on potential extensions of our work and strategies to include covariates into our framework.
We study the problem of estimating non-linear functionals of discrete distributions in the context of local differential privacy. The initial data $x_1,\ldots,x_n \in [K]$ are supposed i.i.d. and distributed according to an unknown discrete distribution $p = (p_1,\ldots,p_K)$. Only $\alpha$-locally differentially private (LDP) samples $z_1,...,z_n$ are publicly available, where the term 'local' means that each $z_i$ is produced using one individual attribute $x_i$. We exhibit privacy mechanisms (PM) that are interactive (i.e. they are allowed to use already published confidential data) or non-interactive. We describe the behavior of the quadratic risk for estimating the power sum functional $F_{\gamma} = \sum_{k=1}^K p_k^{\gamma}$, $\gamma >0$ as a function of $K, \, n$ and $\alpha$. In the non-interactive case, we study two plug-in type estimators of $F_{\gamma}$, for all $\gamma >0$, that are similar to the MLE analyzed by Jiao et al. (2017) in the multinomial model. However, due to the privacy constraint the rates we attain are slower and similar to those obtained in the Gaussian model by Collier et al. (2020). In the interactive case, we introduce for all $\gamma >1$ a two-step procedure which attains the faster parametric rate $(n \alpha^2)^{-1/2}$ when $\gamma \geq 2$. We give lower bounds results over all $\alpha$-LDP mechanisms and all estimators using the private samples.
We propose a novel inference procedure for linear combinations of high-dimensional regression coefficients in generalized estimating equations (GEE), which are widely used to analyze correlated data. Our estimator for this more general inferential target, obtained via constructing projected estimating equations, is shown to be asymptotically normally distributed under certain regularity conditions. We also introduce a data-driven cross-validation procedure to select the tuning parameter for estimating the projection direction, which is not addressed in the existing procedures. We demonstrate the robust finite-sample performance, especially in estimation bias and confidence interval coverage, of the proposed method via extensive simulations, and apply the method to a longitudinal proteomic study of COVID-19 plasma samples to investigate the proteomic signatures associated with disease severity.
Probabilistic evolution of the error of numerical method for linear stochastic differential equation
The quantitative characterization of the evolution of the error distribution (as the step-size tends to zero) is a fundamental problem in the analysis of stochastic numerical method. In this paper, we answer this problem by proving that the error of numerical method for linear stochastic differential equation satisfies the limit theorems and large deviation principle. To the best of our knowledge, this is the first result on the quantitative characterization of the evolution of the error distribution of stochastic numerical method. As an application, we provide a new perspective to explain the superiority of symplectic methods for stochastic Hamiltonian systems in the long-time computation. To be specific, by taking the linear stochastic oscillator as the test equation, we show that in the long-time computation, the probability that the error deviates from the typical value is smaller for the symplectic methods than that for the non-symplectic methods, which reveals that the stochastic symplectic methods are more stable than non-symplectic methods.
The Helmholtz equation is related to seismic exploration, sonar, antennas, and medical imaging applications. It is one of the most challenging problems to solve in terms of accuracy and convergence due to the scalability issues of the numerical solvers. For 3D large-scale applications, high-performance parallel solvers are also needed. In this paper, a matrix-free parallel iterative solver is presented for the three-dimensional (3D) heterogeneous Helmholtz equation. We consider the preconditioned Krylov subspace methods for solving the linear system obtained from finite-difference discretization. The Complex Shifted Laplace Preconditioner (CSLP) is employed since it results in a linear increase in the number of iterations as a function of the wavenumber. The preconditioner is approximately inverted using one parallel 3D multigrid cycle. For parallel computing, the global domain is partitioned blockwise. The matrix-vector multiplication and preconditioning operator are implemented in a matrix-free way instead of constructing large, memory-consuming coefficient matrices. Numerical experiments of 3D model problems demonstrate the robustness and outstanding strong scaling of our matrix-free parallel solution method. Moreover, the weak parallel scalability indicates our approach is suitable for realistic 3D heterogeneous Helmholtz problems with minimized pollution error.
It is well known that the Euler method for approximating the solutions of a random ordinary differential equation $\mathrm{d}X_t/\mathrm{d}t = f(t, X_t, Y_t)$ driven by a stochastic process $\{Y_t\}_t$ with $\theta$-H\"older sample paths is estimated to be of strong order $\theta$ with respect to the time step, provided $f=f(t, x, y)$ is sufficiently regular and with suitable bounds. Here, it is proved that, in many typical cases, further conditions on the noise can be exploited so that the strong convergence is actually of order 1, regardless of the H\"older regularity of the sample paths. This applies for instance to additive or multiplicative It\^o process noises (such as Wiener, Ornstein-Uhlenbeck, and geometric Brownian motion processes); to point-process noises (such as Poisson point processes and Hawkes self-exciting processes, which even have jump-type discontinuities); and to transport-type processes with sample paths of bounded variation. The result is based on a novel approach, estimating the global error as an iterated integral over both large and small mesh scales, and switching the order of integration to move the critical regularity to the large scale. The work is complemented with numerical simulations illustrating the strong order 1 convergence in those cases, and with an example with fractional Brownian motion noise with Hurst parameter $0 < H < 1/2$ for which the order of convergence is $H + 1/2$, hence lower than the attained order 1 in the examples above, but still higher than the order $H$ of convergence expected from previous works.
小貼士
登錄享
注冊地址： 北京市海淀區羊坊店路18號2幢3層301-191