Wiedemann algorithm: an efficient approach for solving linear systems with sparse matrices

Moumouni DJASSIBO WOBA; ZONGO Moumouni; ZOUNGRANA Amidou

doi:https://doi.org/10.5281/zenodo.15179468

Wiedemann algorithm: an efficient approach for solving linear systems with sparse matrices

Author: Moumouni DJASSIBO WOBA*, ZONGO Moumouni, ZOUNGRANA Amidou

Université Lédéa Bernard OUEDRAOGO (B.F).

Published Date: 2025-03-30

Keywords: Sparse matrices, Linear systems, Minimal polynomial, Recurrent sequence, Constant coefficients.

Abstract:

Sparse matrices are matrices that contain many zero elements. The Wiedemann algorithm is an iterative method for solving linear systems represented by sparse matrices. It reduces the solution to the computation of the minimal polynomial, which itself relies on the recognition of a recurrent sequence with constant coefficients.