Abstract

This paper studies algorithms for decomposition, reconstruction, and approximation based on piecewise linear prewavelets on bounded triangulations of arbitrary topology. Our key mathematical result is showing that the Schur complement of the associated two scale matrix is symmetric, positive definite, and well conditioned. Numerical examples suggest that thresholding based on prewavelets yields a smaller approximation error than when based on the simple ‘Faber’ decomposition scheme.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.