Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy-Reference-Cited by-同舟云学术

Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy

Published:2015-10 Issue:5 Volume:31 Page:689-714
ISSN:0885-064X
Container-title:Journal of Complexity
language:en
Short-container-title:Journal of Complexity

Author:

Kawamura Akitoshi,Müller Norbert,Rösnick Carsten,Ziegler Martin

Publisher

Elsevier BV

Subject

Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics

Reference78 articles.

1. V.V. Andreev, T.H. McNicholl, Computing Conformal Maps onto Canonical Slit Domains in: A. Bauer, R. Dillhage, P. Hertling, K. Ko, and R. Rettinger (Eds.), Proc. 6th Int. Conf. on Computability and Complexity in Analysis (CCA2009), vol. 353 of Informatik Berichte FernUniversität in Hagen, pp.23–34.

2. Algorithms in Real Algebraic Geometry;Basu,2006

3. On computational complexity of Riemann mapping;Binder;Ark. Mat.,2007

4. Data structures and efficient algorithms for power series in exact real arithmetic;Bitterlich,2012

5. Complexity and Real Computation;Blum,1998

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complexity of a root clustering algorithm for holomorphic functions;Theoretical Computer Science;2024-06

2. Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations;Journal of Complexity;2023-06

3. Computer Science for Continuous Data;Computer Algebra in Scientific Computing;2022

4. Representations and evaluation strategies for feasibly approximable functions;Computability;2021-01-20

5. Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations;Computer Algebra in Scientific Computing;2021