Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/74469
PIRA download icon_1.1View/Download Full Text
Title: Discrete maximal regularity of time-stepping schemes for fractional evolution equations
Authors: Jin, B
Li, B 
Zhou, Z 
Issue Date: 2018
Source: Numerische mathematik, 2018, v. 138, no. 1, p. 101-131
Abstract: In this work, we establish the maximal (Formula presented.)-regularity for several time stepping schemes for a fractional evolution model, which involves a fractional derivative of order (Formula presented.), (Formula presented.), in time. These schemes include convolution quadratures generated by backward Euler method and second-order backward difference formula, the L1 scheme, explicit Euler method and a fractional variant of the Crank–Nicolson method. The main tools for the analysis include operator-valued Fourier multiplier theorem due to Weis (Math Ann 319:735–758, 2001. doi:10.1007/PL00004457) and its discrete analogue due to Blunck (Stud Math 146:157–176, 2001. doi:10.4064/sm146-2-3). These results generalize the corresponding results for parabolic problems.
Publisher: Springer
Journal: Numerische mathematik 
ISSN: 0029-599X
EISSN: 0945-3245
DOI: 10.1007/s00211-017-0904-8
Rights: ©The Author(s) 2017. This article is an open access publication
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Jin2018_Article_DiscreteMaximalRegularityOfTim.pdf600.13 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

199
Last Week
1
Last month
Citations as of Nov 10, 2025

Downloads

48
Citations as of Nov 10, 2025

SCOPUSTM   
Citations

72
Last Week
2
Last month
1
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

70
Last Week
0
Last month
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.