Theoretical and experimental results on time-series representations of polynomials

This study considers time-series representations of polynomials. Often in data modelling and many other applications, accurate estimations of the degree of a polynomial, of the noise standard deviation, and of the coefficient of the highest degree of a polynomial are useful in detection, estimation, and prediction. The major contributions of this paper can be found in the original research offering novel theoretical and experimental results. The theoretical results include an alternative proof of the q th order AR time-series representation, with a constant, of a polynomial of degree q , an alternative proof of the ( q + 1)-th order AR time-series representation, without a constant, of a polynomial of degree q , as well as generalized equations (valid for a polynomial of an arbitrary degree) for reduced variance estimation of the polynomial coefficient corresponding to the highest degree. The experimental investigations are the most comprehensive so far, in that they use well over 35 times more realisations than before, use a greater variety of noisy data (Gaussian, Uniform, and Exponential noise), and use a larger range of polynomial degrees as well as of noise standard deviations than before. Experimental results on estimations of the degree of a polynomial, of the noise standard deviation, and of the polynomial coefficient corresponding to the highest degree using seven methods (AIC, AICc, GIC, BIC, Chi-square, F-distribution, and PTS2) are presented. Results indicate clearly that PTS2 performs the best.

Authors

Publication Details

Journal
Frontiers in Signal Processing
Published
2025-04-09
DOI
https://doi.org/10.3389/frsip.2025.1582043
Primary Topic
Statistical and numerical algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Theoretical and experimental results on time-series representations of polynomials

Asoke K. Nandi
Frontiers in Signal Processing
Statistical and numerical algorithms
article

Theoretical and experimental results on time-series representations of polynomials

Asoke K. Nandi
article en

Abstract

This study considers time-series representations of polynomials. Often in data modelling and many other applications, accurate estimations of the degree of a polynomial, of the noise standard deviation, and of the coefficient of the highest degree of a polynomial are useful in detection, estimation, and prediction. The major contributions of this paper can be found in the original research offering novel theoretical and experimental results. The theoretical results include an alternative proof of the q th order AR time-series representation, with a constant, of a polynomial of degree q , an alternative proof of the ( q + 1)-th order AR time-series representation, without a constant, of a polynomial of degree q , as well as generalized equations (valid for a polynomial of an arbitrary degree) for reduced variance estimation of the polynomial coefficient corresponding to the highest degree. The experimental investigations are the most comprehensive so far, in that they use well over 35 times more realisations than before, use a greater variety of noisy data (Gaussian, Uniform, and Exponential noise), and use a larger range of polynomial degrees as well as of noise standard deviations than before. Experimental results on estimations of the degree of a polynomial, of the noise standard deviation, and of the polynomial coefficient corresponding to the highest degree using seven methods (AIC, AICc, GIC, BIC, Chi-square, F-distribution, and PTS2) are presented. Results indicate clearly that PTS2 performs the best.

Frontiers in Signal ProcessingVol. 5
Openalex Percentile: Top 90%
Statistical and numerical algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Theoretical and experimental results on time-series representations of polynomials — Asoke K. Nandi · Frontiers in Signal Processing (2025) | TGRS Research Map | TGRS