关于双特征Beltrami方程

该文研究空间Ｂｅｌｔｒａｍｉ方程的推广形式，即双特征Ｂｅｌｔｒａｍｉ方程．利用外微分形式与矩阵的外代数等工具，将双特征Ｂｅｌｔｒａｍｉ方程转化为一个非齐次的狆 调和方程，转化过程中只用到加于特征矩阵的一致椭圆型条件．然后验证了算子犃满足的条件：Ｌｉｐｓｃｈｉｔｚ型条件、单调不等式、齐次性条件以及算子犅满足的控制增长条件．并利用得到的狆 调和方程，给出了双特征Ｂｅｌｔｒａｍｉ方程广义解分量函数的弱单调性结果．     

Multi-sample cluster analysis using Akaike's Information Criterion

Summary Multi-sample cluster analysis, the problem of grouping samples, is studied from an information-theoretic viewpoint via Akaike's Information Criterion (AIC). This criterion combines the maximum value of the likelihood with the number of parameters used in achieving that value. The multi-sample cluster problem is defined, and AIC is developed for this problem. The form of AIC is derived in both the multivariate analysis of variance (MANOVA) model and in the multivariate model with varying mean vectors and variance-covariance matrices. Numerical examples are presented for AIC and another criterion calledw-square. The results demonstrate the utility of AIC in identifying the best clustering alternatives. This research was supported by Office of Naval Research Contract N00014-80-C-0408, Task NR042-443 and Army Research Office Contract DAAG 29-82-K-0155, at the University of Illinois at Chicago.     

Concerning Difference Matrices

Several new constructions for difference matrices are given. One classof constructions uses pairwise balanced designs to develop newdifference matrices over the additive group of GF (q). A second class of constructions gives difference matrices overgroups whose orders are not (necessarily) prime powers.     

Approximating dominant singular triplets of large sparse matrices via modified moments

A procedure for determining a few of the largest singular values and corresponding singular vectors of large sparse matrices is presented. Equivalent eigensystems are solved using a technique originally proposed by Golub and Kent based on the computation of modified moments. The asynchronicity in the computations of moments and eigenvalues makes this method attractive for parallel implementations on a network of workstations. Although no obvious relationship between modified moments and the corresponding eigenvectors is known to exist, a scheme to approximate both eigenvalues and eigenvectors (and subsequently singular values and singular vectors) has been produced. This scheme exploits both modified moments in conjunction with the Chebyshev semi-iterative method and deflation techniques to produce approximate eigenpairs of the equivalent sparse eigensystems. The performance of an ANSI-C implementation of this scheme on a network of UNIX workstations and a 256-processor Cray T3D is presented.This research was supported in part by the National Science Foundation under grant numbers NSF-ASC-92-03004 and NSF-ASC-94-11394.     

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.     

Nearly Linear Time Algorithms for Permutation Groups: An Interplay Between Theory and Practice

We survey polynomial time algorithms (both deterministic and random) for computations with permutation groups. Particular emphasis is given to algorithms with running time of the form O(n log ^c |G|), where G is a permutation group of degree n. In the case of small-base groups, i.e., when log |G| is polylogarithmic as a function of n, such algorithms run in nearly linear, O(n log^c' n) time. Important classes of groups, including all permutation representations of simple groups except the alternating ones, as well as most primitive groups, belong to this category. For large n, the majority of practical computations is carried out on small-base groups.In the last section, we present some new nearly linear time algorithms, culminating in the computation of the upper central series in nilpotent groups.     

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.