Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
From MaRDI portal
Publication:491087
DOI10.1016/J.JCO.2015.05.001zbMATH Open1336.68133OpenAlexW235490522MaRDI QIDQ491087FDOQ491087
Authors: Akitoshi Kawamura, Carsten Rösnick, Martin Ziegler, Norbert Th. Müller 
Publication date: 24 August 2015
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2015.05.001
Recommendations
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Bit complexity for critical point computation in smooth and compact real hypersurfaces
- Optimization-based computation of analytic interpolants of bounded complexity
- Complexity of parametric integration in various smoothness classes
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Computational complexity theory for advanced function spaces in analysis
- Numerics of analytic functions and complexity
- On the Complexity of Numerical Analysis
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computation over the reals, computable analysis (03D78)
Cites Work
- Title not available (Why is that?)
- Some new characterizations of the Chebyshev polynomials
- Condition. The geometry of numerical algorithms
- Approximation theory and approximation practice
- Topological properties of real number representations.
- Parametrized complexity theory.
- Solving analytic differential equations in polynomial time over unbounded domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Title not available (Why is that?)
- Computational complexity and feasibility of data processing and interval computations
- The exponentially convergent trapezoidal rule
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- The Arithmetical Hierarchy of Real Numbers
- Analytic root clustering: a complete algorithm using soft zero tests
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- An effective Riemann Mapping Theorem
- On the definitions of computable real continuous functions
- A critique of numerical analysis
- On the computational complexity of the Riemann mapping
- The computational complexity of maximization and integration
- Computational complexity of real functions
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computing over the reals: foundations for scientific computing.
- Singular coverings and non‐uniform notions of closed set computability
- Title not available (Why is that?)
- Computational complexity on computable metric spaces
- Effective analytic functions
- The computable multi-functions on multi-represented sets are closed under programming
- Title not available (Why is that?)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- On effective analytic continuation
- The maximum value problem and NP real numbers
- A fundamental effect in computations on real numbers
- Why does information-based complexity use the real number model?
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- Analytical properties of resource-bounded real functionals
- Algorithmic solution of higher type equations
- Computing conformal maps onto canonical slit domains
- Relative computability and uniform continuity of relations
- Computable functions of reals
- Computable operators on regular sets
- Spaces allowing Type‐2 Complexity Theory revisited
- Making polynomials robust to noise
- Title not available (Why is that?)
- On the computational complexity of ordinary differential equations
- Resultats d'unicite forte pour des operateurs elliptiques a coefficients gevrey
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Computability on Regular Subsets of Euclidean Space
- Lower bounds on the continuation of holomorphic functions
- Function spaces for second-order polynomial time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representation theorems for analytic machines and computability of analytic functions
Cited In (13)
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Parametrised second-order complexity theory with applications to the study of interval computation
- Title not available (Why is that?)
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.
- Representations and evaluation strategies for feasibly approximable functions
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Comparing representations for function spaces in computable analysis
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Representations of analytic functions and Weihrauch degrees
- Computer Science for Continuous Data
- Complexity of a root clustering algorithm for holomorphic functions
- Parametrized uniform complexity of computation in geometry and numerics
This page was built for publication: Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491087)
