Relaxed algorithms for p-adic numbers

DOI10.5802/JTNB.777MaRDI QIDQ449711zbMATH OpenOpenAlexFDO

Authors Jérémy Berthomieu, Joris van der Hoeven, Grégoire Lecerf

Publication date 31 August 2012

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/219803

zbMATH Keywords

algorithms\(p\)-adic numberspower series

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Recommendations

• Relaxed \(p\)-adic Hensel lifting for algebraic systems
• Exact \(p\)-adic computation in Magma
• Faster relaxed multiplication
• \textsf{ZpL}: a \(p\)-adic precision package
• Relax, but don't be too lazy

Cites work

• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 4171064 (Why is no real title available?)
• scientific article; zbMATH DE number 3897063 (Why is no real title available?)
• scientific article; zbMATH DE number 3566956 (Why is no real title available?)
• scientific article; zbMATH DE number 1253958 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• A concise proof of the Kronecker polynomial system solver from scratch
• Effective procedures in field theory
• Efficient accelero-summation of holonomic functions
• Fast Algorithms for Manipulating Formal Power Series
• Fast evaluation of holonomic functions
• Fast evaluation of holonomic functions near and in regular singularities
• Fast multiplication of large numbers
• Faster integer multiplication
• Hensel and Newton Methods in Valuation Rings
• New algorithms for relaxed multiplication
• Newton's method and FFT trading
• On fast multiplication of polynomials over arbitrary algebras
• Relax, but don't be too lazy
• \(p\)-adic analysis compared with real

Cited in

(18)

• \textsf{ZpL}: a \(p\)-adic precision package
• On an efficient algorithm for big rational number computations by parallel \(p\)-adics
• Extending the PSLQ Algorithm to Algebraic Integer Relations
• Faster relaxed multiplication
• Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
• On the complexity exponent of polynomial system solving
• Relax, but don't be too lazy
• scientific article; zbMATH DE number 6693374 (Why is no real title available?)
• scientific article; zbMATH DE number 4125509 (Why is no real title available?)
• scientific article; zbMATH DE number 3636092 (Why is no real title available?)
• Polynomial root finding over local rings and application to error correcting codes
• Fast arithmetic in unramified \(p\)-adic fields
• Relaxed Hensel lifting of triangular sets
• A simple and fast online power series multiplication and its analysis
• Exact \(p\)-adic computation in Magma
• On FGLM algorithms with Tate algebras
• Relaxed \(p\)-adic Hensel lifting for algebraic systems
• Tracking \(p\)-adic precision

Describes a project that uses

Uses Software

• SageMath
• PARI/GP
• Mathemagix
• Kronecker
• gmp
• FLINT

This page was built for publication: Relaxed algorithms for \(p\)-adic numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449711)