Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
暂无分享,去创建一个
[1] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .
[2] Chris Smith,et al. Geometric completion of differential systems using numeric-symbolic continuation , 2002, SIGS.
[3] Lihong Zhi,et al. A complete symbolic-numeric linear method for camera pose determination , 2003, ISSAC '03.
[4] Bernard Mourrain,et al. Solving projective complete intersection faster , 2000, ISSAC.
[5] S. Huffel,et al. STRUCTURED TOTAL LEAST SQUARES Analysis, Algorithms and Applications , 2002 .
[6] J. Ben Rosen,et al. Total Least Norm Formulation and Solution for Structured Problems , 1996, SIAM J. Matrix Anal. Appl..
[7] Stephen M. Watt,et al. The singular value decomposition for polynomial systems , 1995, ISSAC '95.
[8] Philippe Trébuchet. Vers une résolution stable et rapide des équations algébriques , 2002 .
[9] Sabine Van Huffel,et al. Fast algorithm for solving the Hankel/Toeplitz Structured Total Least Squares problem , 2004, Numerical Algorithms.
[10] Werner M. Seiler,et al. Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra , 2009, Algorithms and computation in mathematics.
[11] J. Emsalem. Géométrie des points épais , 1978 .
[12] M. Kuranishi. ON E. CARTAN'S PROLONGATION THEOREM OF EXTERIOR DIFFERENTIAL SYSTEMS.* , 1957 .
[13] J. Pommaret. Systems of partial differential equations and Lie pseudogroups , 1978 .
[14] Robert M. Corless,et al. A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots , 1997, ISSAC.
[15] G. Reid,et al. Differential Elimination–Completion Algorithms for DAE and PDAE , 2001 .
[16] Yuri A. Blinkov,et al. Involutive bases of polynomial ideals , 1998, math/9912027.
[17] F. S. Macaulay,et al. The Algebraic Theory of Modular Systems , 1972 .
[18] J. Tuomela,et al. On the numerical solution of involutive ordinary differential systems , 2000 .
[19] Erich Kaltofen,et al. Polynomial Factorization 1987-1991 , 1992, LATIN.
[20] Wenjun Wu. On the Construction of Groebner Basis of a Polynomial Ideal Based on Riquier—Janet Theory , 2005 .
[21] H. Stetter,et al. An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations , 1988 .
[22] H. M. Möller,et al. Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems , 1995 .
[23] Andrew J. Sommese,et al. The numerical solution of systems of polynomials - arising in engineering and science , 2005 .
[24] B. Mourrain. Isolated points, duality and residues , 1997 .
[25] E. Davison,et al. The numerical solution of A'Q+QA =-C , 1968 .
[26] Dinesh Manocha,et al. SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .
[27] Bernard Mourrain,et al. A New Criterion for Normal Form Algorithms , 1999, AAECC.
[28] Daniel Lazard,et al. Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations , 1983, EUROCAL.
[29] B. Sturmfels,et al. Grbner Deformations of Hypergeometric Differential Equations , 2000 .
[30] F. Lemaire,et al. Determination of approximate symmetries of differential equations , 2003 .
[31] 吴文俊. ON THE CONSTRUCTION OF GROEBNER BASIS OF A POLYNOMIAL IDEAL BASED ON RIQUIER-JANET THEORY , 1991 .
[32] K. Gatemann. Symbolic solution polynomial equation systems with symmetry , 1990, ISSAC '90.
[33] Jean Charles Faugère,et al. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.
[34] G. Reid,et al. Fast differential elimination in C: The CDiffElim environment ? ? This program can be downloaded fro , 2001 .
[35] Hans J. Stetter,et al. Numerical polynomial algebra , 2004 .
[36] Tomas Sauer,et al. H-bases for polynomial interpolation and system solving , 2000, Adv. Comput. Math..
[37] G. B. M. Zerr,et al. Algebra: 117-118 , 1900 .