Mathemagix
From MaRDI portal
Software:13308
swMATH553MaRDI QIDQ13308FDOQ13308
Author name not available (Why is that?)
Cited In (39)
- Guessing singular dependencies
- Degeneracy loci and polynomial equation solving
- On the complexity of skew arithmetic
- Computational schemes for subresultant chains
- On the computation of the topology of a non-reduced implicit space curve
- On the isotopic meshing of an algebraic implicit surface
- Formal solutions of completely integrable Pfaffian systems with normal crossings
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- On the complexity of integer matrix multiplication
- On the complexity of the Lickteig-Roy subresultant algorithm
- Sparse polynomials in FLINT
- On the complexity exponent of polynomial system solving
- Even faster integer multiplication
- Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings
- Relaxed algorithms for \(p\)-adic numbers
- 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
- Employing C++ Templates in the Design of a Computer Algebra Library
- Collaborative Computer Algebra
- Implementing Fast Carryless Multiplication
- Newton's method and FFT trading
- Automatic asymptotics for coefficients of smooth, bivariate rational functions
- Relaxed p-adic Hensel lifting for algebraic systems
- Lacunaryx
- Relaxed Hensel lifting of triangular sets
- Meta-expansion of transseries
- EFFECTIVE ASYMPTOTICS ANALYSIS FOR FINANCE
- On asymptotic extrapolation
- Mathemagix
- Categories as Type Classes in the Scala Algebra System
- Sparse resultants and straight-line programs
- Exact \(p\)-adic computation in Magma
- Efficient accelero-summation of holonomic functions
- New algorithms for relaxed multiplication
- Around the numeric-symbolic computation of differential Galois groups
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- Computations with effective real numbers
- A regularization approach for estimating the type of a plane curve singularity
- Fast Polynomial Multiplication over F 2 60
This page was built for software: Mathemagix