Projection to the Set of Shift Orthogonal Functions

Farzin Barekat, Rongjie Lai, Ke Yin, Stanley Osher, Russel Caflisch, Vidvuds Ozolins

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(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.
BibTeX
@misc{barekat2014projection,
  author = {Farzin Barekat and Rongjie Lai and Ke Yin and Stanley Osher and Russel Caflisch and Vidvuds Ozolins},
  title = {{Projection to the Set of Shift Orthogonal Functions}},
  year = {2014},
  eprint = {1402.5158},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1402.5158},
}

Loading related content...

Figure