Please use this identifier to cite or link to this item:
|Title:||An algorithm for matrix extension and wavelet construction|
|Authors:||Lawton, W. |
|Source:||Lawton, W., Lee, S.L., Shen, Z. (1996-04). An algorithm for matrix extension and wavelet construction. Mathematics of Computation 65 (214) : 723-737. ScholarBank@NUS Repository. https://doi.org/10.1090/S0025-5718-96-00714-4|
|Abstract:||This paper gives a practical method of extending an n x r matrix P(z), r ≤ n, with Laurent polynomial entries in one complex variable z, to a square matrix also with Laurent polynomial entries. If P(z) has orthonormal columns when z is restricted to the torus T, it can be extended to a paraunitary matrix. If P(z) has rank r for each z ∈ T, it can be extended to a matrix with nonvanishing determinant on T. The method is easily implemented in the computer. It is applied to the construction of compactly supported wavelets and prewavelets from multiresolutions generated by several univariate scaling functions with an arbitrary dilation parameter.|
|Source Title:||Mathematics of Computation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2017
WEB OF SCIENCETM
checked on Nov 16, 2017
checked on Dec 10, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.