Parallel computation of determinants of matrices with polynomial entries

Journal of Symbolic Computation

Volumn 37, Issue 6, 2004, Pages 749-760

  Marco, Ana ^a   Martínez, José Javier ^a  

^a UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2642584647     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2003.11.002     Document Type: Article

References (21)

1. Aries, F., Senoussi, R., 2001. An implicitization algorithm for rational surfaces with no base points. J. Symbolic Computation 31, 357-365.
2. Bini, D., Pan, V.Y., 1994. Polynomial and Matrix Computations. Fundamental Algorithms. volume 1: Birkhäuser, Boston.
3. Björck, A., Pereyra, V., 1970. Solution of Vandermonde systems of equations. Math. Comp. 24, 893-903.
4. Blochinger, W., Küchlin, W., Ludwig, C., Weber, A., 1999. An object-oriented platform for distributed high-performance symbolic computation. Math. Comput. Simulation 49, 161-178.
5. Buis, P.E., Dyksen, W.R., 1996. Efficient vector and parallel manipulation of tensor products. ACM Trans. Math. Software 22 (1), 18-23.
6. Chionh, E.W., 1997. Concise parallel Dixon determinant. Comput. Aided Geom. Design 14, 561-570.
7. Davenport, J.H., Siret, Y., Tournier, E., 1988. Computer Algebra: Systems and Algorithms for Algebraic Computation. Academic Press, New York.
8. Davis, P.J., 1975. Interpolation and Approximation. Dover Publications Inc., New York.
9. Golub, G.H., Van Loan, C.F., 1996. Matrix Computations. third edition. Johns Hopkins University Press, Baltimore, MD.
10. Hong, H., 2000. J. Symbolic Computation 29, 3-4 (Editorial).
11. Hong, H., Liska, R., Robidoux, N., Steinberg, S., 2000. Elimination of variables in parallel. SIAM News 33 (8), 1, 12-13.
12. Horn, R.A., Johnson, C.R., 1991. Topics in Matrix Analysis. Cambridge University Press, Cambridge.
13. Kaltofen, E., Saunders, B.D., 2003. Linear Systems. In: Grabmeier, J., Kaltofen, E., Weispfenning, V. (Eds.), Computer Algebra Handbook. Springer-Verlag, Berlin (section 2.3.1).
14. Khanin, R., Cartmell, M., 2001. Parallelization of perturbation analysis: application to large-scale engineering problems. J. Symbolic Computation 31, 461-473.
15. Lu, H., 1994. Fast solution of confluent Vandermonde linear systems. SIAM J. Matrix Anal. Appl. 15 (4), 1277-1289.
16. Manocha, D., Canny, J.F., 1993. Multipolynomial resultant algorithms. J. Symbolic Computation 15, 99-122.
17. Marco, A., Martínez, J.J., 2001. Using polynomial interpolation for implicitizing algebraic curves. Comput. Aided Geom. Design 18, 309-319.
18. Martínez, J.J., 1999. A generalized Kronecker product and linear systems. Internat. J. Math. Ed. Sci. Tech. 30 (1), 137-141.
19. Murao, H., Fujise, T., 1996. Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation. J. Symbolic Computation 21, 377-396.
20. Sederberg, T., Goldman, R., Du, H., 1997. Implicitizing rational curves by the method of moving algebraic curves. J. Symbolic Computation 23, 153-175.
21. Winkler, F., 1996. Polynomial Algorithms in Computer Algebra. Springer-Verlag, Wien, New York.