An accelerated technique for solving one type of discrete-time algebraic Riccati equations

An accelerated technique for solving one type of discrete-time algebraic Riccati equations Algebraic Riccati equations are encountered in many applications of control and engineering problems, e.g., LQG problems and H ∞ control theory. In this work, we study the properties of one type of discrete-time algebraic Riccati equations. Our contribution is twofold. First, we present sufficient conditions for the existence of a unique positive definite solution. Second, we propose an accelerated algorithm to obtain the positive definite solution with the rate of convergence of any desired order. Numerical experiments strongly support that our approach performs extremely well even in the almost critical case. As a byproduct, we show that this method is capable of computing the unique negative definite solution, once it exists. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Computational and Applied Mathematics Elsevier

An accelerated technique for solving one type of discrete-time algebraic Riccati equations

Loading next page...
 
/lp/elsevier/an-accelerated-technique-for-solving-one-type-of-discrete-time-XHgjEWMi3d
Publisher
Elsevier
Copyright
Copyright © 2018 Elsevier B.V.
ISSN
0377-0427
eISSN
1879-1778
D.O.I.
10.1016/j.cam.2018.02.004
Publisher site
See Article on Publisher Site

Abstract

Algebraic Riccati equations are encountered in many applications of control and engineering problems, e.g., LQG problems and H ∞ control theory. In this work, we study the properties of one type of discrete-time algebraic Riccati equations. Our contribution is twofold. First, we present sufficient conditions for the existence of a unique positive definite solution. Second, we propose an accelerated algorithm to obtain the positive definite solution with the rate of convergence of any desired order. Numerical experiments strongly support that our approach performs extremely well even in the almost critical case. As a byproduct, we show that this method is capable of computing the unique negative definite solution, once it exists.

Journal

Journal of Computational and Applied MathematicsElsevier

Published: Aug 15, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off