467 research outputs found
General computational approach for optimal fault detection
We propose a new computational approach to solve the optimal fault detection
problem in the most general setting. The proposed procedure is free of any technical assumptions
and is applicable to both proper and non-proper systems. This procedure forms the basis of
an integrated numerically reliable state-space algorithm, which relies on powerful descriptor
systems techniques to solve the underlying computational subproblems. The new algorithm has
been implemented into a Fault Detection Toolbox for Matlab
Spectral Factorization of Rank-Deficient Rational Densities
Though there have been hundreds of methods on solving rational spectral
factorization, most of them are based on a positive definite density matrix
assumption. In this work, we propose a novel approach on the spectral
factorization of a low-rank spectral density, to a minimum-phase full-rank
factor. Compared with other several approaches on low-rank spectral
factorizations, our approach uses the deterministic relation inside a factor,
leading to a high computation efficiency. In addition, we shall show that this
method is easily used in identification of low-rank processes and Wiener
Filter.Comment: 25 page
A numerical comparison of solvers for large-scale, continuous-time algebraic Riccati equations and LQR problems
In this paper, we discuss numerical methods for solving large-scale
continuous-time algebraic Riccati equations. These methods have been the focus
of intensive research in recent years, and significant progress has been made
in both the theoretical understanding and efficient implementation of various
competing algorithms. There are several goals of this manuscript: first, to
gather in one place an overview of different approaches for solving large-scale
Riccati equations, and to point to the recent advances in each of them. Second,
to analyze and compare the main computational ingredients of these algorithms,
to detect their strong points and their potential bottlenecks. And finally, to
compare the effective implementations of all methods on a set of relevant
benchmark examples, giving an indication of their relative performance
New optimization methods in predictive control
This thesis is mainly concerned with the efficient solution of a linear discrete-time
finite horizon optimal control problem (FHOCP) with quadratic cost and linear constraints
on the states and inputs. In predictive control, such a FHOCP needs to be
solved online at each sampling instant. In order to solve such a FHOCP, it is necessary
to solve a quadratic programming (QP) problem. Interior point methods (IPMs) have
proven to be an efficient way of solving quadratic programming problems. A linear system
of equations needs to be solved in each iteration of an IPM. The ill-conditioning
of this linear system in the later iterations of the IPM prevents the use of an iterative
method in solving the linear system due to a very slow rate of convergence; in some cases
the solution never reaches the desired accuracy. A new well-conditioned IPM, which increases
the rate of convergence of the iterative method is proposed. The computational
advantage is obtained by the use of an inexact Newton method along with the use of
novel preconditioners.
A new warm-start strategy is also presented to solve a QP with an interior-point
method whose data is slightly perturbed from the previous QP. The effectiveness of
this warm-start strategy is demonstrated on a number of available online benchmark
problems. Numerical results indicate that the proposed technique depends upon the
size of perturbation and it leads to a reduction of 30-74% in floating point operations
compared to a cold-start interior point method.
Following the main theme of this thesis, which is to improve the computational efficiency
of an algorithm, an efficient algorithm for solving the coupled Sylvester equation
that arises in converting a system of linear differential-algebraic equations (DAEs) to
ordinary differential equations is also presented. A significant computational advantage
is obtained by exploiting the structure of the involved matrices. The proposed algorithm
removes the need to solve a standard Sylvester equation or to invert a matrix. The
improved performance of this new method over existing techniques is demonstrated by
comparing the number of floating-point operations and via numerical examples
Efficient Numerical Solution of Large Scale Algebraic Matrix Equations in PDE Control and Model Order Reduction
Matrix Lyapunov and Riccati equations are an important tool in mathematical systems theory. They are the key ingredients in balancing based model order reduction techniques and linear quadratic regulator problems. For small and moderately sized problems these equations are solved by techniques with at least cubic complexity which prohibits their usage in large scale applications.
Around the year 2000 solvers for large scale problems have been introduced. The basic idea there is to compute a low rank decomposition of the quadratic and dense solution matrix and in turn reduce the memory and computational complexity of the algorithms. In this thesis efficiency enhancing techniques for the low rank alternating directions implicit iteration based solution of large scale matrix equations are introduced and discussed. Also the applicability in the context of real world systems is demonstrated.
The thesis is structured in seven central chapters. After the introduction chapter 2 introduces the basic concepts and notations needed as fundamental tools for the remainder of the thesis. The next chapter then introduces a collection of test examples spanning from easily scalable academic test systems to badly conditioned technical applications which are used to demonstrate the features of the solvers. Chapter four and five describe the basic solvers and the modifications taken to make them applicable to an even larger class of problems. The following two chapters treat the application of the solvers in the context of model order reduction and linear quadratic optimal control of PDEs. The final chapter then presents the extensive numerical testing undertaken with the solvers proposed in the prior chapters.
Some conclusions and an appendix complete the thesis
- …