Related papers: Highly accurate operator factorization methods for…
In this paper, we present and analyze fully discrete finite difference schemes designed for solving the initial value problem associated with the fractional Korteweg-de Vries (KdV) equation involving the fractional Laplacian. We design the…
Based on the continuous time random walk, we derive the Fokker-Planck equations with Caputo-Fabrizio fractional derivative, which can effectively model a variety of physical phenomena, especially, the material heterogeneities and structures…
Diagonalizing a Hamiltonian, which is essential for simulating its long-time dynamics, is a key primitive in quantum computing and has been proven to yield a quantum advantage for several specific families of Hamiltonians. Yet, despite its…
We propose and analyze a new discretization technique for a linear-quadratic optimal control problem involving the fractional powers of a symmetric and uniformly elliptic second oder operator; control constraints are considered. Since these…
We study the numerical evaluation of the integral fractional Laplacian and its application in solving fractional diffusion equations. We derive a pseudo-spectral formula for the integral fractional Laplacian operator based on fractional…
We introduce a definition of the fractional Laplacian $(-\Delta)^{s(\cdot)}$ with spatially variable order $s:\Omega\to [0,1]$ and study the solvability of the associated Poisson problem on a bounded domain $\Omega$. The initial motivation…
We establish sharp pointwise estimates for the ground states of some singular fractional Schr\"odinger operators on relatively compact Euclidean subsets. The considered operators are of the type $(-\Delta)^{\alpha/2}|_\Om-c|x|^{-\alpha}$,…
Consider a classical elliptic pseudodifferential operator $P$ on ${\Bbb R}^n$ of order $2a$ ($0<a<1)$ with even symbol. For example, $P=A(x,D)^a$ where $A(x,D)$ is a second-order strongly elliptic differential operator; the fractional…
We consider the spectral definition of the fractional Laplace operator and study a basic linear problem involving this operator and singular forcing. In two dimensions, we introduce an appropriate weak formulation in fractional Sobolev…
We show that it is possible to obtain numerical solutions to quantum mechanical problems involving a fractional Laplacian, using a collocation approach based on Little Sinc Functions (LSF), which discretizes the Schr\"odinger equation on a…
Higher-order regularization problem formulations are popular frameworks used in machine learning, inverse problems and image/signal processing. In this paper, we consider the computational problem of finding the minimizer of the Sobolev…
Toeplitz matrices for the study of the fractional Laplacian on a bounded interval. In this work we get a deep link between (--$\Delta$) $\alpha$ ]0,1[ the fractional Laplacian on the interval ]0, 1[ and T N ($\Phi$ $\alpha$) the Toeplitz…
We propose a general strategy to discretize the Dyson series without applying direct numerical quadrature to high-dimensional integrals, and extend this framework to open quantum systems. The resulting discretization can also be interpreted…
A grid-overlay finite difference method is proposed for the numerical approximation of the fractional Laplacian on arbitrary bounded domains. The method uses an unstructured simplicial mesh and an overlay uniform grid for the underlying…
The study of fractional order differential operators is receiving renewed attention in many scientific fields. In order to accommodate researchers doing work in these areas, there is a need for highly scalable numerical methods for solving…
High-order methods gain more and more attention in computational fluid dynamics. However, the potential advantage of these methods depends critically on the availability of efficient elliptic solvers. With spectral-element methods, static…
We introduce the tensor numerical method for solution of the $d$-dimensional optimal control problems with fractional Laplacian type operators in constraints discretized on large $n^{\otimes d}$ tensor-product Cartesian grids. The approach…
While existing algorithms may be used to solve a linear system over a general field in matrix-multiplication time, the complexity of constructing a symmetric triangular factorization (LDL) has received relatively little formal study. The…
In a previous work, we introduced a discretization scheme for a constrained optimal control problem involving the fractional Laplacian. For such a control problem, we derived optimal a priori error estimates that demand the convexity of the…
In solving a linear system with iterative methods, one is usually confronted with the dilemma of having to choose between cheap, inefficient iterates over sparse search directions (e.g., coordinate descent), or expensive iterates in…