Two improved algorithms to compute the minimal bases of univariate matrices

DOI10.1007/S11424-024-3306-XMaRDI QIDQ6950598zbMATH OpenFDO

Authors Lingfan Chen, Shanshan Yao

Publication date 30 July 2025

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11424-024-3306-X

zbMATH Keywords

implicitizationminimal basismoving planespolynomial matrix

Mathematics Subject Classification ID

Numerical linear algebra (65F99)

Cites work

• -bases for polynomial systems in one variable
• A direct approach to computing the \(\mu\)-basis of planar rational curves
• Algorithm for computing \(\mu\)-bases of univariate polynomials
• Computing \(\mu\)-bases of univariate polynomial matrices using polynomial matrix factorization
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• scientific article; zbMATH DE number 5222433 (Why is no real title available?)
• The moving line ideal basis of planar rational curves
• The μ-basis of a planar rational curve—properties and computation
• Using Algebraic Geometry

This page was built for publication: Two improved algorithms to compute the minimal bases of univariate matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950598)