Pages that link to "Item:Q548302"
From MaRDI portal
The following pages link to A fast segmentation algorithm for piecewise polynomial numeric function generators (Q548302):
Displaying 4 items.
- On the number of segments needed in a piecewise linear approximation (Q964964) (← links)
- Binary segmentation for multivariate polynomials (Q1908892) (← links)
- Using piecewise polynomials for faster potential function evaluation (Q2655688) (← links)
- Piecewise linear approximation with minimum number of linear segments and minimum error: a fast approach to tighten and warm start the hierarchical mixed Integer formulation (Q6554599) (← links)