Approximation with respect to what is now known as the Chebyshev norm was proposed by Laplace (1799) in a study of the approximate solution of inconsistent linear equations. However, the first systematic investigation of the problem was carried out by Chebyshev (1854, 1859, 1881). The mainstream of the early theoretical investigation was the study of a restricted subset of an important general class of real linear problems
This is the softcover reprint of the very popular hardcover edition. This book deals with the numeri...
International audienceA Chebyshev expansion is a series in the basis of Chebyshev polynomials of the...
AbstractThere have been several attempts to develop a unified approach to the characterization of so...
This thesis examines methods for the solution of a number of approximation problems which include m...
The Chebyshev approximation problem is usually described as to find the polynomial (or the element o...
AbstractA historical account is given of the development of methods for solving approximation proble...
Chebyshev polynomials are used to obtain accurate numerical solutions of ordinary and partial differ...
AbstractThis paper constitutes a computer program for the discrete linear restricted Chebyshev appro...
AbstractThis paper presents a numerical solution for solving optimal control problems, and the contr...
Series expressed in terms of Chebyshev polynomials are applied using Lie series to the iterative sol...
The Approximation Problem and specifically, "direct" rational Chebyshev approximation is discussed. ...
In this thesis, we develop a method for finding approximate particular solutions for second order or...
Neste trabalho, estudamos o problema de determinar uma solução aproximada de um Sistema Linear Incon...
AbstractThe linear inequality method is an algorithm for discrete Chebyshev approximation by general...
This paper suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approxim...
This is the softcover reprint of the very popular hardcover edition. This book deals with the numeri...
International audienceA Chebyshev expansion is a series in the basis of Chebyshev polynomials of the...
AbstractThere have been several attempts to develop a unified approach to the characterization of so...
This thesis examines methods for the solution of a number of approximation problems which include m...
The Chebyshev approximation problem is usually described as to find the polynomial (or the element o...
AbstractA historical account is given of the development of methods for solving approximation proble...
Chebyshev polynomials are used to obtain accurate numerical solutions of ordinary and partial differ...
AbstractThis paper constitutes a computer program for the discrete linear restricted Chebyshev appro...
AbstractThis paper presents a numerical solution for solving optimal control problems, and the contr...
Series expressed in terms of Chebyshev polynomials are applied using Lie series to the iterative sol...
The Approximation Problem and specifically, "direct" rational Chebyshev approximation is discussed. ...
In this thesis, we develop a method for finding approximate particular solutions for second order or...
Neste trabalho, estudamos o problema de determinar uma solução aproximada de um Sistema Linear Incon...
AbstractThe linear inequality method is an algorithm for discrete Chebyshev approximation by general...
This paper suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approxim...
This is the softcover reprint of the very popular hardcover edition. This book deals with the numeri...
International audienceA Chebyshev expansion is a series in the basis of Chebyshev polynomials of the...
AbstractThere have been several attempts to develop a unified approach to the characterization of so...