REGULARITY AND CONSTRUCTION OF BOUNDARY MULTIWAVELETS
|
|
- Dale McDonald
- 6 years ago
- Views:
Transcription
1 REGULARITY AND CONSTRUCTION OF BOUNDARY MULTIWAVELETS FRITZ KEINERT Abstract. The conventional way of constructing boundary functions for wavelets on a finite interval is to form linear combinations of boundary-crossing scaling functions. In this article we focus instead on boundary functions defined by recursion relations. We show that the number of boundary functions at each end is uniquely determined, and derive conditions for determining regularity from the boundary recursion coefficients. We then develop an algorithm based on linear algebra which can be used to construct boundary functions with maximal regularity.. Introduction The Discrete Wavelet Transform (DWT) is designed to act on infinitely long signals. For finite signals, the algorithm breaks down near the boundaries. This can be dealt with by extending the data by zero padding, extrapolation, symmetry, or other methods [4, 9,, ], or by constructing special boundary functions [, 6, 7]. Boundary functions can be constructed as linear combinations of boundary-crossing interior functions, or from boundary recursion relations. The standard examples in the literature have both properties, but the recursion relation approach can produce new boundary functions which cannot be derived using linear combinations. There are also linear combinations which are not refinable, but these are of little practical value, since the DWT algorithm requires recursion coefficients. One way to find suitable boundary recursion coefficients is based on linear algebra. The infinite banded Toeplitz matrix representing the DWT is replaced by a finite matrix, by suitable end-point modifications. A particular such method for scalar wavelets is presented in Madych [9]. The Madych approach can be generalized to multiwavelets under an additional assumption, which may or may not be satisfied for a given multiwavelet. We present a modified method which does not require this extra assumption. Linear algebra completions are not unique; they all include multiplication by an arbitrary orthogonal matrix. A random choice of matrix does not in general produce coefficients that correspond to any actual boundary function. Random choice also does not provide any approximation orders at the boundary. Thus, we investigate the question of continuity and approximation order at the boundary in some detail. We then show how to impose these constraints in the algorithm, and in the process remove much or all of the non-uniqueness. Mathematics Subject Classification. 4C4. Key words and phrases. wavelets on an interval, multiwavelets, discrete wavelet transform, boundary handling. Department of Mathematics, Iowa State University, Ames, IA 5, keinert@iastate.edu.
2 Regularity and Construction of Boundary Wavelets The results given below are based on the papers [] and []. For more details, and most of the proofs, we refer to the original papers.. Wavelets and Multiwavelets We assume that the reader is familiar with the basics of wavelet theory, so we only review a few basic concepts that we need in this paper. A multiresolution approximation (MRA) of L prq is a chain of closed subspaces tv n u, n P Z, Ă V Ă V Ă V Ă Ă L prq satisfying (i) V n Ă V n` for all n P Z; (ii) fpxq P V n ðñ fpxq P V n` for all n P Z; (iii) fpxq P V n ùñ fpx n kq P V n for all n, k P Z; (iv) Ş npz V n tu; (v) Ť npz V n L prq; (vi) there exists a function vector φ pxq φpxq. φ r pxq, φ i P L prq, such that tφ j px kq : ď j ď r, k P Zu is an orthonormal basis for V []. The function φ is called the multiscaling function of the given MRA. r is called the multiplicity. φ satisfies a recursion relation φpxq? ÿ k H k φpx kq. (.) The recursion coefficients H k are r ˆ r matrices. The orthogonal projection P n of a function s P L into V n is given by P n s ÿ kpzxs, φ nk yφ nk, where φ nk : n{ φp n x kq. P n s is interpreted as an approximation to s at scale n. Q n P n` P n is also an orthogonal projection onto a closed subspace W n which is the orthogonal complement of V n in V n` : V n` V n W n. Q n s is interpreted as the fine detail in s at resolution n. An orthonormal basis of W is generated from the integer translates of a single function vector ψ P L prq, called a multiwavelet function. Since W Ă V, ψ can be represented as ψpxq? ÿ n G n φpx nq (.) for some coefficient matrices G n.
3 Regularity and Construction of Boundary Wavelets The Discrete Wavelet Transform (DWT) takes a function s P V n for some n, and decomposes it into a coarser approximation at level m ă n, plus the fine detail at the intermediate levels. s P n s P m s ` It suffices to describe the step from level n to level n. Since the signal s P V n V n W n, we can represent it by its coefficients s nk xs, φ nky, d nk xs, ψ nky as s ÿ s nkφ nk ÿ s n,jφ n,j ` ÿ d n,jψ n,j. k j j n ÿ k m Q n s. Here s denotes the transpose of s. We find that s n,j ÿ H k j s nk, d n,j ÿ k k If we interleave the coefficients at level n. s n, d psdq n n,, s n, d n, the DWT can be written as where psdq n s n, T T T T T T T T T, T k. G k j s nk. ˆHk The matrix is orthogonal. Signal reconstruction corresponds to s n psdq n. G k H G k`. (.) A multiscaling function φ has approximation order p if all polynomials of degree less than p can be expressed locally as linear combinations of integer shifts of φ. That is, there exist row vectors c jk, j,..., p, k P Z, so that x j ÿ k c jkφpx kq. (.4) For orthogonal wavelets c jk where µ j is the jth continuous moment of φ, ż µ j x j φpxq dx. jÿ l ˆj k l j l µ l, (.5)
4 4 Regularity and Construction of Boundary Wavelets A high approximation order is desirable in applications. A minimum approximation order of is a required condition in many theorems.. Boundary Functions The original DWT is defined for infinitely long signals. In practice, we can only transform a signal of finite length. What do we do near the boundaries? A frequently used approach is data extension, for example by zeros, by symmetry, or by linear or higher order extrapolation [4, 9,, ]. We will be using instead special boundary wavelets. We make the following assumptions: The original functions φ, ψ are orthogonal, continuous, provide approximation order p ě, and are supported on r, Ns. The interval r, Ms on which the signal and the wavelets are defined is long enough so that the left and right boundary functions do not overlap. We use all of the interior functions, that is, all φpx nq, ψpx nq whose support lies in r, Ms. There are L (scalar) left boundary scaling functions, R right boundary functions, collected into function vectors φ L, φ R. Likewise, we have L, R left and right boundary wavelet functions ψ L, ψ R. The left boundary functions have support on r, N s, the right boundary functions have support on rm N `, Ms. The boundary functions are regular, which means they are orthogonal, continuous, and provide approximation order ě. This implies that φ L, φ R are not identically zero at the endpoints. The numbers L and R of boundary functions are the same at every level. Note that L and R are generally not equal, and they are not in general multiples of r = multiplicity of interior functions. Lemma.. [] Under our assumptions, L and R are uniquely determined. We sketch the idea of the proof, since some of the results are needed later. Assume at first that there are only four recursion coefficients, so only two matrices T, T. Orthogonality of means T T ` T T I, T T. From this one can show that ρ j rankpt j q satisfy ρ ` ρ r, and that T, T have a common SVD ˆIρ ˆ T U V, T U V I ρ. Here I k denotes the k ˆ k identity matrix. With an argument due to Strang [] one can show L ρ, R ρ. If there are more than two matrices T j, we form block matrices. For example if we have T,..., T, we use T T ˆT T T T, ˆT T T T T T T T There are two systematic ways to construct boundary functions. We show the details for the left endpoint only, since the notation is easier there.
5 Regularity and Construction of Boundary Wavelets 5 The first method uses linear combinations of boundary-crossing functions (see e. g. [7]). φ L pxq ÿ k N` C k φpx kq for x ą. Each C k is of size L ˆ r. The second method uses recursion relations. For the interior functions, these are given by (.) and (.). For the boundary functions at the left end, they are φ L pxq? Aφ L pxq `? N ÿ B k φpx kq, k ψ L pxq? Eφ L pxq `? N ÿ F k φpx kq. A and E are of size L ˆ L, each B k and F k is of size L ˆ r. Under our assumptions, the decomposition matrix on the interval r, M s takes the the form L L L K T T T K.. T M T.. TK (.).... T T T K R R R K Here ˆ ˆ Z ^ A L, L E k Bk B k N, k,..., K, K, F k F k and similarly at the right end. Theorem.. [] Assume that the boundary functions are both refinable and linear combinations. Then A, B k, C k are related by CV AC, (.) CW B, where B `B B B N, k C `C N` C N` C, H N H N H V N H N H N H N H, H H. W H 4 H N. H H N H N H N
6 6 Regularity and Construction of Boundary Wavelets Some observations about the two approaches are as follows. Eq. (.) is a form of eigenvalue problem. There are only a small number of choices for C, A, B. In fact, if there is a single boundary scaling function (i. e. L ), (.) is a standard eigenvalue problem. Not every refinable boundary function is a linear combination of boundary-crossing functions. Conversely, not every linear combination of boundary-crossing functions is refinable. Refinability is required for applications. Without the existence of A, B k there is no DWT algorithm. Linear combinations are not required. If boundary functions as constructed as linear combinations, then continuity is automatic, and approximation order is easy to enforce. If the approximation order is greater than or equal to the number of boundary scaling functions, refinability is automatic. Orthogonality is hard, and this is where most of the effort lies. If boundary functions are constructed from recursion relations, then orthogonality is easy. Continuity and approximation order are harder to impose, but a suitable algorithm is detailed in this paper. 4. Construction of Boundary Functions Using Linear Algebra In [9], Madych proposed an algorithm for constructing a decomposition matrix M of the form (.). His algorithm was for scalar wavelets. It turns out that it generalizes to multiwavelets only if L R. Our algorithm does not require this assumption. Assume again initially that there are only four recursion coefficients. The general case is handled as before, by forming block matrices. It is sufficient to demonstrate the idea on the ˆ orthogonal block matrix T T T T. T T We use pre- and postmultiplication by orthogonal matrices to make T in the lower left disappear. Let U and V be the orthogonal matrices from the joint SVD of T and T. Let U U U, V V V, U V then U V I ρ I ρ I ρ I ρ I ρ I ρ (4.) By inspection, a technique that produces the correct structure is to move the first ρ columns to the end, and then interchange the first ρ rows with the last ρ rows. That amounts to multiplying from the right and left with appropriate permutation matrices.
7 Then Regularity and Construction of Boundary Wavelets 7 P L U V P R I ρ I ρ I ρ I ρ I ρ I ρ Now let Q L, Q R be arbitrary orthogonal matrices of size ρ ˆ ρ, ρ ˆ ρ, respectively. We multiply from the left with U L QL U Q R and from the right with Let U R I ρ V V. I ρ Q L pq L, Q L, q, Q R pq R, Q R, q, V pv V q (4.) with Q L,, Q L, of size ρ ˆ ρ, Q R,, Q R, of size ρ ˆ ρ, and V, V of size r ˆ ρ, r ˆ ρ, respectively. Then U L P L U L V P R U R L T T R R where L Q L,, L Q L, V, R Q R, V, R Q R,. If we consider Madych s approach in our notation, we find that it amounts to moving the second set of columns in (4.) to the end, so that we end up with I ρ I ρ I ρ I ρ I ρ I ρ This only yields matrices of the correct size if ρ ρ. Madych only considered scalar wavelets, where this condition is automatic. The drawback of the algorithm is that Q L, Q R are arbitrary, and the recursion coefficients produced by most random choices do not correspond to actual boundary functions, nor do they provide any approximation orders. In the following, we first investigate how to determine continuity and approximation orders from the boundary recursion coefficients. After that, we will show how to find suitable matrices Q L, Q R to impose these conditions.
8 8 Regularity and Construction of Boundary Wavelets 5. Regularity Properties of Refinable Boundary Functions First we consider continuity. The cascade algorithm at the left boundary is given by φ L,n` pxq? Aφ L,n pxq `? N ÿ B k φpx kq k Starting with an initial function φ L, with support r, N s, we see that φ L, is given on rpn q{, N s by a linear combination of translates of φpxq. This part of φ L, does not change in future steps. After step, φ L, is given on rpn q{4, pn q{s by a linear combination of translates of φp4xq, and so on. Thus, the cascade algorithm converges to a continuous limit on p, N s. The only question is what happens at x. It is easy to show that if the spectral radius ρp? Aq ă, the cascade algorithm will converge, but φ L pq. If ρp? Aq ą, the cascade algorithm will diverge for most starting guesses. It is conceivable but unlikely that there will be continuous solutions. We will not pursue this further. We say that? A satisfies Condition Epmq if it is diagonalizable, has an m-fold eigenvalue, and all other eigenvalues are less than in magnitude. In this case,? A n Ñ Γ `r,..., r m l. l m where r j, l j are the right and left eigenvectors to eigenvalue, normalized to l j r j. Theorem 5.. [] If? A satisfies condition E(m), then φ L p n x q Ñ Γ φ L px q ` p? B qpi?h ı q φpx q as n Ñ 8. In other words: Starting with any point x ą, the sequence of point values φ L p n x q converges. Thus, continuity of φ L at is equivalent to the condition that the limit is independent of x. This appears hard to verify, but we will see below that this is actually a consequence of approximation order. It can be shown that our regularity assumptions imply that pi?h q exists. The following graph shows an example where the limit of φp n x q exists for every x, but the resulting function is not continuous at. It is based on the Daubechies D wavelet, with A? { and B p? 6{4, q.
9 Regularity and Construction of Boundary Wavelets 9 6 D, discontinuous example, iteration 6 D, discontinuous example, iteration D, discontinuous example, iteration D, discontinuous example, iteration We next consider approximation order. The approximation order conditions for interior functions are stated in (.4). For left boundary functions, approximation order p means x j l j φ L pxq ` ÿ c jkφpx kq, j,..., p, for suitable vectors l j. kě Theorem 5.. [] The left boundary functions have approximation order p if the interior functions do, and if there exist vectors l j so that for j,..., p? l j A j l j,? (5.) Bm γ jm, m,..., N, where the γ jm are known vectors: l j γ jm j c jm? tm{u ÿ k c jkh m k. Corollary 5.. If? A satisfies condition Epq, then approximation order implies continuity.
10 Regularity and Construction of Boundary Wavelets Proof. Approximation order at x means ÿ l φ L pxq ` µ φpx kq, x ě, which for x P r, s reduces to l φ L pxq ` µ φpxq. The approximation order conditions (5.) for j begin with? A The second of these implies l l l µ l kě l,? B µ µ? H,? B µ µ? H,...? B I?H, so that Γ φ L pxq ` p? B qpi?h ı q φpxq? r l φ L pxq ` l B I?H j r l φ L pxq ` µ φpxq r. It is not immediately clear whether continuity and φ L pq implies approximation order. We conjecture that this is not the case. 6. Imposing Regularity We now describe how to construct suitable orthogonal matrices Q L, Q R for use in the algorithm described in section 4, to impose continuity and approximation orders on the boundary functions. This will also remove some or all of the arbitrariness in the construction. Let Λ be the matrix with columns l j (see theorem 5.). It is easy to see that if we replace the boundary function vector φ L by Mφ L for an invertible matrix M, the new boundary functions still span the same space, and remain refinable. They also remain orthogonal if M is orthogonal. The effect of M on the coefficients A, B, C and the matrix Λ is A Ñ Ã MAM, B Ñ B MB, C Ñ C MC, Λ Ñ Λ ΛM. The key observation is that by using a suitable M, we can assume that Λ is upper triangular. We don t actually need to find this M.
11 Regularity and Construction of Boundary Wavelets One can show that it is possible to construct vectors l e, l P spanpe, e q,..., and a matrix Q L which enforce the approximation order conditions one by one. The details are rather lengthy, and can be found in []. This algorithm will build one boundary function per approximation order, up to the approximation order provided by the interior functions. If the number of boundary functions is higher than the interior approximation order, we can fill up the remaining rows of recursion coefficients arbitrarily. 7. Examples Example 7.. For the Daubechies scaling function with two vanishing moments we get one boundary function at each end. We can impose approximation order at each end..5 D, left end, regular.5 D, right end, regular Example 7.. The Chui-Lian multiwavelet CL() [5] has approximation order. We need boundary functions at each end, so we can impose approximation order at the ends. This multiwavelet is symmetric, and the boundary functions are mirror images of each other..5 CL() left end, approximation order.5 CL() right end, approximation order Example 7.. The DGHM multiwavelet [8] has approximation order. We find ρ, ρ, so we have only a single boundary function at the left end, but three at the right end. At the left end we can only enforce approximation order. At the right end we can enforce approximation order. This determines two of the boundary functions. The third function (determined by the third row of Q R ) is arbitrary, except
12 Regularity and Construction of Boundary Wavelets that the diagonal entry in Z should be smaller than? { to ensure that the completion is regular. As an example, we set the third column of Z to zero, and let the QR-factorization built into Matlab choose an appropriate third row of Y. The result was DGHM left end, approximation order DGHM right end, approximation order References [] A. Altürk and F. Keinert, Regularity of boundary wavelets, Appl. Comput. Harmon. Anal., (), pp [], Construction of multiwavelets on an interval wavelets, Axioms, (), pp. 4. [] L. Andersson, N. Hall, B. Jawerth, and G. Peters, Wavelets on closed subsets of the real line, in Recent advances in wavelet analysis, vol. of Wavelet Anal. Appl., Academic Press, Boston, MA, 994, pp. 6. [4] C. Brislawn, Classification of nonexpansive symmetric extension transforms for multirate filter banks, Appl. Comput. Harmon. Anal., (996), pp [5] C. K. Chui and J.-a. Lian, A study of orthonormal multi-wavelets, Appl. Numer. Math., (996), pp Selected keynote papers presented at 4th IMACS World Congress (Atlanta, GA, 994). [6] C. K. Chui and E. Quak, Wavelets on a bounded interval, in Numerical methods in approximation theory, Vol. 9 (Oberwolfach, 99), vol. 5 of Internat. Ser. Numer. Math., Birkhäuser, Basel, 99, pp [7] A. Cohen, I. Daubechies, and P. Vial, Wavelets on the interval and fast wavelet transforms, Appl. Comput. Harmon. Anal., (99), pp [8] G. C. Donovan, J. S. Geronimo, D. P. Hardin, and P. R. Massopust, Construction of orthogonal wavelets using fractal interpolation functions, SIAM J. Math. Anal., 7 (996), pp [9] W. R. Madych, Finite orthogonal transforms and multiresolution analyses on intervals, J. Fourier Anal. Appl., (997), pp [] S. G. Mallat, Multiresolution approximations and wavelet orthonormal bases of L prq, Trans. Amer. Math. Soc., 5 (989), pp [] G. Strang and T. Nguyen, Wavelets and filter banks, Wellesley-Cambridge Press, Wellesley, MA, 996. [] J. R. Williams and K. Amaratunga, A discrete wavelet transform without edge effects using wavelet extrapolation, J. Fourier Anal. Appl., (997), pp
axioms Construction of Multiwavelets on an Interval Axioms 2013, 2, ; doi: /axioms ISSN
Axioms 2013, 2, 122-141; doi:10.3390/axioms2020122 Article OPEN ACCESS axioms ISSN 2075-1680 www.mdpi.com/journal/axioms Construction of Multiwavelets on an Interval Ahmet Altürk 1 and Fritz Keinert 2,
More informationApplied and Computational Harmonic Analysis
Appl Comput Harmon Anal 32 (2012 65 85 Contents lists available at ScienceDirect Applied and Computational Harmonic Analysis wwwelseviercom/locate/acha Regularity of boundary wavelets Ahmet Altürk, Fritz
More informationBoundary functions for wavelets and their properties
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 009 Boundary functions for wavelets and their properties Ahmet Alturk Iowa State University Follow this and additional
More informationPOINT VALUES AND NORMALIZATION OF TWO-DIRECTION MULTIWAVELETS AND THEIR DERIVATIVES
November 1, 1 POINT VALUES AND NORMALIZATION OF TWO-DIRECTION MULTIWAVELETS AND THEIR DERIVATIVES FRITZ KEINERT AND SOON-GEOL KWON,1 Abstract Two-direction multiscaling functions φ and two-direction multiwavelets
More informationDISCRETE CDF 9/7 WAVELET TRANSFORM FOR FINITE-LENGTH SIGNALS
DISCRETE CDF 9/7 WAVELET TRANSFORM FOR FINITE-LENGTH SIGNALS D. Černá, V. Finěk Department of Mathematics and Didactics of Mathematics, Technical University in Liberec Abstract Wavelets and a discrete
More informationFrame Diagonalization of Matrices
Frame Diagonalization of Matrices Fumiko Futamura Mathematics and Computer Science Department Southwestern University 00 E University Ave Georgetown, Texas 78626 U.S.A. Phone: + (52) 863-98 Fax: + (52)
More informationAn Introduction to Wavelets and some Applications
An Introduction to Wavelets and some Applications Milan, May 2003 Anestis Antoniadis Laboratoire IMAG-LMC University Joseph Fourier Grenoble, France An Introduction to Wavelets and some Applications p.1/54
More informationLet p 2 ( t), (2 t k), we have the scaling relation,
Multiresolution Analysis and Daubechies N Wavelet We have discussed decomposing a signal into its Haar wavelet components of varying frequencies. The Haar wavelet scheme relied on two functions: the Haar
More informationDAVID FERRONE. s k s k 2j = δ 0j. s k = 1
FINITE BIORTHOGONAL TRANSFORMS AND MULTIRESOLUTION ANALYSES ON INTERVALS DAVID FERRONE 1. Introduction Wavelet theory over the entire real line is well understood and elegantly presented in various textboos
More informationDecomposition of Riesz frames and wavelets into a finite union of linearly independent sets
Decomposition of Riesz frames and wavelets into a finite union of linearly independent sets Ole Christensen, Alexander M. Lindner Abstract We characterize Riesz frames and prove that every Riesz frame
More informationA NOTE ON MATRIX REFINEMENT EQUATIONS. Abstract. Renement equations involving matrix masks are receiving a lot of attention these days.
A NOTE ON MATRI REFINEMENT EQUATIONS THOMAS A. HOGAN y Abstract. Renement equations involving matrix masks are receiving a lot of attention these days. They can play a central role in the study of renable
More informationConstruction of orthogonal multiscaling functions and multiwavelets with higher approximation order based on the matrix extension algorithm
J. Math. Kyoto Univ. (JMKYAZ 6- (6, 75 9 Construction of orthogonal multiscaling functions and multiwavelets with higher approximation order based on the matrix extension algorithm By Shouzhi Yang and
More informationINFINITUDE OF MINIMALLY SUPPORTED TOTALLY INTERPOLATING BIORTHOGONAL MULTIWAVELET SYSTEMS WITH LOW APPROXIMATION ORDERS. Youngwoo Choi and Jaewon Jung
Korean J. Math. (0) No. pp. 7 6 http://dx.doi.org/0.68/kjm.0...7 INFINITUDE OF MINIMALLY SUPPORTED TOTALLY INTERPOLATING BIORTHOGONAL MULTIWAVELET SYSTEMS WITH LOW APPROXIMATION ORDERS Youngwoo Choi and
More informationConstruction of Multivariate Compactly Supported Orthonormal Wavelets
Construction of Multivariate Compactly Supported Orthonormal Wavelets Ming-Jun Lai Department of Mathematics The University of Georgia Athens, GA 30602 April 30, 2004 Dedicated to Professor Charles A.
More informationQuadrature Prefilters for the Discrete Wavelet Transform. Bruce R. Johnson. James L. Kinsey. Abstract
Quadrature Prefilters for the Discrete Wavelet Transform Bruce R. Johnson James L. Kinsey Abstract Discrepancies between the Discrete Wavelet Transform and the coefficients of the Wavelet Series are known
More informationLectures notes. Rheology and Fluid Dynamics
ÉC O L E P O L Y T E C H N IQ U E FÉ DÉR A L E D E L A U S A N N E Christophe Ancey Laboratoire hydraulique environnementale (LHE) École Polytechnique Fédérale de Lausanne Écublens CH-05 Lausanne Lectures
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationCOMPACTLY SUPPORTED ORTHONORMAL COMPLEX WAVELETS WITH DILATION 4 AND SYMMETRY
COMPACTLY SUPPORTED ORTHONORMAL COMPLEX WAVELETS WITH DILATION 4 AND SYMMETRY BIN HAN AND HUI JI Abstract. In this paper, we provide a family of compactly supported orthonormal complex wavelets with dilation
More informationOctober 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable
International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität
More informationPhysics 202 Laboratory 5. Linear Algebra 1. Laboratory 5. Physics 202 Laboratory
Physics 202 Laboratory 5 Linear Algebra Laboratory 5 Physics 202 Laboratory We close our whirlwind tour of numerical methods by advertising some elements of (numerical) linear algebra. There are three
More informationBiorthogonal Spline Type Wavelets
PERGAMON Computers and Mathematics with Applications 0 (00 1 0 www.elsevier.com/locate/camwa Biorthogonal Spline Type Wavelets Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationI. Multiple Choice Questions (Answer any eight)
Name of the student : Roll No : CS65: Linear Algebra and Random Processes Exam - Course Instructor : Prashanth L.A. Date : Sep-24, 27 Duration : 5 minutes INSTRUCTIONS: The test will be evaluated ONLY
More informationA DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE PETER G. CASAZZA, GITTA KUTYNIOK,
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationFast Transforms: Banded Matrices with Banded Inverses
Fast Transforms: Banded Matrices with Banded Inverses 1. Introduction Gilbert Strang, MIT An invertible transform y = Ax expresses the vector x in a new basis. The inverse transform x = A 1 y reconstructs
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationarxiv: v2 [math.fa] 27 Sep 2016
Decomposition of Integral Self-Affine Multi-Tiles Xiaoye Fu and Jean-Pierre Gabardo arxiv:43.335v2 [math.fa] 27 Sep 26 Abstract. In this paper we propose a method to decompose an integral self-affine Z
More informationarxiv:math/ v1 [math.ca] 19 May 2004
Fractal Components of Wavelet Measures arxiv:math/040537v [math.ca] 9 May 004 Abstract Palle E.T. Jorgensen Department of Mathematics, The University of Iowa, 4 MacLean Hall, Iowa City, IA, 54-49, U.S.A.
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationWavelet Decompositions for Quantitative Pattern Matching
Western Kentucky University TopSCHOLAR Mathematics Faculty Publications Mathematics January 09 Wavelet Decompositions for Quantitative Pattern Matching Bruce Kessler Western Kentucky University, bruce.kessler@wku.edu
More informationarxiv: v1 [math.ca] 4 Apr 2017
ON LOCALIZATION OF SCHRÖDINGER MEANS PER SJÖLIN Abstract. Localization properties for Schrödinger means are studied in dimension higher than one. arxiv:704.00927v [math.ca] 4 Apr 207. Introduction Let
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationA Tutorial on Wavelets and their Applications. Martin J. Mohlenkamp
A Tutorial on Wavelets and their Applications Martin J. Mohlenkamp University of Colorado at Boulder Department of Applied Mathematics mjm@colorado.edu This tutorial is designed for people with little
More informationIntroduction to Wavelets and Wavelet Transforms
Introduction to Wavelets and Wavelet Transforms A Primer C. Sidney Burrus, Ramesh A. Gopinath, and Haitao Guo with additional material and programs by Jan E. Odegard and Ivan W. Selesnick Electrical and
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationWavelet Bi-frames with Uniform Symmetry for Curve Multiresolution Processing
Wavelet Bi-frames with Uniform Symmetry for Curve Multiresolution Processing Qingtang Jiang Abstract This paper is about the construction of univariate wavelet bi-frames with each framelet being symmetric.
More informationConstruction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions. P. Bouboulis, L. Dalla and M. Kostaki-Kosta
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 54 27 (79 95) Construction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions P. Bouboulis L. Dalla and M. Kostaki-Kosta Received
More informationWavelet Bases of the Interval: A New Approach
Int. Journal of Math. Analysis, Vol. 1, 2007, no. 21, 1019-1030 Wavelet Bases of the Interval: A New Approach Khaled Melkemi Department of Mathematics University of Biskra, Algeria kmelkemi@yahoo.fr Zouhir
More informationMathematics Department Stanford University Math 61CM/DM Inner products
Mathematics Department Stanford University Math 61CM/DM Inner products Recall the definition of an inner product space; see Appendix A.8 of the textbook. Definition 1 An inner product space V is a vector
More informationConstruction of Biorthogonal B-spline Type Wavelet Sequences with Certain Regularities
Illinois Wesleyan University From the SelectedWorks of Tian-Xiao He 007 Construction of Biorthogonal B-spline Type Wavelet Sequences with Certain Regularities Tian-Xiao He, Illinois Wesleyan University
More informationModule 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur
Module 4 MULTI- RESOLUTION ANALYSIS Lesson Theory of Wavelets Instructional Objectives At the end of this lesson, the students should be able to:. Explain the space-frequency localization problem in sinusoidal
More informationFinal Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson
Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson Name: TA Name and section: NO CALCULATORS, SHOW ALL WORK, NO OTHER PAPERS ON DESK. There is very little actual work to be done on this exam if
More informationMATH 221, Spring Homework 10 Solutions
MATH 22, Spring 28 - Homework Solutions Due Tuesday, May Section 52 Page 279, Problem 2: 4 λ A λi = and the characteristic polynomial is det(a λi) = ( 4 λ)( λ) ( )(6) = λ 6 λ 2 +λ+2 The solutions to the
More informationREVIEW FOR EXAM III SIMILARITY AND DIAGONALIZATION
REVIEW FOR EXAM III The exam covers sections 4.4, the portions of 4. on systems of differential equations and on Markov chains, and..4. SIMILARITY AND DIAGONALIZATION. Two matrices A and B are similar
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More informationFourier-like Transforms
L 2 (R) Solutions of Dilation Equations and Fourier-like Transforms David Malone December 6, 2000 Abstract We state a novel construction of the Fourier transform on L 2 (R) based on translation and dilation
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationChapter 4 & 5: Vector Spaces & Linear Transformations
Chapter 4 & 5: Vector Spaces & Linear Transformations Philip Gressman University of Pennsylvania Philip Gressman Math 240 002 2014C: Chapters 4 & 5 1 / 40 Objective The purpose of Chapter 4 is to think
More informationMath 307 Learning Goals. March 23, 2010
Math 307 Learning Goals March 23, 2010 Course Description The course presents core concepts of linear algebra by focusing on applications in Science and Engineering. Examples of applications from recent
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationEigenvectors and Hermitian Operators
7 71 Eigenvalues and Eigenvectors Basic Definitions Let L be a linear operator on some given vector space V A scalar λ and a nonzero vector v are referred to, respectively, as an eigenvalue and corresponding
More informationDORIN ERVIN DUTKAY AND PALLE JORGENSEN. (Communicated by )
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 OVERSAMPLING GENERATES SUPER-WAVELETS arxiv:math/0511399v1 [math.fa] 16 Nov 2005 DORIN ERVIN DUTKAY
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationTRUNCATED TOEPLITZ OPERATORS ON FINITE DIMENSIONAL SPACES
TRUNCATED TOEPLITZ OPERATORS ON FINITE DIMENSIONAL SPACES JOSEPH A. CIMA, WILLIAM T. ROSS, AND WARREN R. WOGEN Abstract. In this paper, we study the matrix representations of compressions of Toeplitz operators
More informationSymmetric Wavelet Tight Frames with Two Generators
Symmetric Wavelet Tight Frames with Two Generators Ivan W. Selesnick Electrical and Computer Engineering Polytechnic University 6 Metrotech Center, Brooklyn, NY 11201, USA tel: 718 260-3416, fax: 718 260-3906
More informationSTABILITY AND LINEAR INDEPENDENCE ASSOCIATED WITH SCALING VECTORS. JIANZHONG WANG y
STABILITY AND LINEAR INDEPENDENCE ASSOCIATED WITH SCALING VECTORS JIANZHONG WANG y Abstract. In this paper, we discuss stability and linear independence of the integer translates of a scaling vector =
More informationREAL ANALYSIS II TAKE HOME EXAM. T. Tao s Lecture Notes Set 5
REAL ANALYSIS II TAKE HOME EXAM CİHAN BAHRAN T. Tao s Lecture Notes Set 5 1. Suppose that te 1, e 2, e 3,... u is a countable orthonormal system in a complex Hilbert space H, and c 1, c 2,... is a sequence
More informationChapter 7 Wavelets and Multiresolution Processing
Chapter 7 Wavelets and Multiresolution Processing Background Multiresolution Expansions Wavelet Transforms in One Dimension Wavelet Transforms in Two Dimensions Image Pyramids Subband Coding The Haar
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationSUMMARY OF MATH 1600
SUMMARY OF MATH 1600 Note: The following list is intended as a study guide for the final exam. It is a continuation of the study guide for the midterm. It does not claim to be a comprehensive list. You
More information[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]
Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the
More information2 W. LAWTON, S. L. LEE AND ZUOWEI SHEN is called the fundamental condition, and a sequence which satises the fundamental condition will be called a fu
CONVERGENCE OF MULTIDIMENSIONAL CASCADE ALGORITHM W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. Necessary and sucient conditions on the spectrum of the restricted transition operators are given for the
More informationDesign of Orthonormal Wavelet Filter Banks Using the Remez Exchange Algorithm
Electronics and Communications in Japan, Part 3, Vol. 81, No. 6, 1998 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J80-A, No. 9, September 1997, pp. 1396 1402 Design of Orthonormal Wavelet
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationApproximation by Multiple Refinable Functions
Approximation by Multiple Refinable Functions Rong-Qing Jia, S. D. Riemenschneider, and Ding-Xuan Zhou Department of Mathematical Sciences University of Alberta Edmonton, Canada T6G 2G1 Abstract We consider
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More informationLeast Squares Optimization
Least Squares Optimization The following is a brief review of least squares optimization and constrained optimization techniques. Broadly, these techniques can be used in data analysis and visualization
More informationLinear Least-Squares Data Fitting
CHAPTER 6 Linear Least-Squares Data Fitting 61 Introduction Recall that in chapter 3 we were discussing linear systems of equations, written in shorthand in the form Ax = b In chapter 3, we just considered
More informationAnalysis of Fractals, Image Compression and Entropy Encoding
Analysis of Fractals, Image Compression and Entropy Encoding Myung-Sin Song Southern Illinois University Edwardsville Jul 10, 2009 Joint work with Palle Jorgensen. Outline 1. Signal and Image processing,
More informationExercise Set 7.2. Skills
Orthogonally diagonalizable matrix Spectral decomposition (or eigenvalue decomposition) Schur decomposition Subdiagonal Upper Hessenburg form Upper Hessenburg decomposition Skills Be able to recognize
More informationEstimating the support of a scaling vector
Estimating the support of a scaling vector Wasin So Jianzhong Wang October, 00 Abstract An estimate is given for the support of each component function of a compactly supported scaling vector satisfying
More informationReview of Some Concepts from Linear Algebra: Part 2
Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set
More informationON SPECTRAL CANTOR MEASURES. 1. Introduction
ON SPECTRAL CANTOR MEASURES IZABELLA LABA AND YANG WANG Abstract. A probability measure in R d is called a spectral measure if it has an orthonormal basis consisting of exponentials. In this paper we study
More informationft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST
me me ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST 1. (1 pt) local/library/ui/eigentf.pg A is n n an matrices.. There are an infinite number
More information446 SCIENCE IN CHINA (Series F) Vol. 46 introduced in refs. [6, ]. Based on this inequality, we add normalization condition, symmetric conditions and
Vol. 46 No. 6 SCIENCE IN CHINA (Series F) December 003 Construction for a class of smooth wavelet tight frames PENG Lizhong (Λ Π) & WANG Haihui (Ξ ) LMAM, School of Mathematical Sciences, Peking University,
More informationA PRIMER ON SESQUILINEAR FORMS
A PRIMER ON SESQUILINEAR FORMS BRIAN OSSERMAN This is an alternative presentation of most of the material from 8., 8.2, 8.3, 8.4, 8.5 and 8.8 of Artin s book. Any terminology (such as sesquilinear form
More informationL. Levaggi A. Tabacco WAVELETS ON THE INTERVAL AND RELATED TOPICS
Rend. Sem. Mat. Univ. Pol. Torino Vol. 57, 1999) L. Levaggi A. Tabacco WAVELETS ON THE INTERVAL AND RELATED TOPICS Abstract. We use an abstract framework to obtain a multilevel decomposition of a variety
More informationChapter III. Quantum Computation. Mathematical preliminaries. A.1 Complex numbers. A.2 Linear algebra review
Chapter III Quantum Computation These lecture notes are exclusively for the use of students in Prof. MacLennan s Unconventional Computation course. c 2017, B. J. MacLennan, EECS, University of Tennessee,
More informationAN ALGORITHM FOR MATRIX EXTENSION AND WAVELET CONSTRUCTION
MATHEMATICS OF COMPUTATION Volume 65, Number 14 April 1996, Pages 73 737 AN ALGORITHM FOR MATRIX EXTENSION AND WAVELET CONSTRUCTION W LAWTON, S L LEE AND ZUOWEI SHEN Abstract This paper gives a practical
More informationMatrix-Valued Wavelets. Ahmet Alturk. A creative component submitted to the graduate faculty
Matrix-Valued Wavelets by Ahmet Alturk A creative component submitted to the graduate faculty in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE Major: Mathematics Program of
More informationSize properties of wavelet packets generated using finite filters
Rev. Mat. Iberoamericana, 18 (2002, 249 265 Size properties of wavelet packets generated using finite filters Morten Nielsen Abstract We show that asymptotic estimates for the growth in L p (R- norm of
More informationOn Riesz-Fischer sequences and lower frame bounds
On Riesz-Fischer sequences and lower frame bounds P. Casazza, O. Christensen, S. Li, A. Lindner Abstract We investigate the consequences of the lower frame condition and the lower Riesz basis condition
More informationChapter 6: Orthogonality
Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products
More informationLINEAR ALGEBRA SUMMARY SHEET.
LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
More informationDraft. Lecture 01 Introduction & Matrix-Vector Multiplication. MATH 562 Numerical Analysis II. Songting Luo
Lecture 01 Introduction & Matrix-Vector Multiplication Songting Luo Department of Mathematics Iowa State University MATH 562 Numerical Analysis II Songting Luo ( Department of Mathematics Iowa State University[0.5in]
More informationWavelets and Multiresolution Processing. Thinh Nguyen
Wavelets and Multiresolution Processing Thinh Nguyen Multiresolution Analysis (MRA) A scaling function is used to create a series of approximations of a function or image, each differing by a factor of
More information