Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions

DOI10.1016/J.JCO.2016.02.005MaRDI QIDQ346291zbMATH OpenOpenAlexFDO

Authors Bolesław Kacewicz

Publication date 5 December 2016

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jco.2016.02.005

zbMATH Keywords

algorithmNeumann boundary conditionscost\(\varepsilon\)-complexityminimal error algorithmnonlinear tow-point boundary value problems

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Nonlinear boundary value problems for ordinary differential equations (34B15) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Error bounds for numerical methods for ordinary differential equations (65L70)

Recommendations

• Complexity of nonlinear two-point boundary-value problems
• The complexity of two-point boundary-value problems with analytic data
• Solution of a nonlinear two-point boundary value problem with Neumann- type boundary data
• Publication:5748829
• Where does smoothness count the most for two-point boundary-value problems?

Cites work

• scientific article; zbMATH DE number 4041188 (Why is no real title available?)
• scientific article; zbMATH DE number 44104 (Why is no real title available?)
• Almost optimal solution of initial-value problems by randomized and quantum algorithms
• Approximation of the solution of certain nonlinear ODEs with linear complexity
• Complexity of nonlinear two-point boundary-value problems
• Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
• Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with large absorption
• Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption
• How to increase the order to get minimal-error algorithms for systems of ODE
• Newton's method and a mesh-independence principle for certain semilinear boundary-value problems
• On the randomized solution of initial value problems
• On the solution of the polynomial systems arising in the discretization of certain ODEs
• Randomized and quantum complexity of nonlinear two-point BVPs
• The convergence rate of the sandwich algorithm for approximating convex functions
• The randomized complexity of initial value problems

Cited in

(1)

• Complexity of nonlinear two-point boundary-value problems

This page was built for publication: Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346291)