Asymptotic error of algorithms for solving nonlinear problems
Journal of Complexity
Optimal solution of ordinary differential equations
Journal of Complexity
Information-based complexity
Optimal algorithms for a problem of optimal control
Journal of Complexity
The computational complexity of differential and integral equations: an information-based approach
The computational complexity of differential and integral equations: an information-based approach
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
The complexity of two-point boundary-value problems with piecewise analytic data
Journal of Complexity
Where does smoothness count the most for two-point boundary-value problems?
Journal of Complexity
Optimal solution of nonlinear equations
Optimal solution of nonlinear equations
How to minimize the cost of iterative methods in the presence of perturbations
Journal of Complexity
Complexity of initial-value problems for ordinary differential equations of order k
Journal of Complexity
Approximation of the solution of certain nonlinear ODEs with linear complexity
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We study upper and lower bounds on the worst-case ε-complexity of nonlinear two-point boundary-value problems. We deal with general systems of equations with general nonlinear boundary conditions, as well as with second-order scalar problems. Two types of information are considered: standard information defined by the values or partial derivatives of the right-hand-side function, and linear information defined by arbitrary linear functionals. The complexity depends significantly on the problem being solved and on the type of information allowed. We define algorithms based on standard or linear information, using perturbed Newton's iteration, which provide upper bounds on the ε-complexity. The upper and lower bounds obtained differ by a factor of log log 1/ε. Neglecting this factor, for general problems the ε-complexity for the right-hand-side functions having r (r ≥ 2) continuous bounded partial derivatives turns out to be of order (1/ε)1/r for standard information, and (1/ε)1/(r+1) for linear information. For second-order scalar problems, linear information is even more powerful. The ε-complexity in this case is shown to be of order (1/ε)1/(r-2), while for standard information it remains at the same level as in the general case.