We study the neutrino mixing matrix (the MNS matrix) in the seesaw model. By assuming a large mass hierarchy for the heavy right-handed Majorana mass, we show that, in the diagonal Majorana base, the MNS matrix is determined by a unitary matrix, S, which transforms the neutrino Yukawa matrix, yν , into a triangular form, y△. The mixing matrix of light leptons is VKMS ′∗ , where VKM ≡ VLe VLν an...

for a fixed positive integer , we say a ring with identity is n-generalized right principally quasi-baer, if for any principal right ideal of , the right annihilator of is generated by an idempotent. this class of rings includes the right principally quasi-baer rings and hence all prime rings. a certain n-generalized principally quasi-baer subring of the matrix ring are studied, and connections...

Superregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has a zero determinant unless it is trivially zero due to the lower triangular structure. In this paper, we discuss how superregular matrices may be used to cons...

in this paper, the notions of $(t,s)$-composition matrix and$(t,s)$-interval-valued intuitionistic fuzzy equivalence matrix areintroduced where $(t,s)$ is a dual pair of triangular module. theyare the generalization of composition matrix and interval-valuedintuitionistic fuzzy equivalence matrix. furthermore, theirproperties and characterizations are presented. then a new methodbased on $tilde{...

We show that the use of a matrix inversion scheme based on a special lower triangular-upper triangular factorization rather than on the standard Gaussian elimination significantly improves the numerical stability of T-matrix computations for nonabsorbing and weakly absorbing nonspherical particles. As a result, the maximum convergent size parameter for particles with small or zero absorption ca...

We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the coefficient matrix is a series with matrix coefficients, and provide a characterization for when the matrix series is regular based on the algebraic variety of an ...

A large portion of Linear algebra (scientific computing) is devoted to accelerate computationally intensive operations through the deeper understanding on the structure of the matrix. While it is not extremely hard to obtain an analytical solutions for the problems of interest, often a large-size matrix or repetetive nature of the computations prohibit us from getting the actual solution in num...