CDC2000 Numerical Methods in Control

Numerical Methods in Control
Home Full List of Titles 1: Proceedings of CDC2000 Discrete Event Systems Control in Communication Systems Optimal Control and Applications I Optimisation Approaches and Methods Model Predictive Control Advances in Linear Estimation Stochastic and Uncertain Systems Nonlinear Control and Applications Nonlinear Estimation and Filtering Formation Control and its Applications New Approaches to Fuzzy Control Manufacturing Systems Automotive Applications Stability Issues in Hybrid Control Recent Advances in Stochastic Networks Optimal Control and Applications II Robust Controller Design - mu, L1 and H2 Constrained and Receding Horizon Control Identification and Control around the World Markov Decision Processes Nonlinear Optimisation Observers for Nonlinear Systems Motion Planning Neural / Fuzzy Stability and Control Motor Control Control of Quantum Phenomena I Hybrid Systems Methods Control in Communication Networks Robustness and Optimisation Bumpless Transfer, Antiwindup and Saturation Adaptive Control: Linear Systems Estimation and Closed Loop Identification Control of Markov Processes Nonlinear Filtering and Control Modelling, Identification and Validation of Nonlinear Systems Differential Geometric Control Theory for Mechanical Systems Nonlinear Output Feedback Control Pneumatics and Compression Systems Control of Quantum Phenomena II Stability of Hybrid Systems Performance Analysis in Communication Networks Adaptive Control of Nonlinear Systems LMI Methods in Design Robust Control of Time Delay Systems Subspace Identification Methods Nonlinear Stochastic Filtering and Estimation Bifurcations, Chaos and Control I New Progress in Synthesis of Nonlinear Systems I Implementation Issues of Sliding Mode Control Theory Control of Mixing in Shear Flows Novel Neural Network Control Techniques for Industrial Motion Control Systems Physiological Control Systems Optimal Control of Hybrid Systems Stochastic Models for Communication Networks Control and Stabilisation of Nonlinear Systems New Directions in Robust Control Linear Systems Theory Advanced Topics in Systems Theory Estimation in Action Bifurcations, Chaos and Control II New Progress in Synthesis of Nonlinear Systems II Numerical Design and Analysis Techniques for Nonlinear Systems Analysis and Control of Underactuated Systems Sliding Mode Control I Challenges in the Application of Control to Computer Systems Estimation and Diagnosis of Discrete Event Systems Communications and Games Optimal Control Stochastic Systems Model Reduction Methodologies Identification and Subspace Methods Applications of Nonlinear Adaptive Control Advances in Nonlinear Output Feedback Design The Behavioural Approach to Systems and Control Vision Based Estimation and Control: Recent Advances and Open Problems Agile Control of Military Operations Sliding Mode Control II Model-based Fault Diagnosis of Industrial Processes Discrete Event Systems / Petri Nets System Identification and Confidence Estimation New Approaches to H-Infinity Control I Probabilistic Approaches to Robust Control Time Delay System Stabilisation Identification Methods Controlled Stochastic Processes Output Feedback of Nonlinear Systems Topics in Nonlinear Stabilisation Mobile Robots: Tracking Control Robust Control of Nonlinear Systems Power Systems Stabilisation and Control Disk Drive Control Hybrid Control Applications Discrete Time Systems New Approaches to H-Infinity Control II Linear Systems with Saturating Actuators New Theories in Distributed Parameter Systems Applications of Estimation and Identification Stochastic Control and Tuning Methodologies Control of Nonlinear Systems Iterative Learning and Control Coordinating Robot Systems Nonlinear Time Varying Systems Novel Applications of Neural Networks Aerospace Applications Switched Systems Implicit and Descriptor Systems LQG Periodic Systems and Disturbances New Horizons for Distributed Parameter Systems State Estimation Learning and Neuro-Control Nonlinear Control and Stabilisation I Tracking Vision Servoing Controllability of Nonlinear Systems Control of Flexible Systems Electro-Mechanical Systems Robust Control Methods and Applications Fault Detection and Diagnosis Optimisation and Applications Robust Stability Analysis Numerical Methods in Control Filtering in Continuous Time Stochastic Systems Interplay between Control and Signal Processing Fault Detection and Analysis Nonlinear Dynamical Systems Nonlinear Time Delay Systems Computational Issues in Nonlinear Control Disturbance Rejection Process Control Industry Applications Linear Parameter Varying Systems Linear Control Systems Dynamic and Nonlinear Programming Model Reduction Applications New Techniques for Control and Systems: Numerical Linear Algebra Estimation and Identification using Hidden Markov Models Applications of Stochastic Control Topics in Linear Design Nonlinear Control and Stabilisation II Ambulatory Robot Systems Chaotic and Oscillatory Systems Biomedical System Control Integrated Control and CPU Scheduling Linear Design Techniques Adaptive Disturbance / Noise Compensation Nonlinear Model Predictive Control Sensitivity Design, Analysis and Limitations Analysis of Linear Systems Linear Matrix Inequalities in Design Lyapunov's 2nd Method Robotics: Tracking Control Lagrangian and Hamiltonian Theory Variable Structure Control Machine Vision Signal Processing Methods in Control Applied Nonlinear Control Author Index A B C D E F G H I J K L M N O P Q R S T U V W X Y Z	Extraction Of Infinite Zeros Of Polynomial Matrices Authors: Didier Henrion, Javier Ruiz-León, Michael Sebek, Volume: 1, Page 4221 Paper number 1026 Abstract: An algorithm is described for computing the structure at infinity and extracting the infinite zeros of a given polynomial matrix. The algorithm relies on numerically reliable operations only. Applications include computation of the subspace of impulsive solution of a set of linear differential equations, derivation of the Smith form at infinity of a polynomial matrix, or also enhanced computation of the poles of a linear system described by polynomial matrix fractions. The numerical routines described in this paper are implemented in the new release 3.0 of the Polynomial Toolbox for Matlab. CD001026.PDF (From Author) TOP Numerical Solution to H-Infinity Control of Multi-Delayed Systems via Operator Approach Authors: Andrey E. Barabanov, Andrey Ghulchak, Volume: 1, Page 4227 Paper number 1845 Abstract: A computational algorithm for the Full Information H-infinity control problem for multi-delayed LTI systems is derived. The algorithm is based on a new general operator approach in spectral domain developed recently for finite-dimensional LTI plants. A simplicity of spectral operations and explicit formulas for computation make it possible to generalize it to infinite-dimensional plants. In this paper, a complete computational solution for such a plant with several delays in the output, control and disturbance is obtained and illustrated with a simple example. CD001845.PDF (From Author) TOP New Perturbation Bounds for Sylvester Equations Authors: Nicolai D. Christov, Suzanne Lesecq, Mihail M. Konstantinov, Petko Hr. Petkov, Alain Barraud, Volume: 1, Page 4233 Paper number 1040 Abstract: The sensitivity of Sylvester matrix equations relative to perturbations in the coefficient matrices is studied. New local perturbations bounds are obtained. CD001040.PDF (From Author) TOP Computer Algebra for Exact Complex Stability Margin Computation Authors: Nainn-Ping Ke, Volume: 1, Page 4235 Paper number 1446 Abstract: As previous results, multivariable stability margin problem can be formulated as solving polynomial systems by using symbolic computation and stratified Morse theory. Once the solutions are found, the stability margin problem can be easily solved. For complex mu problem, no matter how many uncertainties, there is only one one-dimensional polynomial system which needs to be solved in order to find all singularities to determine whether the boundary of Horowitz template intercept the origin or not. The objective of this paper is to describe how to use Groebner Basis method to solve this polynomial system. Due to the continuity property of complex mu, numerical solutions are good enough for complex mu computation. In addition, we can sample this one-dimensional polynomial system into several zero-dimensional polynomial systems. There are many efficient algorithm to solve these zero-dimensional polynomial systems. Therefore, we have an efficient way of singularity related method to compute exact complex mu. CD001446.PDF (From Author) TOP A Grassmann-Rayleigh Quotient Iteration for Computing Invariant Subspaces Authors: Pierre-Antoine Absil, Robert Mahony, Rodolphe Sepulchre, Paul van Dooren, Volume: 1, Page 4241 Paper number 1663 Abstract: The classical Rayleigh Quotient Iteration (RQI) computes a 1-dimensional invariant subspace of a symmetric matrix A with cubic convergence. We propose a generalization of the RQI which computes a p-dimensional invariant subspace of A. The geometry of the algorithm on the Grassmann manifold Gr(p,n) is developed to show cubic convergence and to draw connections with recently proposed Newton algorithms on Riemannian manifolds. CD001663.PDF (From Author) TOP New Integral Representations and Algorithms for Computing n-th Roots and the Matrix Sector Function of Nonsingular Complex Matrices Authors: Mohammed A. Hasan, Jawad A.K. Hasan, Lucas Scharenbroich, Volume: 1, Page 4247 Paper number 2135 Abstract: It is known that sector switching is a problem of many locally convergent methods for computing the matrix sector function such as Newton�s and Halley�s methods. In this paper, fast convergent and stable algorithms for approximating the matrix sector function and the principal n-th root of complex matrices which avoid these problems are presented. These methods are based on new integral representations of the matrix sector function and the principal n-th root of a complex matrix. The new representations are based on Cauchy integral formula and the residue theorem in analytic function theory. The generalized Householder method for computing the matrix sector function and the principal n-th root of a complex matrix are introduced. Finally, a new matrix decomposition called 'sector factorization' is defined. CD002135.PDF (From Author) TOP Fixed Point Iterations for Computing Square Roots and the Matrix Sign Function of Complex Matrices Authors: Mohammed A. Hasan, Ali A. Hasan, Syed Rahman, Volume: 1, Page 4253 Paper number 2137 Abstract: The purpose of this work has been the development of new set of rational iterations for computing square roots and the matrix sign function of complex matrices. Given any positive integer r>=2, we presented a systematic way of deriving r-th order convergent algorithms for matrix square roots, the matrix sign function,invariant subspaces in different half-planes, and the polar decomposition. We have shown that these iterations are applicable for computing square roots of more general type of matrices than previously reported,such as matrices in which some of its eigenvalues are negative. Also, algorithms for computing square roots and the invariant subspace of a given matrix in any given half-plane are derived. CD002137.PDF (From Author) TOP