On the complexity of a two-point boundary value problem in different settings

DOI10.1080/00207160903401852zbMath1208.65104OpenAlexW2069679810MaRDI QIDQ3066981

Marek Szczȩsny, Maciej Goćwin

Publication date: 20 January 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903401852

zbMATH Keywords

complexityalgorithmtwo-point boundary value problemquantum computinglinear problemrandomized computingworst-case setting

Mathematics Subject Classification ID

Quantum computation (81P68) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Complexity and performance of numerical algorithms (65Y20) Linear boundary value problems for ordinary differential equations (34B05) Randomized algorithms (68W20)

Related Items

Randomized and quantum complexity of nonlinear two-point BVPs, Newton's method and a mesh-independence principle for certain semilinear boundary-value problems

Cites Work

• Unnamed Item
• Almost optimal solution of initial-value problems by randomized and quantum algorithms
• Optimal solution of ordinary differential equations
• Quantum summation with an application to integration.
• Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
• Complexity of initial-value problems for ordinary differential equations of order \(k\)