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

DOI10.1080/00207160903401852MaRDI QIDQ3066981zbMATH OpenOpenAlexFDO

Authors Maciej Goćwin, Marek Szczȩsny

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

algorithmcomplexitylinear problemquantum computingrandomized computingtwo-point boundary value problemworst-case setting

Mathematics Subject Classification ID

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

Recommendations

• Randomized and quantum complexity of nonlinear two-point BVPs
• Improved bounds on the randomized and quantum complexity of initial-value problems
• Complexity of initial-value problems for ordinary differential equations of order k-different models of computation
• Complexity of nonlinear two-point boundary-value problems
• Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k

Cites work

• Almost optimal solution of initial-value problems by randomized and quantum algorithms
• Complexity of initial-value problems for ordinary differential equations of order k
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Optimal solution of ordinary differential equations
• Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
• Quantum summation with an application to integration.

Cited in

(6)

• The complexity of two-point boundary-value problems with piecewise analytic data
• On the complexity of the multivariate Sturm-Liouville eigenvalue problem
• Randomized and quantum complexity of nonlinear two-point BVPs
• Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings
• On the Complexity of 2D Discrete Fixed Point Problem
• Newton's method and a mesh-independence principle for certain semilinear boundary-value problems

This page was built for publication: On the complexity of a two-point boundary value problem in different settings

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