Zhonggang Zeng
- D.J. BATES, C. PETERSON AND A.J. SOMMESE, A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set, IEEE Trans. Signal Processing, 52 (2003), pp. 3394--3402.Google Scholar
- D.J. BATES, J.D. HAUENSTEIN, A.J. SOMMESE AND C.W. WAMPLER II, Software for numerical algebraic geometry: A paradigm and progress towards its implementation, in Software for Algebraic Geometry, IMA Volume 148, M. Stillman, N. Takayama, and J. Verschelde, eds., Springer, 2008, pp. 1--14.Google Scholar
- R. M. CORLESS, S. M. WATT, AND L. ZHI, QR factoring to compute the GCD of univariate approximate polynomials, IEEE Trans. Signal Processing, 52 (2003), pp. 3394--3402. Google ScholarDigital Library
- B. DAYTON AND Z. ZENG, Computing the multiplicity structure in solving polynomial systems. Proceedings of ISSAC '05, ACM Press, pp 116--123, 2005. Google ScholarDigital Library
- S. GAO, E. KALTOFEN, J. MAY, Z. YANG, AND L. ZHI, Approximate factorization of multivariate polynomials via differential equations. Proc. ISSAC '04, ACM Press, pp 167--174, 2004. Google ScholarDigital Library
- C.-P. JEANNEROD AND G. LABAHN, The SNAP package for arithemetic with numeric polynomials. In International Congress of Mathematical Software, World Scientific, pages 61--71, 2002.Google Scholar
- A.J. SOMMESE AND C.W. WAMPLER II, The Numerical Solution of Systems of Polynomials, World Scientific Pub., Hackensack, NJ. 2005.Google Scholar
- H. J. STETTER, Numerical Polynomial Algebra, SIAM, 2004. Google ScholarDigital Library
- J. VERSCHELDE, Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. on Math. Software, 25(1999), pp. 251--276. Google ScholarDigital Library
- Z. ZENG, A polynomial elimination method for symbolic and numerical computation. to appear, 2008.Google Scholar
- Z. ZENG, Computing multiple roots of inexact polynomials, Math. Comp., 74 (2005), pp. 869--903.Google Scholar
- Z. ZENG, ApaTools: A Maple and Matlab toolbox for approximate polynomial algebra, in Software for Algebraic Geometry, IMA Volume 148, M. Stillman, N. Takayama, and J. Verschelde, eds., Springer, 2008, pp. 149--167.Google Scholar
- Z. ZENG AND B. DAYTON, The approximate GCD of inexact polynomials. II: A multivariate algorithm. Proceedings of ISSAC'04, ACM Press, pp 320--327. (2006). Google ScholarDigital Library
Index Terms
- ApaTools: a software toolbox for approximate polynomial algebra
Recommendations
Commutative pseudo-equality algebras
Pseudo-equality algebras were initially introduced by Jenei and Kóródi as a possible algebraic semantic for fuzzy-type theory, and they have been revised by Dvureăźenskij and Zahiri under the name of JK-algebras. In this paper, we define and study the ...
An antipode formula for the natural Hopf algebra of a set operad
A symmetric set operad is a monoid in the category of combinatorial species with respect to the operation of substitution. From a symmetric set operad, we give here a simple construction of a commutative and non-co-commutative Hopf algebra, that we call ...
Wronskian type determinants of orthogonal polynomials, Selberg type formulas and constant term identities
Let (p"n)"n be a sequence of orthogonal polynomials with respect to the measure @m. Let T be a linear operator acting in the linear space of polynomials P and satisfying deg(T(p))=deg(p)-1, for all polynomial p. We then construct a sequence of ...
Comments