Computations of permeability of large rock images by dual grid domain decomposition
Not Available
SEARCH · Search NASA
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.
Not Available
We consider here Anderson extrapolation to accelerate the (stationary) Richardson iterative method for sparse linear systems. Using an Anderson mixing at periodic intervals, we assess how this benefits convergence to a prescribed accuracy. The method, named alternating Anderson–Richardson, has appealing properties for high-performance computing, such as the potential to reduce communication and storage in comparison to more conventional linear solvers. We establish sufficient conditions for convergence, and we evaluate the performance of this technique in combination with various preconditioners through numerical examples. Furthermore, we propose an augmented version of this technique.
This paper presents a parallel implementation of fractional solvers for the incompressible Navier-Stokes equations using an algebraic approach. Under this framework, predictor-corrector and incremental projection schemes are seen as sub-classes of the same class, making apparent its differences and similarities. An additional advantage of this approach is to set a common basis for a parallelization strategy, which can be extended to other split techniques or to compressible flows. The predictor-corrector scheme consists in solving the momentum equation and a modified 'continuity' equation (namely a simple iteration for the pressure Schur complement) consecutively in order to converge to the monolithic solution, thus avoiding fractional errors. On the other hand, the incremental projection scheme solves only one iteration of the predictor-corrector per time step and adds a correction equation to fulfill the mass conservation. As shown in the paper, these two schemes are very well suited for massively parallel implementation. In fact, when compared with monolithic schemes, simpler solvers and preconditioners can be used to solve the non-symmetric momentum equations (GMRES, Bi-CGSTAB) and to solve the symmetric continuity equation (CG, Deflated CG). This gives good speedup properties of the algorithm. The implementation of the mesh partitioning technique is presented, as well as the parallel performances and speedups for thousands of processors.
The goal of this project is to develop and improve domain decomposition algorithms for a variety of partial differential equations such as those of linear elasticity and electro-magnetics.These iterative methods are designed for massively parallel computing systems and allow the fast solution of the very large systems of algebraic equations that arise in large scale and complicated simulations. A special emphasis is placed on problems arising from Maxwell's equation. The approximate solvers, the preconditioners, are combined with the conjugate gradient method and must always include a solver of a coarse model in order to have a performance which is independent of the number of processors used in the computer simulation. A recent development allows for an adaptive construction of this coarse component of the preconditioner.
Abstract Spurred by recent advances in detector technology and X-ray optics, upgrades to scanning-probe-based tomographic imaging have led to an exponential growth in the amount and complexity of experimental data and have created a clear opportunity for tomographic imaging to approach single-atom sensitivity. The improved spatial resolution, however, is highly susceptible to systematic and random experimental errors, such as center of rotation drifts, which may lead to imaging artifacts and prevent reliable data extraction. Here, we present a model-based approach that simultaneously optimizes the reconstructed specimen and sinogram alignment as a single optimization problem for tomographic reconstruction with center of rotation error correction. Our algorithm utilizes an adaptive regularizer that is dynamically adjusted at each alternating iteration step. Furthermore, we describe its implementation in a software package targeting high-throughput workflows for execution on distributed-memory clusters. We demonstrate the performance of our solver on large-scale synthetic problems and show that it is robust to a wide range of noise and experimental drifts with near-ideal throughput.
Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier analysis is that it can be used to minimize an estimate of the spectral radius of a stationary iteration, or the condition number of a preconditioned system, in terms of a symbol representation of the algorithm. In practice, this is a “minimax” problem, minimizing with respect to solver parameters the appropriate measure of work, which involves maximizing over the Fourier frequency. Often, several algorithmic parameters may be determined by local Fourier analysis in order to obtain efficient algorithms. Analytical solutions to minimax problems are rarely possible beyond simple problems; the status quo in local Fourier analysis involves grid sampling, which is prohibitively expensive in high dimensions. In this paper, we propose and explore optimization algorithms to solve these problems efficiently. Finally, several examples, with known and unknown analytical solutions, are presented to show the effectiveness of these approaches.
In this work, we collect data from runs of Krylov subspace methods and pipelined Krylov algorithms in an effort to understand and model the impact of machine noise and other sources of variability on performance. We find large variability of Krylov iterations between compute nodes for standard methods that is reduced in pipelined algorithms, directly supporting conjecture, as well as large variation between statistical distributions of runtimes across iterations. Based on these results, we improve upon a previously introduced nondeterministic performance model by allowing iterations to fluctuate over time. We present our data from runs of various Krylov algorithms across multiple platforms as well as our updated non-stationary model that provides good agreement with observations. We also suggest how it can be used as a predictive tool.
We present the new features available in the recent release of SuperLU_DIST, Version 8.1.1. SuperLU_DIST is a distributed-memory parallel sparse direct solver. The new features include (1) a 3D communication-avoiding algorithm framework that trades off inter-process communication for selective memory duplication, (2) multi-GPU support for both NVIDIA GPUs and AMD GPUs, and (3) mixed-precision routines that perform single-precision LU factorization and double-precision iterative refinement. Apart from the algorithm improvements, we also modernized the software build system to use CMake and Spack package installation tools to simplify the installation procedure. Throughout the article, we describe in detail the pertinent performance-sensitive parameters associated with each new algorithmic feature, show how they are exposed to the users, and give general guidance of how to set these parameters. We illustrate that the solver’s performance both in time and memory can be greatly improved after systematic tuning of the parameters, depending on the input sparse matrix and underlying hardware.
In this work, a novel iterative approach for solving discretized linear wave equations in a frequency domain, which combines time evolution with iterative relaxation schemes, is presented. In this hybrid approach, each iteration cycle consists of evolution of electromagnetic (EM) fields in time over a specified number of field periods followed by several iterative relaxations. Provided that there is sufficient dissipation, both the time evolution and the iterative relaxations contribute to the convergence of the EM fields to the solution of the formulated full wave boundary value problem. Time evolution rapidly distributes EM fields, propagating with group velocity, over the simulation domain, while the iterative relaxations smooth the fields, reducing the numerical errors such that iteration cycles converge to a steady state solution, approximating the solution of the formulated problem. This approach is intended for large scale simulations which are beyond the capabilities of direct solvers presently used for solving wave equations in the frequency domain. Lastly, the technique is demonstrated for solving wave equations on a regular grid using a cold plasma dielectric model with collisions for 2D modeling of EM fields in tokamak in an electron cyclotron frequency range.
We apply the postquasistatic approximation, an iterative method for the evolution of self-gravitating spheres of matter, to study the evolution of dissipative and electrically charged distributions in general relativity. The numerical implementation of our approach leads to a solver which is globally second-order convergent. We evolve nonadiabatic distributions assuming an equation of state that accounts for the anisotropy induced by the electric charge. Dissipation is described by streaming-out or diffusion approximations. We match the interior solution, in noncomoving coordinates, with the Vaidya-Reissner-Nordstroem exterior solution. Two models are considered: (i) a Schwarzschild-like shell in the diffusion limit; and (ii) a Schwarzschild-like interior in the free-streaming limit. These toy models tell us something about the nature of the dissipative and electrically charged collapse. Diffusion stabilizes the gravitational collapse producing a spherical shell whose contraction is halted in a short characteristic hydrodynamic time. The streaming-out radiation provides a more efficient mechanism for emission of energy, redistributing the electric charge on the whole sphere, while the distribution collapses indefinitely with a longer hydrodynamic time scale.
A new numerical method is described for the fully iterated, conjugate solution of two discrete submodels, involving (a) a transport network model for heat, moisture, and airflows in a high-permeability, air-filled cavity; and (b) a variably saturated fractured porous medium. The transport network submodel is an integrated-parameter, computational fluid dynamics solver, describing the thermal-hydrologic transport processes in the flow channel system of the cavity with laminar or turbulent flow and convective heat and mass transport, using MULTIFLUX. The porous medium submodel, using TOUGH2, is a solver for the heat and mass transport in the fractured rock mass. The new model solution extends the application fields of TOUGH2 by integrating it with turbulent flow and transport in a discrete flow network system. We present demonstrational results for a nuclear waste repository application at Yucca Mountain with the most realistic model assumptions and input parameters including the geometrical layout of the nuclear spent fuel and waste with variable heat load for the individual containers. The MULTIFLUX and TOUGH2 model elements are fully iterated, applying a programmed reprocessing of the Numerical Transport Code Functionalization model-element in an automated Outside Balance Iteration loop. The natural, convective airflow field and the heat and mass transport in a representative emplacement drift during postclosure are explicitly solved in the new model. The results demonstrate that the direction and magnitude of the air circulation patterns and all transport modes are strongly affected by the heat and moisture transport processes in the surrounding rock, justifying the need for a coupled, fully iterated model solution such as the one presented in the paper.
Various flow regimes exist in a boiling water reactor (BWR) as the steam quality increases in the uprising coolant flow, from bubbly flow, slug/churn flow, to annular flow. The annular flow is characterized by the presence of a fast-moving gas core and the surrounding liquid film flowing on the conduit wall. Additionally, entrained droplets can be observed in the gas core with ingested bubbles in the liquid film. The dynamics occurring on the wavy interface between the liquid film and gas core plays a crucial role in affecting the heat transfer rate and pressure drop within the BWR core. However, a fundamental understanding of annular flow is still lacking, partly due to the difficulty in obtaining detailed local data in annular flow experiments. In the current study, a novel simulation framework is developed for the annular flow by coupling a computational fluid dynamics flow solver with state-of-the-art meshing software. The gas-liquid interface is tracked with the level set method. Based on the computed flow solutions, the computational mesh is dynamically adapted in memory to meet the local mesh resolution requirement. This iterative simulation-adaptation framework can ensure the fine mesh resolution across the interface, which not only helps mitigate the mass conservation degradation known to level set methods but also improves the representation of dramatic interface topological changes such as wave breaking and droplet entrainment. The present investigation will shed light onto the complex interfacial processes involved in annular flow and generate much needed simulation data for annular flow modeling.
A software framework to study, from the performance and energy perspective, the efficacy of GPU-resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process
The need for parallel-in-time is being driven by changes in computer architectures, where future speed-ups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the p-Laplacian, where p = 4 corresponds to a well-known nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work required increases dramatically on coarser time grids, where relatively large time steps lead to worse conditioned nonlinear solves and increased nonlinear iteration counts per time step evaluation. This is the key difficulty explored by this paper. We show that by using a variety of strategies, most importantly, spatial coarsening and an alternate initial guess to the nonlinear time-step solver, we can reduce the work per time step evaluation over all temporal levels to a range similar with the corresponding linear problem. This allows for parallel scaling behavior comparable to the corresponding linear problem.
This work presents a spectral micromechanical formulation for obtaining the full-field and homogenized response of elastic micropolar composites. The algorithm relies on a coupled set of convolution integral equations for the micropolar strains, where periodic Green’s operators associated with a linear homogeneous reference medium are convolved with functions of the Cauchy and couple stress fields that encode the material’s heterogeneity, as well as any potential material nonlinearity. Such convolution integral equations take an algebraic form in the reciprocal Fourier space that can be solved iteratively. In this vein, the fast Fourier transform (FFT) algorithm is leveraged to accelerate the numerical solution, resulting in a mesh-free formulation in which the periodic unit cell representing the heterogeneous material can be discretized by a regular grid of pixels in two dimensions (or voxels in three dimensions). For verification, the numerical solutions obtained with the micropolar FFT solver are compared with analytical solutions for a matrix with a dilute circular inclusion subjected to plane strain loading. The developed computational framework is then used to study length-scale effects and effective (micropolar) moduli of composites with various topological configurations.
A simple approach to efficiently solve a coupled set of 1-D diffusion-type transport equations with a stiff transport model for tokamak plasmas is presented based on the 4th order accurate Interpolated Differential Operator scheme along with a nonlinear iteration method derived from a root-finding algorithm. Here, numerical tests using the Trapped Gyro-Landau-Fluid model show that the presented high order method provides an accurate transport solution using a small number of grid points with robust nonlinear convergence.
The Center for Extended Magnetohydrodynamic Modeling (CEMM) is built around the further development, verification, validation, and other application of two major extended magnetohydrodynamics (MHD) codes NIMROD and M3D-C1. The General Atomics (GA) CEMM Program focuses on three main research areas: extension of the M3D-C1 MHD code plasma response calculations to new regimes, coupling of the DK4D drift kinetic equation solver to a temperature evolution equation, and simulations of disruption mitigation for unstable plasmas with pre-existing magnetic islands using massive gas injection (MGI) with the NIMROD MHD code. A systematic scan of the zero-crossing of the rotation profile in a DIII-D ITER-similar shape equilibrium using linear, time-independent modeling with M3D-C1 was performed. A new Python utility, autoC1, has been developed to automate the running of M3D-C1 for linear simulations. A number of ELM suppression experiments were analyzed including a validation and cross-code verification with the MARS-F MHD code of magnetic signal phase shifts across ELM-suppression bifurcations. A linearized, time-dependent temperature equation was tightly coupled to the electron and ion drift-kinetic equations (DKEs) in the DK4D drift-kinetic equation solver. Various explicit and implicit implementations were attempted, but all methods proved numerically unstable, even with the addition of numerical dissipation. Several simulations were completed investigating the effects of pre-existing islands on disruption mitigation by MGI in DIII-D using NIMROD.
This report outlines the progress of Idaho National Laboratory in developing a high-fidelity and high-resolution model of the Microreactor Applications Research Validation and Evaluation reactor. The model was developed under the Nuclear Energy Advanced Modeling and Simulation microreactor application driver at Idaho National Laboratory. The overarching objective of this activity is the development of a high-fidelity multiphysics MARVEL model using NEAMS tools, and to verify and validate NEAMS tools against MARVEL reference simulation and experimental data, respectively. This is a unique opportunity to conduct multiphysics analysis on a soon-to-be-deployed microreactor. This multiphysics model developed under the NEAMS-funded INL microreactor application driver leverages three single-physics models coupled via the MOOSE’s MultiApp and Transfer systems. The latter systems enable in-memory data transfer between MOOSE-based and MOOSE-wrapped applications. The first single-physics model, that functions as main application, leverages Griffin to model the neutron transport in the core through the discontinuous finite element (DFEM) discrete ordinates solver (SN). Several optimization flags that were developed by the Griffin developer team were beta-tested to enhance the solver’s performance. These include the combined use of using_average_xs and update_averaged_xs_on that enable to avoid expensive on-the-fly cross sections evaluations at each linear iterations in favor of evaluations of the macroscopic cross sections at each Picard iteration. The second single-physics model uses BISON to handle solid heat transfer and asymptotic hydrogen redistribution analysis in the fuel. While the model returns consistent results for the temperature and hydrogen distribution in the fuel, a mismatch was noticed in the calculated temperature in the reflector due to the value of the gap conductance used in our model. Ongoing investigations are being performed to assess the origin of this discrepancy. Finally, the System Analysis Module (SAM) was used to model the flow of the sodium-potassium eutectic in the primary loop. A first verification was also performed showing good agreement in terms of mass flow rate and inlet temperature. All mesh files were generated using the MOOSE Reactor module, removing the need for external meshing tools. Notably, this workscope represents one of the initial applications of the MOOSE Reactor module for modeling highly irregular geometries. The use of the reactor module significantly streamlined the mesh generation process. The full multiphysics mode, that combines all the single physics models, was leveraged to conduct initial steady-state multiphysics simulations to compute power, and temperature distribution in the reactor. Initial testing was performed for transient simulations as well. In this case, the new checkpoint restart capability for eigenvalue calculations was tested showing the capability for streamlined restart of transient calculations. Future work will focus on improving the fidelity of the model by performing comprehensive code-to-code comparisons. For instance, the full-core Griffin neutronics model will be benchmarked against MCNP reference results, that were provided by the MARVEL design team. Additionally, the SAM T/H model will be verified against reference RELAP-5 results for selected accident scenarios. Besides code-to-code verification exercises, the model fidelity will be improved by replacing the single-channel SAM model with a more complex SAM-Pronghorn coupled model, in which the sub-channel capability is deployed to obtain radial temperature resolution in the coolant. This model will be developed in synergy with the NEAMS thermal hydraulics team.