link to my thesis

BIBLIOGRAPHY 239
[26] A. Cayley. On the theory of elimination. Cambridge and Dublin Mathematical Journal,
3:210–270, 1865. [cited at p. 29]
[27] T.Y. Chen and J. Demmel. Balancing sparse matrices for computing eigenvalues.
Linear Algebra and Its Applications, 309(1–3):261–287, 2000. [cited at p. 110, 158]
[28] D. Cox, J. Little, and D. O’Shea. Ideals, Varieties, and Algorithms. An Introduction to
Computational Algebraic Geometry and Commutative Algebra. Springer, 2nd edition,
1997. [cited at p. 11, 17, 18, 19, 20, 23, 34]
[29] D. Cox, J. Little, and D. O’Shea. Using algebraic geometry. Springer, 1998.
[cited at p. 35]
[30] E.R. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding
eigenvectors of large real-symmetric matrices. Journal of Computational
Physics, 17:87Ű–94, 1975. [cited at p. 82]
[31] B.L. Van der Waerden. Algebra: Volume I. Springer-Verlag, 6th edition, 1964.
[cited at p. 26]
[32] E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik,
1:269–271, 1959. [cited at p. 52]
[33] A.L. Dixon. The elimination of three quantics in two independent variables. In Proceedings
of London Mathematical Society, volume 6, pages 468–478, 1908. [cited at p. 29]
[34] P. Van Dooren. The computation of Kronecker’s canonical form of a singular pencil.
Linear Algebra and Its Applications, 27:103–140, 1979. [cited at p. 166, 168, 172, 177, 236]
[35] D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels. Mathematical Computations
with Macaulay 2 (http://www.math.uiuc.edu/Macaulay2), volume 8. Springer Verlag,
2001. [cited at p. 25]
[36] I. Emiris and J. Canny. A practical method for the sparse resultant. In M. Bronstein,
editor, Proceedings of the 1993 international symposium on Symbolic and algebraic
computation ISSAC ’93, pages 183–192, New York, 1993. ACM Press. [cited at p. 29]
[37] G. Farin. Curves and surfaces for computer aided geometric design, A practical guide.
Academic Press, 1990. [cited at p. 32]
[38] R.W. Floyd. Algorithm 97: Shortest Path. Communications of the ACM, 5(6):345,
1962. [cited at p. 52]
[39] D.R. Fokkema, G.L.G. Sleijpen, and H.A. van der Vorst. Jacobi–Davidson style QR
and QZ algorithms for the reduction of matrix pencils. SIAM Journal on Scientific
Computing, 20(1):94–125, 1998. [cited at p. 51, 83, 112]
[40] E. Fornasini, P. Rocha, and S. Zampieri. State space realization of 2–D finite–
dimensional behaviours. SIAM Journal on Control and Optimization, 31(6):1502–1517,
1993. [cited at p. 52]
[41] P. Fulcheri and M. Olivi. Matrix rational H 2 approximation: a gradient algorithm
based on Schur analysis. SIAM Journal on Control and Optimization, 36(6):2103–
2127, 1998. [cited at p. 134]