Chandrasekhar algorithm

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Chandrasekhar algorithm refers to an efficient method to solve matrix Riccati equation, which uses symmetric factorization and was introduced by Subrahmanyan Chandrasekhar in his book, Radiative Transfer. This technique was later adapted for use in control theory, leading to the development of the Chandrasekhar equations, which refer to a set of linear differential equations that reformulates continuous-time algebraic Riccati equation (CARE).

Chandrasekhar algorithm refers to an efficient method to solve matrix Riccati equation, which uses symmetric factorization and was introduced by Subrahmanyan Chandrasekhar in his book, Radiative Transfer. This technique was later adapted for use in control theory, leading to the development of the Chandrasekhar equations, which refer to a set of linear differential equations that reformulates continuous-time algebraic Riccati equation (CARE).

Mathematical description

Consider a linear dynamical system \dot x(t) = A x(t) + B u(t) , where x(t) is the state vector, u(t) is the control input and A and B are the system matrices. The objective is to minimize the quadratic cost function J = \int_0^\infty [x^T Q x + u^T R u)] dt subject to the constraint \dot x(t) = A x(t) + B u(t) . Hhere Q and R are positive definite, symmetric, weighting matrices, referred to as the state cost and control cost. The optimization leads to u=-R^{-1}B^T P x , where P(t) is a symmetric matrix and satisfies the continuous-time algebraic Riccati equation -\dot P = A^TP+P A - P BR^{-1} B^T P(t) + Q. Chandrasekhar introduced the factorization P(t) = Z(t) Z(t)^T ( Z need not be a square matrix) so that \dot Z= (A - BR^{-1} B^T Z Z^T) Z + Q Z^{-T}. The second term is regarded linear since the operation Z^TZ is a projection on a reduced-dimensional space.

Example

Let us illustrate the Chandrasekhar equations using a simple example, where we take A=\begin{bmatrix}1 & 2 \\ 0 & -1\end{bmatrix}, \quad B = \begin{bmatrix}0 \\ 1 \end{bmatrix}, \quad Q=I=\begin{bmatrix}1 & 0 \\ 0 & 1\end{bmatrix}, \quad R = \begin{bmatrix}1 \end{bmatrix}, \quad Z = \begin{bmatrix}z_1 \\ z_2\end{bmatrix}, then we have Z^TZ = z_1^2+Z^2 and therefore ZZ^TZ = \begin{bmatrix}z_1 \\ z_2\end{bmatrix}(z_1^2+z_2^2). For this example, the Chandrasekhar equations become \begin{bmatrix}\dot z_1 \\ \dot z_2\end{bmatrix} = \begin{bmatrix}z_1-z_1^3+2z_2-z_1z_2^2 \\ -z_2\end{bmatrix}+\frac{1}{z_1^2+z_2^2}\begin{bmatrix}z_1 \\ z_2\end{bmatrix}.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1317874609 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001317874609 · captured 1760966155.0 · version history

Cite this page as: encyclopegia.org, “Chandrasekhar algorithm”, snapshot enwiki-001317874609. https://encyclopegia.org/a/chandrasekhar-algorithm

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.