Root subsystems of loop extensions

We completely classify the real root subsystems of root systems of loop algebras of Kac–Moody Lie algebras. This classification involves new notions of “admissible subgroups” of the coweight lattice of a root system Ψ, and “scaling functions” on Ψ. Our results generalise and simplify earlier work on subsystems of real affine root systems.     

Enhanced Dynkin diagrams and Weyl orbits

The root system Σ of a complex semisimple Lie algebra is uniquely determined by its basis (also called a simple root system). It is natural to ask whether all homomorphisms of root systems come from homomorphisms of their bases. Since the Dynkin diagram of Σ is, in general, not large enough to contain the diagrams of all subsystems of Σ, the answer to this question is negative. In this paper we introduce a canonical enlargement of a basis (called an enhanced basis) for which the stated question has a positive answer. We use the name an enhanced Dynkin diagram for a diagram representing an enhanced basis. These diagrams in combination with other new tools (mosets, core groups) allow us to obtain a transparent picture of the natural partial order between Weyl orbits of subsystems in Σ. In this paper we consider only ADE root systems (i.e., systems represented by simply laced Dynkin diagrams). The general case will be the subject of the next publication.     

一类五次多项式系统原点等时中心的分析

研究了一类五次系统原点复等时中心的问题.先通过一种最新算法求出了这类五次系统原点的周期常数,从而得到复等时中心的必要条件,并利用一些有效途径证明它们的充分性.这实际上解决了这类五次系统的伴随系统原点等时中心问题与其自身为实系统时鞍点可线性化的问题.     

Modeling opinion formation in the kinetic theory of active particles I: spontaneous trend

The kinetic theory of active particles is used to model the formation and evolution of opinions in a structured population. The spatial structure is modeled by a network whose nodes mimic the geographic distribution of individuals, while the functional subsystems present in each node group together elements sharing a common orientation. In this paper we introduce a model, based on nonlinear and nonlinearly additive interactions among individuals, subsystems and nodes, related to the spontaneous evolution of opinion concerning given specific issues. Numerical solutions in a model situation not related with real data show how the mutual interactions are able to drive the subsystems opinion toward the emergence of collective structures characterizing this kind of complex systems.     

The Waveform Relaxation method for systems of differential/algebraic equations

This paper reports efforts towards establishing a parallel numerical algorithm known as Waveform Relaxation (WR) for simulating large systems of differential/algebraic equations. The WR algorithm was established as a relaxation based iterative method for the numerical integration of systems of ODEs over a finite time interval. In the WR approach, the system is broken into subsystems which are solved independently, with each subsystem using the previous iterate waveform as “guesses” about the behavior of the state variables in other subsystems. Waveforms are then exchanged between subsystems, and the subsystems are then resolved repeatedly with this improved information about the other subsystems until convergence is achieved.

In this paper, a WR algorithm is introduced for the simulation of generalized high-index DAE systems. As with ODEs, DAE systems often exhibit a multirate behavior in which the states vary as differing speeds. This can be exploited by partitioning the system into subsystems as in the WR for ODEs. One additional benefit of partitioning the DAE system into subsystems is that some of the resulting subsystems may be of lower index and, therefore, do not suffer from the numerical complications that high-index systems do. These lower index subsystems may therefore be solved by less specialized simulations. This increases the efficiency of the simulation since only a portion of the problem must be solved with specially tailored code. In addition, this paper established solvability requirements and convergence theorems for varying index DAE systems for WR simulation.     

Adaptive partitioning techniques for ordinary differential equations

Many stiff systems of ordinary differential equations (ODEs) modeling practical problems can be partitioned into loosely coupled subsystems. In this paper the objective of the partitioning is to permit the numerical integration of one time step to be performed as the solution of a sequence of small subproblems. This reduces the computational complexity compared to solving one large system and permits efficient parallel execution under appropriate conditions. The subsystems are integrated using methods based on low order backward differentiation formulas.This paper presents an adaptive partitioning algorithm based on a classical graph algorithm and techniques for the efficient evaluation of the error introduced by the partitioning.The power of the adaptive partitioning algorithm is demonstrated by a real world example, a variable step-size integration algorithm which solves a system of ODEs originating from chemical reaction kinetics. The computational savings are substantial. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 65L06, 65Y05     

Some Combinatorial Results for Complex Reflection Groups

In this paper, we prove that a simple system for a subsystem Ψ of the complex root system Φ can always be chosen as a subset of the positive system Φ⁺of Φ. Furthermore, we show that a set of distinguished coset representatives can be found for every reflection subgroup of the complex reflection groups. The corresponding results for real crystallographic root systems and their reflection groups (i.e., Weyl groups) are well known (see [9]).     

有理分式的增广图示及其在工程控制论中的应用

本文研究有理分式的增广图示,分子分母分别为n及m次多项式的有理分式,它的根轨迹方程的次数,当n+m是偶数时,是y2的(n+m)/2-1次;当n+m是奇数时,是(n+m-1)/2次.因此,n+m≤10的图示数据能用公式计算有理分式的增广图示能应用于研究反馈系统及特征方程的任一实系数作参数的图线特性.用本文理论易证倒分式定理:K₁=f(n)(s)/(F)(m)(s),与K₂=F(m)(s)/f(n)(s)二者在复数平面上的根轨迹完全相同又由图示知识发现,不论n和m多大,只要有理分式的零点和极点在实轴上相间排列,它就没有复数根轨迹,这样的系统不会发生振荡,本文对这种分式可能存在的稳定区作较全面地分析.     

Merging covering arrays and compressing multiple sequence alignments

Covering arrays have been extensively studied, in part because of their applications in testing interacting software components. In this setting, fast and flexible methods are needed to construct covering arrays of close-to-minimum size. However testing scenarios often impose additional structure on the tests that can be selected. We extend a greedy method to construct test suites for complex systems that have a hierarchical structure in which components combine to form subsystems, which in turn form larger subsystems, until the entire system is formed. The algorithm for merging covering arrays that we propose is then shown to have further potential application in the compression of multiple sequence alignments of genomic data.     

Bifurcations on a spring-pendulum oscillator

In this paper we study experimentally the dynamics of a non linear system: a spring pendulum coupled to an oscillator. The system was tested using a hybrid technique called Real Time Dynamic Substructuring (RTDS)[1, 2]. RTDS is a testing technique that involves splitting the system under study into two subsystems: one will be physically tested (physical substructure) and the other will be simulated in the computer (numerical model). These substructures interact in real time through a set of transfer systems. RTDS is a very powerful experimental methodology that not only allows full scale and real time testing but also real-time bifurcation tracking in complex engineering systems [3, 4]. In our hybrid experiment the spring pendulum is taken to be the physical substructure while oscillator is the simulated numerical model. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian

We study the average complexity of certain numerical algorithms when adapted to solving systems of multivariate polynomial equations whose coefficients belong to some fixed proper real subspace of the space of systems with complex coefficients. A particular motivation is the study of the case of systems of polynomial equations with real coefficients. Along these pages, we accept methods that compute either real or complex solutions of these input systems. This study leads to interesting problems in Integral Geometry: the question of giving estimates on the average of the normalized condition number along great circles that belong to a Schubert subvariety of the Grassmannian of great circles on a sphere. We prove that this average equals a closed formula in terms of the spherical Radon transform of the condition number along a totally geodesic submanifold of the sphere.     

On Decomposition of Algebraic PDE Systems into Simple Subsystems

In this paper we present an algorithmization of the Thomas method for splitting a system of partial differential equations and (possibly) inequalities into triangular subsystems whose Thomas called simple. The splitting algorithm is applicable to systems whose elements are differential polynomials in unknown functions and polynomials in independent variables. Simplicity properties of the subsystems make easier their completion to involution. Our algorithmization uses algebraic Gröbner bases to avoid some unnecessary splittings.     

Discretized Multisplitting AOR Waveform Relaxation Algorithms for Initial Value Problem of Systems of ODEs

1.IntroductionInthedevelopmentofnewelectricalcircuits,thesimulationofthebehaviourofthecircuithasbecomeanessentialtoolforelectricalengineers.Fromthelayoutofthecircuitanonlinearsystemofordinarydifferentialequationsisgeneratedwhichdescribesthedynamicalbehaviourofthecircuit.Inthesimulationofverylargescaleintegrated(VLSI)circuitsthedimensionofthesystemofODEscanbecomeverylarge.Moreoversincethesystemisstiff,solvingthesesystemsisaverycomputionallyintensivetaskandtheuseofsupercomputersbecomesin-evit…     

Computation of roots of real and complex matrices

An algorithm is presented in this paper by which the rth root of real or complex matrices can be found without the computation of the eigenvalues and eigenvectors of the matrix. All required computations are in the real domain. The method is based on the Newton-Raphson algorithm and is capable of finding roots even when the matrix is defective. Computing the root of a matrix from eigenvalues and eigenvectors would be the preferred method if these data were available.     

Feasible partition problem in reverse convex and convex mixed-integer programming

In this paper we consider the consistent partition problem in reverse convex and convex mixed-integer programming. In particular we will show that for the considered classes of convex functions, both integer and relaxed systems can be partitioned into two disjoint subsystems, each of which is consistent and defines an unbounded region. The polynomial time algorithm to generate the partition will be proposed and the algorithm for a maximal partition will also be provided.     

Extendability Of Solutions To Autonomous Polynomial Differential SystemsExtendability Of Solutions To Autonomous Polynomial Differential Systems

We consider real and complex autonomous polynomial differential systems, both ordinary and completely solvable ones. We prove that in the case of the general position, solutions to these systems are not infinitely extendable in all independent variables. In addition, we give the proper examples.     

Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres

In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowing pre-emption are also presented.     

A reduced FE formulation based on POD method for hyperbolic equations

A proper orthogonal decomposition (POD) method was successfully used in the reduced-order modeling of complex systems. In this paper, we extend the applications of POD method, namely, apply POD method to a classical finite element (FE) formulation for second-order hyperbolic equations with real practical applied background, establish a reduced FE formulation with lower dimensions and high enough accuracy, and provide the error estimates between the reduced FE solutions and the classical FE solutions and the implementation of algorithm for solving reduced FE formulation so as to provide scientific theoretic basis for service applications. Some numerical examples illustrate the fact that the results of numerical computation are consistent with theoretical conclusions. Moreover, it is shown that the reduced FE formulation based on POD method is feasible and efficient for solving FE formulation for second-order hyperbolic equations.     

Optimal control of impulsive switched systems with minimum subsystem durations

This paper presents a new computational approach for solving optimal control problems governed by impulsive switched systems. Such systems consist of multiple subsystems operating in succession, with possible instantaneous state jumps occurring when the system switches from one subsystem to another. The control variables are the subsystem durations and a set of system parameters influencing the state jumps. In contrast with most other papers on the control of impulsive switched systems, we do not require every potential subsystem to be active during the time horizon (it may be optimal to delete certain subsystems, especially when the optimal number of switches is unknown). However, any active subsystem must be active for a minimum non-negligible duration of time. This restriction leads to a disjoint feasible region for the subsystem durations. The problem of choosing the subsystem durations and the system parameters to minimize a given cost function is a non-standard optimal control problem that cannot be solved using conventional techniques. By combining a time-scaling transformation and an exact penalty method, we develop a computational algorithm for solving this problem. We then demonstrate the effectiveness of this algorithm by considering a numerical example on the optimization of shrimp harvesting operations.     

An Exact Solution Method for Reliability Optimization in Complex Systems

Systems reliability plays an important role in systems design, operation and management. Systems reliability can be improved by adding redundant components or increasing the reliability levels of subsystems. Determination of the optimal amount of redundancy and reliability levels among various subsystems under limited resource constraints leads to a mixed-integer nonlinear programming problem. The continuous relaxation of this problem in a complex system is a nonconvex nonseparable optimization problem with certain monotone properties. In this paper, we propose a convexification method to solve this class of continuous relaxation problems. Combined with a branch-and-bound method, our solution scheme provides an efficient way to find an exact optimal solution to integer reliability optimization in complex systems. This research was partially supported by the Research Grants Council of Hong Kong, grants CUHK4056/98E, CUHK4214/01E and 2050252, and the National Natural Science Foundation of China under Grants 79970107 and 10271073.