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...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
MDPI AG
2024-06-01
|
| Серии: | Sensors |
| Предметы: | |
| Online-ссылка: | https://www.mdpi.com/1424-8220/24/12/3991 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|