Cargando…
An explicit Wiener–Hopf factorization algorithm for matrix polynomials and its exact realizations within ExactMPF package
We discuss an explicit algorithm for solving the Wiener–Hopf factorization problem for matrix polynomials. By an exact solution of the problem, we understand the one constructed by a symbolic computation. Since the problem is, generally speaking, unstable, this requirement is crucial to guarantee th...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
The Royal Society
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9257591/ https://www.ncbi.nlm.nih.gov/pubmed/35811639 http://dx.doi.org/10.1098/rspa.2021.0941 |