Optimizing in the class of Fuller modified limited information maximum likelihood estimators

A general class of Fuller modified maximum likelihood estimators are considered. It is shown that this class possesses finite moments. Asymptotic bias and asymptotic mean squared error are derived using small-σ expansions. A simulation study is carried out to compare different estimators in this class with standard estimators.     

关于Fejer点上的一种复有理型插值的一致逼近阶

设D是一个Jordan,Г为其边界，并设Г满足Aльпер条件。本文得到了一种基于Fejer点的有理型插值算子对于f(z)∈C（Г）的一致逼近阶。     

矩阵方程（A^TXA，B^TXB=（C，D）的反对称解及其最佳逼近

本利用矩阵对的标准相关分解，得到了矩阵方程(A^TXB，B^TXB)=(C，D)反对称解存在的充分必要条件及通解表达式，同时给出了解关于已知矩阵的最佳逼近．     

The supersymmetric WKB approximation of ring-shaped oscillator potential in r and θ dimensions with spherical polar coordinates

According to calculation of the energy spectrum of ring-shape oscillator potential by using the supersymmetric WKB approximation, it is shown that the energy spectrum of some noncentral separable potentials can be exactly obtained in r and θ dimensions by above method.     

Linearized and rational approximation method for solving non‐linear Burgers' equation

A new numerical method called linearized and rational approximation method is presented to solve non‐linear evolution equations. The utility of the method is demonstrated for the case of differentiation of functions involving steep gradients. The solution of Burgers' equation is presented to illustrate the effectiveness of the technique for the solution of non‐linear evolution equations exhibiting nearly discontinuous solutions. Copyright © 2004 John Wiley & Sons, Ltd.     

Construction of best Bregman approximations in reflexive Banach spaces

An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.

     

Eikonal Approximation to 5D Wave Equations and the 4D Space-Time Metric

We apply a method analogous to the eikonal approximation to the Maxwell wave equations in an inhomogeneous anisotropic medium and geodesic motion in a three dimensional Riemannian manifold, using a method which identifies the symplectic structure of the corresponding mechanics, to the five dimensional generalization of Maxwell theory required by the gauge invariance of Stueckelberg's covariant classical and quantum dynamics. In this way, we demonstrate, in the eikonal approximation, the existence of geodesic motion for the flow of mass in a four dimensional pseudo-Riemannian manifold. These results provide a foundation for the geometrical optics of the five dimensional radiation theory and establish a model in which there is mass flow along geodesics. We then discuss the interesting case of relativistic quantum theory in an anisotropic medium as well. In this case the eikonal approximation to the relativistic quantum mechanical current coincides with the geodesic flow governed by the pseudo-Riemannian metric obtained from the eikonal approximation to solutions of the Stueckelberg–Schrödinger equation. The locally symplectic structure which emerges is that of a generally covariant form of Stueckelberg's mechanics on this manifold.     

The Cosmological Constant in the Framework of Gravito-Magnetodynamic Waves in Weak Gravitational Fields

Using the linearization of Einstein's equations for weak gravitational fields, a specific model of gravito-magnetofluid is elaborated. The study of wave formation and propagation in such a medium is necessarily connected to the existence of the cosmological constant.     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.