COMPOSITE LEGENDRE-LAGUERRE APPROXIMATION IN UNBOUNDED DOMAINS

1. IntroductionMany problems in science aam engineering are set in unbounded domains. There are severalways for their numerical simulatiolls. We may restrict calculations to some bounded domainswith certain artificial boundary conditions. But they induce errors. In particular, they ductshe wave Propagations in revolutionary problems. In opposite, if we use'spectral methods assorted with orthogonal systems of polynomials in Unbounded domains, then we could avoid tabstrouble, e.g., see Mad'ay,…     

概率约束随机规划的一种近似方法及其它的有效解模式

根据最小风险的投资最优问题，我们给出了一个统一的概率约束随机规划模型。随后我们提出了求解这类概率约束随机规划的一种近似算法，并在一定的条件下证明了算法的收敛性。此外，提出了这种具有概率约束多目标随机规划问题的一种有效解模型。     

On the convergence of multipoint Padé-type approximants and quadrature formulas associated with the unit circle

We study the convergence of rational interpolants with prescribed poles on the unit circle to the Herglotz-Riesz transform of a complex measure supported on [–, ]. As a consequence, quadrature formulas arise which integrate exactly certain rational functions. Estimates of the rate of convergence of these quadrature formulas are also included.This research was performed as part of the European project ROLLS under contract CHRX-CT93-0416.     

Competing edge networks

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, subject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other?s growth and encourage the other?s demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.     

Asymptotic approximation for the solution to a semilinear parabolic problem in a thin star‐shaped junction

A semilinear parabolic problem is considered in a thin 3‐D star‐shaped junction that consists of several thin curvilinear cylinders that are joined through a domain (node) of diameter The purpose is to study the asymptotic behavior of the solution u_ε as ε→0, ie, when the star‐shaped junction is transformed in a graph. In addition, the passage to the limit is accompanied by special intensity factors and in nonlinear perturbed Robin boundary conditions. We establish qualitatively different cases in the asymptotic behavior of the solution depending on the value of the parameters {α_i}and {β_i}. Using the multiscale analysis, the asymptotic approximation for the solution is constructed and justified as the parameter ε→0. Namely, in each case, we derive the limit problem (ε=0)on the graph with the corresponding Kirchhoff transmission conditions (untypical in some cases) at the vertex, define other terms of the asymptotic approximation and prove appropriate asymptotic estimates that justify these coupling conditions at the vertex, and show the impact of the local geometric heterogeneity of the node and physical processes in the node on some properties of the solution.     

On two-coefficient identification in elliptic variational inequalities

Abstract

This paper is concerned with elliptic variational inequalities that depend on two parameters. First, we investigate the dependence of the solution of the forward problem on these parameters and prove a Lipschitz estimate. Then, we study the inverse problem of identification of these two parameters and formulate two optimization approaches to this parameter identification problem. We extend the output least-squares approach, provide an existence result and establish a convergence result for finite-dimensional approximation. Further, we investigate the modified output least-squares approach which is based on energy functionals. This latter approach can be related to vector approximation.     

On the solutions of the equation AXB = C under Toeplitz‐like and Hankel matrices constraint

In this paper, we are mainly concerned with 2 types of constrained matrix equation problems of the form AXB=C, the least squares problem and the optimal approximation problem, and we consider several constraint matrices, such as general Toeplitz matrices, upper triangular Toeplitz matrices, lower triangular Toeplitz matrices, symmetric Toeplitz matrices, and Hankel matrices. In the first problem, owing to the special structure of the constraint matrix , we construct special algorithms; necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions. In the second problem, we use von Neumann alternating projection algorithm to obtain the solutions of problem. Then we give 2 numerical examples to demonstrate the effectiveness of the algorithms.     

量子孤子在光纤中的传播特性

利用线性近似和分步傅里叶变换法，分析了量子孤子在无耗光纤中的传播规律.量子孤子在光纤中的行为由量子非线性薛定谔方程（QNSE）描述,用线性近似法求解此方程，将量子噪声与经典部分分离，着重讨论了孤子量子噪声的演化行为，分析了高阶色散对噪声压缩的影响.结果表明：在较短的传输距离内，孤子的压缩性依然存在，但无论初始时压缩参数如何，随着传输距离的增加，压缩比会达到一个极限;在负色散区，三阶色散对压缩效应无影响.     

Bootstrap approximation of nearest neighbor regression function estimates

Let (X, Y) be a random vector in the plane and denote by m(x) = (Y|X = x) the corresponding regression function. We show that the bootstrap approximation for the distribution of a smoothed nearest neighbor estimate of m(x) is valid. Also we compare, by Monte Carlo, confidence intervals which are obtained from both the normal and the bootstrap approximation.     

On the invariant translation approximation property for discrete groups

Recently J.Roe considered the question of whether for a discrete group the reduced group -algebra is the fixed point algebra of Ad acting on the uniform Roe algebra . is said to have the invariant translation approximation property in this case. We consider a slight generalization of this property which, for exact , is equivalent to the operator space approximation property of . We also give a new characterization of exactness and a short proof of the equivalence of exactness of and exactness of for discrete groups.