On sequential and parallel solution of initial value problems (Q911713): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Bolesław Kacewicz / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Muhammad Aslam Noor / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaption helps for some nonconvex classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal error of algorithms for solving scalar autonomous ODE / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to increase the order to get minimal-error algorithms for systems of ODE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum asymptotic error of algorithms for solving ODE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisection is optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Adaptive Information for Functions with Singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can adaption help on the average? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic setting of information-based complexity / rank
 
Normal rank

Latest revision as of 14:18, 20 June 2024

scientific article
Language Label Description Also known as
English
On sequential and parallel solution of initial value problems
scientific article

    Statements

    On sequential and parallel solution of initial value problems (English)
    0 references
    1990
    0 references
    It is well known that if the functionals are given in advance, independent of any particular f, then the information is called nonadaptive. On the other hand, if the functionals are chosen on the basis of all previously computed values then the informations are called adaptive. The main advantage of nonadaptive over adaptive information is that the former is well-suited for parallel computations, while the later is sequential. In this interesting paper the author shows that adaptation gives a much smaller error than nonadaptation. In fact, it is shown that the superiority of adaptation increases with the dimension. Several examples are given to illustrate the main ideas of the paper.
    0 references
    sequential solutions
    0 references
    numerical examples
    0 references
    parallel computations
    0 references
    adaptation
    0 references
    nonadaptation
    0 references
    0 references

    Identifiers