Optimal Piecewise Polynomial Approximation for Minimum Computing Cost by Using Constrained Least Squares
In this paper, the optimal approximation algorithm is proposed to simplify non-linear functions and/or discrete data as piecewise polynomials by using the constrained least squares. In time-sensitive applications or in embedded systems with limited resources, the runtime of the approximate function...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI AG
2024-06-01
|
| Saila: | Sensors |
| Gaiak: | |
| Sarrera elektronikoa: | https://www.mdpi.com/1424-8220/24/12/3991 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|