Polynomial Precise Interval Analysis Revisited
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3875920
- Polynomials with bounds and numerical approximation
- Bounded Point Evaluations and Polynomials Approximation
- Polynomial Approximation of Piecewise Analytic Functions
- Polynomial approximation of piecewise analytic functions
- scientific article; zbMATH DE number 3882950
- scientific article; zbMATH DE number 854186
- Perturbation bounds for polynomials
- Interpolatory pointwise estimates for polynomial approximation
- Polynomial approximation in convex domains
Cites work
- A class of polynomially solvable range constraints for interval analysis without widenings
- A generalization of Dijkstra's algorithm
- Accelerated Data-Flow Analysis
- scientific article; zbMATH DE number 3610766 (Why is no real title available?)
- Introduction to algorithms
- Precise Fixpoint Computation Through Strategy Iteration
- Programming Languages and Systems
- Programming Languages and Systems
- Verification, Model Checking, and Abstract Interpretation
Cited in
(9)- Ultra-arithmetic. II: Intervals of polynomials
- A class of polynomially solvable range constraints for interval analysis without widenings
- Static analysis by abstract interpretation: a mathematical programming approach
- Improving strategies via SMT solving
- Damping margins of interval polynomials
- Computing Game Values for Crash Games
- scientific article; zbMATH DE number 804644 (Why is no real title available?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Precise Fixpoint Computation Through Strategy Iteration
This page was built for publication: Polynomial Precise Interval Analysis Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644736)
