REGULARITY THEORY AND HIGH ORDER NUMERICAL METHODS FOR THE (1D)-FRACTIONAL LAPLACIAN

被引:38
作者
Acosta, Gabriel [1 ,2 ]
Pablo Borthagaray, Juan [1 ,2 ]
Bruno, Oscar [3 ]
Maas, Martin [2 ,4 ]
机构
[1] Univ Buenos Aires, CONICET, IMAS, Ciudad Univ,Pabellon 1, RA-1428 Buenos Aires, DF, Argentina
[2] Univ Buenos Aires, FCEyN, Dept Matemat, Ciudad Univ,Pabellon 1, RA-1428 Buenos Aires, DF, Argentina
[3] CALTECH, Pasadena, CA 91125 USA
[4] Univ Buenos Aires, CONICET, IAFE, Ciudad Univ,Pabellon 1, RA-1428 Buenos Aires, DF, Argentina
关键词
Fractional Laplacian; hypersingular integral equations; high order numerical methods; Gegenbauer polynomials; FRACTIONAL LAPLACIAN; SOBOLEV SPACES; EQUATION; QUADRATURE; OPERATORS; APPROXIMATIONS; BOUNDARY; DOMAINS;
D O I
10.1090/mcom/3276
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. 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 (Babuska 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 Nystrom 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.
引用
收藏
页码:1821 / 1857
页数:37
相关论文
共 40 条
[31]  
Rudin Walter, 1964, PRINCIPLES MATH ANAL, VSecond
[32]  
SAAD Y, 1986, SIAM J SCI STAT COMP, V7, P856, DOI 10.1137/0907058
[33]   On the spectrum of two different fractional operators [J].
Servadei, Raffaella ;
Valdinoci, Enrico .
PROCEEDINGS OF THE ROYAL SOCIETY OF EDINBURGH SECTION A-MATHEMATICS, 2014, 144 (04) :831-855
[35]  
Szeg G., 1975, Orthogonal Polynomials, Fourth edition, American Mathematical Society Colloquium Publications, V23
[36]  
Valdinoci E., 2009, Bol. Soc. Esp. Mat. Apl. SeMA, V49, P33
[37]  
Xie ZQ, 2013, MATH COMPUT, V82, P1017
[38]  
YAN Y, 1988, J INTEGRAL EQU APPL, V1, P549
[39]   SHARP ERROR BOUNDS FOR JACOBI EXPANSIONS AND GEGENBAUER-GAUSS QUADRATURE OF ANALYTIC FUNCTIONS [J].
Zhao, Xiaodan ;
Wang, Li-Lian ;
Xie, Ziqing .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2013, 51 (03) :1443-1469
[40]  
[No title captured]