An efficient sparse minor expansion algorithm

Authors:
Martin L. Griss
Affiliations:
-
Venue:
ACM '76 Proceedings of the 1976 annual conference
Year:
1976

Citing 5
Cited 3

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On Computing the Exact Determinant of Matrices with Polynomial Entries

Journal of the ACM (JACM)
The Algebraic Solution of Sparse Linear Systems via Minor Expansion

ACM Transactions on Mathematical Software (TOMS)
Analysis of algorithms, a case study: Determinants of polynomials

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The definition and use of data structures in REDUCE

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems

ACM Transactions on Mathematical Software (TOMS)
A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

An improved algorithm for computing the minors of a (large) sparse matrix of polynomials is described, with emphasis on efficiency and optimal ordering. A possible application to polynomial resultant computation is discussed.