# A low-rank solution method for Riccati equations with indefinite quadratic terms

@article{Benner2021ALS, title={A low-rank solution method for Riccati equations with indefinite quadratic terms}, author={Peter Benner and Jan Heiland and Steffen W. R. Werner}, journal={Numerical Algorithms}, year={2021}, volume={92}, pages={1083 - 1103} }

Algebraic Riccati equations with indefinite quadratic terms play an important role in applications related to robust controller design. While there are many established approaches to solve these in case of small-scale dense coefficients, there is no approach available to compute solutions in the large-scale sparse setting. In this paper, we develop an iterative method to compute low-rank approximations of stabilizing solutions of large-scale sparse continuous-time algebraic Riccati equations…

## References

SHOWING 1-10 OF 66 REFERENCES

### An iterative algorithm to solve Algebraic Riccati Equations with an indefinite quadratic term

- Mathematics, Computer Science2007 European Control Conference (ECC)
- 2007

An iterative algorithm to solve Algebraic Riccati Equations arising from, for example, a standard H∞ control problem is proposed by constructing two sequences of positive semidefinite matrices which can be solved more easily by existing iterative methods.

### Numerical solution of special algebraic Riccati equations via an exact line search method

- Mathematics1997 European Control Conference (ECC)
- 1997

We study the numerical solution of a class of algebraic Riccati equations arising in spectral factorization and H∞ optimal control problems. This type of matrix Riccati equations differs from the…

### Computing the Positive Stabilizing Solution to Algebraic Riccati Equations With an Indefinite Quadratic Term via a Recursive Method

- Mathematics, Computer ScienceIEEE Transactions on Automatic Control
- 2008

An iterative algorithm to solve algebraic riccati equations with an indefinite quadratic term with superior effectiveness when compared with methods based on finding stable invariant subspaces of Hamiltonian matrices.

### Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: a state of the art survey

- Chemistry, Mathematics
- 2013

Efficient numerical algorithms for the solution of large and sparse matrix Riccati and Lyapunov equations based on the low rank alternating directions implicit (ADI) iteration have become available…

### Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems

- Computer Science, MathematicsNumer. Linear Algebra Appl.
- 2008

N numerical algorithms for the solution of large algebraic Lyapunov and Riccati equations and linear‐quadratic optimal control problems, which arise from such systems with a sparse or structured state matrix and a relatively small number of inputs and outputs are studied.

### A new subspace iteration method for the algebraic Riccati equation

- MathematicsNumer. Linear Algebra Appl.
- 2015

An algorithm is developed for the low-rank approximation of X by means of an invariant subspace iteration on a function of the associated Hamiltonian matrix and establishes new insightful matrix relations with emerging projection-type methods, which will help increase the understanding of this latter class of solution strategies.

### RADI: a low-rank ADI-type algorithm for large scale algebraic Riccati equations

- Computer Science, MathematicsNumerische Mathematik
- 2018

There is a very tight relation between the new algorithm and three other algorithms for CARE previously known in the literature—all of these seemingly different methods in fact produce exactly the same iterates when used with the same parameters.

### A schur method for solving algebraic Riccati equations

- Mathematics, Computer Science1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes
- 1978

A new algorithm for solving algebraic Riccati equations (both continuous-time and discrete-time versions) is presented, a variant of the classical eigenvector approach and uses instead an appropriate set of Schur vectors thereby gaining substantial numerical advantages.

### Generalized eigenproblem algorithms and software for algebraic Riccati equations

- Mathematics, Computer ScienceProceedings of the IEEE
- 1984

The approach presented uses the generalized eigenproblem formulation for the solution of general forms of algebraic Riccati equations arising in both continuous- and discrete-time applications.

### Low rank iterative methods for projected generalized Lyapunov equations

- Mathematics, Computer Science
- 2005

An alternating direction implicit method and the Smith method are generalized for large-scale projected generalized Lyapunov equations that arise in model reduction for descriptor systems and low rank versions of these methods are presented.