This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy al...This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy algorithm Gm^P（., Ψ）. This makes the greedy algorithm realize the near best approximation in practice. Moreover, we study the efficiency of the finite-term approximation of another Mgorithm introduced by Birge and Massart.展开更多
This paper is concerned with seeking the general solutions of matrix equation M（ξ）M＊ （ξ） = Is for the construction of multiple channel biorthogonal wavelets, provided that some special solution of its is known.
基金the foundation under the program of"One Hundred Outstanding Young Chinese Scientists"of the Chinese Academy of Sciencesthe Graduate Innovation Foundation of the Chinese Academy of Sciences
文摘This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy algorithm Gm^P（., Ψ）. This makes the greedy algorithm realize the near best approximation in practice. Moreover, we study the efficiency of the finite-term approximation of another Mgorithm introduced by Birge and Massart.
基金supported in part Professor Yuesheng Xu under the program of"One Hundred Outstanding Young Chinese Scientists" of the Chinese Academy of Sciencesthe Graduate Innovation Foundation of the Chinese Academy of Sciences
文摘This paper is concerned with seeking the general solutions of matrix equation M（ξ）M＊ （ξ） = Is for the construction of multiple channel biorthogonal wavelets, provided that some special solution of its is known.
