Direct Methods For Linear Systems
Direct Methods for Linear Systems is a computational approach in numerical analysis that belongs to the class of algorithms designed to solve systems of linear equations by transforming the system into an equivalent form through a finite sequence of arithmetic operations, distinguishing itself from iterative methods by guaranteeing an exact solution in the absence of rounding errors.
190
Publications
11.5K
Citations
354
Authors
171
Institutions
Publications per year
2017–2026
10
Parents
190
A Proposal for Toeplitz Matrix Calculations
Gilbert Strang · Studies in Applied Mathematics · 1986 · 429 citations
1–5 of 190
354
6
h-index
4
h-index
4
h-index
3
h-index
2
h-index
1–5 of 354
171

Rutherford Appleton Laboratory
Didcot, United Kingdom
7 h-index
11 publications
594 citations
AGH University of Krakow
Krakow, Poland
4 h-index
4 publications
97 citations
Sandia National Laboratories
Albuquerque, United States
3 h-index
7 publications
586 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
3 h-index
4 publications
116 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
7 publications
257 citations
Brown University
Providence, United States
3 h-index
3 publications
99 citations
University of Liège
Liège, Belgium
3 h-index
5 publications
168 citations

Indian Institute of Technology Bombay
Mumbai, India
2 h-index
6 publications
87 citations
1–8 of 171
8 publications · 637 citations
8
h-index
TOMS · 7 publications · 904 citations
7
h-index
7 publications · 891 citations
7
h-index
MCOM · 6 publications · 892 citations
6
h-index
5 publications · 139 citations
5
h-index
1–5