高逼近阶对偶框架的迭代算法  

Iterative Algorithms of High Approximate Order of Approximate Dual Frames

作　　者：范子宁 杨守志[1] FAN Zining;YANG Shouzhi(Department of Mathematics,Shantou University,Shantou 515063,Guangdong,China)

机构地区：[1]汕头大学数学系,广东汕头515063

出　　处：《汕头大学学报（自然科学版）》2023年第4期3-8,F0002,共7页Journal of Shantou University：Natural Science Edition

摘　　要：在框架理论中,希望构造一些具有良好性质的逼近对偶框架,如框架的高逼近阶等.基于Neumann级数展开理论,本文给出了两个提升逼近对偶框架逼近阶的迭代算法,分别将逼近对偶框架的逼近阶在原来的基础上提升到O(q^(2p))阶、O(q^(3p))阶.类似地,可以得到任意高阶的逼近对偶框架的迭代算法.In frame theory,some approximate dual frames with nice properties are constructed,such as high approximation order of frames.Based on Neumann series expansion theory,some iterative algorithms are provided for high approximation order of approximate dual frames.The approximation order is increased to O(q^(2p))and O(q^(3p))respectively.Similarly,an iterative algorithm of any higher order can be obtained.

关 键 词：对偶框架 逼近对偶框架 逼近对偶的迭代算法 

分 类 号：O174.2[理学—数学]