Output-sensitive modular algorithms for polynomial matrix normal forms-Reference-Cited by-同舟云学术

Output-sensitive modular algorithms for polynomial matrix normal forms

Published:2007-07 Issue:7 Volume:42 Page:733-750
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Cheng Howard,Labahn George

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference22 articles.

1. On solutions of linear functional systems;Abramov,2001

2. Abramov, S., Bronstein, M., Linear algebra for skew-polynomial matrices. Technical Report RR-4420, INRIA. 2002

3. Sylvester’s identity and multistep integer-preserving Gaussian elimination;Bareiss;Math. Comp.,1968

4. Effective computation of rational approximants and interpolants;Beckermann;Reliable Computing,2000

5. Beckermann, B., Labahn, G., On the fraction-free computation of column-reduced matrix polynomials via FFFG. Technical Report ANO436, Laboratoire ANO, University of Lille, 2001. Available at http://ano.univ-lille1.fr/pub/2001/ano436.ps.Z

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

1. Modular Techniques for Noncommutative Gröbner Bases;Mathematics in Computer Science;2019-11-21

2. The strong Popov form of nonlinear input–output equations;Proceedings of the Estonian Academy of Sciences;2018

3. Computing polynomial LCM and GCD in lagrange basis;ACM Communications in Computer Algebra;2009-02-06

4. Submersive rational difference systems and their accessibility;Proceedings of the 2009 international symposium on Symbolic and algebraic computation - ISSAC '09;2009

5. An Effective Algorithm for Analytical Computation of Flat Outputs over the Weyl Algebra;IFAC Proceedings Volumes;2008