Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative solvers”

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 505 records · Page 28

Final Technical Report on “Center for Nonlinear Simulation of Energetic Particles in Burning Plasmas (CSEP)”

The gyrokinetic turbulence code GEM is used to study reverse shear Alfven eigenmodes in the DIII-D tokamak, cylindrical tearing mode, the nonlinear saturation mechanism of Alfven eigenmodes, and verify other gyrokinetic codes. It is used to study the stability of Alfven waves in the presence of fusion product alpha particles in ITER. New algorithm features and physics capabilities are added to GEM, including a novel discretization method for the Poisson equation, a vorticity approach to the fluid electron model and a low-n solver in cylindrical geometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A fast band–Krylov eigensolver for macromolecular functional motion simulation on multicore architectures and graphics processors

We introduce a new iterative Krylov subspace-based eigensolver for the simulation of macromolecular motions on desktop multithreaded platforms equipped with multicore processors and, possibly, a graphics accelerator (GPU). The method consists of two stages, with the original problem first reduced into a simpler band-structured form by means of a high-performance compute-intensive procedure. This is followed by a memory-intensive but low-cost Krylov iteration, which is off-loaded to be computed on the GPU by means of an efficient data-parallel kernel. The experimental results reveal the performance of the new eigensolver. Concretely, when applied to the simulation of macromolecules with a few thousands degrees of freedom and the number of eigenpairs to be computed is small to moderate, the new solver outperforms other methods implemented as part of high-performance numerical linear algebra packages for multithreaded architectures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

Verification of iterative matrix solutions for multipoint kinetics equations

Multipoint kinetic equation systems have been solved numerically using matrix algebra software and 1st to 4th order implicit schemes based on single-step matrix propagators. These matrix schemes have been validated successfully on demanding point kinetics benchmarks with various prescribed reactivity insertions. Verification tests have also been performed on a simple 3-region fast reactor core model with asymmetric step or ramp reactivity insertions and cross-checked with the multipoint kinetics SACRE code developed at INL and based on existing and validated stiff ODE solver packages. Accurate results can be obtained at a limited time expense. The reason for intriguing results obtained in some transients has been elucidated and linked to the multipoint matrix coefficient interpolation method during the transient.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Review of recent experimental and modeling progress in the lower hybrid range of frequencies at ITER relevant parameters

Progress in experiment and simulation capability in the lower hybrid range of frequencies (LHRF) at ITER relevant parameters is reviewed. Use of LH power in reactor devices is motivated in terms of its potential for efficient off-axis current profile control. Recent improvements in simulation capability including the development of full-wave field solvers, inclusion of the scrape off layer (SOL) in wave propagation codes, the use of coupled ray tracing / full-wave / 3D (r v{sub ⊥}, v{sub ∥}) Fokker Planck models, and the inclusion of nonlinear broadening effects in ray tracing / Fokker Planck codes are discussed. Experimental and modeling results are reviewed which are aimed at understanding the spectral gap problem in LH current drive (LHCD) and the density limit that has been observed in LHCD experiments. Physics mechanisms that could be operative in these experiments are discussed, including toroidally induced variations in the parallel wavenumber, nonlinear broadening of the pump wave, scattering of LH waves from density fluctuations in the SOL, and spectral broadening at the plasma edge via full-wave effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Review of recent experimental and modeling progress in the lower hybrid range of frequencies at ITER relevant parameters

Progress in experiment and simulation capability in the lower hybrid range of frequencies at ITER relevant parameters is reviewed. Use of LH power in reactor devices is motivated in terms of its potential for efficient off-axis current profile control. Recent improvements in simulation capability including the development of full-wave field solvers, inclusion of the scrape off layer (SOL) in wave propagation codes, the use of coupled ray tracing/full-wave/3D (r v{sub ⊥}, v{sub //}) Fokker Planck models, and the inclusion of wave scattering as well as nonlinear broadening effects in ray tracing / Fokker Planck codes are discussed. Experimental and modeling results are reviewed which are aimed at understanding the spectral gap problem in LH current drive (LHCD) and the density limit that has been observed and mitigated in LHCD experiments. Physics mechanisms that could be operative in these experiments are discussed, including toroidally induced variations in the parallel wavenumber, nonlinear broadening of the pump wave, scattering of LH waves from density fluctuations in the SOL, and spectral broadening at the plasma edge via full-wave effects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Final report for “Extreme-scale Algorithms and Solver Resilience”

This is a joint project with principal investigators at Oak Ridge National Laboratory, Sandia National Laboratories, the University of California at Berkeley, and the University of Tennessee. Our part of the project involves developing performance models for highly scalable algorithms and the development of latency tolerant iterative methods. During this project, we extended our performance models for the Multigrid method for solving large systems of linear equations and conducted experiments with highly scalable variants of conjugate gradient methods that avoid blocking synchronization. In addition, we worked with the other members of the project on alternative techniques for resilience and reproducibility. We also presented an alternative approach for reproducible dot-products in parallel computations that performs almost as well as the conventional approach by separating the order of computation from the details of the decomposition of vectors across the processes.

97 MATHEMATICS AND COMPUTING↗

Optimizing Power Generation of a Bottom-Raised Oscillating Surge Wave Energy Converter Using a Theoretical Model: Preprint

Preliminary sizing of an oscillating surge wave energy converter (OSWEC) is an iterative process that relies on knowledge of the relevant hydrodynamic coefficients for a given geometry. Often, the complex definition of the device geometry requires coefficients to be obtained through experiments or numerical boundary element solvers such as WAMIT. These techniques demand significant user and computational effort, therefore inhibiting the fine scale parametrization of object dimensions. In this study, a theoretical model, originally presented in Michele et al. (2016), is developed and demonstrated to efficiently optimize the power production for an OSWEC device (subjected to certain environmental conditions) with variations in device widths, heights, and distances from the seabed. Assuming negligible device thickness, the OSWEC motions are modelled as a bottom-raised two-dimensional flap in regular waves using potential flow theory formulated in elliptical coordinates. The solutions to this diffraction-radiation problem are obtained using Mathieu functions with appropriate boundary conditions. The resulting potentials are then used to derive frequency-dependent expressions for the added mass and radiation damping coefficients, along with wave excitation magnitude in surge, pitch, and coupled surge-pitch motions. Good agreement in hydrodynamic coefficient curves is shown between the theoretical model and the numerical results obtained from the boundary element-based program WAMIT. The theoretical model is then employed to maximize the time-averaged output power while maintaining or reducing the hinge reaction force, with variations in device dimensions, wave frequency and amplitude.

ACE↗

Optimizing Power Generation of a Bottomraised Oscillating Surge Wave Energy Converter Using a Theoretical Model

Preliminary sizing of an oscillating surge wave energy converter (OSWEC) is an iterative process that relies on knowledge of the relevant hydrodynamic coefficients for a given geometry. Often, the complex definition of the device geometry requires coefficients to be obtained through experiments or numerical boundary element solvers such as WAMIT. These techniques demand significant user and computational effort, therefore inhibiting the fine scale parametrization of object dimensions. In this study, a theoretical model, originally presented in Michele et al. (2016), is developed and demonstrated to efficiently optimize the power production for an OSWEC device (subjected to certain environmental conditions) with variations in device widths, heights, and distances from the seabed. Assuming negligible device thickness, the OSWEC motions are modelled as a bottom-raised two-dimensional flap in regular waves using potential flow theory formulated in elliptical coordinates. The solutions to this diffraction-radiation problem are obtained using Mathieu functions with appropriate boundary conditions. The resulting potentials are then used to derive frequency-dependent expressions for the added mass and radiation damping coefficients, along with wave excitation magnitude in surge, pitch, and coupled surge-pitch motions. Good agreement in hydrodynamic coefficient curves is shown between the theoretical model and the numerical results obtained from the boundary element-based program WAMIT. The theoretical model is then employed to maximize the time-averaged output power while maintaining or reducing the hinge reaction force, with variations in device dimensions, wave frequency and amplitude.

ACE↗

Adaptive Algebraic Smoothers

methods based on Local Sensitivity Analysis (LSA). The method can be used in the context of geometric and algebraic multigrid methods for constructing smoothers, and in the context of Krylov methods for constructing block preconditioners. It is suitable for both constant and variable coecient problems. Furthermore, the method can be applied to systems arising from both scalar and coupled system partial differential equations (PDEs), as well as linear systems that do not arise from PDEs. The simplicity of the method will allow it to be easily incorporated into existing multigrid and Krylov solvers while providing a powerful tool for adaptively constructing methods tuned to a problem.

99 GENERAL AND MISCELLANEOUS↗

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

Bowen-York trumpet data and black-hole simulations

The most popular method to construct initial data for black-hole-binary simulations is the puncture method, in which compactified wormholes are given linear and angular momentum via the Bowen-York extrinsic curvature. When these data are evolved, they quickly approach a trumpet topology, suggesting that it would be preferable to use data that are in trumpet form from the outset. To achieve this, we extend the puncture method to allow the construction of Bowen-York trumpets, including an outline of an existence and uniqueness proof of the solutions. We construct boosted, spinning and binary Bowen-York puncture trumpets using a single-domain pseudospectral elliptic solver, and evolve the binary data and compare with standard wormhole-data results. We also show that for boosted trumpets the black-hole mass can be prescribed a priori, without recourse to the iterative procedure that is necessary for wormhole data.

79 ASTRONOMY AND ASTROPHYSICS↗

AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids

We present an augmented matrix approach to update the solution to a linear system of equations when the coefficient matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform $N-x$ contingency analysis, i.e., determine the state of the system when up to $x$ links from $N$ fail. Our algorithms augment the coefficient matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the coefficient matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing $N-x$ contingency analysis on a $778K$ bus grid, updating a solution with $x=20$ elements in $1.6 \times 10^{-2}$ seconds on an Intel Xeon processor.

Yeung, Yu-Hong↗

Simulation and Optimizing Groundwater Investigations, Conceptual Design Analysis, Model Calibration and Remedial Design Using Parallel Numerical Methods: Theory and Application - 16578

Optimization of environmental restoration efforts at complex groundwater sites involves the development of a conceptual and often numerical flow and transport models. Typically, a limited number of simulations are done to assess the impact of parameter uncertainty, to evaluate remedial alternatives and develop a remedy, or to modify an existing remedy. A limited number of simulations are performed because each simulation can take upwards of several hours per simulation and until now the ability to conduct the 100's to 1000's of simulations needed to derive an optimal remedy was beyond the reach of the everyday practitioner. HGL has developed and implemented new parallel simulation and optimization methods in their software and has successfully deployed applications on high performance Cloud-based computing platforms. This advancement removes the impediment of burdensome and unpredictable runtime requirements these types of projects have typically exhibited using heuristic trial-and-error or even automated serial computation approaches. A parallel numerical solver has been added to the subsurface flow and transport simulator MODFLOW-SURFACT{sup TM} and has demonstrated reductions in solution time by as much as a factor of 9.8. This is accomplished by distributing the numerical computations of every time step over multiple processors. The integrated parallel simulation and optimization method uses the breadth and depth search approach; iteratively producing sets of tens or 100's of candidate solutions that are evaluated concurrently instead sequentially (i.e. one model evaluation at a time). Solutions within 80-100% of the globally optimal solution are regularly found expending only 5-10% of the usual computational effort using this new parallel optimization method (reducing computation effort by 10 to 20 times). Distributing optimal search runs across multiple processors additionally reduces calendar time to solutions. Practitioners evaluating multiple conceptual site models, model calibration by auto-calibration methods and remedial design by heuristics can enjoy significant reductions in model solution time by using the parallel numerical matrix solver in the physics-based simulator. Combining investigation and design analysis with breadth and depth parallel optimization methods, projects at the fringe of practical optimization, along with projects that were beyond the reach of formal optimization methods are now wholly feasible and tractable optimization problems. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Iterative map-making with two-level preconditioning for polarized cosmic microwave background data sets: A worked example for ground-based experiments

Context. An estimation of the sky signal from streams of time ordered data (TOD) acquired by the cosmic microwave background (CMB) experiments is one of the most important steps in the context of CMB data analysis referred to as the map-making problem. The continuously growing CMB data sets render the CMB map-making problem progressively more challenging in terms of computational cost and memory in particular in the context of ground-based experiments with their operational limitations as well as the presence of contaminants. Aims. We study a recently proposed, novel class of the Preconditioned Conjugate Gradient (PCG) solvers which invoke two-level preconditioners in the context of the ground-based CMB experiments. We compare them against the PCG solvers commonly used in the map-making context considering their precision and time-to-solution. Methods. We compare these new methods on realistic, simulated data sets reflecting the characteristics of current and forthcoming CMB ground-based experiments. We develop a divide-and-conquer implementation of the approach where each processor performs a sequential map-making for a subset of the TOD. Results. We find that considering the map level residuals, the new class of solvers permits us to achieve a tolerance that is better than the standard approach by up to three orders of magnitude, where the residual level often saturates before convergence is reached. This often corresponds to an important improvement in the precision of the recovered power spectra in particular on the largest angular scales. The new method also typically requires fewer iterations to reach a required precision and therefore shorter run times are required for a single map-making solution. However, the construction of an appropriate two-level preconditioner can be as costly as a single standard map-making run. Nevertheless, if the same problem needs to be solved multiple times, for example, as in Monte Carlo simulations, this cost is incurred only once, and the method should be competitive, not only as far as its precision is concerned but also its performance.

79 ASTRONOMY AND ASTROPHYSICS↗

A scalable, fully implicit algorithm for the reduced two-field low-β extended MHD model

Here, we demonstrate a scalable fully implicit algorithm for the two-field low-β extended MHD model. This reduced model describes plasma behavior in the presence of strong guide fields, and is of significant practical impact both in nature and in laboratory plasmas. The model displays strong hyperbolic behavior, as manifested by the presence of fast dispersive waves, which make a fully implicit treatment very challenging. In this study, we employ a Jacobian-free Newton–Krylov nonlinear solver, for which we propose a physics-based preconditioner that renders the linearized set of equations suitable for inversion with multigrid methods. As a result, the algorithm is shown to scale both algorithmically (i.e., the iteration count is insensitive to grid refinement and timestep size) and in parallel in a weak-scaling sense, with the wall-clock time scaling weakly with the number of cores for up to 4096 cores. For a 4096 × 4096 mesh, we demonstrate a wall-clock-time speedup of ~6700 with respect to explicit algorithms. The model is validated linearly (against linear theory predictions) and nonlinearly (against fully kinetic simulations), demonstrating excellent agreement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗