We present a practical and efficient means to compute the singular value decomposition (svd) of a quaternion matrix A based on bidiagonalization of A to a real bidiagonal matrix B using quaternionic Householder transformations. Computation of the svd of B using an existing subroutine library such as lapack provides the singular values of A. The singular vectors of A are obtained trivially from ...

Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed random object is caused by regular variation of components of the original random structure. In this paper we build up on previous work and derive results in t...

Figure 1: A comparison of dual quaternion skinning with previous methods: log-matrix blending Cordier and Magnenat-Thalmann 2005 and. Dual quaternions a generalization of regular quaternions invented. Techdocslcoterrors.pdf.Figure 1: A comparison of dual quaternion skinning with previous methods: log-matrix. Closed-form approximation, based on dual quaternions a general.Skinning with Quaternion...

I Transformations and Projections 5 2 Camera Models 5 3 Plane to plane transformations 9 3.1 Plane projectivities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.2 Homogeneous line representation . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.3 Duality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.4 Projective tra...

We apply generalized Bogoliubov transformations to the transfer matrix of relativistic field theories regularized on a lattice. We derive the conditions these transformations must satisfy to factorize the transfer matrix into two terms which propagate fermions and antifermions separately, and we solve the relative equations under some conditions. We relate these equations to the saddle point ap...

This paper describes two methods for computing the invariant subspace of a matrix. The rst method involves using transformations to interchange the eigenvalues. The matrix is assumed to be in Schur form and transformations are applied to interchange neighboring blocks. The blocks can be either one by one or two by two. The second method involves the construction of an invariant subspace by a di...

Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed random object is caused by regular variation of components of the original random structure. In this paper we build on previous work, and derive results in the...

We study the optimal design of graph filters (GFs) to implement arbitrary linear transformations between graph signals. GFs can be represented by matrix polynomials of the graph-shift operator (GSO). Since this operator captures the local structure of the graph, GFs naturally give rise to distributed operators. In most setups the GSO is given, so that GF design consists fundamentally in choosin...