You are here

Chandrasekhar Algorithms for Linear Time Varying Distributed Systems

Type: 
Conference PaperInvited and refereed articles in conference proceedings
Authored by:
Baras, John S., Lainiotis, Demetrios G.
Conference date:
March 24-26, 1976
Conference:
1976 Conference on Information Sciences and Systems, pp. 269-274
Full Text Paper: 
Abstract: 

Generalized Chandrasekhar type algorithms are obtained that are applicable to linear time varying as well as time-invariant distributed systems. Utilizing the framework of J.H. Lions for quadratic controla and the framework of A. Bensoussan for filtering of linear distributed systems we analyze the implications of these algorithms.