Status | 已发表Published |
Title | The sharpness of kuznetsov's o(√∆x) l1-error estimate for monotone difference schemes |
Creator | |
Date Issued | 1995 |
Source Publication | Mathematics of Computation
![]() |
ISSN | 0025-5718 |
Volume | 64Issue:210Pages:581-589 |
Abstract | We derive a lower error bound for monotone difference schemes to the solution of the linear advection equation with BV initial data. A rigorous analysis shows that for any monotone difference scheme the lower L1 error bound is O(√∆x), where ∆x is the spatial stepsize. © 1995 American Mathematical Society. |
Keyword | Error estimate Lower error bound Monotone difference scheme |
DOI | 10.1090/S0025-5718-1995-1270625-9 |
URL | View source |
Indexed By | SCIE |
Language | 英语English |
WOS Research Area | Mathematics |
WOS Subject | Mathematics, Applied |
WOS ID | WOS:A1995QU15200007 |
Scopus ID | 2-s2.0-84968519569 |
Citation statistics | |
Document Type | Journal article |
Identifier | http://repository.uic.edu.cn/handle/39GCC9TT/2117 |
Collection | Research outside affiliated institution |
Affiliation | 1.Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC, V5A1S6, Canada 2.Department of Mathematics, Peking University, Beijing, 100871, China |
Recommended Citation GB/T 7714 | Tang, Tao,Teng, Zhenhuan. The sharpness of kuznetsov's o(√∆x) l1-error estimate for monotone difference schemes[J]. Mathematics of Computation, 1995, 64(210): 581-589. |
APA | Tang, Tao, & Teng, Zhenhuan. (1995). The sharpness of kuznetsov's o(√∆x) l1-error estimate for monotone difference schemes. Mathematics of Computation, 64(210), 581-589. |
MLA | Tang, Tao,et al."The sharpness of kuznetsov's o(√∆x) l1-error estimate for monotone difference schemes". Mathematics of Computation 64.210(1995): 581-589. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment