Spelling suggestions: "subject:"balanced truncated"" "subject:"alanced truncated""
11 |
Linear Time-Varying Systems: Modeling and ReductionSandberg, Henrik January 2002 (has links)
Linear time-invariant models are widely used in the control community. They often serve as approximations of nonlinear systems. For control purposes linear approximations are often good enough since feedback control systems are inherently robust to model errors. In this thesis some of the possibilities for linear time-varying modeling are studied. In the thesis it is shown that the balanced truncation procedure can be applied to reduce the order of linear time-varying systems. Many of the attractive properties of balanced truncation for time-invariant systems can be generalized into the time-varying framework. For example, it is shown that a truncated input-output stable system will be input-output stable, and computable simple worst-case error bounds are derived. The method is illustrated with model reduction of a nonlinear diesel exhaust catalyst model. It is also shown that linear time-periodic models can be used for analysis of systems with power converters. Power converters produce harmonics in the power grids and give frequency coupling that cannot be modeled with standard time-invariant linear models. With time-periodic models we can visualize the coupling and also use all the available tools for linear time-varying systems, such as balanced truncation. The method is illustrated on inverter locomotives. / QC 20120208
|
12 |
Balanced truncation model reduction for linear time-varying systemsLang, Norman, Saak, Jens, Stykel, Tatjana 05 November 2015 (has links) (PDF)
A practical procedure based on implicit time integration methods applied to the differential Lyapunov equations arising in the square root balanced truncation method is presented. The application of high order time integrators results in indefinite right-hand sides of the algebraic Lyapunov equations that have to be solved within every time step. Therefore, classical methods exploiting the inherent low-rank structure often observed for practical applications end up in complex data and arithmetic. Avoiding the additional effort treating complex quantities, a symmetric indefinite factorization of both the right-hand side and the solution of the differential Lyapunov equations is applied.
|
13 |
Model Reduction for Piezo-Mechanical Systems using Balanced TruncationUddin, Mohammad Monir 07 November 2011 (has links) (PDF)
Today in the scientific and technological world, physical and artificial processes are often described by mathematical models which can be used for simulation, optimization or control. As the mathematical models get more detailed and different coupling effects are required to include, usually the dimension of these models become very large. Such large-scale systems lead to large memory requirements and computational complexity. To handle these large models efficiently in simulation, control or optimization model order reduction (MOR) is essential. The fundamental idea of model order reduction is to approximate a large-scale model by a reduced model of lower state space dimension that has the same (to the largest possible extent) input-output behavior as the original system. Recently, the system-theoretic method Balanced Truncation (BT) which was believed to be applicable only to moderately sized problems, has been adapted to really large-scale problems. Moreover, it also has been extended to so-called descriptor systems, i.e., systems whose dynamics obey differential-algebraic equations. In this thesis, a BT algorithm is developed for MOR of index-1 descriptor systems based on several papers from the literature. It is then applied to the setting of a piezo-mechanical system. The algorithm is verified by real-world data describing micro-mechanical piezo-actuators. The whole algorithm works for sparse descriptor form of the system. The piezo-mechanical original system is a second order index-1 descriptor system, where mass, damping, stiffness, input and output matrices are highly sparse. Several techniques are introduced to reduce the system into a first order index-1 descriptor system by preserving the sparsity pattern of the original models. Several numerical experiments are used to illustrate the efficiency of the algorithm.
|
14 |
Parallel Order Reduction via Balanced Truncation for Optimal Cooling of Steel ProfilesBadía, José M., Benner, Peter, Mayo, Rafael, Quintana-Ortí, Enrique S., Quintana-Ortí, Gregorio, Saak, Jens 06 September 2006 (has links)
We employ two efficient parallel approaches to reduce a model arising from a semi-discretization of a controlled heat transfer process for optimal cooling of a steel profile. Both algorithms are based on balanced truncation but differ in the numerical method that is used to solve two dual generalized Lyapunov equations, which is the major computational task. Experimental results on a cluster of Intel Xeon processors compare the efficacy of the parallel model reduction algorithms.
|
15 |
Novel Model Reduction Techniques for Control of Machine ToolsBenner, Peter, Bonin, Thomas, Faßbender, Heike, Saak, Jens, Soppa, Andreas, Zaeh, Michael 13 November 2009 (has links)
Computational methods for reducing the complexity of Finite Element (FE)
models in structural dynamics are usually based on modal analysis.
Classical approaches such as modal truncation, static condensation
(Craig-Bampton, Guyan), and component mode synthesis (CMS) are
available in many CAE tools such as ANSYS. In other disciplines, different
techniques for Model Order Reduction (MOR) have been developed in the
previous 2 decades. Krylov subspace methods are one possible
choice and often lead to much smaller models than modal truncation
methods given the same prescribed tolerance threshold. They have become
available to ANSYS users through the tool mor4ansys. A disadvantage
is that neither modal truncation nor CMS nor Krylov subspace methods
preserve properties important to control design. System-theoretic
methods like balanced truncation approximation (BTA), on the other
hand, are directed towards reduced-order models for use in closed-loop
control. So far, these methods are considered to be too expensive for
large-scale structural models. We show that recent algorithmic
advantages lead to MOR methods that are applicable to FE models in
structural dynamics and that can easily be integrated into CAE
software. We will demonstrate the efficiency of the proposed MOR
method based on BTA using a control system including as plant the FE
model of a machine tool.
|
16 |
Balanced truncation model reduction for linear time-varying systemsLang, Norman, Saak, Jens, Stykel, Tatjana January 2015 (has links)
A practical procedure based on implicit time integration methods applied to the differential Lyapunov equations arising in the square root balanced truncation method is presented. The application of high order time integrators results in indefinite right-hand sides of the algebraic Lyapunov equations that have to be solved within every time step. Therefore, classical methods exploiting the inherent low-rank structure often observed for practical applications end up in complex data and arithmetic. Avoiding the additional effort treating complex quantities, a symmetric indefinite factorization of both the right-hand side and the solution of the differential Lyapunov equations is applied.:1 Introduction
2 Balanced truncation for LTV systems
3 Solving differential Lyapunov equations
4 Solving the reduced-order system
5 Numerical experiments
6 Conclusion
|
17 |
Hinf-Linear Parameter Varying Controllers Order Reduction : Application to semi-active suspension control / Réduction d'ordre de correcteurs Hinf-linéaires à paramètre variant : Application à la commande d'une suspension semi-activeZebiri, Hossni 03 October 2016 (has links)
L'amélioration permanente de la qualité et des performances des systèmes automatiques constitue un défi majeur dans la théorie du contrôle. La théorieHinf a permis d'améliorer considérablement les performances des correcteurs. Ces derniers reposent sur des modèles mathématiques qui sont potentiellement d'ordre élevé (c.-à-d. comprenant un nombre élevé d'équations différentielles). De plus, l'ajout de poids de pondérations spécifiant les performances à respecter accroit encore plus leur ordre. La complexité algorithmique résultante peut alors rendre leur implantation difficile voire même impossible pour un fonctionnement en temps réel.Les travaux présentés visent à réduire l'ordre de correcteurs Hinf dans le but de faciliter leur intégration tout en respectant les performances imposées d'une part et proposent une majoration de l'erreur introduite par l'étape de réduction d'autre part.Dans la littérature, de nombreuses méthodes pour la réduction d'ordre de modèles et de correcteurs des systèmes LTI ont été développées. Ces techniques ont été étudiées, comparées et testées sur un ensemble de benchmarks. S'appuyant sur ces travaux, nous proposons une extension aux systèmes linéaires à paramètres variants (LPV). Pour valider leurs performances, une application sur une commande d'une suspension semi-active a montré l'efficacité des algorithmes de réduction développés. / The work presented in this dissertation is related to the Hinf-LPV-controller orderReduction. This latter consists of the design of a robust reduced-order LPV-controller for LPV-systems. The order reduction issue has been very fairly investigated. However, the case of LPV-control design is slightly discussed. This thesis focuses primarily on two topics: How to obtain an LPV-reduced-order controller even the high order generated by the classical synthesis and how this reduced order controller can deal with a practical engineering problem (semi-active suspension control). In view of this, the order-reduction topic and the Hinf-synthesis theory have been widely studied in this thesis. This study, has allowed the development of a new method forH1-LPV-controller order reduction.
|
18 |
Analysis and control of transitional shear flows using global modesBagheri, Shervin January 2010 (has links)
In this thesis direct numerical simulations are used to investigate two phenomenain shear flows: laminar-turbulent transition over a flat plate and periodicvortex shedding induced by a jet in cross flow. The emphasis is on understanding and controlling the flow dynamics using tools from dynamical systems and control theory. In particular, the global behavior of complex flows is describedand low-dimensional models suitable for control design are developed; this isdone by decomposing the flow into global modes determined from spectral analysisof various linear operators associated with the Navier–Stokes equations.Two distinct self-sustained global oscillations, associated with the sheddingof vortices, are identified from direct numerical simulations of the jet incrossflow. The investigation is split into a linear stability analysis of the steadyflow and a nonlinear analysis of the unsteady flow. The eigenmodes of theNavier–Stokes equations, linearized about an unstable steady solution revealthe presence of elliptic, Kelvin-Helmholtz and von K´arm´an type instabilities.The unsteady nonlinear dynamics is decomposed into a sequence of Koopmanmodes, determined from the spectral analysis of the Koopman operator. Thesemodes represent spatial structures with periodic behavior in time. A shearlayermode and a wall mode are identified, corresponding to high-frequency andlow-frequency self-sustained oscillations in the jet in crossflow, respectively.The knowledge of global modes is also useful for transition control, wherethe objective is to reduce the growth of small-amplitude disturbances to delaythe transition to turbulence. Using a particular basis of global modes, knownas balanced modes, low-dimensional models that capture the behavior betweenactuator and sensor signals in a flat-plate boundary layer are constructed andused to design optimal feedback controllers. It is shown that by using controltheory in combination with sensing/actuation in small, localized, regionsnear the rigid wall, the energy of disturbances may be reduced by an order of magnitude.
|
19 |
A cyclic low rank Smith method for large, sparse Lyapunov equations with applications in model reduction and optimal controlPenzl, T. 30 October 1998 (has links) (PDF)
We present a new method for the computation of low rank approximations
to the solution of large, sparse, stable Lyapunov equations. It is based
on a generalization of the classical Smith method and profits by the
usual low rank property of the right hand side matrix.
The requirements of the method are moderate with respect to both
computational cost and memory.
Hence, it provides a possibility to tackle large scale control
problems.
Besides the efficient solution of the matrix equation itself,
a thorough integration of the method into several control
algorithms can improve their performance
to a high degree.
This is demonstrated for algorithms
for model reduction and optimal control.
Furthermore, we propose a heuristic for determining a set of
suboptimal ADI shift parameters. This heuristic, which is based on a
pair of Arnoldi processes, does not require any a priori
knowledge on the spectrum of
the coefficient matrix of the Lyapunov equation.
Numerical experiments show the efficiency of the iterative scheme
combined with the heuristic for the ADI parameters.
|
20 |
A cyclic low rank Smith method for large, sparse Lyapunov equations with applications in model reduction and optimal controlPenzl, T. 30 October 1998 (has links)
We present a new method for the computation of low rank approximations
to the solution of large, sparse, stable Lyapunov equations. It is based
on a generalization of the classical Smith method and profits by the
usual low rank property of the right hand side matrix.
The requirements of the method are moderate with respect to both
computational cost and memory.
Hence, it provides a possibility to tackle large scale control
problems.
Besides the efficient solution of the matrix equation itself,
a thorough integration of the method into several control
algorithms can improve their performance
to a high degree.
This is demonstrated for algorithms
for model reduction and optimal control.
Furthermore, we propose a heuristic for determining a set of
suboptimal ADI shift parameters. This heuristic, which is based on a
pair of Arnoldi processes, does not require any a priori
knowledge on the spectrum of
the coefficient matrix of the Lyapunov equation.
Numerical experiments show the efficiency of the iterative scheme
combined with the heuristic for the ADI parameters.
|
Page generated in 0.0834 seconds