Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k
The complexity of initial-value problems is well studied for systems of equations of first order. In this paper, we study the \(\varepsilon\)-complexity for initial-value problems for scalar equations of higher order. We consider two models of computation, the randomized model and the quantum model....
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2008-01-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | http://www.opuscula.agh.edu.pl/vol28/3/art/opuscula_math_2819.pdf |