Computational Complexity of One-Step Methods for Systems of Differential Equations (Q3875248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Runge-Kutta Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Order Bound for Runge–Kutta Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Explicit Runge”Kutta Methods of High Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5719651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3264312 / rank
 
Normal rank

Latest revision as of 04:10, 13 June 2024

scientific article
Language Label Description Also known as
English
Computational Complexity of One-Step Methods for Systems of Differential Equations
scientific article

    Statements

    1980
    0 references
    first order differential equation system
    0 references
    Taylor series
    0 references
    explicit Runge- Kutta methods
    0 references
    global error behaviour
    0 references
    informational cost
    0 references
    combinatory cost
    0 references
    asymptotic analysis of optimal costs
    0 references
    efficient evaluation algorithms
    0 references
    comparison
    0 references
    Computational Complexity of One-Step Methods for Systems of Differential Equations (English)
    0 references

    Identifiers