Mark Giesbrecht, Joseph Haraldson, George Labahn. Computing the Nearest Rank-Deficient Matrix Polynomial. In Michael A. Burr, Chee K. Yap, Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. pages 181-188, ACM, 2017. [doi]
@inproceedings{GiesbrechtHL17,
title = {Computing the Nearest Rank-Deficient Matrix Polynomial},
author = {Mark Giesbrecht and Joseph Haraldson and George Labahn},
year = {2017},
doi = {10.1145/3087604.3087648},
url = {http://doi.acm.org/10.1145/3087604.3087648},
researchr = {https://researchr.org/publication/GiesbrechtHL17},
cites = {0},
citedby = {0},
pages = {181-188},
booktitle = {Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017},
editor = {Michael A. Burr and Chee K. Yap and Mohab Safey El Din},
publisher = {ACM},
isbn = {978-1-4503-5064-8},
}