Abstract
Formal power series are used to derive four entry formulas for the Dixon matrix. These entry formulas have uniform and simple summation bounds for the entire Dixon matrix. When corner cutting is applied to the monomial support, each of the four loose entry formulas simplifies greatly for some rows and columns associated with a particular corner, but still maintains the uniform and simple summation bounds. Uniform summation bounds make the entry formulas loose because redundant brackets that eventually vanish are produced. On the other hand, uniform summation bounds reveal valuable information about the properties of the Dixon matrix for a corner-cut monomial support.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chionh, E.W.: Concise Parallel Dixon Determinant. Computer Aided Geometric Design 14, 561–570 (1997)
Chionh, E.W.: Rectangular Corner Cutting and Dixon \(\mathcal{A}\)-resultants. J. Symbolic Computation 31, 651–669 (2001)
Chionh, E.W.: Parallel Dixon Matrices by Bracket. Advances in Computational Mathematics 19, 373–383 (2003)
Chionh, E.W., Zhang, M., Goldman, R.N.: Implicitization by Dixon \(\mathcal{A}\)-resultants. In: Proceedings of Geometric Modeling and Processing, pp. 310–318 (2000)
Chionh, E.W., Zhang, M., Goldman, R.N.: Fast Computations of the Bezout and the Dixon Resultant Matrices. Journal of Symbolic Computation 33, 13–29 (2002)
Chtcherba, A.D., Kapur, D.: On the Efficiency and Optimality of Dixon-based Resultant Methods. In: ISSAC, pp. 29–36 (2002)
Chtcherba, A.D., Kapur, D.: Resultants for Unmixed Bivariant Polynomial Systems using the Dixon formulation. Journal of Symbolic Computation 38, 915–958 (2004)
Chtcherba, A.D.: A New Sylvetser-type Resultant Method Based on the Dixon-B\(\acute{e}\)zout Formulation. Ph.d. Dissertation, The University of New Mexico (2003)
Cox, D., Little, J., O’Shea, D.: Using Algebraic Geometry. Springer, New York (1998)
Dixon, A.L.: The Eliminant of Three Quantics in Two Independent Variables. Proc. London Math. Soc. Second Series, vol. 7, pp. 49–69, 473-492 (1909)
Emiris, I.Z., Mourrain, B.: Matrices in Elimination Theory. Journal of Symbolic Computation 28, 3–44 (1999)
Foo, M.C., Chionh, E.W.: Corner Point Pasting and Dixon \(\mathcal{A}\)-Resultant Quotients. Asian Symposium on Computer Mathematics, 114–127 (2003)
Foo, M.C., Chionh, E.W.: Corner Edge Cutting and Dixon \(\mathcal{A}\)-Resultant Quotients. J. Symbolic Computation 37, 101–119 (2004)
Foo, M.C., Chionh, E.W.: Dixon \(\mathcal{A}\)-Resultant Quotients for 6-Point Isosceles Triangular Corner Cutting. Geometric Computation, Lecture Notes Series on Computing 11, 374–395 (2004)
Foo, M.C.: Master’s thesis. National Unviversity of Singapore (2003)
Kapur, D., Saxena, T.: Comparison of Various Multivariate Resultants. In: ACM ISSAC, Montreal, Canada (1995)
Kapur, D., Saxena, T.: Sparsity Considerations in the Dixon Resultant Formulation. In: Proc. ACM Symposium on Theory of Computing, Philadelphia (1996)
Wang, D.M.: Elimination Methods. Springer, New York (2001)
Xiao, W.: Master’s thesis. National University of Singapore (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, W., Chionh, EW. (2005). Formal Power Series and Loose Entry Formulas for the Dixon Matrix. In: Li, H., Olver, P.J., Sommer, G. (eds) Computer Algebra and Geometric Algebra with Applications. IWMM GIAE 2004 2004. Lecture Notes in Computer Science, vol 3519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499251_8
Download citation
DOI: https://doi.org/10.1007/11499251_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26296-1
Online ISBN: 978-3-540-32119-4
eBook Packages: Computer ScienceComputer Science (R0)