Projection to the Set of Shift Orthogonal Functions

arXiv1402.5158MaRDI QIDQ6249205FDOQ6249205

Authors: Farzin Barekat, Rongjie Lai, Ke Yin, Stanley Osher, Russel Caflisch, Vidvuds Ozoliņš 

Publication date: 20 February 2014

Abstract: 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(Mlog(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.

This page was built for publication: Projection to the Set of Shift Orthogonal Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6249205)