DeepAI AI Chat
Log In Sign Up

Exponentially convergent trapezoidal rules to approximate fractional powers of operators

by   Lidia Aceto, et al.
Università del Piemonte Orientale
University of Trieste

In this paper we are interested in the approximation of fractional powers of self-adjoint positive operators. Starting from the integral representation of the operators, we apply the trapezoidal rule combined with a single-exponential and a double-exponential transform of the integrand function. For the first approach our aim is only to review some theoretical aspects in order to refine the choice of the parameters that allow a faster convergence. As for the double exponential transform, in this work we show how to improve the existing error estimates for the scalar case and also extend the analysis to operators. We report some numerical experiments to show the reliability of the estimates obtained.


page 1

page 2

page 3

page 4


Fast and accurate approximations to fractional powers of operators

In this paper we consider some rational approximations to the fractional...

A Gauss Laguerre approach for the resolvent of fractional powers

This paper introduces a very fast method for the computation of the reso...

About Convergence and Order of Convergence of some Fractional Derivatives

In this paper we establish some convergence results for Riemann-Liouvill...

Exponentially Convergent Numerical Method for Abstract Cauchy Problem with Fractional Derivative of Caputo Type

We present an exponentially convergent numerical method to approximate t...

An Auxiliary Space Preconditioner for Fractional Laplacian of Negative Order

Coupled multiphysics problems often give rise to interface conditions na...

Construction of Hierarchically Semi-Separable matrix Representation using Adaptive Johnson-Lindenstrauss Sketching

We extend an adaptive partially matrix-free Hierarchically Semi-Separabl...

Double exponential quadrature for fractional diffusion

We introduce a novel discretization technique for both elliptic and para...