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

Authors

222

  1. HZ
    Hongkai Zhao

    University of California, Irvine, United States

    9 publications · 2.3K citations

    9

    h-index

  2. JQ
    Jianliang Qian

    Michigan State University, United States

    7 publications · 813 citations

    7

    h-index

  3. YZ
    Yong‐Tao Zhang

    University of Notre Dame, United States

    6 publications · 706 citations

    6

    h-index

  4. SL
    Songting Luo

    Iowa State University, United States

    6 publications · 430 citations

    6

    h-index

  5. SO
    Stanley Osher

    University of California, Los Angeles, United States

    3 publications · 621 citations

    3

    h-index

1–5 of 222

Venues

  1. Journal of Computational Physics

    10 publications · 545 citations

    10

    h-index

  2. SIAM Journal on Scientific Computing

    6 publications · 244 citations

    6

    h-index

  3. Journal of Differential Equations

    5 publications · 279 citations

    5

    h-index

  4. SIAM Journal on Numerical Analysis

    4 publications · 846 citations

    4

    h-index

  5. Journal of Scientific Computing

    4 publications · 527 citations

    4

    h-index

1–5