This paper presents a fast algorithm for projecting a given function to the set of shift orthogonal functions (i.e. set containing functions with unit $L^2$ norm that are orthogonal to their prescribed shifts). The algorithm can be parallelized easily and its computational complexity is bounded by $O(M\log(M))$, where $M$ is the number of coefficients used for storing the input. To derive the algorithm, a particular class of basis called Shift Orthogonal Basis Functions are introduced and some theory regarding them is developed.
Convergence rates of spectral orthogonal projection approximation for functions of algebraic and logarithmatic regularities
基于雅可比多项式与Bessel函数之间的Hilb型公式,应用van der Corput型引理,导出了奇异函数Jacobi展开系数的最优衰减率,从而得到了Jacobi、Gegenbauer和Chebyshev正交投影上的最优收敛速度.有趣的是,对于边界奇点,随着$(α,β)$和$λ$的增加,可以在Jacobi或Gegenbauer投影上获得更快的收敛速度。参数值越大,可以实现越高的收敛速度。特别地,勒让德投影比切比雪夫投影高半阶。而且,当$\min\{α,β\}>0$和$λ>\frac{1}{2}$满足条件时,Jacobi和Gegenbauer正交投影的收敛阶数比Legendre投影的收敛阶数高.而对于内部奇异性,收敛阶与$(α,β)$和$λ$无关.
Probabilistic Analysis of Least Squares, Orthogonal Projection, and QR Factorization Algorithms Subject to Gaussian Noise
Department of Computer Science, University of Saskatchewan(萨斯喀彻温大学计算机科学系);Department of Applied Mathematics, University of Colorado Denver(科罗拉多大学丹佛分校应用数学系);Department of Mathematics, The University of Tulsa(塔尔萨大学数学系)