On solving systems of ordinary differential equations on MIMD-computers (Q2458058): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126252642, #quickstatements; #temporary_batch_1721934265115
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-007-0049-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023389978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic foundations of creation of an intelligent software tool for investigation and solution of Cauchy problems for systems of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525855 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126252642 / rank
 
Normal rank

Latest revision as of 21:10, 25 July 2024

scientific article
Language Label Description Also known as
English
On solving systems of ordinary differential equations on MIMD-computers
scientific article

    Statements

    On solving systems of ordinary differential equations on MIMD-computers (English)
    0 references
    0 references
    0 references
    0 references
    31 October 2007
    0 references
    Two aspects of solving systems of ordinary differential equations (ODEs) with initial condition are considered. The first aspect is the solution of the ODEs with approximate initial data and a theorem is given which shows the dependence of the solution on the exact data. For the second aspect of parallelism, a parallel computer with distributed memory is assumed and a parallel implementation of solution methods for ODEs in \(C\) and MPI (message passing interface) with a blockwise distribution of the system is described. Runtime experiments are presented for an Adams method, a Gear method and a Runge-Kutta-method for up to 16 processors.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate initial data
    0 references
    parallel implementation
    0 references
    numerical examples
    0 references
    Cauchy problem
    0 references
    systems
    0 references
    distributed-memory MIMD computers
    0 references
    parallelizing of computations
    0 references
    Adams method
    0 references
    Gear method
    0 references
    Runge-Kutta-method
    0 references
    0 references
    0 references