Abstract is missing.
- Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codesErich L. Kaltofen. 1-2 [doi]
- Automated theorem proving for special functions: the next phaseLawrence C. Paulson. 3-8 [doi]
- The euclidean distance degreeJan Draisma, Emil Horobet, Giorgio Ottaviani, Bernd Sturmfels, Rekha R. Thomas. 9-16 [doi]
- A multiprecision algorithm for the solution of polynomials and polynomial eigenvalue problemsDario A. Bini, Leonardo Robol. 17-18 [doi]
- Some ideas for the computation of matrix solventsMoulay A. Barkatou, Paola Boito, E. Segura Ugalde. 19-20 [doi]
- Nearly optimal computations with structured matricesVictor Y. Pan, Elias P. Tsigaridas. 21-30 [doi]
- Mixed and componentwise condition numbers for matrix decompositionsWei-guo Wang, Yimin Wei. 31-32 [doi]
- Numerical linear system solving with parametric entries by error correctionBrice Boyer, Erich L. Kaltofen. 33-38 [doi]
- Optimizing a linear function over a noncompact real algebraic varietyFeng Guo, Chu Wang, Lihong Zhi. 39-40 [doi]
- A note on geometric involutive bases for positive dimensional polynomial ideals and SDP methodsGreg Reid, Fei Wang, Wenyuan Wu. 41-42 [doi]
- Maximum likelihood for dual varietiesJose Israel Rodriguez. 43-49 [doi]
- Exploring univariate mixed polynomialsMohamed Elkadi, André Galligo. 50-58 [doi]
- Prony systems via decimation and homotopy continuationDmitry Batenkov. 59-60 [doi]
- Structure of symmetry of PDE: exploiting partially integrated systemsIan G. Lisle, S.-L. Tracy Huang, Gregory J. Reid. 61-69 [doi]
- Finding a sparse solution of a class of linear differential equations by solving a nonlinear systemLibin Jiao, Bo Yu. 70-77 [doi]
- Computing GCRDs of approximate differential polynomialsMark Giesbrecht, Joseph Haraldson. 78-87 [doi]
- Two variants of HJLS-PSLQ with applicationsYong Feng, Jingwei Chen, Wenyuan Wu. 88-96 [doi]
- A recursive decision method for termination of linear programsYi Li. 97-106 [doi]
- Safety verification of nonlinear systems based on rational invariantsWang Lin, Min Wu, Zhengfeng Yang, Zhenbing Zeng. 107-108 [doi]
- Predicting zero reductions in Gröbner basis computationsChristian Eder. 109-110 [doi]
- Numerical and geometric properties of a method for finding points on real solution componentsWenyuan Wu, Greg Reid, Yong Feng. 111-117 [doi]
- Isotopic epsilon-meshing of real algebraic space curvesKai Jin, Jin-San Cheng. 118-127 [doi]
- Parametrization of translational surfacesSonia Pérez-Díaz, Li-Yong Shen. 128-129 [doi]
- An algorithm to compute certain euler characteristics and Chern-Schwartz-MacPherson classesMartin Helmer. 130-131 [doi]
- Accelerated approximation of the complex roots of a univariate polynomialVictor Y. Pan, Elias P. Tsigaridas. 132-134 [doi]
- On the interplay between asymptotic and numerical methods to solve differential equations problemsRenato Spigler. 135-143 [doi]
- The nearest polynomial to multiple given polynomials with a given zeroHiroshi Sekigawa. 144-145 [doi]