Pages that link to "Item:Q4620318"
From MaRDI portal
The following pages link to Algorithms For Positive Polynomial Approximation (Q4620318):
Displaying 10 items.
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions (Q373942) (← links)
- A projection algorithm on the set of polynomials with two bounds (Q827089) (← links)
- Faster algorithms for computing Hong's bound on absolute positiveness (Q972846) (← links)
- Conservative semi-Lagrangian schemes for kinetic equations. I: Reconstruction (Q2128508) (← links)
- Bounds-constrained polynomial approximation using the Bernstein basis (Q2168063) (← links)
- Algorithms For Positive Polynomial Approximation (Q4620318) (← links)
- Computation of Sum of Squares Polynomials from Data Points (Q5113128) (← links)
- Structure-Preserving Function Approximation via Convex Optimization (Q5132001) (← links)
- Geometric Quasilinearization Framework for Analysis and Design of Bound-Preserving Schemes (Q6071825) (← links)
- Density theorems with applications in quantum signal processing (Q6178622) (← links)