Can we characterize the wavelets through linear transformation? the answer for this question is certainly YES. In this paper we have characterized the Haar wavelet matrix by their linear transformation and proved some theorems on properties of Haar wavelet matrix such as Trace, eigenvalue and eigenvector and diagonalization of a matrix.

New bounds on the canonical angles between an invariant subspace of A and an approximating subspace by the differences between Ritz values and the targeted eigenvalues are obtained. From this result, various bounds are readily available to estimate how accurate the Ritz vectors computed from the approximating subspace may be, based on information on approximation accuracies in the Ritz values. ...

For most unsymmetric matrices it is difficult to compute many accurate eigenvalues using the primitive form of the unsymmetric Lanczos algorithm (ULA). In this paper we propose a modification of the ULA. It is related to ideas used in [J. Chem. Phys. 122 (2005), 244107 (11 pages)] to compute resonance lifetimes. Using the refined ULA we suggest, the calculation of accurate extremal and interior...

This chapter introduces a variety of tools from matrix algebra and multivariate statistics useful in the analysis of selection on multiple characters. Our primary intent is to introduce the reader to the idea of vectors and matrices as geometric structures, viewing matrix operations as transformations converting a vector into a new vector by a change in geometry (rotation and scaling). The eige...