Article

Free access

Multipolynomial resultants and linear algebra

Authors:

Dinesh Manocha,

John F. CannyAuthors Info & Claims

ISSAC '92: Papers from the international symposium on Symbolic and algebraic computation

Pages 158 - 167

https://doi.org/10.1145/143242.143300

Published: 01 August 1992 Publication History

PDF eReader

References

[1]

M. Ben-or and P. Tiwari. A deterministic algorithm for sparse multivariate polynomial interpolation. In A CM Symposium on Theory of Computing, pages 301-309, 1988.

Digital Library

Google Scholar

[2]

B. Buchberger. Groebner bases: An algorithmic method in ideal theory, in N.K. Bose, editor, Multidimensional Systems Theory, pages 184-232. D. Reidel Publishing Co., 1985.

Google Scholar

[3]

B. Buchberger. Applications of groebner bases in non-linear computational geometry. In D. Kaput and J. Mundy, editors, Geometric Reasoning, pages 415- 447. MIT Press, 1989.

Digital Library

Google Scholar

[4]

J.F. Canny. The Complexity of Robot Motion Planning. ACM Doctoral Dissertation Award. MIT Press, 1988.

Digital Library

Google Scholar

[5]

J.F. Canny. Generalized characteristic polynomials. Journal 'of Symbolic Computation, 9:241-250, 1990.

Digital Library

Google Scholar

[6]

A.L. Dixon. The eliminant of three quantics in two independent variables. Proceedings of London Mathematical Society, 6:49-69,209-236, 1908.

Google Scholar

[7]

B.S. Garbow, J.M. Boyle, J. Dongarra, and C.B. Moler. Matrix Eigensystem Routines - EISPA CK Guide Extension, volume 51 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1977.

Google Scholar

[8]

X.S. Gao and S.C. Chou. Implicitization of rational parametric equations. Technical report, Department of Computer Science TR-90-34, University of Texas at Austin, 1990.

Digital Library

Google Scholar

[9]

I. Gohberg, P. Lancaster, and L. Rodman. Matrix Polynomials. Academic Press, New York, 1982.

Google Scholar

[10]

C.M. Hoffmann. Algebraic and numeric techniques for offsets and blends. In W. Dahmen, M. Gasca, and C. Micchelli, editors, Computations of Curves and Surfaces, pages 499-528. Kluwer Academic Publishers, 1990.

Crossref

Google Scholar

[11]

C. Hoffmann. Implicit curves and surfaces in computer aided geometric design. Technical report, Department of Computer Science CER-92-002, Purdue University, 1992.

Google Scholar

[12]

Jean-Pierre Jouanolou. Le formalisme du r6sultant. Technical report, Universit4 Louis Pasteur, Department of Mathematics, France, 1989. Manuscript.

Google Scholar

[13]

M. Kalkbrener. Three Contmbutions to Elimination Theory. PhD thesis, Technisch-Naturwissenschaftliche Fakultat, Johannes Kepler Universitat, Linz, 1991.

Google Scholar

[14]

E. Kaltofen and Y.N. Lakshman. improved sparse multivariate polynomial interpolation aIgortihms. In Lecture Notes in Computer Sczence, volume 358, pages 467-474. Springer-Verlag, 1988.

Crossref

Google Scholar

[15]

D. Kaput and Y.N. Laksman. Elimination methods: An introduction. In D. Kaput B. Donald and J. Mundy, editors, Symbolic and Numemcal Computation: an Integration. Academic Press, 1992. To Appear.

Google Scholar

[16]

F.S. Macaulay. On some formula in elimination. Proceedings of London Mathematical Society, pages 3-27, May 1902.

Google Scholar

[17]

F.S. Macaulay. Note on the resultant of a number of polynomials of the same degree. Proceedings of London Mathematical Society, pages 14-21, June 1921.

Google Scholar

[18]

F.S. Macaulay. The Algebrazc Theory of Modular Systems. Stechert-Hafner Service Agency, New York, 1964.

Google Scholar

[19]

F. Morley and A.B. Coble. New results in elimination. Amemcan Journal of Mathematics, 49:463-488, 1927.

Crossref

Google Scholar

[20]

D. Manocha and J.F. Canny. Efficient techniques for multipolynomial resultant algorithms. In Proceedings of International Symposzum on Symbolic and Algebraic Computation, pages 86-95, 1991.

Digital Library

Google Scholar

[21]

D. Manocha and J.F. Canny. Multipolynomial resultant algorithms. In Proceedings of International Symposium on Intelligent Robotzcs, pages 348-358, 1991. Also available as Technical Report UCB/CSD 91/632, Computer S,=ience Division, University of California, Berkeley.

Digital Library

Google Scholar

[22]

D. Manocha and J.F. Canny. The implicit representation of rational parametric surfaces. Journal of Symbolic Computation, 1992. To appear.

Digital Library

Google Scholar

[23]

J.F. Rift. Differential Algebra. AMS Colloquium Publications, 1950.

Google Scholar

[24]

G. Salmon. Lessons Introductory to the Modern Higher Algebra. G.E. Stechert & Co., New York, 1885.

Google Scholar

[25]

B. Sturmfels. Sparse elimination theory. Technical Report 91-32, Mathematical Sciences Institute, Cornell University, 1991.

Google Scholar

[26]

B. Sturmfels and A. Zelevinsky. Multigraded resultants of sylvester type. Technical report, Mathematical Sciences Institute, Cornell University, 1991. Manuscript.

Google Scholar

[27]

B.L. Van Der Waerden. Modern Algebra (third edztion). F. Ungar Publishing Co., New York, 1950.

Google Scholar

[28]

J.H. Wilkinson. The algebraic eigenvalue problem. Oxford University Press, Oxford, 1965.

Digital Library

Google Scholar

[29]

W. Wu. On the decision problem and the mechanization of theorem proving in elementary geometry. Scientia Sinic.a, 21:150-172, 1978. Also in Bledsoe and Loveland, eds. Theorem Proving: After 25 years, Contemporary Mathematics, 29,213-234.

Google Scholar

[30]

R. Zippel. Interpolating polynomials from their values. Journal of Symbolic Computation, 9:375-403, 1990.

Digital Library

Google Scholar

Cited By

View all

Ju YYu M(2023)An Innovative Inverse Kinematics for Bionic Robot Arms Based on Directional Tangent Matrix2023 2nd International Conference on Automation, Robotics and Computer Engineering (ICARCE)10.1109/ICARCE59252.2024.10492514(1-6)Online publication date: 14-Dec-2023
https://doi.org/10.1109/ICARCE59252.2024.10492514
Grafarend EAwange JGrafarend EAwange J(2011)Special Problems of Algebraic Regression and Stochastic EstimationLinear and Nonlinear Models10.1007/978-3-642-22241-2_14(493-525)Online publication date: 21-Dec-2011
https://doi.org/10.1007/978-3-642-22241-2_14
Li Y(2009)An effective hybrid algorithm for computing symbolic determinantsApplied Mathematics and Computation10.1016/j.amc.2009.08.056215:7(2495-2501)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.1016/j.amc.2009.08.056
Show More Cited By

Index Terms

Multipolynomial resultants and linear algebra
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Algebraic algorithms
      2. Linear algebra algorithms
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on matrices
      2. Computations on polynomials

Recommendations

Multivariate resultants in Bernstein basis
ADG'08: Proceedings of the 7th international conference on Automated deduction in geometry

Macaulay and Dixon resultant formulations are proposed for parametrized multivariate polynomial systems represented in Bernstein basis. It is proved that the Macaulay resultant for a polynomial system in Bernstein basis vanishes for the total degree ...
Cyclic resultants

We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial f of degree d, there are exactly 2^d^-^1 distinct degree d polynomials with the same set of cyclic resultants as f. However, in the generic monic ...
Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm

Algorithms for computing the resultant of two polynomials in several variables, a key repetitive step of computation in solving systems of polynomial equations by elimination, are studied. Determining the best algorithm for computer implementation ...

Comments

Information & Contributors

Information

Published In

ISSAC '92: Papers from the international symposium on Symbolic and algebraic computation

August 1992

406 pages

ISBN:0897914899

DOI:10.1145/143242

Editor:
Paul S. Wang
Kent State Univ., Kent, OH

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC92

Sponsor:

ISSAC92: International Symposium on Symbolic Algebraic Computation

July 27 - 29, 1992

California, Berkeley, USA

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
512
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)7

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ju YYu M(2023)An Innovative Inverse Kinematics for Bionic Robot Arms Based on Directional Tangent Matrix2023 2nd International Conference on Automation, Robotics and Computer Engineering (ICARCE)10.1109/ICARCE59252.2024.10492514(1-6)Online publication date: 14-Dec-2023
https://doi.org/10.1109/ICARCE59252.2024.10492514
Grafarend EAwange JGrafarend EAwange J(2011)Special Problems of Algebraic Regression and Stochastic EstimationLinear and Nonlinear Models10.1007/978-3-642-22241-2_14(493-525)Online publication date: 21-Dec-2011
https://doi.org/10.1007/978-3-642-22241-2_14
Li Y(2009)An effective hybrid algorithm for computing symbolic determinantsApplied Mathematics and Computation10.1016/j.amc.2009.08.056215:7(2495-2501)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.1016/j.amc.2009.08.056
Villard GEngeler ECaviness B(1996)Computing Popov and Hermite forms of polynomial matricesProceedings of the 1996 international symposium on Symbolic and algebraic computation10.1145/236869.237082(250-258)Online publication date: 1-Oct-1996
https://dl.acm.org/doi/10.1145/236869.237082
González-Vega LTrujillo G(1995)Implicitization of parametric curves and surfaces by using symmetric functionsProceedings of the 1995 international symposium on Symbolic and algebraic computation10.1145/220346.220369(180-186)Online publication date: 1-Apr-1995
https://dl.acm.org/doi/10.1145/220346.220369
Emiris IRege AMacCallum M(1994)Monomial bases and polynomial system solving (extended abstract)Proceedings of the international symposium on Symbolic and algebraic computation10.1145/190347.190374(114-122)Online publication date: 1-Aug-1994
https://dl.acm.org/doi/10.1145/190347.190374
Emiris ICanny J(1993)A practical method for the sparse resultantProceedings of the 1993 international symposium on Symbolic and algebraic computation10.1145/164081.164122(183-192)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/164081.164122

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Multivariate resultants in Bernstein basis

Cyclic resultants

Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm