Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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 919 records · Page 51

Toward robust scalable algebraic multigrid solvers.

This talk highlights some multigrid challenges that arise from several application areas including structural dynamics, fluid flow, and electromagnetics. A general framework is presented to help introduce and understand algebraic multigrid methods based on energy minimization concepts. Connections between algebraic multigrid prolongators and finite element basis functions are made to explored. It is shown how the general algebraic multigrid framework allows one to adapt multigrid ideas to a number of different situations. Examples are given corresponding to linear elasticity and specifically in the solution of linear systems associated with extended finite elements for fracture problems.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Simulation of nonlinear propagation of biomedical ultrasound using PZFlex and the KZK Texas code

In biomedical ultrasound nonlinear acoustics can be important in both diagnostic and therapeutic applications and robust simulations tools are needed in the design process but also for day-to-day use such as treatment planning. For most biomedical application the ultrasound sources generate focused sound beams of finite amplitude. The KZK equation is a common model as it accounts for nonlinearity, absorption and paraxial diffraction and there are a number of solvers available, primarily developed by research groups. We compare the predictions of the KZK Texas code (a finite-difference time-domain algorithm) to an FEM-based commercial software, PZFlex. PZFlex solves the continuity equation and momentum conservation equation with a correction for nonlinearity in the equation of state incorporated using an incrementally linear, 2nd order accurate, explicit algorithm in time domain. Nonlinear ultrasound beams from two transducers driven at 1 MHz and 3.3 MHz respectively were simulated by both the KZK Texas code and PZFlex, and the pressure field was also measured by a fibre-optic hydrophone to validate the models. Further simulations were carried out a wide range of frequencies. The comparisons showed good agreement for the fundamental frequency for PZFlex, the KZK Texas code and the experiments. For the harmonic components, the KZK Texas code was in good agreement with measurements but PZFlex underestimated the amplitude: 32% for the 2nd harmonic and 66% for the 3rd harmonic. The underestimation of harmonics by PZFlex was more significant when the fundamental frequency increased. Furthermore non-physical oscillations in the axial profile of harmonics occurred in the PZFlex results when the amplitudes were relatively low. These results suggest that careful benchmarking of nonlinear simulations is important.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Persistence of deuterium and tritium nuclear spin-polarization in presence of high-frequency plasma waves

We present first-principles numerical calculations of the depolarization rate of spin-polarized deuterium and tritium nuclei in realistic tokamak plasmas, driven by resonant interactions with plasma waves. Backed up by first-of-a-kind linear and nonlinear simulations, we find that alpha particle-driven Alfvénic modes cause only negligible depolarization, which is contrary to expectations in prior literature. Other Alfvénic instabilities can in principle degrade polarization, but only under conditions unlikely to be realized on transport timescales. By combining full-orbit particle tracing with a dedicated depolarization solver, we demonstrate that wave-driven depolarization is surprisingly weak in SPARC and ITER-scale devices. These results provide strong evidence that spin-polarized fuel can maintain its polarization long enough to boost fusion reactivity, opening a viable path toward substantially enhanced performance in magnetic confinement fusion power plants.

Cook, James William Setchfield [UK Atomic Energy A↗

Convex Relaxation of OPF in Multiphase Radial Networks with Wye and Delta Connections

This panel presentation focuses on multiphase radial distribution networks with wye and delta connections, and proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem. Two multiphase power flow models are developed to facilitate the integration of delta-connected loads or generation resources in the OPF problem. The first model is referred to as the extended branch flow model (EBFM). The second model leverages a linear relationship between phase-to-ground power injections and delta connections that holds under a balanced voltage approximation (BVA). Based on these models, pertinent OPF problems are formulated and relaxed to semidefinite programs (SDPs). Numerical studies on IEEE test feeders show that the proposed SDP relaxations can be solved efficiently by a generic optimization solver. Numerical evidence also indicates that solving the resultant SDP under BVA is faster than under EBFM. Moreover, both SDP solutions are numerically exact with respect to voltages and branch flows. It is further shown that the SDP solution under BVA has a small optimality gap, and the BVA model is accurate in the sense that it reproduces actual system voltages.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dynamics of electrified liquid metal surface using shallow water model

A shallow water model that incorporates surface tension and electric field effects is developed to investigate the dynamics of an electrified liquid surface. The computational model is verified against the Zakharov–Kuznetsov equation and is applied to study the growth and damping of the electrified liquid surface. A linear wave analysis is performed under a shallow water theory assuming an analytic solution of the electric field, similar to the Tonks–Frenkel instability. The electrified liquid surface grows or dampens based on the balance of the electric field, surface tension, and gravitational forces. As a result, the numerical results obtained from the electrified shallow water solver are in good agreement with the theoretical analysis.

Computational models↗

Wind Turbine Aeroelastic Stability in OpenFAST

Wind turbines are growing in size and increasingly suffer from aeroelastic instabilities. Unfortunately, numerical models often show inconsistent results during verification studies. We address this gap by first introducing novel linearization capabilities within the open-source aero-hydro-servo-elastic framework OpenFAST. Next, a code-to-code benchmark study is presented that compares modal parameters between OpenFAST and HAWCStab2 for a land-based version of the International Energy Agency 15-MW reference wind turbine modeled with quasi-steady aerodynamics. The two solvers are in strong agreement except for discrepancies in the second rotor flapwise modes. The differences are attributed to the torsional flexibility of the tower, which is assumed torsionally stiff in the OpenFAST model. Work is ongoing to close this modeling gap. The aeroelastic stability of a low-specific-power land-based wind turbine is also investigated. The impact of design choices is discussed, high-lighting how narrow the margins are between a stable design and an unstable design.

17 WIND ENERGY↗

Chance-Constrained AC Optimal Power Flow for Distribution Systems With Renewables

This paper focuses on distribution systems featuring renewable energy sources (RESs) and energy storage systems, and presents an AC optimal power flow (OPF) approach to optimize system-level performance objectives while coping with uncertainty in both RES generation and loads. The proposed method hinges on a chance-constrained AC OPF formulation where probabilistic constraints are utilized to enforce voltage regulation with prescribed probability. A computationally more affordable convex reformulation is developed by resorting to suitable linear approximations of the AC power-flow equations as well as convex approximations of the chance constraints. The approximate chance constraints provide conservative bounds that hold for arbitrary distributions of the forecasting errors. An adaptive strategy is then obtained by embedding the proposed AC OPF task into a model predictive control framework. Finally, a distributed solver is developed to strategically distribute the solution of the optimization problems across utility and customers.

24 POWER TRANSMISSION AND DISTRIBUTION↗

HEMS: Home Energy Management System [SWR-15-12] - Stochastic Optimal Scheduling of Residential Appliances with Renewable Energy Sources

The HEMS algorithm schedules residential appliance operation to minimize the weighted sum of occupant discomfort, total energy cost, peak electricity consumption and carbon footprint, weighted according to occupant preferences. A centralized mixed integer linear programming (MILP) based optimization approach is taken, with the HEMS managing all appliances directly, following a Model Predictive Control (MPC) methodology which determines the optimal schedule over the user-specified scheduling horizon and repeats the optimization at configurable time intervals. The HEMS is developed on the General Algebraic Modeling System (GAMS) using the MILP solver. This system is able to effectively deal with the stochasticity in the distributed system by utilizing Monte Carlo simulation where uncertainties in future electricity price, outdoor temperature, water usage, solar and wind generation can be accounted for. The HEMS controls the operation of the heating, ventilation and air conditioning (HVAC) system, water heater, refrigerator, residential batteries, electric vehicles, standalone micro combined heat and power (CHP) generator, dishwasher, washer/dryer, pool pumps, and lighting.

Pratt, Annabelle↗

A preconditioning technique for Schur complement systems arising in stochastic optimization

Deterministic sample average approximations of stochastic programming problems with recourse are suitable for a scenario-based parallelization. In this paper the parallelization is obtained by using an interior-point method and a Schur complement mechanism for the interior-point linear systems. However, the direct linear solves involving the dense Schur complement matrix are expensive, and adversely affect the scalability of this approach. We address this issue by proposing a stochastic preconditioner for the Schur complement matrix and by using Krylov iterative methods for the solution of the dense linear systems. The stochastic preconditioner is built based on a subset of existing scenarios and can be assembled and factorized on a separate process before the computation of the Schur complement matrix finishes on the remaining processes. The expensive factorization of the Schur complement is removed from the parallel execution flow and the scaling of the optimization solver is considerably improved with this approach. The spectral analysis indicates an exponentially fast convergence in probability to 1 of the eigenvalues of the preconditioned matrix with the number of scenarios incorporated in the preconditioner. Numerical experiments performed on the relaxation of a unit commitment problem show good performance, in terms of both the accuracy of the solution and the execution time.

99 GENERAL AND MISCELLANEOUS↗

Slow-scale split-step tau-leap method for stiff stochastic chemical systems

Tau-leaping is a family of algorithms for the approximate simulation of the discrete state continuous time Markov chains. A motivation for the development of such methods can be found, for instance, in the fields of chemical kinetics and systems biology. It is known that the dynamical behavior of biochemical systems is often intrinsically stiff representing a serious challenge for their numerical approximation. The naive extension of stiff deterministic solvers to stochastic integration often yields numerical solutions with either impractically large relaxation times or incorrectly resolved covariance. In this paper, we propose a splitting heuristic which helps to resolve some of these issues. The proposed integrator contains a number of unknown parameters which are estimated for each particular problem from the moment equations of the corresponding linearized system. We show that this method is able to reproduce the exact mean and variance of the linear scalar test equation and demonstrates a good accuracy for the arbitrarily stiff systems at least in the linear case. The numerical examples for both linear and nonlinear systems are also provided, and the obtained results confirm the efficiency of the considered splitting approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multiresolution quantum chemistry in multiwavelet bases: excited states from time-dependent Hartree–Fock and density functional theory via linear response

Using the fully numerical method for time-dependent Hartree–Fock and density functional theory (TD-HF/DFT) with the Tamm–Dancoff (TD) approximation we use a multiresolution analysis (MRA) approach to present our findings. From a reformulation with effective use of the density matrix operator, we obtain a general form of the HF/DFT linear response equation in the first quantization formalism. It can be readily rewritten as an integral equation with the bound-state Helmholtz (BSH) kernel for the Green's function. The MRA implementation of the resultant equation permits excited state calculations without virtual orbitals. Moreover, the integral equation is efficiently and adaptively solved using a numerical multiresolution solver with multiwavelet bases. Our implementation of the TD-HF/DFT methods is applied for calculating the excitation energies of H 2 , Be, N 2 , H 2 O, and C 2 H 4 molecules. The numerical errors of the calculated excitation energies converge in proportion to the residuals of the equation in the molecular orbitals and response functions. The energies of the excited states at a variety of length scales ranging from short-range valence excitations to long-range Rydberg-type ones are consistently accurate. It is shown that the multiresolution calculations yield the correct exponential asymptotic tails for the response functions, whereas those computed with Gaussian basis functions are too diffuse or decay too rapidly. Finally, we introduce a simple asymptotic correction to the local spin-density approximation (LSDA) so that in the TDDFT calculations, the excited states are correctly bound.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Preparing an Incompressible-Flow Fluid Dynamics Code for Exascale-Class Wind Energy Simulations: Preprint

The US Department of Energy has identified Exascale-Class wind farm simulation tools as critical to wind energy scientific discovery. A primary objective of the Exawind project is to build high-performance, predictive Computational Fluid Dynamics tools that satisfy these modeling needs. GPU accelerators will serve as the computational thoroughbreds of next generation, Exascale-Class, platforms. Here, we report on our efforts for preparing the Exawind unstructured mesh solver, Nalu-Wind, for Exascale-Class machines. For computing at this scale, a simple port of the incompressible-flow algorithms to GPUs is not sufficient. One needs novel algorithms that are application aware, memory efficient, and optimized for latest generation GPU devices to get high-performance. The result of our efforts are unstructured mesh simulations of wind turbines that use 1/6 the compute resources of Summit supercomputer at Oak Ridge National Lab. In particular, we demonstrate a first-of-its-kind, simulation using Algebraic Multigrid solvers on over 4000 GPUs.

algebraic multigrid↗

Effect of resonant magnetic perturbations on microturbulence in DIII-D pedestal

Vacuum resonant magnetic perturbations (RMP) applied to otherwise axisymmetric tokamak plasmas produce in general a combination of non-resonant effects that preserve closed flux surfaces (kink response) and resonant effects that introduce magnetic islands and/or stochasticity (tearing response). The effect of the plasma kink response on the linear stability and nonlinear transport of edge turbulence is studied using the gyrokinetic toroidal code GTC for a DIII-D plasma with applied n = 2 vacuum RMP. GTC simulations use the 3D equilibrium of DIII-D discharge 158103 (Nazikian et al 2015 Phys. Rev. Lett. 114 105002), which is provided by nonlinear ideal MHD VMEC equilibrium solver in order to include the effect of the plasma kink response to the external field but to exclude island formation at rational surfaces. Analysis using the GTC simulation results reveal no increase of growth rates for the electrostatic drift wave instability and for the electromagnetic kinetic-ballooning mode in the presence of the plasma kink response to the RMP. Moreover, nonlinear electrostatic simulations show that the effect of the 3D equilibrium on zonal flow damping is very weak and found to be insufficient to modify turbulent transport in the electrostatic turbulence.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Characterization of the Impact of Soft Errors on Iterative Methods

Soft errors caused by transient bit flips have the potential to significantly impact an application’s behavior. This has motivated the design of an array of techniques to detect, isolate, and correct soft errors using microarchitectural, architectural, compilation-based, or application-level techniques to minimize their impact on the executing application. The first step towards the design of good error detection/correction techniques involves an understanding of an application’s vulnerability to soft errors. In this paper, we present the first comprehensive characterization of the impact of soft errors on the convergence characteristics of six iterative methods using application-level fault injection. In particular, we consider the use of iterative methods to incrementally solve a linear systems of equations, which constitutes the core kernel in many scientific applications. We analyze the impact of soft errors in terms of the type of error (single- vs multi-bit), the distribution and location of bits affected, the data structure and the statement impacted, and variation with time. In addition to understanding the vulnerability of iterative solvers to soft errors, this characterization can aid the design of fault injection campaigns that ensure systematic coverage.

fault injection, iterative methods, Silent data co↗

KADATH: A spectral solver for theoretical physics

KADATH is a library that implements spectral methods in a very modular manner. It is designed to solve a wide class of problems that arise in the context of theoretical physics. Several types of coordinates are implemented and additional geometries can be easily encoded. Partial differential equations of various types are discretized by means of spectral methods. The resulting system is solved using a Newton-Raphson iteration. Doing so, KADATH is able to deal with strongly non-linear situations. The algorithms are validated by applying the library to four different problems of contemporary physics, in the fields of gauge field theory and general relativity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗