Skip to main content
SpringerLink
Log in

An extended fast algorithm for constructing the Dixon resultant matrix

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

Abstract

In recent years, the Dixon resultant matrix has been used widely in the resultant elimination to solve nonlinear polynomial equations and many researchers have studied its efficient algorithms. The recursive algorithm is a very efficient algorithm, but which deals with the case of three polynomial equations with two variables at most. In this paper, we extend the algorithm to the general case of n+1 polynomial equations in n variables. The algorithm has been implemented in Maple 9. By testing the random polynomial equations, the results demonstrate that the efficiency of our program is much better than the previous methods, and it is exciting that the necessary condition for the existence of common intersection points on four general surfaces in which the degree with respect to every variable is not greater than 2 is given out in 48×48 Dixon matrix firstly by our program.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lewis, R. H., Stiller, P. F., Solving the recognition problem for six lines using the Dixon resultant, Mathematics and Computers in Simulation, 1999, 49(3): 205–219.

    Article  MathSciNet  Google Scholar 

  2. Chionh, E. W., Zhang, M., Goldman, R. N., Fast computation of the Bezout and Dixon resultant matrices, Journal of Symbolic Computation, 2002, 33(1): 13–29.

    Article  MATH  MathSciNet  Google Scholar 

  3. Dixon, A. L., The eliminant of three quantics in two independent variables, Proceedings of the London Mathematical Society, 1908, 6: 49–69, 473–492.

    Article  Google Scholar 

  4. Kapur, D., Saxena, T., Yang, L., Algebraic and geometric reasoning using Dixon resultants, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, Oxford, 1994, New York: ACM Press, 1994, 99–107.

    Google Scholar 

  5. Lewis, R. H., Using Fermat to solve large polynomial and matrix problems, ACM SIGSAM Bulletin, 2004, 38(1): 27–28.

    Article  Google Scholar 

  6. Kapur, D., Saxena, T., Yang, L., Sparsity considerations in Dixon resultants, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, 1996, New York: ACM Press, 1996, 184–191.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chengdu Institute of Computer Applications, Chinese Academy of Sciences, 610041, Chengdu, China

    Shizhong Zhao

  2. Software Engineering Institute, East China Normal University, 200062, Shanghai, China

    Hongguang Fu

Authors
  1. Shizhong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongguang Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shizhong Zhao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, S., Fu, H. An extended fast algorithm for constructing the Dixon resultant matrix. Sci. China Ser. A-Math. 48, 131–143 (2005). https://doi.org/10.1360/04ys0166

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1360/04ys0166

Keywords

Search

Navigation