A Matricial Algorithm for Polynomial Refinement

Details A Matricial Algorithm for Polynomial Refinement A Matricial Algorithm for Polynomial Refinement

2011-10-27

arxiv.org/abs/1110.6061v2

Computer Science

Information Theory

Scientific paper

In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are typically compactly supported. In 2002, David Larson posed the question in his REU site, "Are all polynomials (of a single variable) finitely refinable?" That summer the author proved that the answer indeed was true using basic linear algebra. The result was presented in a number of talks but had not been typed up until now. The purpose of this short note is to record that particular proof.

Affiliated with

Also associated with

No associations

Rating

A Matricial Algorithm for Polynomial Refinement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Matricial Algorithm for Polynomial Refinement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Matricial Algorithm for Polynomial Refinement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376022