Mathemagix
From MaRDI portal
Cited in
(65)- Fast polynomial multiplication over \(\mathbb{F}_{2^{60}}\)
- On asymptotic extrapolation
- Guessing singular dependencies
- Meta-expansion of transseries
- Categories as type classes in the Scala algebra system
- Employing C++ templates in the design of a computer algebra library
- On the complexity of the Lickteig-Roy subresultant algorithm
- Collaborative computer algebra
- Efficient accelero-summation of holonomic functions
- Computational schemes for subresultant chains
- Exact \(p\)-adic computation in Magma
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- New algorithms for relaxed multiplication
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- On the isotopic meshing of an algebraic implicit surface
- Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation?
- Sparse resultants and straight-line programs
- Effective asymptotics analysis for finance
- Sparse polynomials in FLINT
- Automatic asymptotics for coefficients of smooth, bivariate rational functions
- Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings
- Computations with effective real numbers
- tangent Graeffe
- Dagwood
- FLINT
- gmp
- Isolde
- Kronecker
- LinBox
- matrixss
- TRIP
- Axel
- GENOM3CK
- mpFq
- gf2x
- MD-jeep
- CUMP
- GPUprec
- MPIGMP
- Geomsolvex
- A regularization approach for estimating the type of a plane curve singularity
- Newton's method and FFT trading
- Mmxlib
- Lacunaryx
- Lindalg
- PfaffInt
- Genus2Conductor
- ExactpAdics
- ScAS
- pAdicGaloisGroup
- Degeneracy loci and polynomial equation solving
- Even faster integer multiplication
- Lacunaryx: computing bounded-degree factors of lacunary polynomials
- Around the numeric-symbolic computation of differential Galois groups
- Polynomial root finding over local rings and application to error correcting codes
- Analytic form of the planar two-loop five-parton scattering amplitudes in QCD
- On the computation of the topology of a non-reduced implicit space curve
- On the complexity of integer matrix multiplication
- On the complexity of skew arithmetic
- Relaxed algorithms for \(p\)-adic numbers
- On the complexity exponent of polynomial system solving
- Implementing fast carryless multiplication
- Relaxed Hensel lifting of triangular sets
- Relaxed \(p\)-adic Hensel lifting for algebraic systems
- Formal solutions of completely integrable Pfaffian systems with normal crossings
This page was built for software: Mathemagix
