اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRemarks on the Cayley Representation of Orthogonal Matrices and on Perturbing the Diagonal of a Matrix to Make it Invertible
91
0
0.0
(
0
)
تأليف
Jean Gallier
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This note contains two remarks. The first remark concerns the extension of the well-known Cayley representation of rotation matrices by skew symmetric matrices to rotation matrices admitting -1 as an eigenvalue and then to all orthogonal matrices. We review a method due to Hermann Weyl and another method involving multiplication by a diagonal matrix whose entries are +1 or -1. The second remark has to do with ways of flipping the signs of the entries of a diagonal matrix, C, with nonzero diagonal entries, obtaining a new matrix, E, so that E + A is invertible, where A is any given matrix (invertible or not).
قيم البحث
اقرأ أيضاً
We give upper and lower bounds on the determinant of a perturbation of the identity matrix or, more generally, a perturbation of a nonsingular diagonal matrix. The matrices considered are, in general, diagonally dominant. The lower bounds are best po
ssible, and in several cases they are stronger than well-known bounds due to Ostrowski and other authors. If $A = I-E$ is an $n times n$ matrix and the elements of $E$ are bounded in absolute value by $varepsilon le 1/n$, then a lower bound of Ostrowski (1938) is $det(A) ge 1-nvarepsilon$. We show that if, in addition, the diagonal elements of $E$ are zero, then a best-possible lower bound is [det(A) ge (1-(n-1)varepsilon),(1+varepsilon)^{n-1}.] Corresponding upper bounds are respectively [det(A) le (1 + 2varepsilon + nvarepsilon^2)^{n/2}] and [det(A) le (1 + (n-1)varepsilon^2)^{n/2}.] The first upper bound is stronger than Ostrowskis bound (for $varepsilon < 1/n$) $det(A) le (1 - nvarepsilon)^{-1}$. The second upper bound generalises Hadamards inequality, which is the case $varepsilon = 1$. A necessary and sufficient condition for our upper bounds to be best possible for matrices of order $n$ and all positive $varepsilon$ is the existence of a skew-Hadamard matrix of order $n$.
It is a survey of the results obtained by K. Glazeks and his co-workers. We restrict our attention to the problems of axiomatizations of n-ary groups, classes of n-ary groups, properties of skew elements and homomorphisms induced by skew elements, co
nstructions of covering groups, classifications and representations of n-ary groups. Some new results are added too.
We propose a generalization of the graphical chip-firing model allowing for the redistribution dynamics to be governed by any invertible integer matrix while maintaining the long term critical, superstable, and energy minimizing behavior of the classical model.
For an $n times n$ matrix $M$ with entries in $mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a polynomial in
$n$ algorithm deciding whether $R(M) leq k$ (whose complexity may depend on $k$). We also give a polynomial in $n$ algorithm computing a number $m$ such that $m/2 leq R(M) leq m$. These results have applications to graph drawings on non-orientable surfaces.
The Lagrangian representation of multi-Hamiltonian PDEs has been introduced by Y. Nutku and one of us (MVP). In this paper we focus on systems which are (at least) bi-Hamiltonian by a pair $A_1$, $A_2$, where $A_1$ is a hydrodynamic-type Hamiltonian
operator. We prove that finding the Lagrangian representation is equivalent to finding a generalized vector field $tau$ such that $A_2=L_tau A_1$. We use this result in order to find the Lagrangian representation when $A_2$ is a homogeneous third-order Hamiltonian operator, although the method that we use can be applied to any other homogeneous Hamiltonian operator. As an example we provide the Lagrangian representation of a WDVV hydrodynamic-type system in $3$ components.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
