Average errors for zero finding: Lower bounds (Q1204311)

From MaRDI portal
Revision as of 13:54, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Average errors for zero finding: Lower bounds
scientific article

    Statements

    Average errors for zero finding: Lower bounds (English)
    0 references
    0 references
    0 references
    7 March 1993
    0 references
    Up to now, lower bounds for the average error for methods solving nonlinear problems of numerical analysis were not known. The authors study the nonlinear problem of zero finding for continuous functions \(f\) of one variable. They assume that \(f\) is sign changing at the endpoints of an interval and consider the average with respect to the Brownian bridge. They prove that the average error of optimal methods converges linearly in \(n\), where \(n\) is the number of knots and the error is with respect to the root or residual criterion. This result shows that the linear convergence, which holds for the root criterion in the worst case, cannot be beaten in the average case.
    0 references
    lower bounds
    0 references
    average error
    0 references
    zero finding
    0 references
    continuous functions
    0 references
    Brownian bridge
    0 references
    linear convergence
    0 references

    Identifiers