Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Regularity theory and high order numerical methods for the (1D)-fractional Laplacian
HTML articles powered by AMS MathViewer

by Gabriel Acosta, Juan Pablo Borthagaray, Oscar Bruno and Martín Maas PDF
Math. Comp. 87 (2018), 1821-1857 Request permission

Abstract:

This paper presents regularity results and associated high order numerical methods for one-dimensional fractional-Laplacian boundary-value problems. On the basis of a factorization of solutions as a product of a certain edge-singular weight $\omega$ times a “regular” unknown, a characterization of the regularity of solutions is obtained in terms of the smoothness of the corresponding right-hand sides. In particular, for right-hand sides which are analytic in a Bernstein ellipse, analyticity in the same Bernstein ellipse is obtained for the “regular” unknown. Moreover, a sharp Sobolev regularity result is presented which completely characterizes the co-domain of the fractional-Laplacian operator in terms of certain weighted Sobolev spaces introduced in (Babuška and Guo, SIAM J. Numer. Anal. 2002). The present theoretical treatment relies on a full eigendecomposition for a certain weighted integral operator in terms of the Gegenbauer polynomial basis. The proposed Gegenbauer-based Nyström numerical method for the fractional-Laplacian Dirichlet problem, further, is significantly more accurate and efficient than other algorithms considered previously. The sharp error estimates presented in this paper indicate that the proposed algorithm is spectrally accurate, with convergence rates that only depend on the smoothness of the right-hand side. In particular, convergence is exponentially fast (resp. faster than any power of the mesh-size) for analytic (resp. infinitely smooth) right-hand sides. The properties of the algorithm are illustrated with a variety of numerical results.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65R20, 35B65, 33C45
  • Retrieve articles in all journals with MSC (2010): 65R20, 35B65, 33C45
Additional Information
  • Gabriel Acosta
  • Affiliation: IMAS - CONICET and Departamento de Matemática, FCEyN - Universidad de Buenos Aires, Ciudad Universitaria, Pabellón I (1428) Buenos Aires, Argentina
  • Email: gacosta@dm.uba.ar
  • Juan Pablo Borthagaray
  • Affiliation: IMAS - CONICET and Departamento de Matemática, FCEyN - Universidad de Buenos Aires, Ciudad Universitaria, Pabellón I (1428) Buenos Aires, Argentina
  • MR Author ID: 1171838
  • ORCID: 0000-0001-5535-4939
  • Email: jpbortha@dm.uba.ar
  • Oscar Bruno
  • Affiliation: California Institute of Technology, Pasadena, California
  • Email: obruno@caltech.edu
  • Martín Maas
  • Affiliation: IAFE - CONICET and Departamento de Matemática, FCEyN - Universidad de Buenos Aires, Ciudad Universitaria, Pabellón I (1428) Buenos Aires, Argentina
  • MR Author ID: 1193956
  • Email: mdmaas@iafe.uba.ar
  • Received by editor(s): August 30, 2016
  • Received by editor(s) in revised form: March 16, 2017
  • Published electronically: November 9, 2017
  • Additional Notes: This research was partially supported by CONICET under grant PIP 2014-2016 11220130100184CO
    The work of the first author was partially supported by CONICET, Argentina, under grant PIP 2014–2016 11220130100184CO
    The second and fourth author’s and MM’s efforts were made possible by a graduate fellowship from CONICET, Argentina.
    The third author’s efforts were supported by the US NSF and AFOSR through contracts DMS-1411876 and FA9550-15-1-0043, and by the NSSEFF Vannevar Bush Fellowship under contract number N00014-16-1-2808.
  • © Copyright 2017 American Mathematical Society
  • Journal: Math. Comp. 87 (2018), 1821-1857
  • MSC (2010): Primary 65R20, 35B65, 33C45
  • DOI: https://doi.org/10.1090/mcom/3276
  • MathSciNet review: 3787393