Szczegóły publikacji
Opis bibliograficzny
Randomized and quantum complexity of nonlinear two-point BVPs / Maciej GOĆWIN // Applied Mathematics and Computation ; ISSN 0096-3003. — 2014 — vol. 245, s. 357–371. — Bibliogr. s. 371, Abstr.
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 86364 |
|---|---|
| Data dodania do BaDAP | 2014-12-08 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.amc.2014.07.106 |
| Rok publikacji | 2014 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Applied Mathematics and Computation |
Abstract
We deal with the complexity of nonlinear BVPs with nonlinear two-point boundary conditions. We consider the randomized and quantum models of computation. We assume that the right-hand side function is r times differentiable with all derivatives bounded by a constant. We show that the epsilon-complexity is roughly of order epsilon(-1/(r+1/2)) in the randomized setting, and epsilon(-1/(r+1)) in the quantum setting. We compare our results with known results in the deterministic setting. The speed-up of the randomized computations with respect to the deterministic computations is by 1/(r(2r + 1)) in the exponent of 1/epsilon, and the speed-up of the quantum computations by 1/(r(r +1)) in the exponent. (C) 2014 Elsevier Inc. All rights reserved.
