Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices
Authors:
- Ioannis Z EmirisIEIoannis Z Emiris
- Victor Y PanVPVictor Y Pan
- 1 April 2002
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 33 (4) , 393-413
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Computation of a specified root of a polynomial system of equations using eigenvectorsLinear Algebra and its Applications, 2000
- A subdivision-based algorithm for the sparse resultantJournal of the ACM, 2000
- On the Complexity of Sparse EliminationJournal of Complexity, 1996
- Efficient Incremental Algorithms for the Sparse Resultant and the Mixed VolumeJournal of Symbolic Computation, 1995
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos AlgorithmSIAM Journal on Matrix Analysis and Applications, 1994
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random StartSIAM Journal on Matrix Analysis and Applications, 1992
- On wiedemann's method of solving sparse linear systems1991
- Improved sparse multivariate polynomial interpolation algorithms1989
- Resolution des systemes d'equations algebriquesTheoretical Computer Science, 1981
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979