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.

The topic of this thesis is the theoretical and numerical research of optimal control problems for uncertain nonlinear systems, described by semilinear parabolic differential equations with additive noise, where the state is not completely available. Based on a paper by Kazufumi Ito and Karl Kunisch, which was published in 2006 with the title "Receding Horizon Control with Incomplete Observations", we analyze a Model Predictive Control (MPC) approach where the resulting linear problems on small intervals are solved with a Linear Quadratic Gaussian (LQG) design. Further we define a performance index for the MPC/LQG approach, find estimates for it and present bounds for the solutions of the underlying Riccati equations. Another large part of the thesis is devoted to extensive numerical studies for an 1+1- and 3+1-dimensional problem to show the robustness of the MPC/LQG strategy. The last part is a generalization of the MPC/LQG approach to infinite-dimensional problems.

The topic of this thesis is the theoretical and numerical research of optimal control problems for uncertain nonlinear systems, described by semilinear parabolic differential equations with additive noise, where the state is not completely available. Based on a paper by Kazufumi Ito and Karl Kunisch, which was published in 2006 with the title "Receding Horizon Control with Incomplete Observations", we analyze a Model Predictive Control (MPC) approach where the resulting linear problems on small intervals are solved with a Linear Quadratic Gaussian (LQG) design. Further we define a performance index for the MPC/LQG approach, find estimates for it and present bounds for the solutions of the underlying Riccati equations. Another large part of the thesis is devoted to extensive numerical studies for an 1+1- and 3+1-dimensional problem to show the robustness of the MPC/LQG strategy. The last part is a generalization of the MPC/LQG approach to infinite-dimensional problems.

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.