Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix-Reference-Cited by-同舟云学术

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix

Published:2022-07-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Labahn George¹,Neiger Vincent²,Vu Thi Xuan³,Zhou Wei¹

Affiliation:

1. University of Waterloo, Waterloo, Canada

2. Sorbonne Université, CNRS, LIP6, Paris, France

3. UiT, The Arctic University of Norway, Tromso, Norway

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3476446.3535495

Reference36 articles.

1. A reliable method for computing M-Padé approximants on arbitrary staircases

2. A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants

3. B. Beckermann , G. Labahn , and G. Villard . 1999. Shifted Normal Forms of Polynomial Matrices . In Proceedings ISSAC 1999 . ACM, 189--196. https://doi.org/10.1145/309831.309929 B. Beckermann, G. Labahn, and G. Villard. 1999. Shifted Normal Forms of Polynomial Matrices. In Proceedings ISSAC 1999. ACM, 189--196. https://doi.org/10.1145/309831.309929

4. Normal forms for general polynomial matrices

5. Fast matrix rank algorithms and applications

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast interpolation and multiplication of unbalanced polynomials;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. p-adic algorithm for bivariate Gröbner bases;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24