skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: MULTIGRID REDUCTION IN TIME WITH ADAPTIVE SPATIAL COARSENING FOR THE LINEAR ADVECTION EQUATION

Authors:
; ; ; ;
Publication Date:
Research Org.:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1351132
Report Number(s):
LLNL-PROC-716758
DOE Contract Number:
AC52-07NA27344
Resource Type:
Conference
Resource Relation:
Conference: Presented at: 18th Copper Mountain Conference on Multigrid Methods 2017, Copper Mountain, CO, United States, Mar 26 - Mar 30, 2017
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE

Citation Formats

Howse, A M, De Sterck, H, MacLachlan, S P, Falgout, R D, and Schroder, J B. MULTIGRID REDUCTION IN TIME WITH ADAPTIVE SPATIAL COARSENING FOR THE LINEAR ADVECTION EQUATION. United States: N. p., 2017. Web.
Howse, A M, De Sterck, H, MacLachlan, S P, Falgout, R D, & Schroder, J B. MULTIGRID REDUCTION IN TIME WITH ADAPTIVE SPATIAL COARSENING FOR THE LINEAR ADVECTION EQUATION. United States.
Howse, A M, De Sterck, H, MacLachlan, S P, Falgout, R D, and Schroder, J B. Wed . "MULTIGRID REDUCTION IN TIME WITH ADAPTIVE SPATIAL COARSENING FOR THE LINEAR ADVECTION EQUATION". United States. doi:. https://www.osti.gov/servlets/purl/1351132.
@article{osti_1351132,
title = {MULTIGRID REDUCTION IN TIME WITH ADAPTIVE SPATIAL COARSENING FOR THE LINEAR ADVECTION EQUATION},
author = {Howse, A M and De Sterck, H and MacLachlan, S P and Falgout, R D and Schroder, J B},
abstractNote = {},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Wed Jan 04 00:00:00 EST 2017},
month = {Wed Jan 04 00:00:00 EST 2017}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Solving the linear Boltzmann equation in neutron scattering phenomena presents many challenges to standard numerical schemes in computational physics. For an SN discretization, the so-called ray effects pollute the numerical solution. This pollution can be viewed mathematically as ''contamination'' from a poorly chosen approximating basis set for the angle component of the discretization-i.e., collocation in angle is equivalent to discretization with delta basis functions, which form a poor approximating basis set. Fortunately, a PN discretization, which uses a better approximating basis set (i.e., spherical harmonics), eliminates these ray effects. Unfortunately, solving for the moments or PN equations is difficult. Momentsmore » couple strongly with each other, creating a strongly coupled system of partial differential equations (pde's) ; numerical algorithms for solving such strongly coupled systems are difficult to develop. In this paper, novel algorithms for solving this coupled system are presented. In particular, algorithms for solving the PN discretization of the linear Boltzmann equation using a first-order system least-squares (FOSLS) methodology (c.f. [1]) are presented.« less
  • An efficient numerical method for time-dependent transport equation, the mutigrid amplitude function (MAF) method, is proposed. The method of characteristics (MOC) is being widely used for reactor analysis thanks to the advances of numerical algorithms and computer hardware. However, efficient kinetic calculation method for MOC is still desirable since it requires significant computation time. Various efficient numerical methods for solving the space-dependent kinetic equation, e.g., the improved quasi-static (IQS) and the frequency transform methods, have been developed so far mainly for diffusion calculation. These calculation methods are known as effective numerical methods and they offer a way for faster computation.more » However, they have not been applied to the kinetic calculation method using MOC as the authors' knowledge. Thus, the MAF method is applied to the kinetic calculation using MOC aiming to reduce computation time. The MAF method is a unified numerical framework of conventional kinetic calculation methods, e.g., the IQS, the frequency transform, and the theta methods. Although the MAF method is originally developed for the space-dependent kinetic calculation based on the diffusion theory, it is extended to transport theory in the present study. The accuracy and computational time are evaluated though the TWIGL benchmark problem. The calculation results show the effectiveness of the MAF method. (authors)« less
  • The numerical solution of the advection-diffusion problem in the inviscid limit with closed characteristics is studied as a prelude to an efficient high Reynolds-number flow solver. It is demonstrated by a heuristic analysis and numerical calculations that using upstream discretization with downstream relaxation-ordering and appropriate residual weighting in a simple multigrid V cycle produces an efficient solution process. We also derive upstream finite-difference approximations to the advection operator, whose truncation terms approximate {open_quotes}physical{close_quotes} (Laplacian) viscosity, thus avoiding spurious solutions to the homogeneous problem when the artificial diffusivity dominates the physical viscosity.
  • Standard multigrid methods are not well suited for problems with anisotropic coefficients which can occur, for example, on grids that are stretched to resolve a boundary layer. There are several different modifications of the standard multigrid algorithm that yield efficient methods for anisotropic problems. In the paper, we investigate the parallel performance of these multigrid algorithms. Multigrid algorithms which work well for anisotropic problems are based on line relaxation and/or semi-coarsening. In semi-coarsening multigrid algorithms a grid is coarsened in only one of the coordinate directions unlike standard or full-coarsening multigrid algorithms where a grid is coarsened in each ofmore » the coordinate directions. When both semi-coarsening and line relaxation are used, the resulting multigrid algorithm is robust and automatic in that it requires no knowledge of the nature of the anisotropy. This is the basic multigrid algorithm whose parallel performance we investigate in the paper. The algorithm is currently being implemented on an IBM SP2 and its performance is being analyzed. In addition to looking at the parallel performance of the basic semi-coarsening algorithm, we present algorithmic modifications with potentially better parallel efficiency. One modification reduces the amount of computational work done in relaxation at the expense of using multiple coarse grids. This modification is also being implemented with the aim of comparing its performance to that of the basic semi-coarsening algorithm.« less