Randomized and quantum complexity of nonlinear two-point BVPs

DOI10.1016/J.AMC.2014.07.106MaRDI QIDQ278637zbMATH OpenOpenAlexFDO

Authors 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 problemsoptimal algorithmsquantum computingrandomized computing

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of a two-point boundary value problem in different settings
• Improved bounds on the randomized and quantum complexity of initial-value problems
• Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings
• Randomized and quantum algorithms yield a speed-up for initial-value problems
• Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order \(k\)

Cites work

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

Cited in

(6)

• Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings
• Quantum complexity of the approximation for the classes \({\mathcal B}(W^r_p([0,1]^d))\) and \({\mathcal B}(H^r_p([0,1]^d))\)
• Randomized and quantum algorithms yield a speed-up for initial-value problems
• 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
• On the complexity of a two-point boundary value problem in different settings

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

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