Generalized Companion Matrices in the Lagrange Bases
暂无分享,去创建一个
[1] George Labahn,et al. Symbolic-numeric sparse interpolation of multivariate polynomials , 2006, ISSAC '06.
[2] Steven Fortune,et al. Polynomial root finding using iterated Eigenvalue computation , 2001, ISSAC '01.
[3] J. E. Morais,et al. When Polynomial Equation Systems Can Be "Solved" Fast? , 1995, AAECC.
[4] Shuhong Gao,et al. Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points , 2006, AAECC.
[5] Dinesh Manocha,et al. Algorithms for intersecting parametric and algebraic curves I: simple intersections , 1994, TOGS.
[6] Erich Kaltofen,et al. Factoring high-degree polynomials by the black box Berlekamp algorithm , 1994, ISSAC '94.
[7] T SmithBrian. Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems , 1970 .
[8] Bernard Mourrain,et al. Relations Between Roots and Coefficients, Interpolation and Application to System Solving , 2002, J. Symb. Comput..
[9] Victor Y. Pan,et al. Multivariate Polynomials, Duality, and Structured Matrices , 2000, J. Complex..
[10] Brian T. Smith,et al. Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems , 1970, JACM.
[11] Richard Zippel,et al. Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.
[12] J. Jouanolou. Formes d'inertie et résultant: un formulaire , 1997 .
[13] Robert M. Corless,et al. Polyno-mial Algebra by Values , 2004 .