The Linear Rational Pseudospectral Method with Preassigned Poles

We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method.     

直接求线性规划可行基的一种方法

本文给出直接求线性规划问题基可行解的一种简易方法,该方法既避免了引入人工变量,减少存储,一般又能较快地得到一个较好的基可行解.     

Flow Search Approach and New Bounds for the m-Step Linear Conjugate Gradient Algorithm

A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones.     

The Ends of Manifolds with Bounded Geometry, Linear Growth and Finite Filling Area

We prove that simply connected open manifolds of bounded geometry, linear growth and sublinear filling growth (e.g. finite filling area) are simply connected at infinity.     

Robust Output Tracking Control of an Uncertain Linear System via a Modified Optimal Linear-Quadratic Method

This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness.     

On the concept of point value in the infinite-dimensional realization theory

In this article, we study the effect of the chosen representation of a point value (and point evaluation) on the class of periodic signals realizable using a certain type of infinite-dimensional linear system. By suitably representing the point evaluation at the origin in a Hilbert space, we are able to give a complete characterization of its extensions. These extensions involve a new concept called δ-sequence, the use of which as an observation operator of an infinite-dimensional linear system is studied in this article. In particular, we consider their use in the realization of periodic signals. We also investigate how the use of δ-sequences affects the convergence properties of such realizations; we consider the rate and character of convergence and the removal of the Gibbs phenomenon. As still a further demonstration of the significance of the chosen concept of a point value, we discuss the use of distributional point values in the realization of periodic distributions. The possible applications of this work lie in regulator problems of infinite-dimensional control theory, as is indicated by the well-known internal model principle.     

应用无衍射贝塞尔光束的固体线膨胀系数测量系统

测量固体线膨胀系数是工程设计中的一项重要工作。这套非接触固体线膨胀系数测量系统利用激光三角法进行了设计。通过采用线阵CCD作为信号传感器来实现自动化测量。通过采用无衍射贝塞尔光束来提高测量精度和增大测量范围。     

Separating the solution sets of analytical and polynomial systems

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, respectively) functions of the index on this interval. This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system. Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. Research supported by CONACyT of Mexico, Grant 130036. Research partially supported by CONACyT of Mexico, Grant 44003.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

Numerical analysis of a model of cure process for composites

We consider a composite material composed of fibres included in a resin which becomes solid when it is heated up (reaction of reticulation). The mathematical modelling of the cure process is given by a kinetic equation describing the evolution of the reaction of reticulation coupled with the heat equation. In this paper, we are interested in the computation of approximate solutions. We propose a family of discretized problems depending on two parameters (β₁, β₂) ε [0, 1]² which split the linear and non‐ linear terms in implicit and explicit parts. We prove the stability and convergence of the discretization for any (β₁, β₂) ε [½, 1 ] × [0, 1]. We present also some numerical results. Copyright © 2006 John Wiley & Sons, Ltd.