Convergence properties of numerical discretizations and regridding methods (Q2366434): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An adaptive method of lines with error control for parabolic equations of the reaction-diffusion type / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple moving grid methods for one-dimensional evolutionary partial differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterization of finite differences ''optimal'' meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Finite Difference Formula for the Discretization of d 3 /dx 3 on Nonuniform Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3814717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numerical Solution of Second-Order Boundary Value Problems on Nonuniform Meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supra-Convergent Schemes on Irregular Grids / rank
 
Normal rank

Latest revision as of 18:12, 17 May 2024

scientific article
Language Label Description Also known as
English
Convergence properties of numerical discretizations and regridding methods
scientific article

    Statements

    Convergence properties of numerical discretizations and regridding methods (English)
    0 references
    29 June 1993
    0 references
    The paper is devoted to the study of difference schemes for the following two problems: (P1) \(-u_ x+s(x)=0\), \(u(0)=u_ 0\) \((0<x<1)\) and (P2) \(u_{xx}+s(x)=0\), \(u(0)=u_ 0\), \(u(1)=u_ 1\) \((0<x<1)\). As is well known, both problems occur when studying the steady state solution of the transport or heat equation. After suitable difference discretization of the derivatives it is proved that for an arbitrary grid \(0=x_ 0<x_ 1<\dots<x_ N=1\) with \(h_ i=x_ i-x_{i-1}\), \(h=\max\{h_ i\}\) both the truncation errors \(T_ i\) and the global errors \(E_ i\) are of order \(O(h)\) in problem (P1) while in problem (P2) one has \(T_ i=O(h)\) and \(E_ i=O(h^ 2)\) (so there is a superconvergence phenomenon). Let us now put \(x_ i=g(\xi_ i)\), where \(\xi_ i\) is the uniform grid. Sufficient conditions for the function \(g:(0,1)\to (0,1)\) are given to obtain \(T_ i=O(h^ p)\), \(E_ i=O(h^ p)\) \((p=2,4)\) in both problems (P1), (P2).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convergence
    0 references
    nonuniform grids
    0 references
    regridding methods
    0 references
    difference schemes
    0 references
    truncation errors
    0 references
    global errors
    0 references
    superconvergence
    0 references
    0 references
    0 references