首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Etude de l'algorithme de Rémès en l'absence de condition de Haar
Authors:Carasso  Claude
Institution:(1) Mathématiques Appliquées; I.R.M.A., Université Scientifique et Médicale de Grenoble, Boîte Postale 53, Centre de Tri, 38041 Grenoble-Cédex, France
Abstract:Summary Using a geometric interpretation, the unicity of a best approximation and the convergence of the Remes-algorithm without the Haar-condition are investigated (in the case of the Tchebycheff-approximation of a continuous function by a linear combination of two continuous functions). Replacing the Haar-condition by a weaker one which is ldquogenerallyrdquo satisfied, one obtains a convergence theorem that is weaker than the classical convergence theorem but is sufficient for the applicatons. A generalization of these results is indicated.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号