Stop the war!
Остановите войну!
for scientists:
default search action
SNC 2011: San Jose, California, USA
- Marc Moreno Maza:
SNC 2011, Proceedings of the 2011 Internation Workshop on Symbolic-Numeric Computation, San Jose, California, USA, June 7-9, 2011. ACM 2011, ISBN 978-1-4503-0515-0 - Jonathan M. Borwein:
Mahler measures, short walks and log-sine integrals: a case study in hybrid computation. 1 - James Demmel:
Accurate and efficient expression evaluation and linear algebra, or why it can be easier to compute accurate eigenvalues of a Vandermonde matrix than the accurate sum of 3 numbers. 2 - Stephen M. Watt:
Polynomial approximation in handwriting recognition. 3-7 - Barry H. Dayton:
Numerical calculation of H-bases for positive dimensional varieties. 8-15 - Chenyi Hu:
Interval function and its linear least-squares approximation. 16-23 - Johannes Grotendorst:
On calculating the rate of linear convergence of non-linear transformed sequences. 24-33 - Tateaki Sasaki, Daiju Inaba:
A study of Hensel series in general case. 34-43 - Madalina Hodorog, Josef Schicho:
A regularization method for computing approximate invariants of plane curves singularities. 44-53 - Tsz-Wo Sze:
Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers. 54-62 - Kosaku Nagasaka:
An improvement in the lattice construction process of approximate polynomial GCD over integers. 63-64 - Françoise Richard-Jung:
Stokes phenomenon: graphical visualization and certified computation. 65-73 - Paola Boito, Olivier Ruatta:
Extended companion matrix for approximate GCD. 74-80 - Nargol Rezvani, Robert M. Corless:
Using weighted norms to find nearest polynomials satisfying linear constraints. 81-87 - Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Arrangement computation for planar algebraic curves. 88-98 - Bingyu Li, Xiaoli Wu:
A subresultant based subspace method for the computation of polynomial GCDs. 100-101 - Nan Li:
An improved method for evaluating Max Noether conditions: case of breadth one. 102-103 - Min Wu, Zhengfeng Yang:
Generating invariants of hybrid systems via sums-of-squares of polynomials with rational coefficients. 104-111 - Victor Y. Pan:
Univariate polynomial root-finding by arming with constraints. 112-121 - André Galligo:
Roots of the derivatives of some random polynomials. 122-129 - Erich L. Kaltofen, Wen-shin Lee, Zhengfeng Yang:
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation. 130-136 - Ioannis Z. Emiris, Tatjana Kalinka, Christos Konaxis:
Implicitization of curves and surfaces using predicted support. 137-146 - Piers W. Lawrence, Robert M. Corless:
Numerical stability of barycentric Hermite root-finding. 147-148 - Thien Nguyen, Bernard Mourrain, André Galligo, Gang Xu:
A construction of injective parameterizations of domains for isogeometric applications. 149-150 - Eugene V. Zima:
Synthetic division in the context of indefinite summation. 151-152 - Robert M. Corless, Erik Postma, David R. Stoutemyer:
GCD of multivariate approximate polynomials using beautification with the subtractive algorithm. 153-154 - Narayan Kamath, Irina Voiculescu, Chee K. Yap:
Empirical study of an evaluation-based subdivision algorithm for complex root isolation. 155-164 - Hong Diep Nguyen, Nathalie Revol:
Refining and verifying the solution of a linear system. 165-167 - Hidenao Iwane, Hitoshi Yanami, Hirokazu Anai:
An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for optimization problems. 168-177 - Masaru Sanuki:
Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures. 178-186
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.