Guessing singular dependencies
From MaRDI portal
Publication:2437325
DOI10.1016/J.JSC.2013.07.002zbMATH Open1290.30001OpenAlexW2072163726WikidataQ122178562 ScholiaQ122178562MaRDI QIDQ2437325FDOQ2437325
Authors: Joris van der Hoeven
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
Recommendations
Cites Work
- GFUN
- Title not available (Why is that?)
- Numerical recipes. The art of scientific computing.
- Factoring polynomials with rational coefficients
- Relax, but don't be too lazy
- Gaussian elimination is not optimal
- Title not available (Why is that?)
- Multiplying matrices faster than coppersmith-winograd
- Title not available (Why is that?)
- How to multiply matrices faster
- Fast Algorithms for Manipulating Formal Power Series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extrapolation methods theory and practice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision problems for differential equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Fast evaluation of holonomic functions
- Effective analytic functions
- Title not available (Why is that?)
- How to recognize zero?
- On effective analytic continuation
- On asymptotic extrapolation
- Zero tests for constants in simple scientific computation
- Transcendental numbers and diophantine approximations
- A note on algebraic independence of logarithmic and exponential constants
- Ten Problems in Experimental Mathematics
- The computer as crucible. An introduction to experimental mathematics. With illustrations by Karl H. Hofmann
Cited In (1)
Uses Software
This page was built for publication: Guessing singular dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437325)