Localized Tight Frames and Fast Framelet Transforms on the Simplex

Abstract
This paper constructs a continuous localized tight frame on a two-dimensional simplex using orthogonal polynomials. We then use quadrature rules on to construct discrete tight framelets. Fast algorithms for discrete tight framelet transforms on are given, which have the same computational steps as the fast Fourier transforms on the simplex .
View on arXivComments on this paper