Numerical Analysis

All Areas

65Xxx

  1. Tobias Beck and Josef Schicho, Curve parametrization over optimal field extensions exploiting the Newton polygon, Geometric Modeling and Algebraic Geometry, Springer, Berlin, 2008, pp. 119–140.[MR]
  2. Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, and Paul Zimmermann, MPFR: a multiple-precision binary floating-point library with correct rounding, ACM Trans. Math. Software 33 (2007), no. 2, Art. 13, 15.[MR]
  3. Shuhong Gao, Guangran Jiang, and Mingfu Zhu, Solving the 100 Swiss Francs problem, preprint (2008), 16 pages.[arXiv]
  4. Vladimir P. Gerdt, Yuri A. Blinkov, and Vladimir V. Mozzhilkin, Gröbner bases and generation of difference schemes for partial differential equations, SIGMA Symmetry Integrability Geom. Methods Appl. 2 (2006), Paper 051, 26 pp. (electronic).[MR]
  5. Marc Giusti and Éric Schost, Solving some overdetermined polynomial systems, in ISSAC '99: Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (Vancouver, BC), ACM, New York, 1999, pp. 1–8 (electronic).[MR]
  6. Peter Kirrinnis, Partial fraction decomposition in C(z) and simultaneous Newton iteration for factorization in C[z], J. Complexity 14 (1998), no. 3, 378–444.[MR]
  7. Greg Kuperberg, Numerical cubature from Archimedes' hat-box theorem, SIAM J. Numer. Anal. 44 (2006), no. 3, 908–935 (electronic).[MR/link]
  8. Greg Kuperberg, Numerical cubature using error-correcting codes, SIAM J. Numer. Anal. 44 (2006), no. 3, 897–907 (electronic).[MR/arXiv]