Sweeping Algorithms
Sweeping Algorithms is a computational procedure within the Discrete Ordinates Method that systematically traverses spatial and angular grids to solve the neutron transport equation by propagating flux information along discrete directional ordinates in a prioritized, sweep-by-sweep manner.
103
Publications
7.1K
Citations
222
Authors
114
Institutions
Publications per year
2017–2026
23
Parents
103
A fast sweeping method for Eikonal equations
Hongkai Zhao · Mathematics of Computation · 2004 · 1.1K citations · Full text
Ironing, Sweeping, and Multidimensional Screening
Jean‐Charles Rochet, Philippe Choné · Econometrica · 1998 · 607 citations
1–5 of 103
222
9
h-index
7
h-index
6
h-index
6
h-index
3
h-index
1–5 of 222
114
University of California, Irvine
Irvine, United States
8 h-index
13 publications
3.1K citations
The University of Texas at Austin
Austin, United States
4 h-index
8 publications
320 citations
University of California, Los Angeles
Los Angeles, United States
4 h-index
5 publications
889 citations
Texas A&M University
College Station, United States
3 h-index
13 publications
525 citations

University of Notre Dame
Notre Dame, United States
3 h-index
5 publications
244 citations
Laboratoire de Mathématiques d'Orsay
Orsay, France
3 h-index
4 publications
240 citations
Iowa State University
Ames, United States
3 h-index
4 publications
137 citations

Université de Montpellier
Montpellier, France
3 h-index
4 publications
453 citations
1–8 of 114
10 publications · 545 citations
10
h-index
6 publications · 244 citations
6
h-index
5 publications · 279 citations
5
h-index
4 publications · 846 citations
4
h-index
4 publications · 527 citations
4
h-index
1–5