A Matricial Algorithm for Polynomial Refinement

@article{King2011AMA,
  title={A Matricial Algorithm for Polynomial Refinement},
  author={Emily J. King},
  journal={CoRR},
  year={2011},
  volume={abs/1110.6061}
}
In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, 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… CONTINUE READING