Algorithms for solving linear systems over cyclotomic fields
DOI10.1016/J.JSC.2010.05.001zbMATH Open1195.65029OpenAlexW2045078718MaRDI QIDQ987701FDOQ987701
Authors: Liang Chen, Michael Monagan
Publication date: 13 August 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.05.001
Recommendations
numerical exampleslinear systemscyclotomic polynomialsMaplecyclotomic fieldscomputational group theoryChinese remainderinglinear \(p\)-adic liftingmodular algorithmsmultiple primes
Direct numerical methods for linear systems and matrix inversion (65F05) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Polynomials over finite fields (11T06)
Cites Work
- Exact solution of linear equations using p-adic expansions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the coefficients of the cyclotomic polynomial
- The shifted number system for fast linear algebra on integer matrices
- Title not available (Why is that?)
- Efficient rational number reconstruction
- Maximal quotient rational reconstruction
- Title not available (Why is that?)
- Faster inversion and other black box matrix computations using efficient block projections
- Title not available (Why is that?)
- A BLAS based C library for exact linear algebra on integer matrices
Cited In (4)
- An algorithm to obtain linear determinantal representations of smooth plane cubics over finite fields
- Algorithms for solving linear equations over associative rings with unit element
- Title not available (Why is that?)
- A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions
Uses Software
This page was built for publication: Algorithms for solving linear systems over cyclotomic fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987701)