Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087): Difference between revisions

Latest revision as of 17:02, 10 July 2024

scientific article

Language	Label	Description	Also known as
English	Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy	scientific article

Statements

instance of

scholarly article

0 references

title

Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (English)

0 references

0 references

0 references

0 references

0 references

Journal of Complexity

0 references

publication date

24 August 2015

0 references

zbMATH Keywords

computational complexity

0 references

rigorous numerics

0 references

smoothness

0 references

Gevrey hierarchy

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jco.2015.05.001

0 references

cites work

Computing Conformal Maps onto Canonical Slit Domains

0 references

Algorithms in real algebraic geometry

0 references

On the computational complexity of the Riemann mapping

0 references

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

0 references

Topological properties of real number representations.

0 references

Computability on subsets of Euclidean space. I: Closed and compact subsets

0 references

Q3373046

0 references

Condition

0 references

On a simple definition of computable function of a real variable‐with applications to functions of a complex variable

0 references

Q5543516

0 references

Algorithmic solution of higher type equations

0 references

Analytical properties of resource-bounded real functionals

0 references

Parametrized complexity theory.

0 references

The computational complexity of maximization and integration

0 references

Representation theorems for analytic machines and computability of analytic functions

0 references

On the definitions of computable real continuous functions

0 references

An effective Riemann Mapping Theorem

0 references

Lipschitz continuous ordinary differential equations are polynomial-space complete

0 references

Computational Complexity of Smooth Differential Equations

0 references

Function Spaces for Second-Order Polynomial Time

0 references

The maximum value problem and NP real numbers

0 references

Q4002474

0 references

Q4249729

0 references

On the computational complexity of ordinary differential equations

0 references

Computational complexity of real functions

0 references

Q3150781

0 references

Computational complexity and feasibility of data processing and interval computations

0 references

Q3671969

0 references

Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval

0 references

Resultats d'unicite forte pour des operateurs elliptiques a coefficients gevrey

0 references

Singular coverings and non‐uniform notions of closed set computability

0 references

A critique of numerical analysis

0 references

A fundamental effect in computations on real numbers

0 references

Q5710169

0 references

Relative computability and uniform continuity of relations

0 references

Lower Bounds on the Continuation of Holomorphic Functions

0 references

Some new characterizations of the Chebyshev polynomials

0 references

Q5526189

0 references

Q5614117

0 references

Spaces allowing Type‐2 Complexity Theory revisited

0 references

Q3191588

0 references

Q5625125

0 references

Q3260574

0 references

Low functions of reals

0 references

Q3993279

0 references

Q4904857

0 references

The Exponentially Convergent Trapezoidal Rule

0 references

On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

0 references

ROUNDING-OFF ERRORS IN MATRIX PROCESSES

0 references

Effective analytic functions

0 references

On effective analytic continuation

0 references

Q4485693

0 references

Q3518432

0 references

Computational complexity on computable metric spaces

0 references

Why does information-based complexity use the real number model?

0 references

Q5718722

0 references

Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests

0 references

The Arithmetical Hierarchy of Real Numbers

0 references

Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra

0 references

Computability on Regular Subsets of Euclidean Space

0 references

Computable operators on regular sets

0 references

Identifiers

zbMATH Open document ID

1336.68133

0 references

DOI

10.1016/j.jco.2015.05.001

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:491087

@@ Property / author @@
-Norbert Th. Müller
@@ Property / author: Norbert Th. Müller / rank @@
-Normal rank
@@ Property / author @@
-Martin Ziegler
@@ Property / author: Martin Ziegler / rank @@
-Normal rank
@@ Property / author @@
+Martin Ziegler
@@ Property / author: Martin Ziegler / rank @@
+Normal rank
@@ Property / author @@
+Norbert Th. Müller
@@ Property / author: Norbert Th. Müller / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D78
@@ Property / Mathematics Subject Classification ID: 03D78 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Y20
@@ Property / Mathematics Subject Classification ID: 65Y20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6475044
@@ Property / zbMATH DE Number: 6475044 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+rigorous numerics
@@ Property / zbMATH Keywords: rigorous numerics / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+smoothness
@@ Property / zbMATH Keywords: smoothness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Gevrey hierarchy
@@ Property / zbMATH Keywords: Gevrey hierarchy / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jco.2015.05.001
+Normal rank
@@ Property / OpenAlex ID @@
+W235490522
@@ Property / OpenAlex ID: W235490522 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Conformal Maps onto Canonical Slit Domains
+Normal rank
@@ Property / cites work @@
+Algorithms in real algebraic geometry
@@ Property / cites work: Algorithms in real algebraic geometry / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Riemann mapping
+Normal rank
@@ Property / cites work @@
+Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
+Normal rank
@@ Property / cites work @@
+Topological properties of real number representations.
+Normal rank
@@ Property / cites work @@
+Computability on subsets of Euclidean space. I: Closed and compact subsets
+Normal rank
@@ Property / cites work @@
+Q3373046
@@ Property / cites work: Q3373046 / rank @@
+Normal rank
@@ Property / cites work @@
+Condition
@@ Property / cites work: Condition / rank @@
+Normal rank
@@ Property / cites work @@
+On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
+Normal rank
@@ Property / cites work @@
+Q5543516
@@ Property / cites work: Q5543516 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic solution of higher type equations
@@ Property / cites work: Algorithmic solution of higher type equations / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical properties of resource-bounded real functionals
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of maximization and integration
+Normal rank
@@ Property / cites work @@
+Representation theorems for analytic machines and computability of analytic functions
+Normal rank
@@ Property / cites work @@
+On the definitions of computable real continuous functions
+Normal rank
@@ Property / cites work @@
+An effective Riemann Mapping Theorem
@@ Property / cites work: An effective Riemann Mapping Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Lipschitz continuous ordinary differential equations are polynomial-space complete
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Smooth Differential Equations
+Normal rank
@@ Property / cites work @@
+Function Spaces for Second-Order Polynomial Time
@@ Property / cites work: Function Spaces for Second-Order Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum value problem and NP real numbers
@@ Property / cites work: The maximum value problem and NP real numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002474
@@ Property / cites work: Q4002474 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249729
@@ Property / cites work: Q4249729 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of ordinary differential equations
+Normal rank
@@ Property / cites work @@
+Computational complexity of real functions
@@ Property / cites work: Computational complexity of real functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3150781
@@ Property / cites work: Q3150781 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity and feasibility of data processing and interval computations
+Normal rank
@@ Property / cites work @@
+Q3671969
@@ Property / cites work: Q3671969 / rank @@
+Normal rank
@@ Property / cites work @@
+Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
+Normal rank
@@ Property / cites work @@
+Resultats d'unicite forte pour des operateurs elliptiques a coefficients gevrey
+Normal rank
@@ Property / cites work @@
+Singular coverings and non‐uniform notions of closed set computability
+Normal rank
@@ Property / cites work @@
+A critique of numerical analysis
@@ Property / cites work: A critique of numerical analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A fundamental effect in computations on real numbers
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Relative computability and uniform continuity of relations
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Continuation of Holomorphic Functions
+Normal rank
@@ Property / cites work @@
+Some new characterizations of the Chebyshev polynomials
+Normal rank
@@ Property / cites work @@
+Q5526189
@@ Property / cites work: Q5526189 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5614117
@@ Property / cites work: Q5614117 / rank @@
+Normal rank
@@ Property / cites work @@
+Spaces allowing Type‐2 Complexity Theory revisited
+Normal rank
@@ Property / cites work @@
+Q3191588
@@ Property / cites work: Q3191588 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5625125
@@ Property / cites work: Q5625125 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3260574
@@ Property / cites work: Q3260574 / rank @@
+Normal rank
@@ Property / cites work @@
+Low functions of reals
@@ Property / cites work: Low functions of reals / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993279
@@ Property / cites work: Q3993279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904857
@@ Property / cites work: Q4904857 / rank @@
+Normal rank
@@ Property / cites work @@
+The Exponentially Convergent Trapezoidal Rule
@@ Property / cites work: The Exponentially Convergent Trapezoidal Rule / rank @@
+Normal rank
@@ Property / cites work @@
+On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
+Normal rank
@@ Property / cites work @@
+ROUNDING-OFF ERRORS IN MATRIX PROCESSES
@@ Property / cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES / rank @@
+Normal rank
@@ Property / cites work @@
+Effective analytic functions
@@ Property / cites work: Effective analytic functions / rank @@
+Normal rank
@@ Property / cites work @@
+On effective analytic continuation
@@ Property / cites work: On effective analytic continuation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4485693
@@ Property / cites work: Q4485693 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3518432
@@ Property / cites work: Q3518432 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity on computable metric spaces
+Normal rank
@@ Property / cites work @@
+Why does information-based complexity use the real number model?
+Normal rank
@@ Property / cites work @@
+Q5718722
@@ Property / cites work: Q5718722 / rank @@
+Normal rank
@@ Property / cites work @@
+Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
+Normal rank
@@ Property / cites work @@
+The Arithmetical Hierarchy of Real Numbers
@@ Property / cites work: The Arithmetical Hierarchy of Real Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
+Normal rank
@@ Property / cites work @@
+Computability on Regular Subsets of Euclidean Space
+Normal rank
@@ Property / cites work @@
+Computable operators on regular sets
@@ Property / cites work: Computable operators on regular sets / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:491087