Search NASA⌕ Search

SEARCH · Search NASA

Results for “transport sweeps”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Parallel transport sweeps on two-dimensional cartesian and hexagonal grids

This paper aims to provide a proof of concept for parallel transport sweeps on two-dimensional hexagonal grids for the discrete ordinates transport equation. While the method is an extension of the popular and well-established Koch-Baker-Alcoulffe (KBA) algorithm, there are significant differences between the cartesian and hexagonal grid and thereafter sweep. The most important is the three-way connectivity of hexagons within the grid which creates greater dependencies between the elements. The KBA method in structured orthogonal grids was first implemented in the DRAGON5 code and the method is first described here. The differences in implementation for the hexagonal grid are also described. Benchmark results are also presented, showing roughly 10 times speedup in computational times with roughly 100 processors, in both cases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Massively parallel transport sweeps on meshes with cyclic dependencies

When solving the first-order form of the linear Boltzmann equation, a common misconception is that the matrix-free computational method of “sweeping the mesh”, used in conjunction with the Discrete Ordinates method, is too complex or does not scale well enough to be implemented in modern high performance computing codes. This has led to considerable efforts in the development of matrix-based methods that are computationally expensive and is partly driven by the requirements placed on modern spatial discretizations. In particular, modern transport codes are required to support higher order elements, a concept that invariably adds a lot of complexity to sweeps because of the introduction of cyclic dependencies with curved mesh cells. In this article we will present a comprehensive implementation of sweeping, to a piecewise-linear DFEM spatial discretization with particular focus on handling cyclic dependencies and possible extensions to higher order spatial discretizations. We find that these methods are implemented in a new C++ simulation framework called Chi-Tech (). We present some typical simulation results with some performance aspects that one can expect during real world simulations, we also present a scaling study to >100k processes where Chi-Tech maintains greater than 80% efficiency solving a total of 87.7 trillion angular flux unknowns for a 116 group simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2003

Some Remarks on GMRES for Transport Theory

We review some work on the application of GMRES to the solution of the discrete ordinates transport equation in one-dimension. We note that GMRES can be applied directly to the angular flux vector, or it can be applied to only a vector of flux moments as needed to compute the scattering operator of the transport equation. In the former case we illustrate both the delights and defects of ILU right-preconditioners for problems with anisotropic scatter and for problems with upscatter. When working with flux moments we note that GMRES can be used as an accelerator for any existing transport code whose solver is based on a stationary fixed-point iteration, including transport sweeps and DSA transport sweeps. We also provide some numerical illustrations of this idea. We finally show how space can be traded for speed by taking multiple transport sweeps per GMRES iteration. Key Words: transport equation, GMRES, Krylov subspace

Patton, Bruce W.↗
DOE OSTI2021

Analysis of a New Implicit Solver for a Semiconductor Model

Here, we present and analyze a new iterative solver for implicit discretizations of a simplified Boltzmann--Poisson system. The algorithm builds on recent work that incorporated a sweeping algorithm for the Vlasov--Poisson equations as part of nested inner-outer iterative solvers for the Boltzmann--Poisson equations. The new method eliminates the need for nesting and requires only one transport sweep per iteration. It arises as a new fixed-point formulation of the discretized system which we prove to be contractive for a given electric potential. We also derive an accelerator to improve the convergence rate for systems in the drift-diffusion regime. We numerically compare the efficiency of the new solver, with and without acceleration, against a recently developed nested iterative solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Neutron (and other Particle) Transport at LANL: An Overview [Presentation]

For decades, Los Alamos National Laboratory has been at the forefront of neutron transport methods research and code development. One such code is PARTISN, the LANL parallel time-dependent discrete ordinate neutron transport code. In this presentation, we describe the various research efforts currently underway by the PARTISN and other code teams. Some examples of current research are a block automated mesh refinement scheme, the application of tensor trains to the discretized neutron transport equation, and GPU code porting. The block automated mesh refinement scheme uses cross section information to refine and coarsen the solution mesh to improve time to solution and reduce memory. The tensor train approach expresses discretized transport operators as tensor products of vectors and matrices to compress the size of linear systems being solved by transport codes. Rather than relying on matrix-free methods such as the transport sweep, we have access to an operator that can be inverted, reshaped, or manipulated algebraically. Finally, we describe how PARTISN is used, what problems we are looking to solve, and what the future holds for neutron transport at LANL. In addition to this, we briefly describe the various research efforts in other particle transport teams using both deterministic and Monte Carlo methods. In the presentation, we list possible opportunities for collaboration between the laboratory and faculty and students.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Data-driven acceleration of thermal radiation transfer calculations with the dynamic mode decomposition and a sequential singular value decomposition

In this work, we present a method for accelerating discrete ordinates radiative transfer calculations for radiative transfer. Our method works with nonlinear positivity fixes, in contrast to most acceleration schemes. The method is based on the dynamic mode decomposition (DMD) and using a sequence of rank-one updates to compute the singular value decomposition needed for DMD. Using a sequential method allows us to automatically determine the number of solution vectors to include in the DMD acceleration. We present results for slab geometry discrete ordinates calculations with the standard temperature linearization. Compared with positive source iteration, our results demonstrate that our acceleration method reduces the number of transport sweeps required to solve the problem by a factor of about 3 on a standard diffusive Marshak wave problem, a factor of several thousand on a cooling problem where the effective scattering ratio approaches unity, and a factor of 20 improvement in a realistic, multimaterial radiating shock problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A family of independent Variable Eddington Factor methods with efficient preconditioned iterative solvers

We present a family of discretizations for the Variable Eddington Factor (VEF) equations that have high-order accuracy on curved meshes and efficient preconditioned iterative solvers. The VEF discretizations are combined with the Discontinuous Galerkin transport discretization from to form effective high-order, linear transport methods. The VEF discretizations are derived by extending the unified analysis of Discontinuous Galerkin methods for elliptic problems presented by Arnold et al. to the VEF equations. This framework is used to define analogs of the interior penalty, second method of Bassi and Rebay, minimal dissipation local Discontinuous Galerkin, and continuous finite element methods. The analysis of subspace correction preconditioners, which use a continuous operator to iteratively precondition the discontinuous discretization, is extended to the case of the non-symmetric VEF system. Numerical results demonstrate that the VEF discretizations have arbitrary-order accuracy on curved meshes, preserve the thick diffusion limit, and are effective on a proxy problem from thermal radiative transfer in both outer transport iterations and inner preconditioned linear solver iterations. We demonstrate that the VEF solution converges to the S N transport solution as the mesh is refined on both problems with smooth and non-smooth behavior in angle. Parallel performance studies show that the interior penalty VEF discretization's linear solve weak scales out to 1024 processors and strong scales well on a single node. Particular attention is paid to the parallel performance of the VEF algorithm when used in combination with a parallel block Jacobi transport sweep.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2005

NASA's Earth Observations of the Global Environment: Our Changing Planet and the View from Space

A birds eye view of the Earth from afar and up close reveals the power and magnificence of the Earth and juxtaposes the simultaneous impacts and powerlessness of humankind. The NASA Electronic Theater presents Earth science observations and visualizations in an historical perspective. See the latest spectacular images from NASA remote sensing missions like TRMM, SeaWiFS, Landsat 7, Terra, and Aqua, which will be visualized and explained in the context of global change and man s impact on our world s environment. See visualizations of global data sets currently available from Earth orbiting satellites, including the Earth at night with its city lights. Shown in high resolution are visualizations of tropical cyclone Eline and the resulting flooding of Mozambique. See flybys of Cape Town, South Africa with its dramatic mountains and landscape, as well as satellite imagery of fires that occurred globally, with a special emphasis on fires in the western US during summer 2001, and how new satellite tools can be used to help fight these disasters from spreading further. See where and when lightning occurs globally, and how dramatic urbanization has been in the desert southwest since 1910. Spectacular visualizations of the global atmosphere and oceans are shown. Learn when and where carbon is absorbed by vegetation on the land and ocean as the product of photosynthesis. See demonstrations of the 3-dimensional structure of hurricanes and cloud structures derived from recently launched Earth-orbiting satellites, and how hurricanes can modify the sea surface temperature in their wake. See massive dust storms in the Middle East as well as dust transport sweeping from north Africa across the Atlantic to the Caribbean and Amazon basin. Learn where and how much the temperature of the Earth s surface has changed during the 20th century, as well as how sea ice has decreased over the Arctic region, how sea level has and is likely to continue to change, and how glaciers have retreated worldwide in a response to global change. We will illustrate these and other topics with a dynamic theater-style presentation, along with animations of satellite launch deployments and orbital mapping to highlight aspects of Earth observations from space.

King, michael D.↗
NASA NTRS1974

Low speed wind tunnel tests of a 1/9-scale model of a variable-sweep advanced supersonic transport

Tests have been conducted in the Langley full-scale tunnel to determine the aerodynamic characteristics of a 1/9-scale variable-sweep advanced supersonic transport configuration. The model configurations investigated were the basic unflapped arrangement, and a takeoff and landing flap arrangement with several strake leading edge flow control devices. The tests were conducted for an angle-of-attack range from about minus 5 deg to 36 deg and a sideslip range from minus 5 deg to 10 deg. The tests were conducted for a range of Reynolds number from 3.92 million to 5.95 million corresponding to test velocities of about 54.5 knots and 81.7 knots, respectively.

Mclemore, H. C.↗