An effective criterion for a stable factorisation of strictly non-singular 2 × 2 matrix functions: Use of the ExactMPF package

N. V. Adukova*, V. M. Adukov, G. Mishuris

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
8 Downloads (Pure)

Abstract

In this paper, we propose a method to factorise arbitrary strictly non-singular 2×2 matrix functions, allowing for stable factorisation. For this purpose, we use the ExactMPF package working within the Maple environment previously developed by the authors and perform an exact factorisation of a non-singular polynomial matrix function. A crucial point in the present analysis is the evaluation of a stability region of the canonical factorisation of the polynomial matrix functions. This, in turn, allows us to propose a sufficient condition for the given matrix function admitting stable factorisation.

Original languageEnglish
Article number20240116
Number of pages23
JournalProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Volume480
Issue number2299
DOIs
Publication statusPublished - 09 Oct 2024

Keywords

  • approximate factorisation
  • canonical factorisation
  • explicit conditions for stable factorisation
  • stable factorisation
  • strictly non-singular matrix functions
  • Wiener-Hopf factorisation

Fingerprint

Dive into the research topics of 'An effective criterion for a stable factorisation of strictly non-singular 2 × 2 matrix functions: Use of the ExactMPF package'. Together they form a unique fingerprint.

Cite this