A Note on Cactus Trees: Variational vs. Recursive Approach

In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent.     

On the advantage over a random assignment

We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

空间斜程能见度的影响因素分析

 空间斜程能见度是空间目标识别的重要参量。水平能见度与大气消光参数有明确的关系，而斜程能见度与大气消光参数、观测方向、太阳天顶角等多种因素有关，目前尚未有明确的结果。从辐射传输理论出发，通过δ-Eddington近似求解辐射传输方程，尝试推导了空间斜程能见度的表达式，探讨了斜程能见度与观察者视角、太阳高度角以及大气光学特性之间的关系。     

Spectral and Pseudospectral Approximations Using Hermite Functions: Application to the Dirac Equation

We consider in this paper spectral and pseudospectral approximations using Hermite functions for PDEs on the whole line. We first develop some basic approximation results associated with the projections and interpolations in the spaces spanned by Hermite functions. These results play important roles in the analysis of the related spectral and pseudospectral methods. We then consider, as an example of applications, spectral and pseudospectral approximations of the Dirac equation using Hermite functions. In particular, these schemes preserve the essential conservation property of the Dirac equation. We also present some numerical results which illustrate the effectiveness of these methods.     

Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

Direct and inverse estimates for a new family of linear positive operators

In the present paper we introduce a new family of linear positive operators and study some direct and inverse results in simultaneous approximation.     

A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces

In this paper, we introduce two iterative schemes by the general iterative method for finding a common element of the set of an equilibrium problem and the set of fixed points of a nonexpansive mapping in a Hilbert space. Then, we prove two strong convergence theorems for nonexpansive mappings to solve a unique solution of the variational inequality which is the optimality condition for the minimization problem. These results extended and improved the corresponding results of Marino and Xu [G. Marino, H.K. Xu, A general iterative method for nonexpansive mapping in Hilbert spaces, J. Math. Anal. Appl. 318 (2006) 43-52], S. Takahashi and W. Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (1) (2007) 506-515], and many others.     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

A new alternating‐direction finite element method for hyperbolic equation

A modified backward difference time discretization is presented for Galerkin approximations for nonlinear hyperbolic equation in two space variables. This procedure uses a local approximation of the coefficients based on patches of finite elements with these procedures, a multidimensional problem can be solved as a series of one‐dimensional problems. Optimal order H₀¹ and L² error estimates are derived. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α δd if every weight is strictly positive,where δd ＞ 0 is a constant depending on the problem dimension and data.