default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSNC 2014: Shanghai, China
- Lihong Zhi, Stephen M. Watt:
Symbolic-Numeric Computation 2014, SNC '14, Shanghai, China, July 28-31, 2014. ACM 2014, ISBN 978-1-4503-2963-7
Invited contributions
- Erich L. Kaltofen:
Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes. 1-2 - Lawrence C. Paulson
:
Automated theorem proving for special functions: the next phase. 3-8 - Jan Draisma, Emil Horobet, Giorgio Ottaviani, Bernd Sturmfels, Rekha R. Thomas:
The euclidean distance degree. 9-16
Linear systems
- Dario A. Bini, Leonardo Robol:
A multiprecision algorithm for the solution of polynomials and polynomial eigenvalue problems. 17-18 - Moulay A. Barkatou, Paola Boito, Esteban Segura Ugalde:
Some ideas for the computation of matrix solvents. 19-20 - Victor Y. Pan, Elias P. Tsigaridas:
Nearly optimal computations with structured matrices. 21-30 - Wei-guo Wang, Yimin Wei:
Mixed and componentwise condition numbers for matrix decompositions. 31-32 - Brice Boyer, Erich L. Kaltofen:
Numerical linear system solving with parametric entries by error correction. 33-38
Optimization
- Feng Guo, Chu Wang, Lihong Zhi:
Optimizing a linear function over a noncompact real algebraic variety. 39-40 - Greg Reid, Fei Wang, Wenyuan Wu:
A note on geometric involutive bases for positive dimensional polynomial ideals and SDP methods. 41-42 - Jose Israel Rodriguez:
Maximum likelihood for dual varieties. 43-49
Generalized polynomials
- Mohamed Elkadi, André Galligo:
Exploring univariate mixed polynomials. 50-58 - Dmitry Batenkov:
Prony systems via decimation and homotopy continuation. 59-60
Differential algebra
- Ian G. Lisle, Tracy Shih-lung Huang, Gregory J. Reid:
Structure of symmetry of PDE: exploiting partially integrated systems. 61-69 - Libin Jiao, Bo Yu:
Finding a sparse solution of a class of linear differential equations by solving a nonlinear system. 70-77 - Mark Giesbrecht, Joseph Haraldson:
Computing GCRDs of approximate differential polynomials. 78-87
Verification and validation
- Yong Feng, Jingwei Chen, Wenyuan Wu:
Two variants of HJLS-PSLQ with applications. 88-96 - Yi Li:
A recursive decision method for termination of linear programs. 97-106 - Wang Lin, Min Wu, Zhengfeng Yang, Zhenbing Zeng:
Safety verification of nonlinear systems based on rational invariants. 107-108
Geometry
- Christian Eder:
Predicting zero reductions in Gröbner basis computations. 109-110 - Wenyuan Wu, Greg Reid, Yong Feng:
Numerical and geometric properties of a method for finding points on real solution components. 111-117 - Kai Jin, Jin-San Cheng:
Isotopic epsilon-meshing of real algebraic space curves. 118-127 - Sonia Pérez-Díaz, Li-Yong Shen:
Parametrization of translational surfaces. 128-129 - Martin Helmer:
An algorithm to compute certain euler characteristics and Chern-Schwartz-MacPherson classes. 130-131
Root finding
- Victor Y. Pan, Elias P. Tsigaridas:
Accelerated approximation of the complex roots of a univariate polynomial. 132-134 - Renato Spigler:
On the interplay between asymptotic and numerical methods to solve differential equations problems. 135-143 - Hiroshi Sekigawa:
The nearest polynomial to multiple given polynomials with a given zero. 144-145
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.
last updated on 2024-10-31 20:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
