On Linear Inequality Systems with Smooth Coefficients

A linear inequality system with infinitely many constraints is polynomial [analytical] if its index set is a compact interval of the real line and all its coefficients are polynomial [analytical] functions of the index on this interval. This paper provides sufficient conditions for a given closed convex set to be the solution set of a certain polynomial or at least analytical system.The authors are indebted to Dr. J. M. Almira for valuable comments and suggestions.     

Multigrid for the Galerkin least squares method in linear elasticity

In SIAM J. Numer. Anal. 28 (1991) 1680-1697, Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we prove the convergence of a multigrid method. This multigrid is robust in that the convergence is uniform as the parameter ν goes to 1/2. Computational experiments are included.     

Reachability properties of constrained linear systems

This paper presents reachability results for a linear control system and arbitrary terminal pointsp inR ⁿ with controls constrained within a compact setU containing the origin. The well-known results forp=0 are then a special case of our results.Geometric properties of the reachable set are presented and include: general containment properties which describe conditions that guarantee the inclusion of a reachable set in another reachable set; classification of the set of all pointsp that ensure the equivalence of two (different) reachable sets and the properties of this set.The topological properties of the reachable set to a pointp depends on the control setU, the final pointp, and the location of the spectrum of the system in the complex plane. We characterize the geometric properties of the reachable set when the spectrum lies in the closed right-half plane, the open left-half plane, or a combination of both.This work was supported in part by NSF Grant ECS-86-09586.     

Controllability and Observability of Linear Quaternion-valued Systems

The aim of this paper is to define an extension of the controllability and observability for linear quaternion-valued systems (QVS). Some criteria for controllability and observability are derived, and the minimum norm control and duality theorem are also investigated. Compared with real-valued or complex-valued linear systems, it is shown that the classical Caylay-Hamilton Theorem as well as Popov-Belevitch-Hautus (PBH) type controllability and observability test do not hold for linear QVS. Hence, a modified PBH type necessary condition is studied for the controllability and observability, respectively. Finally, some examples are given to illustrate the effectiveness of the obtained results.     

Enhanced intersection cutting-plane approach for linear complementarity problems

In this paper, we develop an enhanced intersection cutting-plane algorithm for solving a mixed integer 0–1 bilinear programming formulation of the linear complementarity problem (LCP). The matrixM associated with the LCP is not assumed to possess any special structure, except that the corresponding feasible region is assumed to be bounded. A procedure is described to generate cuts that are deeper versions of the Tuy intersection cuts, based on a relaxation of the usual polar set. The proposed algorithm then attempts to find an LCP solution in the process of generating either a single or a pair of such strengthened intersection cuts. The process of generating these cuts involves a vertexranking scheme that either finds an LCP solution, or else these cuts eliminate the entire feasible region leading to the conclusion that no LCP solution exists. Computational experience on various test problems is provided.This material is based upon work supported by the National Science Foundation under Grant No. DMII-9121419 to the first author and Grant No. DMII-9114489 to the third author. The authors gratefully acknowledge the constructive suggestions of a referee that helped focus the approach and its presentation.     

Latroids and their representation by codes over modules

It has been known for some time that there is a connection between linear codes over fields and matroids represented over fields. In fact a generator matrix for a linear code over a field is also a representation of a matroid over that field. There are intimately related operations of deletion, contraction, minors and duality on both the code and the matroid. The weight enumerator of the code is an evaluation of the Tutte polynomial of the matroid, and a standard identity relating the Tutte polynomials of dual matroids gives rise to a MacWilliams identity relating the weight enumerators of dual codes. More recently, codes over rings and modules have been considered, and MacWilliams type identities have been found in certain cases.

In this paper we consider codes over rings and modules with code duality based on a Morita duality of categories of modules. To these we associate latroids, defined here. We generalize notions of deletion, contraction, minors and duality, on both codes and latroids, and examine all natural relations among these.

We define generating functions associated with codes and latroids, and prove identities relating them, generalizing above-mentioned generating functions and identities.

     

PSD方法的最优因子及效率分析

在系数矩阵是相容序2循环阵的情况下，本文给出了PSD方法的最优松弛参数和最优收敛因子，分析和讨论了它的实用性，并进而得到了一个新的迭代法，它的最优收敛因子与PSD方法一样，而迭代参数却只有一个．     

离心压气机级三元粘性计算

使用叶片排间隙混合平面概念，完成离心压气机级多叶片排三元N-S方程计算。每个动静叶片排内的流动被认为是定常的且由相对独立的程序段进行运算。这样的串行程序很容易被改造为在并行系统上运行的SPMD并行程序。