Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a25bdcb43bef8305

Jump to content

// Workers AI · dad joke modeWhat did the Chandrasekhar algorithm say? I've got a star method.

From Wikipedia, the free encyclopedia

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.[1] 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).[2][3][4][5]

Mathematical description

[edit]

Consider a linear dynamical system , where is the state vector, is the control input and and are the system matrices. The objective is to minimize the quadratic cost function

subject to the constraint . Hhere and are positive definite, symmetric, weighting matrices, referred to as the state cost and control cost. The optimization leads to , where is a symmetric matrix and satisfies the continuous-time algebraic Riccati equation

Chandrasekhar introduced the factorization ( need not be a square matrix) so that

The second term is regarded linear since the operation is a projection on a reduced-dimensional space.

Example

[edit]

Let us illustrate the Chandrasekhar equations using a simple example, where we take

then we have and therefore

For this example, the Chandrasekhar equations become

References

[edit]
  1. Chandrasekhar, S. (2013). Radiative transfer. Courier Corporation.
  2. Ito, K., & Powers, R. K. (1987). Chandrasekhar equations for infinite dimensional systems. SIAM journal on control and optimization, 25(3), 596-611.
  3. Kailath, T. (1972, December). Some Chandrasekhar-type algorithms for quadratic regulators. In Proceedings of the 1972 IEEE Conference on Decision and Control and 11th Symposium on Adaptive Processes (pp. 219–223). IEEE.
  4. Lainiotis, D. (1976). Generalized Chandrasekhar algorithms: Time-varying models. IEEE Transactions on Automatic Control, 21(5), 728-732.
  5. Freitas, F. D., Ishihara, J. Y., & Borges, G. A. (2006, June). Continuous-Time H/spl infin/Control Design of Large Scale Systems Using Chandrasekhar~ fs Equations. In 2006 American Control Conference (pp. 2239–2244). IEEE.