All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
Block Wiedemann algorithm
The block Wiedemann algorithm for computing kernel vectors of a matrix over a finite field is a generalisation of an algorithm due to Don Coppersmith…Â
(More)
Wikipedia
Topic mentions per year
Topic mentions per year
1993-2016
0
1
2
3
1993
2016
Related topics
Related topics
7 relations
Berlekamp–Massey algorithm
Block Lanczos algorithm
Fast Fourier transform
General number field sieve
(More)
Broader (1)
Numerical linear algebra
Related mentions per year
Related mentions per year
1955-2018
1960
1980
2000
2020
Block Wiedemann algorithm
Fast Fourier transform
Numerical linear algebra
Berlekamp–Massey algorithm
General number field sieve
Quadratic sieve
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Online order basis algorithm and its impact on the block Wiedemann algorithm
Pascal Giorgi
,
Romain Lebreton
ISSAC
2014
Order bases are a fundamental tool for linear algebra with polynomial coefficients. In particular, block Wiedemann methods are…Â
(More)
Is this relevant?
2013
2013
Block Wiedemann algorithm on multicore architectures
Bastien Vialla
ACM Comm. Computer Algebra
2013
Solving a linear system with large sparse matrices is a computational kernel used in a wide range of applications, e.g…Â
(More)
Is this relevant?
2013
2013
Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems
Bertil Schmidt
,
Hans Aribowo
,
Hoang-Vu Dang
Concurrency and Computation: Practice and…
2013
The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector…Â
(More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Solving Homogeneous Linear Equations over Gf(2) via Block Wiedemann Algorithm
Don Coppersmith
2007
We propose a method of solving large sparse systems of homogeneous linear equations over GF(2), the field with two elements. We…Â
(More)
Is this relevant?
2006
2006
A block Wiedemann rank algorithm
William J. Turner
ISSAC
2006
This paper makes two contributions to block Wiedemann algorithms. We describe how to compute the minimal generating matrix…Â
(More)
Is this relevant?
2002
2002
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
Emmanuel Thomé
J. Symb. Comput.
2002
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences…Â
(More)
Is this relevant?
2001
2001
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
Emmanuel Thomé
ISSAC
2001
In this paper we describe how the half-gcd algorithm can be adapted in order to speed up the sequential stage of Coppersmith's…Â
(More)
Is this relevant?
1997
1997
Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract)
Gilles Villard
ISSAC
1997
We analyse the probability of success of the block algorithm proposed by Coppersmith for solving large sparse systems Aw = O of…Â
(More)
Is this relevant?
1997
1997
A Study of Coppersmith ' S Block Wiedemannalgorithm Using Matrix Polynomialsgilles
Gilles Villard
1997
Nous analysons un algorithme probabiliste par blocs, propos e par Coppersmith, pour la r esolution de grands syst emes lin eaires…Â
(More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
Erich Kaltofen
AAECC
1993
By using projections by a block of vectors in place of a single vector it is possible to parallelize the outer loop of iterative…Â
(More)
Is this relevant?