Vis enkel innførsel

dc.contributor.authorMalyshev, Alexander
dc.contributor.authorSadkane, Miloud
dc.date.accessioned2021-08-03T09:39:28Z
dc.date.available2021-08-03T09:39:28Z
dc.date.created2020-12-23T15:18:58Z
dc.date.issued2020
dc.identifier.issn0029-599X
dc.identifier.urihttps://hdl.handle.net/11250/2765977
dc.description.abstractA 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.isoengen_US
dc.publisherSpringeren_US
dc.titleComputing the distance to continuous-time instability of quadratic matrix polynomialsen_US
dc.typeJournal articleen_US
dc.typePeer revieweden_US
dc.description.versionacceptedVersionen_US
dc.rights.holderCopyright 2020 Springeren_US
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode2
dc.identifier.doihttps://doi.org/10.1007/s00211-020-01108-0
dc.identifier.cristin1863102
dc.source.journalNumerische Mathematiken_US
dc.source.pagenumber149-165en_US
dc.identifier.citationNumerische Mathematik. 2020, 145, 149-165.en_US
dc.source.volume145en_US


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel