Wiedemann algorithm: an efficient approach for solving linear systems with sparse matrices
Year: 2025
Type: article
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.
Authors: Moumouni DJASSIBO WOBA*, ZONGO Moumouni, ZOUNGRANA Amidou
Institution: University of Koudougou
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6949618202
FWCI:
Cites:
Cited by:
Related to: