Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
ERROR ANALYSIS FOR A FRACTIONAL-DERIVATIVE PARABOLIC PROBLEM ON QUASI-GRADED MESHES USING BARRIER FUNCTIONS
by
MENG, XIANGYUN
, KOPTEVA, NATALIA
2020
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
ERROR ANALYSIS FOR A FRACTIONAL-DERIVATIVE PARABOLIC PROBLEM ON QUASI-GRADED MESHES USING BARRIER FUNCTIONS
by
MENG, XIANGYUN
, KOPTEVA, NATALIA
2020
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
ERROR ANALYSIS FOR A FRACTIONAL-DERIVATIVE PARABOLIC PROBLEM ON QUASI-GRADED MESHES USING BARRIER FUNCTIONS
Journal Article
ERROR ANALYSIS FOR A FRACTIONAL-DERIVATIVE PARABOLIC PROBLEM ON QUASI-GRADED MESHES USING BARRIER FUNCTIONS
2020
Request Book From Autostore
and Choose the Collection Method
Overview
An initial-boundary value problem with a Caputo time derivative of fractional order α ϵ (0, 1) is considered, solutions of which typically exhibit a singular behavior at an initial time. For this problem, we give a simple and general numerical-stability analysis using barrier functions, which yields sharp pointwise-in-time error bounds on quasi-graded temporal meshes with arbitrary degree of grading. L1-type and Alikhanov-type discretization in time are considered. In particular, those results imply that milder (compared to the optimal) grading yields optimal convergence rates in positive time. Semidiscretizations in time and full discretizations are addressed. The theoretical findings are illustrated by numerical experiments.
Publisher
Society for Industrial and Applied Mathematics
MBRLCatalogueRelatedBooks
Related Items
Related Items
We currently cannot retrieve any items related to this title. Kindly check back at a later time.
This website uses cookies to ensure you get the best experience on our website.