Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions
DOI10.1016/j.jco.2016.02.005zbMath1354.65153OpenAlexW2326719265MaRDI QIDQ346291
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
algorithmNeumann boundary conditionscost\(\varepsilon\)-complexityminimal error algorithmnonlinear tow-point boundary value problems
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) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized and quantum complexity of nonlinear two-point BVPs
- Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
- Newton's method and a mesh-independence principle for certain semilinear boundary-value problems
- On the randomized solution of initial value problems
- How to increase the order to get minimal-error algorithms for systems of ODE
- On the solution of the polynomial systems arising in the discretization of certain ODEs
- Approximation of the solution of certain nonlinear ODEs with linear complexity
- Almost optimal solution of initial-value problems by randomized and quantum algorithms
- The convergence rate of the sandwich algorithm for approximating convex functions
- Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with large absorption
- Complexity of nonlinear two-point boundary-value problems
- Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption
- The randomized complexity of initial value problems
This page was built for publication: Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions
