scholarly journals Reachability Analysis of Large Linear Systems With Uncertain Inputs in the Krylov Subspace

2020 ◽  
Vol 65 (2) ◽  
pp. 477-492 ◽  
Author(s):  
Matthias Althoff
Acta Numerica ◽  
1992 ◽  
Vol 1 ◽  
pp. 57-100 ◽  
Author(s):  
Roland W. Freund ◽  
Gene H. Golub ◽  
Noël M. Nachtigal

Recent advances in the field of iterative methods for solving large linear systems are reviewed. The main focus is on developments in the area of conjugate gradient-type algorithms and Krylov subspace methods for nonHermitian matrices.


Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 85
Author(s):  
Andreas Rauh ◽  
Julia Kersten

Continuous-time linear systems with uncertain parameters are widely used for modeling real-life processes. The uncertain parameters, contained in the system and input matrices, can be constant or time-varying. In the latter case, they may represent state dependencies of these matrices. Assuming bounded uncertainties, interval methods become applicable for a verified reachability analysis, for feasibility analysis of feedback controllers, or for the design of robust set-valued state estimators. The evaluation of these system models becomes computationally efficient after a transformation into a cooperative state-space representation, where the dynamics satisfy certain monotonicity properties with respect to the initial conditions. To obtain such representations, similarity transformations are required which are not trivial to find for sufficiently wide a-priori bounds of the uncertain parameters. This paper deals with the derivation and algorithmic comparison of two different transformation techniques for which their applicability to processes with constant and time-varying parameters has to be distinguished. An interval-based reachability analysis of the states of a simple electric step-down converter concludes this paper.


2009 ◽  
Vol 76 (2) ◽  
Author(s):  
Murat Manguoglu ◽  
Ahmed H. Sameh ◽  
Faisal Saied ◽  
Tayfun E. Tezduyar ◽  
Sunil Sathe

In this paper we present effective preconditioning techniques for solving the nonsymmetric systems that arise from the discretization of the Navier–Stokes equations. These linear systems are solved using either Krylov subspace methods or the Richardson scheme. We demonstrate the effectiveness of our techniques in handling time-accurate as well as steady-state solutions. We also compare our solvers with those published previously.


Sign in / Sign up

Export Citation Format

Share Document