Abstract

The characterization of the solvability of matrix versions of truncated Stieltjes-type moment problems led to the class of α-Stieltjes non-negative definite sequences of complex q×q matrices. In [22], a parametrization of this class was introduced, the so-called α-Stieltjes parametrization. The main topic of this first part of the paper is the construction of a Schur-type algorithm which produces exactly the α-Stieltjes parametrization.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.