Related papers: Reduced form of a Mueller matrix
Our goal here is to see the space of matrices of a given size from a geometric and topological perspective, with emphasis on the families of various ranks and how they fit together. We pay special attention to the nearest orthogonal…
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from the observed sum. Such additive decompositions have…
We experimentally investigate the depolarizing power and the polarization entropy of a broad class of scattering optical media. By means of polarization tomography, these quantities are derived from an effective Mueller matrix, which is…
Motivated by Hirano-Tominaga's work \cite{HT} on rings for which every element is a sum of two idempotents and by de Seguins Pazzis's results \cite{de} on decomposing every matrix over a field of positive characteristic as a sum of…
This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which…
A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.
We first propose a concise singular value decomposition of dual matrices. Then, the randomized version of the decomposition is presented. It can significantly reduce the computational cost while maintaining the similar accuracy. We analyze…
The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…
Reed Muller (RM) codes are known for their good minimum distance. One can use their structure to construct polar-like codes with good distance properties by choosing the information set as the rows of the polarization matrix with the…
Simple deformations, with a parameter $\epsilon$, of classical $R$-matrices which follow from decomposition of appropriate Lie algebras, are considered. As a result nonstandard Lax representations for some well known integrable systems are…
The Mueller-Stokes formalism which governs conventional polarization optics is formulated for plane waves, and thus the only qualification one could demand of a $4\times 4$ real matrix $M$ in order that it qualifies to be the Mueller matrix…
The vectorial evolution of polarized light interaction with a medium can reveal its microstructure and anisotropy beyond what can be obtained from scalar light interaction. Anisotropic properties (diattenuation, retardance, and…
Formulae for the matrix element squared of the process e gamma -> e gamma with all four particles polarized are obtained using REDUCE.
We calculate all the elements of the Mueller matrix, which contains all the polarization properties of light scattered from a two-dimensional randomly rough lossy metal surface. The calculations are carried out for arbitrary angles of…
Mueller matrices are defined with respect to appropriate Cartesian reference frames for the representation of the states of polarization of the input and output electromagnetic waves. The polarimetric quantities that are invariant under…
This paper presents a parametrization of a degenerate density matrix. The problem needs to be approached first with a diagonalized form (the spectral representation) to deal with degeneracy. Such a form is useful for this parametrization in…
V.I. Arnold [Russian Math. Surveys 26 (2) (1971) 29-43] constructed a miniversal deformation of matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced…
A modeling methodology and matrix formalism is presented that permits analysis of arbitrarily complex interferometric waveguide systems, including polarization and backreflection effects. Considerable improvement results from separation of…
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…
A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each…