An explicit factorization algorithm (Q1882430)

A new algorithm (in short as (EF)-algorithm) is proposed for the explicit factorization of \(2\times 2\) matrix functions. We say that a factorization of a matrix function is explicit if it can be obtained by means of factorization of scalar functions. \textit{I. Feldman, I. Gohberg} and \textit{N. Krupnik} [Integral Equations Oper. Theory 18, 277--302 (1994; Zbl 0808.47019)] have given an algorithm for the explicit factorization of a matrix function. In this paper, in section one the authors give a description of the (EF)-algorithm, in sections 2 and 3 they show two applications of the (EF)-algorithm. They also point out that if the problem of factorization relative to the unit circle is solved, it is not difficult to reformulate the main results for the factorization relative the real line.