W. M. Gentleman
- 1 BAREISS, E H. Sllvester's ~dentlty and multistep integer-preserving Gaussian ehmination. Math. Computatwn 22 (1968), 565-578.Google Scholar
- 2 FATEMAN, R.J. On the computational powers of polynomials. Dep. Math. Rep., M.I.T., Cambridge, Mass.Google Scholar
- 3 GENTLEMAN, W.M. Optimal multiplication chains for computing a power of a symbolic polynomial. SIGSAM Bull. 18, April 1971. To appear m Math. Computatwn. Google Scholar
- 4 HEINDEL, L.E. Computation of powers of multivariate polynomials over the integers. J. Computer Syst. Sci., 1 (Feb. 1972).Google Scholar
- 5 LIPSON, J.D. Symbohc methods for the computer solution of linear equations with apphcatlons to flowgraphs. In P.G. Tobey, Ed., Proc. 1968 Summer Institute on Symbohc Mathematmal Computation, I.B.M. Programming Lab. Rep. FSC69-0312, June 1969.Google Scholar
Index Terms
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
Recommendations
Determinants with orthogonal polynomial entries
Special issue: Proceedings of the seventh international symposium on Orthogonal polynomials, special functions and applicationsWe use moment representations of orthogonal polynomials to evaluate the corresponding Hankel determinants formed by the orthogonal polynomials. We also study the Hankel determinants which start with p"n on the top left-hand corner. As examples we ...
Matrices with Two Nonzero Entries per Row
ISSAC '15: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic ComputationMatrices with two nonzero entries per row (or per column) occur in many contexts. For example, edge-vertex incidence matrices of graphs have this form. Also, the boundary matrix for the highest dimensional simplices in a simplicial complex sometimes has ...
Explicit matrix inverses for lower triangular matrices with entries involving Jacobi polynomials
For a two-parameter family of lower triangular matrices with entries involving Jacobi polynomials an explicit inverse is given, with entries involving a sum of two Jacobi polynomials. The formula simplifies in the Gegenbauer case and then one choice of ...
Comments