On validated computing in algebraic number fields

DOI10.1006/JSCO.1997.0159MaRDI QIDQ1382030zbMATH OpenOpenAlexFDO

Authors Michael E. Pohst

Publication date 15 February 1999

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1997.0159

zbMATH Keywords

decimal approximationsnumber field computationsunits

Mathematics Subject Classification ID

Units and factorization (11R27) Algebraic number theory computations (11Y40) Symbolic computation and algebraic computation (68W30)

Review text

The author considers the use of decimal approximations (rather than integer arithmetic) in number field computations required (say) for finding units, e.g., divisibility of two numbers in an order and finding numbers with given norm. The LLL-algorithm is useful in ensuring scaled matrices for the basis (and conjugates). Specific practical bounds are given.

Recommendations

• The generalized Voronoi-algorithm in totally real algebraic number fields
• scientific article; zbMATH DE number 3961764
• scientific article; zbMATH DE number 1113832
• On the computation of units and class numbers by a generalization of Lagrange's algorithm

Cited in

(4)

• Hidden verification for computational mathematics
• Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry
• Computing algebraic numbers of bounded height
• Algebraic number fields and the LLL algorithm

This page was built for publication: On validated computing in algebraic number fields

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