AbstractIn this paper we propose an explicit solution to the polynomial least squares approximation problem on Chebyshev extrema nodes. We also show that the inverse of the normal matrix on this set of nodes can be represented as the sum of two symmetric matrices: a full rank matrix which admits a Cholesky factorization and a 2-rank matrix. Finally we discuss the numerical properties of the proposed formulas
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
AbstractIn this paper we propose an explicit solution to the polynomial least squares approximation ...
A Chebyshev polynomial of a square matrix A is a monic polynomial of specified degree that minimizes...
We give a solution of a discrete least squares approximation problem in terms of orthogonal polynomi...
AbstractThis note deals with the properties of the normal matrix of the polynomial LS problem over t...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approxim...
This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approxim...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The aim of the thesis is to study methods for computing roots of polynomials and matrix polynomials ...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
AbstractIn this paper we propose an explicit solution to the polynomial least squares approximation ...
A Chebyshev polynomial of a square matrix A is a monic polynomial of specified degree that minimizes...
We give a solution of a discrete least squares approximation problem in terms of orthogonal polynomi...
AbstractThis note deals with the properties of the normal matrix of the polynomial LS problem over t...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approxim...
This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approxim...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The aim of the thesis is to study methods for computing roots of polynomials and matrix polynomials ...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...