We discuss random matrix models in terms of elementary operations on Blue’s functions (functional inverse of Green’s functions). We show that such operations embody the essence of a number of physical phenomena whether at/or away from the critical points. We illustrate these assertions by borrowing on a number of recent results in effective QCD in vacuum and matter. We provide simple physical a...

We discuss random matrix models in terms of elementary operations on Blue’s functions (functional inverse of Green’s functions). We show that such operations embody the essence of a number of physical phenomena whether at/or away from the critical points. We illustrate these assertions by borrowing on a number of recent results in effective QCD in vacuum and matter. We provide simple physical a...

Matrix operations such as matrix inversion, eigenvalue decomposition, singular value decomposition are ubiquitous in real-world applications. Unfortunately, many of these matrix operations so time and memory expensive that they are prohibitive when the scale of data is large. In real-world applications, since the data themselves are noisy, machine-precision matrix operations are not necessary a...

In the article we describe the approach to parallel implementation of elementary operations for textual data categorization. In the experiments we evaluate parallel computations of similarity matrices and k-means algorithm. The test datasets have been prepared as graphs created from Wikipedia articles related with links. W also present the approach to computing pairs of eigenvectors and eigenva...

In 1956, Brauer showed that there is a partitioning of the pregular conjugacy classes of a group according to the p-blocks of its irreducible characters with close connections to the block theoretical invariants. In a previous paper, the first explicit block splitting of regular classes for a family of groups was given for the 2-regular classes of the symmetric groups. Based on this work, here ...

ÐIn this paper, we present a framework for synthesizing I/O efficient out-of-core programs for block recursive algorithms, such as the fast Fourier transform (FFT) and block matrix transposition algorithms. Our framework uses an algebraic representation which is based on tensor products and other matrix operations. The programs are optimized for the striped Vitter and Shriver's twolevel memory ...

The aim of this paper is to show an effective reorganization of the nonsymmetric block lanczos algorithm efficient, portable and scalable for multiple instructions multiple data (MIMD) distributed memory message passing architectures. Basic operations implemented here are matrix-matrix multiplications, eventually with a transposed and a sparse factor, LU factorisation and triangular systems sol...

This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT): the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, ...

We determine the elementary divisors of the Cartan matrices of spin p-blocks of the covering groups of the symmetric groups when p is an odd prime. As a consequence, we also compute the determinants of these Cartan matrices, and in particular we confirm a conjecture by Brundan and Kleshchev that these determinants depend only on the weight but not on the sign of the block. The main purpose of t...

The inversion problem for square matrices having the structure of a block Hankel-like matrix is studied. Examples of such matrices in&de Hankel striped, Hankel layered, and vector Hankel matrices. It is shown that the components that both determine nonsingularity and construct the inverse of such matrices are closely related to certain matrix polynomials. These matrix polynomials are multidimen...