Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 52 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 192 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4 30 tok/s Pro
2000 character limit reached

Error analysis for time-fractional semilinear parabolic equations using upper and lower solutions (2001.04452v7)

Published 13 Jan 2020 in math.NA and cs.NA

Abstract: A semilinear initial-boundary value problem with a Caputo time derivative of fractional order $\alpha\in(0,1)$ is considered, solutions of which typically exhibit a singular behaviour at an initial time. For L1-type discretizations of this problem, we employ the method of upper and lower solutions to obtain sharp pointwise-in-time error bounds on quasi-graded temporal meshes with arbitrary degree of grading. In particular, those results imply that milder (compared to the optimal) grading yields the optimal convergence rate $2-\alpha$ in positive time, while quasi-uniform temporal meshes yield first-order convergence in positive time. Furthermore, under appropriate conditions on the nonlinearity, the method of upper and lower solutions immediately implies that, similarly to the exact solutions, the computed solutions lie within a certain range. Semi-discretizations in time and full discretizations using finite differences and finite elements in space are addressed. The theoretical findings are illustrated by numerical experiments.

Citations (19)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)