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

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.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-03-30
DOI
https://doi.org/10.5281/zenodo.15179467
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
article

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

article en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
University of Koudougou (BF), Centre Jean Bernard (FR)
Openalex Percentile: Top 50%
Matrix Theory and Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Wiedemann algorithm: an efficient approach for solving linear systems with sparse matrices · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS