A descent algorithm for linear continuous Chebyshev approximation
نویسندگان
چکیده
منابع مشابه
Discrete linear Chebyshev approximation
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملA fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations
In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کاملAn Algorithm for Computing Continuous Chebyshev Approximations
In this paper we introduce an algorithm for computing nonlinear continuous Chebyshev approximations. The algorithm is based on successive linearizations within adaptively adjusted neighborhoods. The convergence of the algorithm is proven under some general assumptions such that it is applicable for many Chebyshev approximation problems discussed in the literature. It, like the Remez exchange me...
متن کاملa fractional type of the chebyshev polynomials for approximation of solution of linear fractional differential equations
in this paper we introduce a type of fractional-order polynomials basedon the classical chebyshev polynomials of the second kind (fcss). also we construct the operationalmatrix of fractional derivative of order $ gamma $ in the caputo for fcss and show that this matrix with the tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کاملOn a Descent Algorithm for the Discrete Best Linear Spline Approximation Problem
Let there be given error-contaminated measurements of function values at strictly ascending abscissae. We address the problem of calculating a best linear spline approximation to these data, whose knots are predefined on the abscissae. We establish conditions that allow the development of a special descent algorithm that takes into account the structure of the problem. 1 Index Terms data fittin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1972
ISSN: 0021-9045
DOI: 10.1016/0021-9045(72)90054-8