Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
From MaRDI portal
(Redirected from Publication:491087)
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
Cites work
- scientific article; zbMATH DE number 1817650 (Why is no real title available?)
- scientific article; zbMATH DE number 3143695 (Why is no real title available?)
- scientific article; zbMATH DE number 3825797 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1303206 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3337042 (Why is no real title available?)
- scientific article; zbMATH DE number 3349776 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 2247480 (Why is no real title available?)
- A critique of numerical analysis
- A fundamental effect in computations on real numbers
- Algorithmic solution of higher type equations
- Algorithms in real algebraic geometry
- An effective Riemann Mapping Theorem
- Analytic root clustering: a complete algorithm using soft zero tests
- Analytical properties of resource-bounded real functionals
- Approximation theory and approximation practice
- Computability on Regular Subsets of Euclidean Space
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computable functions of reals
- Computable operators on regular sets
- Computational complexity and feasibility of data processing and interval computations
- Computational complexity of real functions
- Computational complexity on computable metric spaces
- Computing conformal maps onto canonical slit domains
- Computing over the reals: foundations for scientific computing.
- Condition. The geometry of numerical algorithms
- Effective analytic functions
- Function spaces for second-order polynomial time
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Lower bounds on the continuation of holomorphic functions
- Making polynomials robust to noise
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- On effective analytic continuation
- On the computational complexity of ordinary differential equations
- On the computational complexity of the Riemann mapping
- On the definitions of computable real continuous functions
- Parametrized complexity theory.
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Relative computability and uniform continuity of relations
- Representation theorems for analytic machines and computability of analytic functions
- Resultats d'unicite forte pour des operateurs elliptiques a coefficients gevrey
- Singular coverings and non‐uniform notions of closed set computability
- Solving analytic differential equations in polynomial time over unbounded domains
- Some new characterizations of the Chebyshev polynomials
- Spaces allowing Type‐2 Complexity Theory revisited
- The Arithmetical Hierarchy of Real Numbers
- The computable multi-functions on multi-represented sets are closed under programming
- The computational complexity of maximization and integration
- The exponentially convergent trapezoidal rule
- The maximum value problem and NP real numbers
- Topological properties of real number representations.
- Why does information-based complexity use the real number model?
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
- scientific article; zbMATH DE number 4051615 (Why is no real title available?)
- 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)
