A self-adaptive time integration algorithm for solving partial differential equations (Q1126657): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0096-3003(97)81664-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080813207 / rank
 
Normal rank

Latest revision as of 08:37, 30 July 2024

scientific article
Language Label Description Also known as
English
A self-adaptive time integration algorithm for solving partial differential equations
scientific article

    Statements

    A self-adaptive time integration algorithm for solving partial differential equations (English)
    0 references
    0 references
    0 references
    0 references
    18 February 1999
    0 references
    A new adaptive time integration method is investigated for solving problems with locally fast-changing physical phenomena in space. For these problems non-uniform spatial grids are commonly used, but a traditional explicit time integration scheme is restricted by the stability criterion which is dictated by the smallest grid spacing and requires excessively small time steps. Small space grid is usually unnecessary in the whole domain. This fact is the base of a new idea to use different time stepsizes at different spatial grid points. The stability criterion is still satisfied at all grid points by using different time stepsizes. Complexity analysis and implementation details are discussed. As a numerical example the nonlinear Burgers equation is used. Complexity analysis and numerical computations as well demonstrate significant improvement of computational efficiency.
    0 references
    finite difference scheme
    0 references
    non-uniform spatial grids
    0 references
    adaptive time integration method
    0 references
    stability
    0 references
    numerical example
    0 references
    nonlinear Burgers equation
    0 references
    complexity
    0 references
    computational efficiency
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references