The evaluation of determinants by expansion by minors and the general problem of substitution
Authors:
W. M. Gentleman and S. C. Johnson
Journal:
Math. Comp. 28 (1974), 543-548
MSC:
Primary 68A20
DOI:
https://doi.org/10.1090/S0025-5718-1974-0373369-7
MathSciNet review:
0373369
Full-text PDF Free Access
Abstract | References | Similar Articles | Additional Information
Abstract: In this paper, we consider a class of substitution strategies which correspond to various minor expansion algorithms, and show that the usual expansion by minors, a row at a time, is optimal in this class.
- [1] W. Morven Gentleman, Optimal multiplication chains for computing a power of a symbolic polynomial, Math. Comp. 26 (1972), 935–939. MR 314303, https://doi.org/10.1090/S0025-5718-1972-0314303-3
- [2] Sir Thomas Muir, The Theory of Determinants in the Historical Order of Development, Macmillan, London, 1906-1920.
Retrieve articles in Mathematics of Computation with MSC: 68A20
Retrieve articles in all journals with MSC: 68A20
Additional Information
DOI:
https://doi.org/10.1090/S0025-5718-1974-0373369-7
Keywords:
Substitution,
expansion by minors,
determinants
Article copyright:
© Copyright 1974
American Mathematical Society
