Related papers: Parametrizing the mixing matrix : A unified approa…

A simple recursive scheme for parameterisation of n-by-n unitary matrices is presented.

We present further properties of a previously proposed recursive scheme for parameterisation of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study…

Factorization of compact wavelet matrices into primitive ones has been known for more than 20 years. This method makes it possible to generate wavelet matrix coefficients and also to specify them by their first row. Recently, a new…

The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…

We first obtain the most general and compact parametrization of the unitary transformation diagonalizing any 3 by 3 hermitian matrix H, as a function of its elements and eigenvalues. We then study a special class of fermion mass matrices,…

A recent parameterisation scheme developed for the quark mixing matrix is shown to be easily applicable to the lepton mixing matrix as well.

The use of patterns in predictive models is a topic that has received a lot of attention in recent years. Pattern mining can help to obtain models for structured domains, such as graphs and sequences, and has been proposed as a means to…

Despite the flexibility and popularity of mixture models, their associated parameter spaces are often difficult to represent due to fundamental identification problems. This paper looks at a novel way of representing such a space for…

Various Non-negative Matrix factorization (NMF) based methods add new terms to the cost function to adapt the model to specific tasks, such as clustering, or to preserve some structural properties in the reduced space (e.g., local…

In this paper we study a parametrized description of neutrino mixing from a phenomenological point of view. We concentrate on the parametrization in terms of higher order corrections to the leading order mixing matrix. A method to describe…

Techniques of matrix completion aim to impute a large portion of missing entries in a data matrix through a small portion of observed ones. In practice including collaborative filtering, prior information and special structures are usually…

The neutrino mixing matrix is expanded in powers of a small parameter $\lambda$ in tri-bimaximal mixing pattern. We also present some applications of this parametrization, such as to the expression of the Jarlskog parameter $J$. Comparing…

We construct quark mixing matrices within a group theoretic framework which is easily applicable to any number of generations. Familiar cases are retrieved and related, and it is hoped that our viewpoint may have advantages both…

The homography matrix is a key component in various vision-based robotic tasks. Traditionally, homography estimation algorithms are classified into feature- or intensity-based. The main advantages of the latter are their versatility,…

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…

Matrix factorization models are the core of current commercial collaborative filtering Recommender Systems. This paper tested six representative matrix factorization models, using four collaborative filtering datasets. Experiments have…

Advantages of the original symmetrical form of the parametrization of the lepton mixing matrix are discussed. It provides a conceptually more transparent description of neutrino oscillations and lepton number violating processes like…

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…

The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…