Randomized and quantum complexity of nonlinear two-point BVPs

DOI10.1016/j.amc.2014.07.106zbMath1335.34059OpenAlexW2043747681MaRDI QIDQ278637

Maciej Goćwin

Publication date: 2 May 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.07.106

zbMATH Keywords

complexityboundary value problemsquantum computingoptimal algorithmsrandomized computing

Mathematics Subject Classification ID

Nonlinear boundary value problems for ordinary differential equations (34B15) Random operators and equations (aspects of stochastic analysis) (60H25)

Related Items (2)

Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions ⋮ Newton's method and a mesh-independence principle for certain semilinear boundary-value problems

Cites Work

• Unnamed Item
• On the randomized solution of initial value problems
• Randomized and quantum algorithms yield a speed-up for initial-value problems
• Almost optimal solution of initial-value problems by randomized and quantum algorithms
• Deterministic and stochastic error bounds in numerical analysis
• Quantum summation with an application to integration.
• Complexity of nonlinear two-point boundary-value problems
• Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
• Quantum approximation. II: Sobolev embeddings
• The randomized complexity of initial value problems
• On the complexity of a two-point boundary value problem in different settings
• Quantum complexity of integration

This page was built for publication: Randomized and quantum complexity of nonlinear two-point BVPs