نتایج جستجو برای: haar product matrix
تعداد نتایج: 634299 فیلتر نتایج به سال:
Recently it has been shown that in Image Processing, the usual sum and product of the reals are not the only operations that can be used. Several other operations provided by fuzzy logic perform well in this application. We continue this line of research and we propose the use of a pair consisting of a uninorm and an absorbing norm determined by a continuous, strictly increasing generator inste...
we present here, a haar wavelet method for a class of third order partial dierentialequations (pdes) arising in impulsive motion of a flat plate. we also, present adomaindecomposition method to find the analytic solution of such equations. efficiency andaccuracy have been illustrated by solving numerical examples.
We correct an error in the proof of Theorem 1.5 in 4]. We also give a strengthened necessary condition for the existence of a Haar basis of the speciied kind for every integer matrix A that has a given irreducible characteristic polynomial f(x) with jf(0)j = 2: A. Potiopa 7] found that the expanding polynomial g(x) = x 4 +x 2 +2 violates this necessary condition. Thus there exists some 4 4 expa...
In this paper, a new face recognition system based on Haar wavelet transform (HWT) and Principal Component Analysis (PCA) using Levenberg-Marquardt backpropagation (LMBP) neural network is presented. The image face is preprocessed and detected. The Haar wavelet is used to form the coefficient matrix for the detected face. The image feature vector is obtained by computing PCA for the coefficient...
Let Um be an m×m Haar unitary matrix and U[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U[m,n] as m/n → λ and n → ∞. The rate function and the limit distribution are given explicitely. U[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free....
in this paper, we present a numerical algorithm for solving matrix equations $(a otimes b)x = f$ by extending the well-known gaussian elimination for $ax = b$. the proposed algorithm has a high computational efficiency. two numerical examples are provided to show the effectiveness of the proposed algorithm.
We present a method to factor a given matrix M into a short product of sparse matrices, provided M has a suitable “symmetry”. This sparse factorization represents a fast algorithm for the matrix-vector multiplication with M . The factorization method consists of two essential steps. First, a combinatorial search is used to compute a suitable symmetry of M in the form of a pair of group represen...
We consider the effect of a partial transpose on limit $*$-distribution Haar distributed random unitary matrix. If we fix number blocks, $b$, show that can be decomposed along diagonals into sum $b$ matrices w
In this paper, we have proposed a Haar wavelet quasilinearization method to solve the well known Blasius equation. The method is based on the uniform Haar wavelet operational matrix defined over the interval [0, 1]. In this method, we have proposed the transformation for converting the problem on a fixed computational domain. The Blasius equation arises in the various boundary layer problems of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید