کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4609205 1338435 2006 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Almost optimal solution of initial-value problems by randomized and quantum algorithms
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات آنالیز ریاضی
پیش نمایش صفحه اول مقاله
Almost optimal solution of initial-value problems by randomized and quantum algorithms
چکیده انگلیسی

We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a logarithmic factor. In both the randomized and quantum settings, initial-value problems turn out to be essentially as difficult as scalar integration.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Complexity - Volume 22, Issue 5, October 2006, Pages 676-690