in this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the laplacian equation. themethod is based on the use of the galerkin method with cas wavelets constructed on the unit interval as basis.this approach utilizes the non-uniform gauss-legendre quadrature rule for ...

Abstract So far, our focus has been on the theoretical and algorithmic principles involved in sparse Gaussian elimination-based factorizations. To limit storage work computation of factors their use during solve phase it is generally necessary to reorder (permute) matrix before factorization commences. The complexity most critical steps highly dependent amount fill-in, as can be seen from follo...

the focus of this paper is to consider the compressed sensing problem. it is stated that the compressed sensing theory, under certain conditions, helps relax the nyquist sampling theory and takes smaller samples. one of the important tasks in this theory is to carefully design measurement matrix (sampling operator). most existing methods in the literature attempt to optimize a randomly initiali...

human action recognition is an important problem in computer vision. one of the methods that are recently used is sparse coding. conventional sparse coding algorithms learn dictionaries and codes in an unsupervised manner and neglect class information that is available in the training set. but in this paper for solving this problem, we use a discriminative sparse code based on multi-manifolds. ...