dc.contributor.author | Malyshev, Alexander | |
dc.contributor.author | Sadkane, Miloud | |
dc.date.accessioned | 2021-08-03T09:39:28Z | |
dc.date.available | 2021-08-03T09:39:28Z | |
dc.date.created | 2020-12-23T15:18:58Z | |
dc.date.issued | 2020 | |
dc.identifier.issn | 0029-599X | |
dc.identifier.uri | https://hdl.handle.net/11250/2765977 | |
dc.description.abstract | A bisection method is used to compute lower and upper bounds on the distance from a quadratic matrix polynomial to the set of quadratic matrix polynomials having an eigenvalue on the imaginary axis. Each bisection step requires to check whether an even quadratic matrix polynomial has a purely imaginary eigenvalue. First, an upper bound is obtained using Frobenius-type linearizations. It takes into account rounding errors but does not use the even structure. Then, lower and upper bounds are obtained by reducing the quadratic matrix polynomial to a linear palindromic pencil. The bounds obtained this way also take into account rounding errors. Numerical illustrations are presented. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.title | Computing the distance to continuous-time instability of quadratic matrix polynomials | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2020 Springer | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 2 | |
dc.identifier.doi | https://doi.org/10.1007/s00211-020-01108-0 | |
dc.identifier.cristin | 1863102 | |
dc.source.journal | Numerische Mathematik | en_US |
dc.source.pagenumber | 149-165 | en_US |
dc.identifier.citation | Numerische Mathematik. 2020, 145, 149-165. | en_US |
dc.source.volume | 145 | en_US |