Guessing singular dependencies
From MaRDI portal
Publication:2437325
DOI10.1016/j.jsc.2013.07.002zbMath1290.30001OpenAlexW2072163726WikidataQ122178562 ScholiaQ122178562MaRDI QIDQ2437325
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2013.07.002
Uses Software
Cites Work
- How to multiply matrices faster
- On asymptotic extrapolation
- Factoring polynomials with rational coefficients
- Extrapolation methods theory and practice
- Fast evaluation of holonomic functions
- How to recognize zero?
- Relax, but don't be too lazy
- Effective analytic functions
- Zero tests for constants in simple scientific computation
- On effective analytic continuation
- Gaussian elimination is not optimal
- Ten Problems in Experimental Mathematics
- A note on algebraic independence of logarithmic and exponential constants
- Fast Algorithms for Manipulating Formal Power Series
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- GFUN
- Decision problems for differential equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Multiplying matrices faster than coppersmith-winograd
- Transcendental numbers and diophantine approximations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item