Results 41 to 50 of about 870,005 (280)

Symplectic analogs of polar decomposition and their applications to bosonic Gaussian channels

, 2020
We obtain several analogs of real polar decomposition for even dimensional matrices. In particular, we decompose a non-degenerate matrix as a product of a Hamiltonian and an anti-symplectic matrix and under additional requirements we decompose a matrix ...
Teretenkov, A. E.
core   +1 more source

Singular random matrix decompositions: distributions [PDF]

Journal of Multivariate Analysis, 2005
Assuming that Y has a singular matrix variate elliptically contoured distribution with respect to the Hausdorff measure, the distributions of several matrices associated to QR, modified QR, SV and Polar decompositions of matrix Y are determined, for central and non-central, non-singular and singular cases, as well as their relationship to the Wishart ...
González Farías, Graciela, Díaz García, José A.   +1 more
openaire   +3 more sources

Some Combinatorial Results on the Factor Group K (G)

Journal of Kufa for Mathematics and Computer, 2016
character matrix ( ) from the character table of and finding the invariant factors of this matrix, the primary decomposition of the factor group where is determined.
Manal Najy Yagoob, Ahmed Abed Ali Omran
doaj   +1 more source

Beyond Low Rank + Sparse: Multi-scale Low Rank Matrix Decomposition

, 2016
We present a natural generalization of the recent low rank + sparse matrix decomposition and consider the decomposition of matrices into components of multiple scales.
Lustig, Michael, Ong, Frank
core   +1 more source

Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups [PDF]

SIAM Journal on Matrix Analysis and Applications, 2004
The polar decomposition of \(A\) is \(A=UH\), where \(A\) has complex elements, \(U\) is unitary, \(H\) is Hermitian positive semi-definite. The authors identify a family of globally convergent rational iterations that preserve group structure. They show how the structure preservation leads to particularly convenient convergence tests in the case of ...
Higham, Nicholas J., Mackey, D. Steven, Mackey, Niloufer, Tisseur, Françoise   +3 more
openaire   +2 more sources

Key agreement protocol in infinite semigroup representation level

Lietuvos Matematikos Rinkinys, 2007
Matrix decomposition problem over integer ring is presented. Solving methods are discussed and it is showed, that this problem is hard computational problem regard to computer memory resources.
Artūras Katvickis, Eligijus Sakalauskas, Kastytis Ratkevičius   +2 more
doaj   +1 more source

Structured Matrix Methods Computing the Greatest Common Divisor of Polynomials

Special Matrices, 2017
This paper revisits the Bézout, Sylvester, and power-basis matrix representations of the greatest common divisor (GCD) of sets of several polynomials. Furthermore, the present work introduces the application of the QR decomposition with column pivoting ...
Christou Dimitrios, Mitrouli Marilena, Triantafyllou Dimitrios   +2 more
doaj   +1 more source

Peroxidasin enables melanoma immune escape by inhibiting natural killer cell cytotoxicity

Molecular Oncology, EarlyView.
Peroxidasin (PXDN) is secreted by melanoma cells and binds the NK cell receptor NKG2D, thereby suppressing NK cell activation and cytotoxicity. PXDN depletion restores NKG2D signaling and enables effective NK cell–mediated melanoma killing. These findings identify PXDN as a previously unrecognized immune evasion factor and a potential target to improve
Hsu‐Min Sung, David Bickel, Lena C. M. Krause, Daria Ezeriņa, Christian Ickes, Julian Wojtachnia, Christine S. Gibhardt, Magdalena Shumanska, Khadija Wahni, Andrea Paluschkiwitz, Julia Malo Pueyo, Ekaterina Baranova, Wim Vranken, Hedwig Stanisz, Ioana Stejerean‐Todoran, Michael P. Schön, Joris Messens, Ivan Bogeski   +17 more
wiley   +1 more source

Parallel Cholesky Decomposition and Its Application Based on GPU [PDF]

Jisuanji gongcheng, 2019
In the clMAGMA library of OpenCL parallel computing framework,the large size block parallel method is used in the Cholesky decomposition algorithm,which can not make full use of the high speed local memory of GPU,and there are many data transfers between
SHEN Yan,DAI Yuxing
doaj   +1 more source

Jordan Matrix Decomposition [PDF]

Formalized Mathematics, 2008
We follow the rules: i, j, m, n, k denote natural numbers, K denotes a field, and a, λ denote elements of K. Let us consider K, λ, n. The Jordan block of λ and n yields a matrix over K and is defined by the conditions (Def. 1). (Def. 1)(i) len (the Jordan block of λ and n) = n, (ii) width (the Jordan block of λ and n) = n, and (iii) for all i, j such ...
openaire   +1 more source