This work attempts to give a uniied treatment of sensitivity issues in problems involving the application of-orthogonal transformations. Algorithms for such problems are sometimes implemented with minor variations in the way elementary hyperbolic transformations are used to construct a-orthogonal transformation. This results in a possible variation in the condition of the elementary transformat...

The P, Z, and S properties of a linear transformation on a Euclidean Jordan algebra are generalizations of the corresponding properties of a square matrix on R. Motivated by the equivalence of P and S properties for a Z-matrix [2] and a similar result for Lyapunov and Stein transformations on the space of real symmetric matrices [6], [5], in this paper, we present two results supporting the con...

We introduce a simple uniform structure of elementary Φ-unitary matrices. Elementary Φ-unitary transformations are the extentions of Householder transformations in real and complex spaces with a definite or an indefinite inner product induced by a nonsingular signature matrix Φ. The extentions are found useful in the computations of complex matrices or special structured matrices. For two (comp...

In these notes we study Lorentz transformations and focus on the group of proper, orthochronous Lorentz transformations, donated by L+. (These Lorentz transformations have determinant one and preserve the direction of time.) The 2×2 matrices with determinant one, denoted SL(2, C), play a key role, as there is a map from SL(2,C) onto L+, that is 2-to-1 and a homomorphism. In this correspondence,...

In this paper we describe block algorithms for the reduction of a real symmetric matrix to tridiagonal form and for the reduction of a general real matrix to either bidiagonal or Hessenberg form using Householder transformations. The approach is to aggregate the transformations and to apply them in a blocked fashion, thus achieving algorithms that are rich in matrix-matrix operations. These red...

In this paper we describe block algorithms for the reduction of a real symmetric matrix to tridiagonal form and for the reduction of a general real matrix to either bidiagonal or Hessenberg form using Householder transformations. The approach is to aggregate the transformations and to apply them in a blocked fashion, thus achieving algorithms that are rich in matrix-matrix operations. These red...

In this paper we describe block algorithms for the reduction of a real symmetric matrix to tridiagonal form and for the reduction of a general real matrix to either bidiagonal or Hessenberg form using Householder transformations. The approach is to aggregate the transformations and to apply them in a blocked fashion, thus achieving algorithms that are rich in matrix-matrix operations. These red...

Singular Darboux transformations, in contrast to the conventional ones, have a singular matrix as a coefficient before the derivative. We incorporated such transformations into a chain of conventional transformations and presented determinant formulas for the resulting action of the chain. A determinant representation of the Kohlhoff–von Geramb solution to the Marchenko equation is given. PACS ...

A generalization of Arıkan’s polar code construction using transformations of the form G where G is an l × l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is shown that a large class of such transformations polarize symmetric binary-input memoryless channels.

We consider transformations of normal form games by binding preplay offers of players for payments of utility to other players conditional on them playing designated in the offers strategies. The game-theoretic effect of such preplay offers is transformation of the payoff matrix of the game by transferring payoffs between players. Here we analyze and completely characterize the possible transfo...