Distributed matrix-free solution of large sparse linear systems over finite fields

DOI10.1007/PL00008266zbMath1078.65542OpenAlexW2052469740WikidataQ29305984 ScholiaQ29305984MaRDI QIDQ1125817

A. Lobo, Erich L. Kaltofen

Publication date: 27 June 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00008266

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Related Items (6)

Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates ⋮ Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm ⋮ Simultaneous modular reduction and Kronecker substitution for small finite fields ⋮ Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations ⋮ Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing

This page was built for publication: Distributed matrix-free solution of large sparse linear systems over finite fields