Efficient algorithm for computing inverse of parametric matrices

DOI10.47743/SACS.2024.1.1MaRDI QIDQ6966817zbMATH OpenFDO

Authors Mahdi Dehghani Darmian

Publication date 27 June 2025

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47743/SACS.2024.1.1

zbMATH Keywords

Gauss-Jordan systemGES algorithmIMS algorithminverse matrix systemparametric matrices

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Symbolic computation and algebraic computation (68W30)

Cites work

• A new algorithm for computing comprehensive Gröbner systems
• A new algorithm for discussing Gröbner bases with parameters.
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• A speed-up of the algorithm for computing comprehensive Gröbner systems
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Comprehensive Gröbner bases
• Computing comprehensive Gröbner systems: a comparison of two methods
• Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208]
• Gröbner bases for polynomial systems with parameters
• Gröbner systems conversion
• Ideals, Varieties, and Algorithms
• Parametric FGLM algorithm

Cited in

(1)

• An algorithm for minimal generating set of parametric homogeneous polynomial ideals

This page was built for publication: Efficient algorithm for computing inverse of parametric matrices

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