Related papers: Block-diagonalisation of matrices and operators
In this paper, we will consider matrices with entries in the space of operators $\mathcal{B}(H)$, where $H$ is a separable Hilbert space and consider the class of matrices that can be approached in the operator norm by matrices with a…
We introduce a method for obtaining new classes of free divisors from representations $V$ of connected linear algebraic groups $G$ where $\dim(G)=\dim(V)$, with $V$ having an open orbit. We give sufficient conditions that the complement of…
Hierarchical matrices provide a highly memory-efficient way of storing dense linear operators arising, for example, from boundary element methods, particularly when stored in the H^2 format. In such data-sparse representations, iterative…
A new method to construct task graphs for \mcH-matrix arithmetic is introduced, which uses the information associated with all tasks of the standard recursive \mcH-matrix algorithms, e.g., the block index set of the matrix blocks involved…
Diagonalization of a large matrix is the computational bottleneck in many applications such as electronic structure calculations. We show that a speedup of over 30% can be achieved by exploiting 32-bit floating point operations, while…
It is shown that, for the block matrices belonging to $M(nd,\mathbb{C})$ with commuting and normal block entries of dimension $d$, the separability of such a block matrices is equivalent to its semi-positive definity. The separability…
For each square complex matrix, V. I. Arnold constructed a normal form with the minimal number of parameters to which a family of all matrices B that are close enough to this matrix can be reduced by similarity transformations that smoothly…
We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
Let A(x) be a holomorphic family of bounded self-adjoint operators on a separable Hilbert space H and let A(x)_n be the orthogonal compressions of A(x) to the span of first n elements of an orthonormal basis of H. The problem considered…
Given an algorithm of resolution of singularities satisfying certain conditions (``good algorithms''), natural notions of simultaneous algorithmic resolution, or equiresolution, for families of embedded schemes (parametrized by a reduced…
We describe a canonical procedure for associating to any (germ of) holomorphic self-map f of C^n fixing the origin such that df_O is invertible and non-diagonalizable an n-dimensional complex manifold M, a holomorphic map p from M to C^n, a…
Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…
The blocked composite operators are defined in the one-component Euclidean scalar field theory, and shown to generate a linear transformation of the operators, the operator mixing. This transformation allows us to introduce the parallel…
It is well-known that a complex circulant matrix can be diagonalized by a discrete Fourier matrix with imaginary unit $\mathtt{i}$. The main aim of this paper is to demonstrate that a quaternion circulant matrix cannot be diagonalized by a…
A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…
We show that any scalar differential operator with a family of polyno- mials as its common eigenfunctions leads canonically to a matrix differen- tial operator with the same property. The construction of the correspond- ing family of matrix…
We view the inertia construction of algebraic stacks as an operator on the Grothendieck groups of various categories of algebraic stacks. We show that the inertia operator is locally finite and diagonalizable. This is proved for the…
We provide the definition and fundamental properties of algebraic elements with respect to an operator satisfying hypothesis (h). Furthermore, we analyze Hilbert modules using C_0-operators relative to a bounded finitely connected region…
In Density Functional Theory simulations based on the LAPW method, each self-consistent field cycle comprises dozens of large dense generalized eigenproblems. In contrast to real-space methods, eigenpairs solving for problems at distinct…