A \(C^ 1\) interpolant for codes based on backward differentiation formulae (Q1820562): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Developing software for time-dependent problems using the method of lines and differential-algebraic integrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive theta method for the solution of stiff and nonstiff differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing numerical methods for stiff systems of O.D.E:s / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automatic integration of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality in a Class of Rootfinding Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Precision in Differential Equation Solvers. II: Sources of Trouble and Starting a Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of Implicit Formulas for the Solution of ODE<scp>s</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoother Interpolants for Adams Codes / rank
 
Normal rank

Latest revision as of 19:17, 17 June 2024

scientific article
Language Label Description Also known as
English
A \(C^ 1\) interpolant for codes based on backward differentiation formulae
scientific article

    Statements

    A \(C^ 1\) interpolant for codes based on backward differentiation formulae (English)
    0 references
    1986
    0 references
    The objective of this work is to produce a \(C^ 1\) interpolant for a fixed-step backward differentiation formula with interpolatory step changing, with particular reference to a code which is released in the NAG Library. Although the method essentially consists of augmenting the usual Nordsieck vector, the author shows that it is unnecessary to form this directly, since the correction to the normal vector can be calculated in the interpolation routine. Numerical examples are presented to illustrate the continuity achieved in practice.
    0 references
    0 references
    fixed-step backward differentiation formula
    0 references
    NAG Library
    0 references
    Nordsieck vector
    0 references
    Numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references