Maximal-entropy driven determination of weights in least-square approximation

07/18/2020
by   Domenico Giordano, et al.
0

We exploit the idea to use the maximal-entropy method, successfully tested in information theory and statistical thermodynamics, to determine approximating function's coefficients and squared errors' weights simultaneously as output of one single problem in least-square approximation. We provide evidence of the method's capabilities and performance through its application to representative test cases by working with polynomials as a first step. We conclude by formulating suggestions for future work to improve the version of the method we present in this paper.

READ FULL TEXT
research
04/05/2021

On a simplified version of Hadamard's maximal determinant problem

Hadamard's maximal determinant problem consists in finding the maximal v...
research
09/15/2023

An entropy-based approach for a robust least squares spline approximation

We consider the weighted least squares spline approximation of a noisy d...
research
04/23/2021

Bounds-constrained polynomial approximation using the Bernstein basis

A fundamental problem in numerical analysis and approximation theory is ...
research
01/19/2022

Refined normal approximations for the central and noncentral chi-square distributions and some applications

In this paper, we prove a local limit theorem for the chi-square distrib...
research
01/02/2023

Computing square roots in quaternion algebras

We present an explicit algorithmic method for computing square roots in ...
research
01/17/2019

Two classes of linear codes with a few weights based on twisted Kloosterman sums

Linear codes with a few weights have wide applications in information se...
research
04/29/2020

To Reduce Gross NPA and Classify Defaulters Using Shannon Entropy

Non Performing Asset(NPA) has been in a serious attention by banks over ...

Please sign up or login with your details

Forgot password? Click here to reset