Irregular sampling, Toeplitz matrices, and the approximation of entire functions of exponential type

In many applications one seeks to recover an entire function of exponential type from its non-uniformly spaced samples. Whereas the mathematical theory usually addresses the question of when such a function in can be recovered, numerical methods operate with a finite-dimensional model. The numerical reconstruction or approximation of the original function amounts to the solution of a large linear system. We show that the solutions of a particularly efficient discrete model in which the data are fit by trigonometric polynomials converge to the solution of the original infinite-dimensional reconstruction problem. This legitimatizes the numerical computations and explains why the algorithms employed produce reasonable results. The main mathematical result is a new type of approximation theorem for entire functions of exponential type from a finite number of values. From another point of view our approach provides a new method for proving sampling theorems.

     

Numerical detection of symmetry breaking bifurcation points with nonlinear degeneracies

A numerical tool for the detection of degenerated symmetry breaking bifurcation points is presented. The degeneracies are classified and numerically processed on -D restrictions of the bifurcation equation. The test functions that characterise each of the equivalence classes are constructed by means of an equivariant numerical version of the Liapunov-Schmidt reduction. The classification supplies limited qualitative information concerning the imperfect bifurcation diagrams of the detected bifurcation points.

     

On the distribution of the length of the longest increasing subsequence of random permutations

The authors consider the length, , of the longest increasing subsequence of a random permutation of numbers. The main result in this paper is a proof that the distribution function for , suitably centered and scaled, converges to the Tracy-Widom distribution of the largest eigenvalue of a random GUE matrix. The authors also prove convergence of moments. The proof is based on the steepest descent method for Riemann-Hilbert problems, introduced by Deift and Zhou in 1993 in the context of integrable systems. The applicability of the Riemann-Hilbert technique depends, in turn, on the determinantal formula of Gessel for the Poissonization of the distribution function of .

     

关于双特征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.     

用波形迭代法分析非均匀多导体传输线的时域响应

本文从频域电报方程出发推出了一个描述传输线ABCD矩阵的微分方程,将传输线时域响应分析从微分方程的边值问题转化为数学上更易求解的初值问题。然后利用波形迭代法数值求解非均匀传输线的ABCD矩阵,证明了一个关于迭代收敛性的定理,并据此采取了旨在加快收敛速度的将传输线分割成许多相互级联的子网络的步骤。传输线的ABCD矩阵求得后,便可借用付里叶变换和卷积技术对具有线性、非线性负载的传输线时域响应进行分析。给出的应用实例表明,诙分析方法是有效而可靠的。     

有耗耦合传输线瞬态响应的性质与分析

本文从频域电报方程出发,推出了一个描述传输线ABCD矩阵的微分方程,并将其解析解展开为矩阵无穷级数,从数学角度严格地推导出了有耗耦合传输线瞬态响应的两条重要性质。从这些级数还可近似计算ABCD矩阵的值。为了提高效率,采取了将传输线分割成许多相互级联的子网络的步骤。文章最后给出了利用ABCD矩阵分析传输线瞬态响应的方法和两应用实例。与经典的频域模式法相比,该方法完全避免了模式分解的复杂过程,因而其计算机程序更简单,节省了大约一半的内存。