Time Asymptotic Behaviour for a One-Velocity Transport Operator with Maxwell Boundary Condition

This paper is concerned with the spectral analysis of a one-velocity transport operator with Maxwell boundary condition in L ₁-space. After a detailed spectral analysis it is shown that the associated Cauchy problem is governed by a C ₀-semigroup. Next, we discuss the irreducibility of the transport semigroup. In particular, we show that the transport semigroup is irreducible. Finally, a spectral decomposition of the solutions into an asymptotic term and a transient one which will be estimated for smooth initial data is given.     

A mathematical model of the ring-spinning process

This paper develops a mathematical model of the ring-spinning process that takes into account its non-stationary nature. A complex system of differential equations is obtained, which from a mathematical point of view constitutes a ‘free-boundary’ problem. Its solution involves definition of suitable boundary conditions related to the mechanical characteristics of the process and of the spinning machine itself. The boundary conditions which determine the solution are pointed out. A numerical solution of the system of differential equations can be obtained by the Finite-Segments method, as shown in an example.     

一类非对称椭圆问题瀑布型多重网格法

本将瀑布型多重网格法用于求解非对称椭圆边值问题，数值结果表明算法是有效的。     

A note on stability of the Douglas splitting method

In this note some stability results are derived for the Douglas splitting method. The relevance of the theoretical results is tested for an advection-reaction equation.

     

Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices

The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements. Max characterizations for this sum are established, giving a concise characterization of the subdifferential in terms of a dual matrix. This leads to a very useful characterization of the generalized gradient of the following convex composite function: the sum of the largest eigenvalues of a smooth symmetric matrix-valued function of a set of real parameters. The dual matrix provides the information required to either verify first-order optimality conditions at a point or to generate a descent direction for the eigenvalue sum from that point, splitting a multiple eigenvalue if necessary. Connections with the classical literature on sums of eigenvalues and eigenvalue perturbation theory are discussed. Sums of the largest eigenvalues in the absolute value sense are also addressed.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.The work of this author was supported by the National Science Foundation under grants CCR-8802408 and CCR-9101640.The work of this author was supported in part during a visit to Argonne National Laboratory by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under contract W-31-109-Eng-38, and in part during a visit to the Courant Institute by the U.S. Department of Energy under Contract DEFG0288ER25053.     

凸集的广义Reuleaux三角形

常宽凸集的面积最小者为Reulaux三角形，而非常宽凸集的面积最小者为何呢？它就是本文将给出的广义Reuleaux三角形△R。     

Banach空间中凸映照的增长定理

本文利用凸映照的几何特征证明了一般复Banach空间中单位球上正规化双全纯凸映照的增长定理，即||f(x)||≤||x||/(1-||x||),A↓x∈B，对复内积空间，上述估计是最佳的。     

Differential subordinations concerning starlike functions

Denote byS ^* (⌕), (0≤⌕<1), the family consisting of functionsf(z)=z+a ₂z²+...+a_nzⁿ+... that are analytic and starlike of order ⌕, in the unit disc ⋎z⋎<1. In the present article among other things, with very simple conditions on μ, ⌕ andh(z) we prove the f’(z) (f(z)/z)^μ−1<h(z) implies f∈S^*(⌕). Our results in this direction then admit new applications in the study of univalent functions. In many cases these results considerably extend the earlier works of Miller and Mocanu [6] and others.     

球约束凸二次规划的一个新算法

首先利用Lagrange对偶 ,将球约束凸二次规划问题转化为无约束优化问题 ,然后运用单纯形法求解无约束优化问题 ,从而获得原问题的最优解     

A note on an SOR-like method for augmented systems

Golub et al. (2001, BIT, 41, 71–85) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method.