A class of iterative greedy algorithms related to Blaschke product

• 作 者: Tao Qian Lihui Tan Jiecheng Chen
• 机 构: Macao Institute of Systems Engineering,Macau University of Science and Technology,Macao,China;School
• 出 处: 中国科学：数学（英文版）
• 发表日期: 2021年12期
• 关键词: complex Hardy space M(o)bius transform Blaschke product rational orthogonal syst

M(o)bius transforms,Blaschke products and starlike functions as typical conformal mappings of one complex variable give rise to nonlinear phases with non-negative phase derivatives with the latter being defined by instantaneous frequencies of signals they represent.The positive analytic phase derivative has been a widely interested subject among signal analysts (see Gabor (1946)).Research results of the positive analytic frequency and applications appears in the literature since the middle of the 20th century.Of the positive frequency study a directly related topic is positive frequency decomposition of signals.The mainly focused methods of such decompositions include the maximal selection method and the Blaschke product unwinding method,and joint use of the mentioned methods.In this paper,we propose a class of iterative greedy algorithms based on the Blaschke product and adaptive Fourier decomposition.It generalizes the Blaschke product unwinding method by subtracting constants other than the averages of the remaining functions,aiming at larger winding numbers,and subtracting n-Blaschke forms of the remaining functions,aiming at generating larger numbers of zero-crossings,to fast reduce energy of the remaining terms.Furthermore,we give a comprehensive and rigorous proof of the converging rate in terms of the zeros of the remainders.Finite Blaschke product methods are proposed to avoid the infinite phase derivative dilemma,and to avoid the computational difficulties.