![DSpace logo](/jspui/image/logo.gif)
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/10967
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumar, Devendra | - |
dc.date.accessioned | 2023-07-22T04:54:00Z | - |
dc.date.available | 2023-07-22T04:54:00Z | - |
dc.date.issued | 2022-03 | - |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0168927421003391 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10967 | - |
dc.description.abstract | A numerical scheme is constructed for the second-order parabolic partial differential equation with piecewise smooth initial data. The scheme comprises an orthogonal spline collocation strategy with the Rannacher time-marching. The irregular behavior of the underlying initial conditions of such differential equations results in inaccurate approximations due to the quantization error. For such problems, even the A-stable Crank-Nicolson scheme yields only first-order convergence in the temporal direction, with oscillations near the discontinuity. Applying mathematical perspective to dampen these oscillations, we present a highly accurate orthogonal spline collocation method with a smooth but straightforward time-marching scheme that significantly improves the convergence order. Through rigorous analysis, the present conjunctive scheme's convergence in the spatial direction is shown fourth-order (in and -norms) and third-order (in -norm), and it is shown second-order in the temporal direction. The performance and robustness of the contributed scheme are conclusively demonstrated with two test examples. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.subject | Mathematics | en_US |
dc.subject | Crank-Nicolson scheme | en_US |
dc.subject | Finite difference schemes | en_US |
dc.subject | Non-smoothness | en_US |
dc.subject | Rannacher scheme | en_US |
dc.subject | Orthogonal spline collocation | en_US |
dc.title | A highly accurate algorithm for retrieving the predicted behavior of problems with piecewise-smooth initial data | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Mathematics |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.