×
Mårtensson, K.

On the matrix Riccati equation. (English) Zbl 0206.45602

Inf. Sci. 3, 17-49 (1971).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0206.45602

Cited in 50 Documents

MSC:

93B25 Algebraic methods
93C05 Linear systems in control theory
93C99 Model systems in control theory
49N10 Linear-quadratic optimal control problems
93C15 Control/observation systems governed by ordinary differential equations
93B52 Feedback control
49N35 Optimal feedback synthesis
15A24 Matrix equations and identities
PDF BibTeX XML Cite
\textit{K. Mårtensson}, Inf. Sci. 3, 17--49 (1971; Zbl 0206.45602)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Potter, Matrix quadratic solutions, SIAM J. appl., math., 14, 496-501, (1966) · Zbl 0144.02001
[2] Friedman, ()
[3] ström, ()
[4] Kalman; Englar, A User’s manual for the automatic systhesis program, NASA report CR-475, 170-221, (1966)
[5] Kalman, Contributions to the theory of optimal control, Bol. soc. mat. mexicana, 5, 102-119, (1960) · Zbl 0112.06303
[6] Bucy, Global theory of the Riccati equation, J. comput. system sic., 1, 349-361, (1967) · Zbl 0155.14403
[7] Kalman, When is a linear control system optimal?, J. basic eng., 86, 51-60, (1967)
[8] Wonham, “On Matrix Quadratic Equations and Matrix Riccati Equations,” Technical Report 67-5, Providence, R.I. Division of Applied Mathematics, Brown University · Zbl 0182.20803
[9] Wonham, On pole assignment in multi-input controllable linear systems, IEEE trans. automatic control, 12, 660-665, (1967)
[10] Beckenbach; Bellman, ()
[11] Mrtensson, “Linear Quadratic Control Package. Part I, The Continuous Problem,” Research Report 6802, April 68, Lund Institute of Technology, Division of Automatic Control.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.