Related papers: Reducing graph subspaces and strong solutions to o…
The exact/approximate non-orthogonal general joint block diagonalization ({\sc nogjbd}) problem of a given real matrix set $\mathcal{A}=\{A_i\}_{i=1}^m$ is to find a nonsingular matrix $W\in\mathbb{R}^{n\times n}$ (diagonalizer) such that…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
In this paper, we present several sharp upper bounds for the numerical radii of the diagonal and off-diagonal parts of the $2\times2$ block operator matrix $\begin{bmatrix}A&B\\ C&D\end{bmatrix}$. Among extensions of some results of…
We establish an algorithm for a criterion of the diagonalisability of a matrix over a local field by a unitary matrix. For this sake, we define the notion of normality of a $p$-adic operator, and give several criteria for the normality. We…
In this article we address the issue of uniqueness for differential and algebraic operator Riccati equations, under a distinctive set of assumptions on their unbounded coefficients. The class of boundary control systems characterized by…
The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M-matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive…
Discrete Laplacian operators arise ubiquitously in scientific computing and frequently appear in quantum algorithms for tasks such as linear algebra, Hamiltonian simulation, and partial differential equations. Block encoding provides the…
Let $R$ be a commutative complex unital semisimple Banach algebra with the involution $\cdot ^\star$. Sufficient conditions are given for the existence of a stabilizing solution to the $H^\infty$ Riccati equation when the matricial data has…
In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim., 34 (2024), pp. 1569-1594] by Bredies, Chenchene and Naldi. We particularize it to the case where…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
A regular-graph design is a block design for which a pair $\{a,b\}$ of distinct points occurs in $\lambda+1$ or $\lambda$ blocks depending on whether $\{a,b\}$ is or is not an edge of a given $\delta$-regular graph. Our paper describes a…
This paper proposes a reduction technique for the generalised Riccati difference equation arising in optimal control and optimal filtering. This technique relies on a study on the generalised discrete algebraic Riccati equation. In…
A discrete Schr\"odinger operator of a graph $G$ is a real symmetric matrix whose $i,j$-entry, $i \neq j$, is negative if $\{i,j\}$ is an edge and zero if it is not an edge, while diagonal entries can be any real numbers. The discrete…
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition…
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…
In this paper we obtain necessary and sufficient conditions for a linear bounded operator in a Hilbert space $H$ to have a three-diagonal complex symmetric matrix with non-zero elements on the first sub-diagonal in an orthonormal basis in…
We consider an off-diagonal self-adjoint finite rank perturbation of a self-adjoint operator in a complex separable Hilbert space $\mathfrak{H}_0 \oplus \mathfrak{H}_1$, where $\mathfrak{H}_1$ is finite dimensional. We describe the singular…
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimization and nonsmooth analysis. Assuming that resolvents of the operators are available, this problem can be tackled with the Douglas-Rachford…
Let \(G\) be a finite simple graph and let \(T\) be its Hashimoto operator on the directed-edge space. We show that edge reversal induces a canonical symmetric/antisymmetric splitting under which \(T\) acquires an explicit \(2\times 2\)…
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…