Fermilab top mass and modified Fritzsch mass matrices

Fritzsch like mass matrices with non-zero 22-elements both in U sector and D sector have been investigated in the context of latest data regardingm _t ^phys , |V _ub|, |V _cb|, |V _td| and |V _ts|. Unlike several other phenomenological models, the present model not only accommodates the value ofm _t ^phys in the range 150–240 GeV, encompassing the CDF and D0 values, but is also able to reproduce |V _cb| ≊0.040 and |V _ub/V_cb| = 0.08±0.02 and |V _td| is predicted to lie in the range 0.005–0.014. Further, the angles of the unitarity triangle, related to the CP-violating asymmetries, are calculated to be in the ranges −1.0⩽sin2α⩽−0.1, 0.6 ⩽sin2α⩽1.0 and 0.48⩽sin2β⩽0.56, which are in agreement with other recent calculations.     

Symmetrization of matrix technique in a finite element context

A finite element Galerkin-based formulation of the mass conservation and momentum equations can require, if convective type terms are retained in the coefficient matrix, a non-symmetric solver. The resulting increase in core storage for efficient utilization of CPU time can be considerable. The current paper advocates a simple symmetrization of matrix technique, at element level which results in a considerable reduction in core requirement. The increase in CPU time required when solving linear systems of equations is considerable. However, for nonlinear systems the penalty can be negligible.     

Invariant scale matrix hypothesis tests under elliptical symmetry

The usual assumption in multivariate hypothesis testing is that the sample consists of n independent, identically distributed Gaussian m-vectors. In this paper this assumption is weakened by considering a class of distributions for which the vector observations are not necessarily either Gaussian or independent. This class contains the elliptically symmetric laws with densities of the form f(X(n × m)) = ψ[tr(X ? M)′ (X ? M)Σ^?1]. For testing the equality of k scale matrices and for the sphericity hypothesis it is shown, by using the structure of the underlying distribution rather than any specific form of the density, that the usual invariant normal-theory tests are exactly robust, for both the null and non-null cases, under this wider class.     

On an integral over the surface ofN-dimensional unit sphere

An integral which occurs in the new matrix ensembles and the width fluctuation factor is evaluated using a transformation which changes a Gaussian into an exponential. It is expressed in the form of a series whose terms are found using a simple recursion relation. It is shown that the series can be summed in closed form for the two-dimensional case.     

On kaonic hydrogen. Phenomenological quantum field theoretic model revisited

We argue that due to isospin and U-spin invariance of strong low-energy interactions the S-wave scattering lengths a ⁰ ₀ and a ¹ ₀ of ˉN scattering with isospin I = 0 and I = 1 satisfy the low-energy theorem a ⁰ ₀ +3a ¹ ₀ = 0 valid to leading order in chiral expansion. In the model of strong low-energy ˉN interactions at threshold (Eur. Phys. J. A 21, 11 (2004)) we revisit the contribution of the Σ(1750) resonance, which does not saturate the low-energy theorem a ⁰ ₀ +3a ¹ ₀ = 0, and replace it by the baryon background with properties of an SU(3) octet. We calculate the S-wave scattering amplitudes of K^-N and K^-d scattering at threshold. We calculate the energy level displacements of the ground states of kaonic hydrogen and deuterium. The result obtained for kaonic hydrogen agrees well with recent experimental data by the DEAR Collaboration. We analyse the cross-sections for elastic and inelastic K^-p scattering for laboratory momenta 70MeV/c < p _K < 150MeV/c of the incident K^--meson. The theoretical results agree with the available experimental data within two standard deviations.     

On low order moments of the homodyned-K distribution

Fractional low order moments have been reported as beneficial for sampling computations using the K distribution. However, it has been recently pointed out that this it not the case for the homodyned-K distribution for a tissue discrimination problem. In this paper we show that such an statement is not fully justified. To that end, we follow a standard pattern recognition procedure both to determine class separability measures and to classify data with several classifiers. We conclude that the optimum order of the moments is intimately linked to the specific statistical properties of the tissues to be discriminated. Some ideas on how to choose the optimum order are discussed.     

The Distance Between Classical and Quantum Systems

In a recent paper, a “distance” function, , was defined which measures the distance between pure classical and quantum systems. In this work, we present a new definition of a “distance”, D, which measures the distance between either pure or impure classical and quantum states. We also compare the new distance formula with the previous formula, when the latter is applicable. To illustrate these distances, we have used 2 × 2 matrix examples and two-dimensional vectors for simplicity and clarity. Several specific examples are calculated.     

Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph

The accumulation of the Jacobian matrix F of a vector function can be regarded as a transformation of its linearized computational graph into a subgraph of the directed complete bipartite graph K_n,m. This transformation can be performed by applying different elimination techniques that may lead to varying costs for computing F. This paper introduces face elimination as the basic technique for accumulating Jacobian matrices by using a minimal number of arithmetic operations. Its superiority over both edge and vertex elimination methods is shown. The intention is to establish the conceptual basis for the ongoing development of algorithms for optimizing the computation of Jacobian matrices.     

B-Splines with Arbitrary Connection Matrices

We consider a space of Chebyshev splines whose left and right derivatives satisfy linear constraints that are given by arbitrary nonsingular connection matrices. We show that for almost all knot sequences such spline spaces have basis functions whose support is equal to the support of the ordinary B-splines with the same knots. Consequently, there are knot insertion and evaluation algorithms analogous to de Boors algorithm for ordinary splines.     

Newton-Like Iteration Based on a Cubic Polynomial for Structured Matrices

We recall Newtons iteration for computing the inverse or Moore–Penrose generalized inverse of a matrix. Then we specialize this approach to the case of structured matrices where all input, output and intermediate auxiliary matrices are represented in a compressed form, via their short displacement generators. We design a new Newton-like iteration based on a cubic polynomial and show its effectiveness by some numerical experiments for matrices from the Toeplitz-like class and the Cauchy-like class.