相关论文: Sign Patterns of Orthogonal Matrices and the Stron…

A sign pattern is an array with entries in $\{+,-,0\}$. A matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~Shader, Sign patterns of orthogonal matrices and the strong…

In this study, the orthogonalization process for different inner products is applied to pairwise comparisons. Properties of consistent approximations of a given inconsistent pairwise comparisons matrix are examined. A method of a derivation…

A new property, the strong singular value property, is introduced, developed, and utilized to study the problem of which lists of nonnegative real numbers occur as the singular values of a matrix with a prescribed zero-nonzero pattern.

A sign pattern is a matrix whose entries belong to the set $\{+,-,0\}$. A sign pattern requires a unique inertia if every real matrix in its qualitative class has the same inertia. Symmetric tree sign patterns requiring a unique inertia has…

In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…

The sign patterns of inverse doubly-nonnegative matrices are examined. A necessary and sufficient condition is developed for a sign matrix to correspond to an inverse doubly-nonnegative matrix. In addition, for a doubly-nonnegative matrix…

The exact parameter values of mathematical models are often uncertain or even unknown. Nevertheless, we may have access to crude information about the parameters, e.g., that some of them are nonzero. Such information can be captured by…

A matrix-valued inner product was proposed before to construct orthonormal matrix-valued wavelets for matrix-valued signals. It introduces a weaker orthogonality for matrix-valued signals than the orthogonality of all components in a matrix…

Let $R$ be a commutative ring with identity. The paper studies the problem of self-orthogonality and self-duality matrix-product codes (MPCs) over $R$. Some methods as well as special matrices are introduced for the construction of such…

In this article we present a new characterization of inverse M-matrices, inverse row diagonally dominant M-matrices and inverse row and column diagonally dominant M-matrices, based on the positivity of certain inner products.

In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…

We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…

We give necessary and sufficient conditions for a family of inner products in a finite-dimensional vector space $V$ over an arbitrary field $\mathbb{K}$ to have an orthogonal basis relative to all the inner products. Some applications to…

A real matrix is said to be positive if its every entry is positive, and a real square matrix A is algebraically positive if there exists a real polynomial f such that f(A) is a positive matrix. A sign pattern matrix A is said to require a…

Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

The combined matrix is a very useful concept for many applications. Almost strictly sign regular (ASSR) matrices form an important structured class of matrices with two possible zero patterns, which are either type-I staircase or type-II…

Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…

The class of strictly sign regular (SSR) matrices has been extensively studied by many authors over the past century, notably by Schoenberg, Motzkin, Gantmacher, and Krein. A classical result of Gantmacher-Krein assures the existence of SSR…

The increasing size of neural networks has led to a growing demand for methods of efficient fine-tuning. Recently, an orthogonal fine-tuning paradigm was introduced that uses orthogonal matrices for adapting the weights of a pretrained…