Polynomial-time solution of initial value problems using polynomial enclosures

Keyphrases

• Approximation Theory 50%
• Chebyshev 50%
• Classical Approximation 50%
• Continuous Space 50%
• Discrete Space 50%
• Domain Model 50%
• Domain Theory 50%
• Function-based 100%
• Geometric Convergence 50%
• Initial Value Method 50%
• Initial Value Problem 100%
• Lipschitz 50%
• Picard Algorithm 50%
• Picard Method 50%
• Polynomial Function Approximation 50%
• Polynomial Space 50%
• Polynomial Time 50%
• Polynomial Time Solution 100%
• Problem Solving 50%
• Rational Approximation 50%
• Real Function 100%
• Representable 50%
• Semantic Framework 50%
• Semantic Model 50%
• Step Function 50%
• Truncation 50%
• Turing Computability 50%

Mathematics

• Approximation Theory 33%
• Chebyshev 33%
• Classical Approximation 33%
• Domain Theory 33%
• Initial-Value Problem 100%
• Polynomial 100%
• Polynomial Function 33%
• Polynomial Time 100%
• Rational Function 33%
• Real Function 66%
• Step Function 33%
• Truncation 33%
• Turing Computability 33%

Computer Science

• Approximation (Algorithm) 50%
• Case Study 50%
• Continuous Space 50%
• Domain Theory 50%
• Function Approximation 50%
• Initial Value Problems 100%
• Polynomial Space 50%
• Polynomial Time 100%
• Turing Computability 50%