Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative solver”

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 55 records · Page 3

pnnl/IMIC

The first step toward the design of good error detection/correction techniques involves an understanding of an application’s vulnerability to soft errors. To study the behavior of iterative methods in the presence of soft errors, we inject errors during the execution of these methods. In particular, we study the impact of one error (single- or multi-bit) on the execution of iterative methods. We use real life datasets from the SuiteSparse Matrix Collection (https://sparse.tamu.edu) and widely used iterative solver library (Iterative Methods Library, IML++ v1.2a). We instrument the iterative solver implementations so that our error injection methodology can control the iteration, vector, position, number of bits and position of the bits of the error injection. We employed 6 solvers and 28 datasets, performed a total of 1,744,800 error injection runs and collected more than 2.5TB data.

Mutlu, Burcu↗

Ensemble Grouping Strategies for Embedded Stochastic Collocation Methods Applied to Anisotropic Diffusion Problems

Previous work has demonstrated that propagating groups of samples, called ensembles, together through forward simulations can dramatically reduce the aggregate cost of sampling-based uncertainty propagation methods [E. Phipps, M. D'Elia, H. C. Edwards, M. Hoemmen, J. Hu, and S. Rajamanickam, SIAM J. Sci. Comput., 39 (2017), pp. C162--C193]. However, critical to the success of this approach when applied to challenging problems of scientific interest is the grouping of samples into ensembles to minimize the total computational work. For example, the total number of linear solver iterations for ensemble systems may be strongly influenced by which samples form the ensemble when applying iterative linear solvers to parameterized and stochastic linear systems. In this paper we explore sample grouping strategies for local adaptive stochastic collocation methods applied to PDEs with uncertain input data, in particular canonical anisotropic diffusion problems where the diffusion coefficient is modeled by truncated Karhunen--Loève expansions. Finally, we demonstrate that a measure of the total anisotropy of the diffusion coefficient is a good surrogate for the number of linear solver iterations for each sample and therefore provides a simple and effective metric for grouping samples.

97 MATHEMATICS AND COMPUTING↗

Simple Construction of High Order Rational Iterative Equation Solvers

This article proposes a general technique to construct arbitrarily high order rational one-point iterative equation solvers based on truncated Taylor expansion from lower order schemes. With adding one more function call, an iterative equation solver of convergence order n can be accelerated to order (2n-1). Many existing (some recently published) one-point and two-point iterative equation solvers are special cases of the proposed construction. The proposed approach may be used to obtain new iterative equation solvers.

97 MATHEMATICS AND COMPUTING↗

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗

Comparative investigation of iterative solutions of the all-frequency stable formulation and its vector-potential-only variation

An all-frequency stable formulation has been proposed and applied to solve low-frequency and multiscale electromagnetic problems to avoid the low-frequency breakdown catastrophe of the traditional vector wave equation. Based on the potential representation of the fields, this formulation involves vector and scalar potentials, as well as an auxiliary potential to enforce the gauge condition. In this paper, such a formulation is first simplified to involve vector potential only. Their iterative solutions are then sought by using an incomplete LU preconditioner and an iterative solver. The iterative performance of both formulations are investigated in a comparative study.

Mekonnen, Minyechil↗

Benchmarking ICRF Full-wave Solvers for ITER

Abstract Benchmarking of full-wave solvers for ICRF simulations is performed using plasma profiles and equilibria obtained from integrated self-consistent modeling predictions of four ITER plasmas. One is for a high performance baseline (5.3 T, 15 MA) DT H-mode. The others are for half-field, half-current plasmas of interest for the pre-activation phase with bulk plasma ion species being either hydrogen or He4. The predicted profiles are used by six full-wave solver groups to simulate the ICRF electromagnetic fields and heating, and by three of these groups to simulate the current-drive. Approximate agreement is achieved for the predicted heating power for the DT and He4 cases. Factor of two disagreements are found for the cases with second harmonic He3 heating in bulk H cases. Approximate agreement is achieved simulating the ICRF current drive.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A hierarchical butterfly LU preconditioner for two-dimensional electromagnetic scattering problems involving open surfaces

This paper introduces a hierarchical interpolative decomposition butterfly-LU factorization (H-IDBF-LU) preconditioner for solving two-dimensional electric-field integral equations (EFIEs) in electromagnetic scattering problems of perfect electrically conducting objects with open surfaces. H-IDBF-LU leverages the interpolative decomposition butterfly factorization (IDBF) to compress dense blocks of the discretized EFIE operator to expedite its application; this compressed operator also serves as an approximate LU factorization of the EFIE operator leading to an efficient preconditioner in iterative solvers. Both the memory requirement and computational cost of the H-IDBF-LU solver scale as $O$($N$ log 2 $N$) in one iteration; the total number of iterations required for a reasonably good accuracy scales as $O$(1) to O(log 2 $N$) in all of our numerical tests. The efficacy and accuracy of the proposed preconditioned iterative solver are demonstrated via its application to a broad range of scatterers involving up to 100 million unknowns.

Liu, Yang↗

A Scalable Semi-Implicit Barotropic Mode Solver for the MPAS-Ocean

A scalable semi-implicit barotropic mode solver for the ocean component of the model for prediction across scales has been implemented as a competitor to an existing explicit-subcycling scheme to allow faster and more stable simulations while not sacrificing accuracy. The semi-implicit solver adopts the pipelined preconditioned bi-conjugate gradient stabilization algorithm as an iterative solver in conjunction with the restricted additive Schwarz preconditioner that accelerates the convergence rate of the iterative solver. The preconditioner is constructed from a linearized barotropic system that also reorders the system for optimal performance, while the semi-implicit solver deals with the fully nonlinear barotropic system that requires reassembly of the coefficient matrix for every time step. Several numerical experiments, from simple one-dimensional tests to three-dimensional real-world tests, demonstrate that the semi-implicit solver has almost the same accuracy and better parallel scalability compared with the existing scheme while allowing faster and more stable simulations. Furthermore, the semi-implicit solver accelerates the barotropic mode up to 2.9 times faster than the existing scheme on 16,320 processors, leading to an overall runtime speedup of 1.9.

97 MATHEMATICS AND COMPUTING↗

Hydrodynamics of suspensions of passive and active rigid particles: a rigid multiblob approach

We develop a rigid multiblob method for numerically solving the mobility problem for suspensions of passive and active rigid particles of complex shape in Stokes flow in unconfined, partially confined, and fully confined geometries. As in a number of existing methods, we discretize rigid bodies using a collection of minimally resolved spherical blobs constrained to move as a rigid body, to arrive at a potentially large linear system of equations for the unknown Lagrange multipliers and rigid-body motions. Here we develop a block-diagonal preconditioner for this linear system and show that a standard Krylov solver converges in a modest number of iterations that is essentially independent of the number of particles. Key to the efficiency of the method is a technique for fast computation of the product of the blob-blob mobility matrix and a vector. For unbounded suspensions, we rely on existing analytical expressions for the Rotne-Prager-Yamakawa tensor combined with a fast multipole method (FMM) to obtain linear scaling in the number of particles. For suspensions sedimented against a single no-slip boundary, we use a direct summation on a graphical processing unit (GPU), which gives quadratic asymptotic scaling with the number of particles. For fully confined domains, such as periodic suspensions or suspensions confined in slit and square channels, we extend a recently developed rigid-body immersed boundary method by B. Kallemov, A. P. S. Bhalla, B. E. Griffith, and A. Donev (Commun. Appl. Math. Comput. Sci. 11 (2016), no. 1, 79-141) to suspensions of freely moving passive or active rigid particles at zero Reynolds number. We demonstrate that the iterative solver for the coupled fluid and rigid-body equations converges in a bounded number of iterations regardless of the system size. In our approach, each iteration only requires a few cycles of a geometric multigrid solver for the Poisson equation, and an application of the block-diagonal preconditioner, leading to linear scaling with the number of particles. We optimize a number of parameters in the iterative solvers and apply our method to a variety of benchmark problems to carefully assess the accuracy of the rigid multiblob approach as a function of the resolution. We also model the dynamics of colloidal particles studied in recent experiments, such as passive boomerangs in a slit channel, as well as a pair of non-Brownian active nanorods sedimented against a wall.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Kriging Surrogate Model for Computing Gas Mixture Equations of State

Accurate simulation of the complex flow following the detonation of an explosive material is a challenging problem. In these flows, the detonation products of the explosive must be treated as a real gas while the surrounding air is treated as an ideal gas. As the detonation process unfolds and the blast wave moves into the surrounding ambient air, the products of detonation expand outward and interact with the air creating a mixture region. In this region, both of the state equations for air and the products must be satisfied. One of the most accurate, yet computationally expensive, methods to handle this problem is an algorithm that iterates between the equations of state until both pressure and temperature reach an equilibrium inside of a computational cell. Since this mixture region moves and grows over time, this algorithm must be performed millions, or even billions, of times in a typical detonation simulation. As such, these calculations can account for a large percentage of the overall solution time. This work aims to use a kriging surrogate model to replace this process. The iterative method solves a nonlinear system of equations created from the gas mixture density, internal energy, and composition using a Broyden iterative solver to obtain an output pressure and temperature. Kriging is used to produce curve fits which interpolate selected pressures and temperatures from this solver from appropriate ranges of the mixture input quantities. Using a finite volume hydrocode, the performance of the model with respect to the iterative solver is demonstrated in the simulation of a pentaerythritol tetranitrate (PETN) charge detonation. The model's computational speed and accuracy are quantified as a function of the choice of sampling points in order to try optimize the combination as well as to show the benefits of this novel approach.

Engineering↗

An Easy Method to Accelerate an Iterative Algebraic Solver, part II

This study is a companion to [Yao, Journal of Computational Physics267(2014)]. We provide a compact alternative development of Yao’s method to accelerate to order 2n–1 a fixed-point iterative scheme with an original convergence-rate of ordern. Using this approach, we show how to further improve the order of convergence by increasings, the number of steps per iteration. This scheme extends to arbitrarily high order without extra derivative evaluations per iteration. We discuss the efficiency of the new methods, including s = 2 (Yao’s method), and compare to that of the original method as a function of n; and we consider the efficiency for systems of equations of system-size M. For n = 2 and large M, we find that the multi-step scheme peaks in efficiency at about s ln s ~ M function evaluations, where its computational speed is several times faster than Newton’s method.

97 MATHEMATICS AND COMPUTING↗

Acceleration of GPU-based Krylov solvers via data transfer reduction

Krylov subspace iterative solvers are often the method of choice when solving large sparse linear systems. At the same time, hardware accelerators such as graphics processing units continue to offer significant floating point performance gains for matrix and vector computations through easy-to-use libraries of computational kernels. However, as these libraries are usually composed of a well optimized but limited set of linear algebra operations, applications that use them often fail to reduce certain data communications, and hence fail to leverage the full potential of the accelerator. In this study, we target the acceleration of Krylov subspace iterative methods for graphics processing units, and in particular the Biconjugate Gradient Stabilized solver that significant improvement can be achieved by reformulating the method to reduce data-communications through application-specific kernels instead of using the generic BLAS kernels, e.g. as provided by NVIDIA’s cuBLAS library, and by designing a graphics processing unit specific sparse matrix-vector product kernel that is able to more efficiently use the graphics processing unit’s computing power. Furthermore, we derive a model estimating the performance improvement, and use experimental data to validate the expected runtime savings. Finally, considering that the derived implementation achieves significantly higher performance, we assert that similar optimizations addressing algorithm structure, as well as sparse matrix-vector, are crucial for the subsequent development of high-performance graphics processing units accelerated Krylov subspace iterative methods.

97 MATHEMATICS AND COMPUTING↗

Simulation of electron Bernstein waves using FullWave with a 2D non-local hot plasma model

Hot plasma wave simulation capability is expanded in the FullWave code by updating the hybrid iterative solver in the code with a semi-implicit time stepping method. The new approach is used to simulate Electron Bernstein Wave (EBW) heating in over-dense spherical tokamak plasmas. The code’s hybrid iterative solver circumvents the prohibitive memory cost of direct methods by combining a time evolution of Maxwell’s equations with frequency-domain relaxation, while the conductivity kernel, calculated via 3D particle tracking, captures the essential non-local wave–particle interactions. One-dimensional EBW simulations verify the algorithm’s accuracy by demonstrating mode conversion from X-mode wave to EBW at the upper hybrid resonance and a strong cyclotron damping near the plasma core. Two-dimensional simulation reproduces the predicted short EBW wavelength and quantitatively matches the hot-plasma dispersion relation. This study demonstrates the fidelity of the hybrid solver for the electron cyclotron frequency range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A matrix-free approach for finite-strain hyperelastic problems using geometric multigrid

This paper investigates matrix-free algorithms for problems in quasi-static finite-strain hyperelasticity. Iterative solvers with matrix-free operator evaluation have emerged as an attractive alternative to sparse matrices in the fluid dynamics and wave propagation communities because they significantly reduce the memory traffic, the limiting factor in classical finite element solvers. Specifically, we study different matrix-free realizations of the finite element tangent operator and determine whether generalized methods of incorporating complex constitutive behavior might be feasible. Furthermore, in order to improve the convergence behavior of iterative solvers, we also propose a method by which to construct level tangent operators and employ them to define a geometric multigrid preconditioner. Additionally, the performance of the matrix-free operator and the geometric multigrid preconditioner is compared to the matrix-based implementation with an algebraic multigrid (AMG) preconditioner on a single node for a representative numerical example of a heterogeneous hyperelastic material in two and three dimensions. We find that matrix-free methods for finite-strain solid mechanics are very promising, outperforming linear matrix-based schemes by two to five times, and that it is possible to develop numerically efficient implementations that are independent of the hyperelastic constitutive law.

42 ENGINEERING↗

A fast implicit solver for semiconductor models in one space dimension

Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in semiconductor devices under a low-density assumption. At each implicit time step, the discretized system is formulated as a fixed-point problem, which can then be solved with a variety of methods. A key algorithmic component in all the approaches considered here is a recently developed sweeping algorithm for Vlasov-Poisson systems. A synthetic acceleration scheme has been implemented to accelerate the convergence of iterative solvers by using the solution to a drift-diffusion equation as a preconditioner. The performance of four iterative solvers and their accelerated variants has been compared on problems modeling semiconductor devices with various electron mean-free-path.

97 MATHEMATICS AND COMPUTING↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗