a novel and eective method based on haar wavelets and block pulse functions(bpfs) is proposed to solve nonlinear fredholm integro-dierential equations of fractional order.the operational matrix of haar wavelets via bpfs is derived and together with haar waveletoperational matrix of fractional integration are used to transform the mentioned equation to asystem of algebraic equations. our new m...

hybrid of rationalized haar functions are developed to approximate the solution of the differential equations. the properties of hybrid functions which are the combinations of block-pulse functions and rationalized haar functions are first presented. these properties together with the newton-cotes nodes are then utilized to reduce the differential equations to the solution of algebraic equation...

An algorithm for orthogonal 4-tap integer multiwavelet transforms is proposed. We compute the singular value decomposition SVD of block recursive matrices of transform matrix, and then transform matrix can be rewritten in a product of two block diagonal matrices and a permutation matrix. Furthermore, we factorize the block matrix of block diagonal matrices into triangular elementary reversible ...

Spectral clustering methods perform well in cases where classical methods (K-means, single linkage, etc.) fail. However, for very non-compact clusters, they also tend to have problems. In this paper, we propose three improvements which we show that perform better in such cases. We suggest that spectral decomposition is merely a method for determining the block structure of the affinity matrix. ...

We describe an extension to ScaLAPACK for computing with symmetric (and hermitian) matrices stored in a packed form. This is similar to the compact storage for symmetric (and hermitian) matrices available in LAPACK [2]. This enables more efficient use of memory by storing only the lower or upper triangular part of a symmetric matrix. The capabilities include Choleksy factorization (PxSPTRF) and...

Block variants of the Jacobi-Davidson method for computing a few eigenpairs of a large sparse matrix are known to improve the robustness of the standard algorithm when it comes to computing multiple or clustered eigenvalues. In practice, however, they are typically avoided because the total number of matrix-vector operations increases. In this paper we present the implementation of a block Jaco...

This paper proposes a new, large diffusion layer for the AES block cipher. This new layer replaces the ShiftRows and MixColumns operations by a new involutory matrix in every round. The objective is to provide complete diffusion in a single round, thus sharply improving the overall cipher security. Moreover, the new matrix elements have low Hamming-weight in order to provide equally good perfor...

A sufficiently optimized matrix multiplication on embedded systems can facilitate data processing in high performance mobile measuring equipment since plenty of the kernel mathematical algorithms are based on matrix multiplication. In this paper, we propose a matrix multiplication specially optimized for ARMv7 architecture. The performance-critical differences between ARMv7 and conventional des...