Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings

DOI10.1016/J.AMC.2013.09.008MaRDI QIDQ279055zbMATH OpenOpenAlexFDO

Authors Maciej Goćwin, Bolesław Kacewicz

Publication date 27 April 2016

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

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

zbMATH Keywords

optimalitycomplexityrandomized algorithmsnonlinear equationsquantum algorithmsdeterministic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

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

Cited in

(3)

• Randomized and quantum complexity of nonlinear two-point BVPs
• Separation of roots of systems of nonlinear equations. Stochastic approach
• A complexity approach to the soliton resolution conjecture

This page was built for publication: Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings

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