UM  > 科技學院
Greedy Algorithms and Rational Approximation in One and Several Variables
Laurent Baratchart1; Wei-Xiong Mai2; Tao Qian2
2016-11-23
Source PublicationModern Trends in Hypercomplex Analysis
Author of SourceBernstein S., Kähler U., Sabadini I., Sommen F.
PublisherBirkhäuser, Cham
Pages19-33
Abstract

We will review the recent development of rational approximation in one and several real and complex variables. The concept rational approximation is closely related to greedy algorithms, based on a dictionary consisting of Szeg˝o kernels in the present context.

KeywordRational Orthogonal System Takenaka–malmquist System Szeg˝o Kernel Hardy Spaces
DOIhttps://doi.org/10.1007/978-3-319-42529-0_2
Language英语
ISBN978-3-319-42528-3
Fulltext Access
Citation statistics
Document TypeBook chapter
CollectionFaculty of Science and Technology
DEPARTMENT OF MATHEMATICS
Affiliation1.INRIA, 2004 route des Lucioles, BP 93 F-06902 Sophia-Antipolis Cedex, France
2.Department of Mathematics, Faculty of Science and Technology University of Macau, Macau, China
Recommended Citation
GB/T 7714
Laurent Baratchart,Wei-Xiong Mai,Tao Qian. Greedy Algorithms and Rational Approximation in One and Several Variables:Birkhäuser, Cham,2016:19-33.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Laurent Baratchart]'s Articles
[Wei-Xiong Mai]'s Articles
[Tao Qian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Laurent Baratchart]'s Articles
[Wei-Xiong Mai]'s Articles
[Tao Qian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Laurent Baratchart]'s Articles
[Wei-Xiong Mai]'s Articles
[Tao Qian]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.