default search action
SNC 2009: Kyoto, Japan
- Hiroshi Kai, Hiroshi Sekigawa, Tateaki Sasaki, Kiyoshi Shirayanagi, Ilias S. Kotsireas:
Symbolic Numeric Computation, SNC '09, Kyoto, Japan - August 03 - 05, 2009. ACM 2009, ISBN 978-1-60558-664-9
Invited speakers papers
- Robert M. Corless:
Pseudospectra for exponential polynomial matrices. 1-2 - Shin'ichi Oishi:
Error free transformations of floating point numbers and its applications to constructing efficient error free numerical algorithms. 3-4 - Victor Y. Pan, Guoliang Qian, Ailong Zheng:
Preconditioning, randomization, solving linear systems, eigen-solving, and root-finding. 5-6 - Stefan Ratschan:
Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems. 7-8 - Masaaki Sugihara:
De-Sinc numerical methods. 9-10
Contiributed full papers
- Martin Berz, Kyoko Makino:
Rigorous global search using taylor models. 11-20 - Jingwei Chen, Yong Feng, Xiaolin Qin, Jingzhong Zhang:
Exact polynomial factorization by approximate high degree algebraic numbers. 21-28 - Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain:
Computing nearest Gcd with certification. 29-34 - Annie A. M. Cuyt, Wen-shin Lee:
Extracting numerical factors of multivariate polynomials from taylor expansions. 35-44 - Michael Hemmer, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos, Ioannis Z. Emiris, Menelaos I. Karavelas, Bernard Mourrain:
Experimental evaluation and cross-benchmarking of univariate real solvers. 45-54 - Hidenao Iwane, Hitoshi Yanami, Hirokazu Anai, Kazuhiro Yokoyama:
An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination. 55-64 - Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi:
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions. 65-70 - Thang Luu Ba, Laurent Busé, Bernard Mourrain:
Curve/surface intersection problem by means of matrix representations. 71-78 - Kyoko Makino, Martin Berz:
Rigorous integration of flows and ODEs using taylor models. 79-84 - Angelos Mantzaflaris, Bernard Mourrain, Elias P. Tsigaridas:
Continued fraction expansion of real roots of polynomial systems. 85-94 - Hiroshi Murakami:
Application of filter diagonalization method to numerical solution of algebraic equations. 95-104 - Victor Y. Pan, Brian Murphy, Rhys Eric Rosholt:
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials. 105-114 - André Galligo, Adrien Poteaux:
Continuations and monodromy on random riemann surfaces. 115-124 - Xiaolin Qin, Yong Feng, Jingwei Chen, Jingzhong Zhang:
Finding exact minimal polynomial by approximations. 125-132 - Philippe P. Pébay, J. Maurice Rojas, David C. Thompson:
Optimization and NP_R-completeness of certain fewnomials. 133-142 - Tetsuya Sakurai, Junko Asakura, Hiroto Tadano, Tsutomu Ikegami, Kinji Kimura:
A method for finding zeros of polynomial equations using a contour integral based eigensolver. 143-148 - Masaru Sanuki:
Computing multivariate approximate GCD based on Barnett's theorem. 149-158 - Tateaki Sasaki, Daiju Inaba:
Convergence and many-valuedness of hensel seriesnear the expansion point. 159-168 - Tateaki Sasaki, Yasutaka Ookura:
Approximate factorization of polynomials over Z. 169-176 - Tateaki Sasaki, Akira Terui:
Computing clustered close-roots of univariate polynomials. 177-184 - Liyong Shen, Min Wu, Zhengfeng Yang, Zhenbing Zeng:
Finding positively invariant sets of a class of nonlinear loops via curve fitting. 185-190 - Kiyoshi Shirayanagi, Hiroshi Sekigawa:
Reducing exact computations to obtain exact results based on stabilization techniques. 191-198
Contributed extended abstracts
- Sonia Pérez-Díaz, J. Rafael Sendra, Sonia L. Rueda, Juana Sendra:
Parametrization of ε-rational curves: extended abstract. 199-200
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.