Black box linear algebra

DOI10.1145/3055282.3055291zbMATH Open1365.65126arXiv1607.04514OpenAlexW2513122423MaRDI QIDQ5268822FDOQ5268822

Wayne Eberly

Publication date: 21 June 2017

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Abstract: Wiedemann's paper, introducing his algorithm for sparse and structured matrix computations over arbitrary fields, also presented a pair of matrix preconditioners for computations over small fields. The analysis of the second of these is extended in order to provide more explicit statements of the expected number of nonzero entries in the matrices obtained as well as bounds on the probability that such matrices have maximal rank. This is part of ongoing work to establish that this matrix preconditioner can also be used to bound the number of nontrivial nilpotent blocks in the Jordan normal form of a preconditioned matrix, in such a way that one can also sample uniformly from the null space of the originally given matrix. If successful this will result in a black box algorithm for the type of matrix computation required when using the number field sieve for integer factorization that is provably reliable and - by a small factor - asymptotically more efficient than alternative techniques that make use of other matrix preconditioners or require computations over field extensions.

Full work available at URL: https://arxiv.org/abs/1607.04514

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08)

Cites Work

• Solving sparse linear equations over finite fields
• Black box linear algebra

Cited In (4)

• Title not available (Why is that?)
• Efficient matrix preconditioners for black box linear algebra
• Black box linear algebra
• Spline split quaternion interpolation in Minkowski space

This page was built for publication: Black box linear algebra

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