Minimum upper bound of the Cayley transform of an orthogonal matrix multiplied by signed permutation matrices

Minimum upper bound of the Cayley transform of an orthogonal matrix multiplied by signed permutation matrices
复制标题

正交矩阵的凯莱变换的最小上界乘以有符号置换矩阵

DOI:
10.1016/j.laa.2022.11.009
复制
发表时间:
2023
影响因子:
1.1
通讯作者:
Tanaka Akira
Tanaka Akira
中科院分区:
数学3区
文献类型:
--
作者:
Mitamura Takuma;Tanaka Akira

文献摘要

参考文献

相似文献

O'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'D'|S I j|其中S=(s i j)= Q(U D)是UD的凯莱变换。在本文中,我们证明了上界可以通过乘以某个符号置换矩阵而不是签名矩阵来减少到2− 1。
O'Dorney has proved that for any orthogonal matrix U, there exists a signature matrix D (a diagonal matrix with diagonal entries±1) by which| s i j|≤ 1, where S=(s i j)= Q (U D) is the Cayley transform of UD. In this paper, we prove that the upper bound can be reduced to 2− 1 by multiplying by a certain signed permutation matrix, instead of a signature matrix.
通过乘以签名矩阵来最小化正交矩阵的凯莱变换
DOI: 10.1016/j.laa.2014.01.032
发表时间: 2014
影响因子: 1.1
作者:
Evan M. O’Dorney
通讯作者: Evan M. O’Dorney
是否存在对角线为零的小偏凯莱变换
DOI: 10.1016/j.laa.2005.08.027
发表时间: 2006
影响因子: 1.1
作者:
W. Kahan
通讯作者: W. Kahan