对称正交反对称矩阵反问题解存在的条件

矩阵反问题和矩阵特征值反问题在科学和工程技术中具有广泛的应用,有关它们的研究已取得了许多进展[1,2].[3]和[4]分别研究了反对称矩阵反问题和双反对称矩阵特征值反问题等.本文研究一类更广泛的对称正交反对称矩阵反问题.用Rn×m（Cn×m）表示n×m实（复）矩阵的全体,ASRn×n表示n阶反对称矩阵的全体,ABSRn×n表示n阶双反对称矩阵的全体,ORn×n表示n阶正交矩阵的全体.A+表示矩阵A的Moore-Penrose广义逆.In表示n阶单位矩阵.ei表示n阶单位矩阵的第i列,Sn=[en,en-1,     

Multiscale kernels

This paper reconstructs multivariate functions from scattered data by a new multiscale technique. The reconstruction uses standard methods of interpolation by positive definite reproducing kernels in Hilbert spaces. But it adopts techniques from wavelet theory and shift-invariant spaces to construct a new class of kernels as multiscale superpositions of shifts and scales of a single compactly supported function φ. This means that the advantages of scaled regular grids are used to construct the kernels, while the advantages of unrestricted scattered data interpolation are maintained after the kernels are constructed. Using such a multiscale kernel, the reconstruction method interpolates at given scattered data. No manipulations of the data (e.g., thinning or separation into subsets of certain scales) are needed. Then, the multiscale structure of the kernel allows to represent the interpolant on regular grids on all scales involved, with cheap evaluation due to the compact support of the function φ, and with a recursive evaluation technique if φ is chosen to be refinable. There also is a wavelet-like data reduction effect, if a suitable thresholding strategy is applied to the coefficients of the interpolant when represented over a scaled grid. Various numerical examples are presented, illustrating the multiresolution and data compression effects.     

Discrete approximation of integral operators

A method to approximate the eigenvalues of linear operators depending on an unknown distribution is introduced and applied to weighted sums of squared normally distributed random variables. This area of application includes the approximation of the asymptotic null distribution of certain degenerated U- and V-statistics.

     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

Variational extension of the mean spherical approximation to arbitrary dimensions

We generalize a variational principle for the mean spherical approximation for a system of charged hard spheres in 3D to arbitrary dimensions. We first construct a free energy variational trial function from the Debye-Hückel excess charging internal energy at a finite concentration and an entropy obtained at the zero-concentration limit by thermodynamic integration. In three dimensions the minimization of this expression with respect to the screening parameter leads to the mean spherical approximation, usually obtained by solution of the Ornstein-Zernike equation. This procedure, which interpolates naturally between the zero concentration/coupling limit and the high-concentration/ coupling limit, is extended to arbitrary dimensions. We conjecture that this result is also equivalent to the MSA as originally defined, although a technical proof of this point is left for the future. The Onsager limitT ΔS ^MSA /ΔE ^MSA → 0 for infinite concentration/coupling is satisfied for all d ≠ 2, while ford=2 this limit is 1. On leave from Department of Physics, University of Puerto Rico, Mayagüez Campus, Mayagüez, Puerto Rico, 00681.     

总延误问题顺时安排法的性能比

给定一组工件的加工时间与工期，要求确定这些工件在一台机器上的加．工排列，使相应的总延误达到最小，这就是总延误问题．该问题在近年已被证明是NP困难的．由Wilkermn和Irwin（1971），林勋（1983）等所研究的顺时安排法能得到相邻交换意义下的局部解．在本文中，我们进一步证明该算法能得到前移邻域意义下的局部解，并确定了该算法的性能比．     

On the topological representation of catalytic cycles with nonlinear steps

Reaction route analysis is applied to visualize reaction networks in several heterogeneous catalytic reactions. Combination of the theory of complex reactions with the notion of catalytic cycles results in a topological representation of complex mechanisms with the nodes comprising all possible surface species including free sites and branches indicating interconnections between reactions.     

Study of photon-induced L3 vacancy alignment for elements La to U

Alignment of photon-induced L₃ vacancies is studied in rare earth and highZ elements at energies of experimental interest, near thresholds to 60 keV, under nonrelativistic dipole approximation. Numerical calculations of the matrix element are undertaken to produce theoretical data for comparison with the experimental findings. The A₂ values being s>0.1 at photoelectron energies <20 keV are certainly higher than 5–8% uncertainties quoted in experimental results. Present findings are from a very basic model, hydrogen-like and can further be treated as reference to observe the impact of screening, relativistic, multipole and retardation corrections to the model     

解可分离约束双凹规划问题的一种外逼近方法[英文]

在本文中，我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件，并构造了一个有限终止外逼近算法。