We propose and analyze an a posteriori error estimator for a PDE-constrained optimization problem involving a nondifferentiable cost functional, fractional diffusion, and control-constraints. We realize fractional diffusion as the Dirichlet-to-Neumann map for a nonuniformly PDE and propose an equivalent optimal control problem with a local state equation. For such an equivalent problem, we design an a posteriori error estimator which can be defined as the sum of four contributions: two contributions related to the approximation of the state and adjoint equations and two contributions that account for the discretization of the control variable and its associated subgradient. The contributions related to the discretization of the state and adjoint equations rely on anisotropic error estimators in weighted Sobolev spaces. We prove that the proposed a posteriori error estimator is locally efficient and, under suitable assumptions, reliable. We design an adaptive scheme that yields, for the examples that we perform, optimal experimental rates of convergence.
This study introduces pre-orthogonal adaptive Fourier decomposition (POAFD) to obtain approximations and numerical solutions to the fractional Laplacian initial value problem and the extension problem of Caffarelli and Silvestre (generalized Poisson equation). The method, as the first step, expands the initial data function into a sparse series of the fundamental solutions with fast convergence, and, as the second step, makes use the semigroup or the reproducing kernel property of each of the expanding entries. Experiments show effectiveness and efficiency of the proposed series solutions.
Adaptive second-order Crank-Nicolson time-stepping methods using the recent scalar auxiliary variable (SAV) approach are developed for the time-fractional Molecular Beam Epitaxial models with Caputo's derivative. Based on the piecewise linear interpolation, the Caputo's fractional derivative is approximated by a novel second-order formula, which is naturally suitable for a general class of nonuniform meshes and essentially preserves the positive semi-definite property of integral kernel. The resulting Crank-Nicolson SAV time-stepping schemes are unconditional energy stable on nonuniform time m…
A time-fractional Allen-Cahn equation with volume constraint is first proposed by introducing a nonlocal time-dependent Lagrange multiplier. Adaptive linear second-order energy stable schemes are developed for the proposed model by combining invariant energy quadratization and scalar auxiliary variable approaches with the recent L1$^{+}$ formula. The new developed methods are proved to be volume-preserving and unconditionally energy stable on arbitrary nonuniform time meshes. The accelerated algorithm and adaptive time strategy are employed in numerical implement. Numerical results show that t…
Stochastic optimisation problems minimise expectations of random cost functions. We use 'optimise then discretise' method to solve stochastic optimisation. In our approach, accurate quadrature methods are required to calculate the objective, gradient or Hessian which are in fact integrals. We apply the dimension-adaptive sparse grid quadrature to approximate these integrals when the problem is high dimensional. Dimension-adaptive sparse grid quadrature shows high accuracy and efficiency in computing an integral with a smooth integrand. It is a kind of generalisation of the classical sparse gri…
We propose a novel Caputo fractional derivative-based optimization algorithm. Upon defining the Caputo fractional gradient with respect to the Cartesian coordinate, we present a generic Caputo fractional gradient descent (CFGD) method. We prove that the CFGD yields the steepest descent direction of a locally smoothed objective function. The generic CFGD requires three parameters to be specified, and a choice of the parameters yields a version of CFGD. We propose three versions -- non-adaptive, adaptive terminal and adaptive order. By focusing on quadratic objective functions, we provide a conv…
Adaptive Finite Element Method for fractional differential equations using Hierarchical Matrices
Beijing Computational Science Research Center（北京计算科学研究中心）；Southeast University（东南大学）；Tufts University（塔夫茨大学）；University of North Carolina at Charlotte（北卡罗来纳大学夏洛特分校）；Brown University（布朗大学）
Institute of Computational Mathematics and Scientific/Engineering Computing, AMSS, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）；Louisiana State University（路易斯安那州立大学）
In this work, we propose adaptive deep learning approaches based on normalizing flows for solving fractional Fokker-Planck equations (FPEs). The solution of a FPE is a probability density function (PDF). Traditional mesh-based methods are ineffective because of the unbounded computation domain, a large number of dimensions and the nonlocal fractional operator. To this end, we represent the solution with an explicit PDF model induced by a flow-based deep generative model, simplified KRnet, which constructs a transport map from a simple distribution to the target distribution. We consider two me…
Aspects of an adaptive finite element method for the fractional Laplacian: a priori and a posteriori error estimates, efficient implementation and multigrid solver
Brown University（布朗大学）；Oak Ridge National Laboratory（橡树岭国家实验室）
Time-space Finite Element Adaptive AMG for Multi-term Time Fractional Advection Diffusion Equations
School of Mathematics and Computational Science, Xiangtan University（湘潭大学数学与计算科学学院）；Hunan Key Laboratory for Computation and Simulation in Science and Engineering, Xiangtan University（湘潭大学湖南省计算与模拟科学重点实验室）
This paper constructs adaptive sparse grid collocation method onto arbitrary order piecewise polynomial space. The sparse grid method is a popular technique for high dimensional problems, and the associated collocation method has been well studied in the literature. The contribution of this work is the introduction of a systematic framework for collocation onto high-order piecewise polynomial space that is allowed to be discontinuous. We consider both Lagrange and Hermite interpolation methods on nested collocation points. Our construction includes a wide range of function space, including tho…
Hierarchical sparse-grid particle-in-cell method with locally adaptive mesh refinement
Université de Toulouse（图卢兹大学；法国国家科学研究中心数学研究所）；UPS, INSA, UT1, UTM, Institut de Mathématiques de Toulouse, CNRS（法国国家信息与自动化研究所，空客CR&T、Cerfacs与Inria联合团队）；Inria, Concace joint team between Airbus CR&T, Cerfacs and Inria
We are interested in numerically solving the Hamilton-Jacobi (HJ) equations, which arise in optimal control and many other applications. Oftentimes, such equations are posed in high dimensions, and this poses great numerical challenges. This work proposes a class of adaptive sparse grid (also called adaptive multiresolution) local discontinuous Galerkin (DG) methods for solving Hamilton-Jacobi equations in high dimensions. By using the sparse grid techniques, we can treat moderately high dimensional cases. Adaptivity is incorporated to capture kinks and other local structures of the solutions.…
Time-fractional parabolic equations with a Caputo time derivative are considered. For such equations, we explore and further develop the new methodology of the a-posteriori error estimation and adaptive time stepping proposed in [7]. We improve the earlier time stepping algorithm based on this theory, and specifically address its stable and efficient implementation in the context of high-order methods. The considered methods include an L1-2 method and continuous collocation methods of arbitrary order, for which adaptive temporal meshes are shown to yield optimal convergence rates in the presen…
Fully Finite Element Adaptive Algebraic Multigrid Method for Time-Space Caputo-Riesz Fractional Diffusion Equations
School of Mathematics and Computational Science, Xiangtan University（湘潭大学数学与计算科学学院）；Hunan Key Laboratory for Computation and Simulation in Science and Engineering, Xiangtan University（湘潭大学湖南省科学与工程计算重点实验室）
We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where e…
In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid algorithm and hierarchical surplus-guided local adaptivity. A high-degree basis is used to obtain a high-order method which, given sufficient smoothness, performs significantly better than the piecewise-linear basis. The underlying generalised sparse grid algorithm greedily selects the dimensions and variable interactions that contribute most to the variabil…
This paper reviews the adaptive sparse grid discontinuous Galerkin (aSG-DG) method for computing high dimensional partial differential equations (PDEs) and its software implementation. The C\texttt{++} software package called AdaM-DG, implementing the aSG-DG method, is available on Github at \url{https://github.com/JuntaoHuang/adaptive-multiresolution-DG}. The package is capable of treating a large class of high dimensional linear and nonlinear PDEs. We review the essential components of the algorithm and the functionality of the software, including the multiwavelets used, assembling of biline…
Deterministic interpolation and quadrature methods are often unsuitable to address Bayesian inverse problems depending on computationally expensive forward mathematical models. While interpolation may give precise posterior approximations, deterministic quadrature is usually unable to efficiently investigate an informative and thus concentrated likelihood. This leads to a large number of required expensive evaluations of the mathematical model. To overcome these challenges, we formulate and test a multilevel adaptive sparse Leja algorithm. At each level, adaptive sparse grid interpolation and …
Sparse polynomial chaos expansions (PCE) are an efficient and widely used surrogate modeling method in uncertainty quantification for engineering problems with computationally expensive models. To make use of the available information in the most efficient way, several approaches for so-called basis-adaptive sparse PCE have been proposed to determine the set of polynomial regressors ("basis") for PCE adaptively. The goal of this paper is to help practitioners identify the most suitable methods for constructing a surrogate PCE for their model. We describe three state-of-the-art basis-adaptive a…
