University of Cambridge > > Isaac Newton Institute Seminar Series > On approximate Wiener-Hopf factorization of 2 × 2 matrices

On approximate Wiener-Hopf factorization of 2 × 2 matrices

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

If you have a question about this talk, please contact nobody.

WHTW02 - WHT Follow on: the applications, generalisation and implementation of the Wiener-Hopf Method

We present a novel algorithm for the factorization of triangular polynomial 2×2 matrices. Our algorithm offers flexibility in choosing between ‘exact’ and ‘natural’ pairs of partial indices. Integrated into the general Winer-Hopf factorization algorithm for 2×2 matrices, as described in, the approach offers a versatile method applicable to practical scenarios. Specifically, given a matrix function S, our method enables the construction of a Wiener-Hopf factorization for an approximate matrix with manageable factors, even when the exact factorization of S may involve large factors. These large factors of S are presumed to arise due to inaccuracies in the construction process of S, rendering its exact factorization impractical. The cases where S or its approximation have unstable partial indices are not excluded. Thus, selecting a reasonable factorization of the approximated matrix function S emerges as a natural choice, facilitating an automatic determination of the partial indices, which in turn, could serve as a novel regularization procedure.  (Co-Authors: G. Mishuris, I. Spitkovsky)

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-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity