University of Cambridge > > Isaac Newton Institute Seminar Series > On Janashia-Lagvilava method of matrix spectral factorisation

On Janashia-Lagvilava method of matrix spectral factorisation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact

WHTW01 - Factorisation of matrix functions: New techniques and applications

Janashia-Lagvilava method is a relatively new algorithm of matrix spectral factorisation which can be applied to compute an approximate spectral factor of any matrix function (non-rational, large scale, singular) which satisfies the necessary and sufficient condition for the existence of spectral factorisation. The numerical properties of the method strongly depend on the way it is algorithmised and we propose its efficient algorithmisation. The method has already been successfully used in connectivity analysis of complex networks. The algorithm has the potential to be used in control system design and implementation for the required optimal controller computations by using frequency response data directly from measurements on real systems. It also provides a robust way of Granger causality computation for noisy singular data.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2021, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity