We present a novel numerical scheme to approximate the solution map $s\mapsto u(s) := \mathcal{L}^{-s}f$ to partial differential equations involving fractional elliptic operators. Reinterpreting $\mathcal{L}^{-s}$ as interpolation operator allows us to derive an integral representation of $u(s)$ which includes solutions to parametrized reaction-diffusion problems. We propose a reduced basis strategy on top of a finite element method to approximate its integrand. Unlike prior works, we deduce the choice of snapshots for the reduced basis procedure analytically. Avoiding further discretization, the integral is interpreted in a spectral setting to evaluate the surrogate directly. Its computation boils down to a matrix approximation $L$ of the operator whose inverse is projected to a low-dimensional space, where explicit diagonalization is feasible. The universal character of the underlying $s$-independent reduced space allows the approximation of $(u(s))_{s\in(0,1)}$ in its entirety. We prove exponential convergence rates and confirm the analysis with a variety of numerical examples.
Further improvements are proposed in the second part of this investigation to avoid inversion of $L$. Instead, we directly project the matrix to the reduced space, where its negative fractional power is evaluated. A numerical comparison with the predecessor highlights its competitive performance.
This paper presents an efficient spectral method for solving the fractional Fredholm integro-differential equations. The non-smoothness of the solutions to such problems leads to the performance of spectral methods based on the classical polynomials such as Chebyshev, Legendre, Laguerre, etc, with a low order of convergence. For this reason, the development of classic numerical methods to solve such problems becomes a challenging issue. Since the non-smooth solutions have the same asymptotic behavior with polynomials of fractional powers, therefore, fractional basis functions are the best cand…
We consider the numerical approximation of the spectral fractional diffusion problem based on the so called Balakrishnan representation. The latter consists of an improper integral approximated via quadratures. At each quadrature point, a reaction-diffusion problem must be approximated and is the method bottle neck. In this work, we propose to reduce the computational cost using a reduced basis strategy allowing for a fast evaluation of the reaction-diffusion problems. The reduced basis does not depend on the fractional power $s$ for $0<s_{\min}\leq s \leq s_{\max}<1$. It is built offline once…
We establish an equivalence between two classes of methods for solving fractional diffusion problems, namely, Reduced Basis Methods (RBM) and Rational Krylov Methods (RKM). In particular, we demonstrate that several recently proposed RBMs for fractional diffusion can be interpreted as RKMs. This changed point of view allows us to give convergence proofs for some methods where none were previously available. We also propose a new RKM for fractional diffusion problems with poles chosen using the best rational approximation of the function $x^{-s}$ in the spectral interval of the spatial discreti…
We propose and analyze new numerical methods to evaluate fractional norms and apply fractional powers of elliptic operators. By means of a reduced basis method, we project to a small dimensional subspace where explicit diagonalization via the eigensystem is feasible. The method relies on several independent evaluations of $(\textrm{I}-t_i^2Δ)^{-1}f$, which can be computed in parallel. We prove exponential convergence rates for the optimal choice of sampling points $t_i$, provided by the so-called Zolotarëv points. Numerical experiments confirm the analysis and demonstrate the efficiency of our…
Fueled by many applications in random processes, imaging science, geophysics, etc., fractional Laplacians have recently received significant attention. The key driving force behind the success of this operator is its ability to capture non-local effects while enforcing less smoothness on functions. In this paper, we introduce a spectral method to approximate this operator employing a sinc basis. Using our scheme, the evaluation of the operator and its application onto a vector has complexity of $\mathcal O(N\log(N))$ where $N$ is the number of unknowns. Thus, using iterative methods such as CG…
Spectral method for substantial fractional differential equations
School of Mathematical Science, Xiamen University（厦门大学数学科学学院）；Department of Mathematics, City University of Hong Kong（香港城市大学数学系）；Beijing Computational Research Center（北京计算科学研究中心）；Department of Mathematics, Wayne State University（韦恩州立大学数学系）
In this paper, Belousov-Zhabotinsky (B-Z) reaction model with Caputo fractional time derivative is investigated by the fractional reduced differential transform method (FRDTM) methods, an iterative technique. The outcome using FRDTM method reveals an efficiency with high accuracy and minimal computations for numerical solutions. Moreover, the solution profiles which demonstrate the behavior of the obtained result are presented.
Decoupled fractional Laplacian wave equation can describe the seismic wave propagation in attenuating media. Fourier pseudospectral implementations, which solve the equation in spatial frequency domain, are the only existing methods for solving the equation. For the earth media with curved boundaries, the pseudospectral methods could be less attractive to handle the irregular computational domains. In the paper, we propose a radial basis function collocation method that can easily tackle the irregular domain problems. Unlike the pseudospectral methods, the proposed method solves the equation i…
In this work, we study a new spectral Petrov-Galerkin approximation of space-time fractional reaction-diffusion equations with viscosity terms built by Riemann-Liouville fractional-order derivatives. The proposed method is reliant on generalized Jacobi functions (GJFs) for our problems. The contributions are threefold: First, thanks to the theoretical framework of variational problems, the well-posedness of the problem is proved. Second, new GJF-basis functions are established to fit weak solutions, which take full advantages of the global properties of fractional derivatives. Moreover, the ba…
In this paper, we propose a new class of operator factorization methods to discretize the integral fractional Laplacian $(-Δ)^\fracα{2}$ for $α\in (0, 2)$. The main advantage of our method is to easily increase numerical accuracy by using high-degree Lagrange basis functions, but remain the scheme structure and computer implementation unchanged. Moreover, our discretization of the fractional Laplacian results in a symmetric (multilevel) Toeplitz differentiation matrix, which not only saves memory cost in simulations but enables efficient computations via the fast Fourier transforms. The perfor…
Reduced basis methods build low-rank approximation spaces for the solution sets of parameterized PDEs by computing solutions of the given PDE for appropriately selected snapshot parameters. Localized reduced basis methods reduce the offline cost of computing these snapshot solutions by instead constructing a global space from spatially localized less expensive problems. In the case of online enrichment, these local problems are iteratively solved in regions of high residual and correspond to subdomain solves in domain decomposition methods. We show in this note that indeed there is a close rel…
In this paper, we propose a certified reduced basis (RB) method for quasilinear elliptic problems together with its application to nonlinear magnetostatics equations, where the later model permanent magnet synchronous motors (PMSM). The parametrization enters through the geometry of the domain and thus, combined with the nonlinearity, drives our reduction problem. We provide a residual-based a-posteriori error bound which, together with the Greedy approach, allows to construct reduced-basis spaces of small dimensions. We use the empirical interpolation method (EIM) to guarantee the efficient o…
Snapshot back-ended reduced basis methods for dynamical systems commonly rely on the singular value decomposition of a matrix whose columns are high-fidelity solution vectors. An alternative basis generation framework is developed here. The advocated maximum entropy snapshot sampling (MESS) identifies the snapshots that encode essential information regarding the system's evolution, by exploiting quantities that are suitable for quantifying a notion of dynamical stability. The maximum entropy snapshot sampling enables a direct reduction of the number of snapshots. A reduced basis is then obtain…
In this article, we develop a reduced basis method for efficiently solving the coupled Stokes/Darcy equations with parametric internal geometry. To accommodate possible changes in topology, we define the Stokes and Darcy domains implicitly via a phase-field indicator function. In our reduced order model, we approximate the parameter-dependent phase-field function with a discrete empirical interpolation method (DEIM) that enables affine decomposition of the associated linear and bilinear forms. In addition, we introduce a modification of DEIM that leads to non-negativity preserving approximatio…
We consider fully discrete embedded finite element approximations for a shallow water hyperbolic problem and its reduced-order model. Our approach is based on a fixed background mesh and an embedded reduced basis. The Shifted Boundary Method for spatial discretization is combined with an explicit predictor/multi-corrector time integration to integrate in time the numerical solutions to the shallow water equations, both for the full and reduced-order model. In order to improve the approximation of the solution manifold also for geometries that are untested during the offline stage, the snapshot…
Reduced Basis A Posteriori Error Bounds for the Instationary Stokes Equations
Aachen Institute for Advanced Study in Computational Engineering Science (AICES), RWTH Aachen University（亚琛计算工程科学高等研究院）；Faculty of Civil Engineering, RWTH Aachen University（亚琛工业大学土木工程学院）
A solution technique is proposed for flows in porous media that guarantees local conservation of mass. We first compute a flux field to balance the mass source and then exploit exact co-chain complexes to generate a solenoidal correction. A reduced basis method based on proper orthogonal decomposition is employed to construct the correction and we show that mass balance is ensured regardless of the quality of the reduced basis approximation. The method is directly applicable to mixed finite and virtual element methods, among other structure-preserving discretization techniques, and we present …
Hermite spectral collocation methods for fractional PDEs in unbounded domains
Southern University of Sciences and Technology（南方科技大学）；Hong Kong Baptist University（香港浸会大学）；Institute of Computational Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学研究所）
We present a reduced basis (RB) method for parametrized linear elliptic partial differential equations (PDEs) in a least-squares finite element framework. A rigorous and reliable error estimate is developed, and is shown to bound the error with respect to the exact solution of the PDE, in contrast to estimates that measure error with respect to a finite-dimensional (high-fidelity) approximation. It is shown that the first-order formulation of the least-squares finite element is a key ingredient. The method is demonstrated using numerical examples.
In this paper, we propose a certified reduced basis (RB) method for quasilinear parabolic problems. The method is based on a space-time variational formulation. We provide a residual-based a-posteriori error bound on a space-time level and the corresponding efficiently computable estimator for the certification of the method. We use the Empirical Interpolation method (EIM) to guarantee the efficient offline-online computational procedure. The error of the EIM method is then rigorously incorporated into the certification procedure. The Petrov-Galerkin finite element discretization allows to ben…
Partial differential equations can be used to model many problems in several fields of application including, e.g., fluid mechanics, heat and mass transfer, and electromagnetism. Accurate discretization methods (e.g., finite element or finite volume methods, the so-called full order models) are widely used to numerically solve these problems. However, when many physical and/or geometrical parameters are involved, the computational cost required by full order models becomes prohibitively expensive and this is not acceptable for real-time computations that are becoming more and more popular for …
