Asymptotically Fast Triangularization of Matrices over Rings
From MaRDI portal
Publication:3985809
DOI10.1137/0220067zbMATH Open0738.68050OpenAlexW1985138225MaRDI QIDQ3985809FDOQ3985809
Authors: Kevin S. McCurley, James Lee Hafner 
Publication date: 27 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/5280687
Recommendations
Factorization of matrices (15A23) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Cited In (29)
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
- Recognizing Units in Number Fields
- Computing the structure of a finite abelian group
- Computing in quotients of rings of integers
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Factoring polynomials over local fields.
- On the complexity of inverting integer and polynomial matrices
- Toric intersection theory for affine root counting
- Approximating rings of integers in number fields
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Random matrices over a DVR and LU factorization
- Recognizing badly presented \(Z\)-modules
- Reduction of Smith normal form transformation matrices
- Morse theory for filtrations and efficient computation of persistent homology
- The shifted number system for fast linear algebra on integer matrices
- Finding orientations of supersingular elliptic curves and quaternion orders
- Hermite and Smith normal form algorithms over Dedekind domains
- Computation of the topological type of a real Riemann surface
- Polynomial functions over finite commutative rings
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank
- Computing Hermite and Smith normal forms of triangular integer matrices
- The power and Arnoldi methods in an algebra of circulants.
- Solving a sparse system using linear algebra
- Algorithms in Algebraic Number Theory
- CoEulerian graphs
- High-order lifting and integrality certification
- On the computation of the HNF of a module over the ring of integers of a number field
- [[Publication:2878808|Linear algebra over \(\mathbb Z_pu\) and related rings]]
This page was built for publication: Asymptotically Fast Triangularization of Matrices over Rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985809)
