An efficient sparse minor expansion algorithm
- 1 January 1976
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 429-434
- https://doi.org/10.1145/800191.805633
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.This publication has 0 references indexed in Scilit: