scientific article; zbMATH DE number 1253961

zbMATH Open0917.65041MaRDI QIDQ4226935FDOQ4226935

Authors: Gilles Villard 

Publication date: 23 February 1999

Title of this publication is not available (Why is that?)

Recommendations

• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• scientific article; zbMATH DE number 503196
• Version of block Lanczos-type algorithm for solving sparse linear systems

zbMATH Keywords

block algorithmlarge sparse systemssmall finite fieldslarge cardinality fields

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Cited In (12)

• On efficient sparse integer matrix Smith normal form computations
• Nearly sparse linear algebra and application to discrete logarithms computations
• On efficient calculations for Bayesian variable selection
• Efficient matrix preconditioners for black box linear algebra
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
• Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
• Block-Krylov techniques in the context of sparse-FGLM algorithms
• An Optimal Bloom Filter Replacement Based on Matrix Solving
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Solving sparse linear equations over finite fields
• Version of block Lanczos-type algorithm for solving sparse linear systems
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm

This page was built for publication:

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