Related papers: The Frobenious distances from projections to an id…

For every idempotent $Q$ on a Hilbert space $H$, the matched projection $m(Q)$ is a well-established concept. This paper explores several applications of the matched projections. The first application addresses the distances from…

We treat the problem of the Frobenius distance evaluation from a given matrix $ A \in \mathbb R^{n\times n} $ with distinct eigenvalues to the manifold of matrices with multiple eigenvalues. On restricting considerations to the rank $ 1 $…

For two $n \times n$ complex matrices $A$ and $B$, we define the $q$-deformed commutator as $[ A, B ]_q := A B - q BA$ for a real parameter $q$. In this paper, we investigate a generalization of the B\"{o}ttcher-Wenzel inequality which…

Given a positive integer k, it is natural to ask for a formula for the distance between a given density matrix (i.e., mixed quantum state) and the set of density matrices of rank at most k. This problem has already been solved when…

Our main interest is the low-rank approximation of a matrix in R^m.n under a weighted Frobenius norm. This norm associates a weight to each of the (m x n) matrix entries. We conjecture that the number of approximations is at most min(m, n).…

Building on MacDonald's formula for the distance from a rank-one projection to the set of nilpotents in $\mathbb{M}_n(\mathbb{C})$, we prove that the distance from a rank $n-1$ projection to the set of nilpotents in…

Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product…

The Frobenius of a matrix $M$ with coefficients in $\bar{\mathbb F}_p$ is the matrix $\sigma(M)$ obtained by raising each coefficient to the $p$-th power. We consider the question of counting matrices with coefficients in $\mathbb F_q$…

Consider a matrix polynomial $P \left( \lambda \right)= A_0 + \lambda A_1 + \ldots + \lambda^d A_d$, with $A_0,\ldots, A_d$ complex (or real) matrices with a certain structure. In this paper we discuss an iterative method to numerically…

The aim of this paper is to give new characterizations of some fundamental issues about idempotents. In the general setting of adjointable operators on Hilbert $C^*$-modules, a new term of quasi-projection pair is introduced. For each…

Let u be a hermitian involution, and e an orthogonal projection, acting on the same Hilbert space. We establish the exact formula, in terms of the norm of eue, for the distance from e to the set of all orthogonal projections q from the…

We consider the closest-point projection with respect to the Frobenius norm of a general real square matrix to the set SL($n$) of matrices with unit determinant. As it turns out, it is sufficient to consider diagonal matrices only. We…

It is shown in this paper that, if $R$ is a Frobenius ring, then the quaternion ring $\mathcal{H}_{a,b}(R)$ is a Frobenius ring for all units $a,b \in R$. In particular, if $q$ is an odd prime power then $\mathcal{H}_{a,b}(\mathbb{F}_q)$ is…

In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…

In this note, we study the distance from an arbitrary nonzero projection $P$ to the set of nilpotents in a factor $\mathcal{M}$ equipped with a normal faithful tracial state $\tau$. We prove that the distance equals $(2\cos…

The unitary polar factor of a matrix F is the unitary matrix Q realizing the minimum of the norm of F-Q over all unitary matrices Q. Tracing back the development on the optimality of the polar factor to its presumable roots, in this paper…

Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix $M$, the goal is to compute a matrix $M'$ of given rank $r$ in a linear or affine…

We work in the space of $m$-by-$n$ real matrices with the Frobenius inner product. Consider the following Problem: Given an m-by-n real matrix A and a positive integer k, find the m-by-n matrix with rank k that is closest to A. I discuss a…

We describe an algorithm for sampling a low-rank random matrix $Q$ that best approximates a fixed target matrix $P\in\mathbb{C}^{n\times m}$ in the following sense: $Q$ is unbiased, i.e., $\mathbb{E}[Q] = P$; $\mathsf{rank}(Q)\leq r$; and…

This paper proposes to establish the distance between partial preference orderings based on two very different approaches. The first approach corresponds to the brute force method based on combinatorics. It generates all possible complete…