Related papers: Block diagonalizing ultrametric matrices
A new method for solving systems of linear algebraic equations of a special type arising in solving problems of image reconstruction has been proposed. This method, due to a certain symmetry of the matrix and the choice of the voxel…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
The results on the inversion of convolution operators as well as Toeplitz (and block Toeplitz) matrices in the $1$-D (one-dimensional) case are classical and have numerous applications. Last year, we considered the $2$-D case of…
Persistent homology is a leading tool in topological data analysis (TDA). Many problems in TDA can be solved via homological -- and indeed, linear -- algebra. However, matrices in this domain are typically large, with rows and columns…
In a previous paper, one of us pointed out that the anomalous dimension matrices for all physical processes that have been calculated to date are complex symmetric, if stated in an orthonormal basis. In this paper we prove this fact and…
In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We present a criterion, based on three commutator relations, that allows to decide whether two self-adjoint matrices with non-overlapping support are simultaneously unitarily similar to quasidiagonal matrices, i.e., whether they can be…
The widely used large-scale diagonalization method using harmonic oscillator basis functions (an instance of the Rayleigh-Ritz method, also called a spectral method, configuration-interaction method, or ``exact diagonalization'' method) is…
We discuss in detail the symmetry breaking and related issues in the minimal renormalizable supersymmetric grand unified theory. We compute the particle spectrum and study its impact on the physical scales of the theory. This provides a…
A random matrix model to describe the coupling of $m$-fold symmetry is constructed. The particular threefold case is used to analyze data on eigenfrequencies of elastomechanical vibration of an anisotropic quartz block. It is suggested that…
A unified approach to parametrization of the mixing matrix for $N$ generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way…
We consider matrix-model representations of the meander problem which describes, in particular, combinatorics for foldings of closed polymer chains. We introduce a supersymmetric matrix model for describing the principal meander numbers.…
The most general evolution of the density matrix of a quantum system with a finite-dimensional state space is by stochastic maps which take a density matrix linearly into the set of density matrices. These dynamical stochastic maps form a…
Block coherence of matrices plays an important role in analyzing the performance of block compressed sensing recovery algorithms (Bajwa and Mixon, 2012). In this paper, we characterize two block coherence metrics: worst-case and average…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
A generalization of modularity, called block modularity, is defined. This is a quality function which evaluates a label assignment against an arbitrary block pattern. Therefore, unlike standard modularity or its variants, arbitrary network…
Consider rectangular matrices over a commutative ring R. Assume the ideal of maximal minors factorizes, I_m(A)=J_1*J_2. When is A left-right equivalent to a block-diagonal matrix? (When does the module/sheaf Coker(A) decompose as the…
We introduce an iterative method named GPMR for solving 2x2 block unsymmetric linear systems. GPMR is based on a new process that reduces simultaneously two rectangular matrices to upper Hessenberg form and that is closely related to the…
In supersymmetric models a tree-level neutrino mass could originate from the (weak-scale) superpotential. We propose and examine a realization of that idea, which arises naturally in the framework of a spontaneously broken U(1) R-symmetry.…