Computing the Nearest Rank-Deficient Matrix Polynomial

DOI10.1145/3087604.3087648zbMath1444.65014OpenAlexW2737871803MaRDI QIDQ5119938

Joseph Haraldson, Mark W. Giesbrecht, George Labahn

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3087604.3087648

zbMATH Keywords

optimizationmatrix polynomialslow-rank approximationhybrid symbolic-numeric methods

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrix pencils (15A22) Numerical computation of matrix exponential and similar matrix functions (65F60) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (7)

Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ Nearest rank deficient matrix polynomials ⋮ Computing nearby non-trivial Smith forms ⋮ Approximate square-free part and decomposition ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Computing lower rank approximations of matrix polynomials ⋮ Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization

This page was built for publication: Computing the Nearest Rank-Deficient Matrix Polynomial