Polynomials with bounds and numerical approximation

DOI10.1007/s11075-017-0286-0zbMath1379.65010OpenAlexW2345300376MaRDI QIDQ1681786

Bruno Després

Publication date: 24 November 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-017-0286-0

zbMATH Keywords

numerical examplesquaternion algebrasnumerical approximationEuler's four squares identitypolynomial with bounds

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Related Items (8)

A projection algorithm on the set of polynomials with two bounds ⋮ Highly accurate monotonicity-preserving semi-Lagrangian scheme for Vlasov-Poisson simulations ⋮ Bounds-constrained polynomial approximation using the Bernstein basis ⋮ Computation of Sum of Squares Polynomials from Data Points ⋮ Density theorems with applications in quantum signal processing ⋮ Algorithms For Positive Polynomial Approximation ⋮ Correction to: ``Polynomials with bounds and numerical approximation ⋮ Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control

Uses Software

• Matlab
• Sostools
• AMPL
• Chebfun
• HE-E1GODF
• Sollya
• Chebfun2
• fminunc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• A mathematical introduction to compressive sensing
• Efficient and accurate computation of upper bounds of approximation errors
• Uncertainty quantification for systems of conservation laws
• A generalization of an inequality of V Markov to multivariate polynomials
• Compositions of quadratic forms
• Markov and Bernstein type inequalities for polynomials
• A computational journey into the mind
• On polynomials of best one sided approximation
• A Generalized Empirical Interpolation Method: Application of Reduced Basis Techniques to Data Assimilation
• Optimal scaling parameters for sparse grid discretizations
• The kernel polynomial method
• Uncertainty Propagation; Intrusive Kinetic Formulations of Scalar Conservation Laws
• Formal Proofs for Nonlinear Optimization
• An Extension of Chebfun to Two Dimensions
• Analytic Inequalities
• Sollya: An Environment for the Development of Numerical Codes

This page was built for publication: Polynomials with bounds and numerical approximation