Search NASA⌕ Search

SEARCH · Search NASA

Results for “successive linear approximation”

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 181 records · Page 10

GMLS-Nets: A Framework for Learning from Unstructured Data

Data fields sampled on irregularly spaced points arise in many applications in the sciences and engineering. For regular grids, Convolutional Neural Networks (CNNs) have been successfully used to gaining benefits from weight sharing and invariances. We generalize CNNs by introducing methods for data on unstructured point clouds based on Generalized Moving Least Squares (GMLS). GMLS is a non-parametric technique for estimating linear bounded functionals from scattered data, and has recently been used in the literature for solving partial differential equations. By parameterizing the GMLS estimator, we obtain learning methods for operators with unstructured stencils. In GMLS-Nets the necessary calculations are local, readily parallelizable, and the estimator is supported by a rigorous approximation theory. We show how the framework may be used for unstructured physical data sets to perform functional regression to identify associated differential operators and to regress quantities of interest. The results suggest the architectures to be an attractive foundation for data-driven model development in scientific machine learning applications

97 MATHEMATICS AND COMPUTING↗

Semi-Analytic Integration of Hypersingular Galerkin BIEs for 3D Potential Problems

An accurate and efficient semi-analytic integration technique is developed for three-dimensional hypersingular boundary integral equations of potential theory. Investigated in the context of a Galerkin approach, surface integrals are defined as limits to the boundary and linear surface elements are employed to approximate the geometry and field variables on the boundary. In the inner integration procedure, all singular and non-singular integrals over a triangular boundary element are expressed exactly as analytic formulae over the edges of the integration triangle. In the outer integration scheme, closed-form expressions are obtained for the coincident case, wherein the divergent terms are identified explicitly and are shown to cancel with corresponding terms from the edge-adjacent case. The remaining surface integrals, containing only weak singularities, are carried out successfully by use of standard numerical cubatures. Sample problems are included to illustrate the performance and validity of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Bounding the electrostatic free energies associated with linear continuum models of molecular solvation.

The importance of electrostatic interactions in molecular biology has driven extensive research toward the development of accurate and efficient theoretical and computational models. Linear continuum electrostatic theory has been surprisingly successful, but the computational costs associated with solving the associated partial differential equations (PDEs) preclude the theory's use in most dynamical simulations. Modern generalized-Born models for electrostatics can reproduce PDE-based calculations to within a few percent and are extremely computationally efficient but do not always faithfully reproduce interactions between chemical groups. Recent work has shown that a boundary-integral-equation formulation of the PDE problem leads naturally to a new approach called boundary-integral-based electrostatics estimation (BIBEE) to approximate electrostatic interactions. In the present paper, we prove that the BIBEE method can be used to rigorously bound the actual continuum-theory electrostatic free energy. The bounds are validated using a set of more than 600 proteins. Detailed numerical results are presented for structures of the peptide met-enkephalin taken from a molecular-dynamics simulation. These bounds, in combination with our demonstration that the BIBEE methods accurately reproduce pairwise interactions, suggest a new approach toward building a highly accurate yet computationally tractable electrostatic model.

59 BASIC BIOLOGICAL SCIENCES↗

Modified semi-classical methods for nonlinear quantum oscillations problems

We develop a modified semi-classical approach to the approximate solution of Schroedinger's equation for certain nonlinear quantum oscillations problems. In our approach, at lowest order, the Hamilton-Jacobi equation of the conventional semi-classical formalism is replaced by an inverted-potential-vanishing-energy variant thereof. With suitable smoothness, convexity and coercivity properties imposed on its potential energy function, we prove, using methods drawn from the calculus of variations together with the (Banach space) implicit function theorem, the existence of a global, smooth 'fundamental solution' to this equation. Higher order quantum corrections thereto, for both ground and excited states, can then be computed through the integration of associated systems of linear transport equations, derived from Schroedinger's equation, and formal expansions for the corresponding energy eigenvalues obtained therefrom by imposing the natural demand for smoothness on the (successively computed) quantum corrections to the eigenfunctions. For the special case of linear oscillators our expansions naturally truncate, reproducing the well-known exact solutions for the energy eigenfunctions and eigenvalues. As an explicit application of our methods to computable nonlinear problems, we calculate a number of terms in the corresponding expansions for the one-dimensional anharmonic oscillators of quartic, sectic, octic, and dectic types and compare the results obtained with those of conventional Rayleigh/Schroedinger perturbation theory. To the orders considered (and, conjecturally, to all orders) our eigenvalue expansions agree with those of Rayleigh/Schroedinger theory whereas our wave functions more accurately capture the more-rapid-than-gaussian decay known to hold for the exact solutions to these problems. For the quartic oscillator in particular our results strongly suggest that both the ground state energy eigenvalue expansion and its associated wave function expansion are Borel summable to yield natural candidates for the actual exact ground state solution and its energy. Our techniques for proving the existence of the crucial 'fundamental solution' to the relevant (inverted-potential-vanishing-energy) Hamilton-Jacobi equation have the important property of admitting interesting infinite dimensional generalizations. In a project paralleling the present one we shall show how this basic construction can be carried out for the Yang-Mills equations in Minkowski spacetime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Efficient simulations of charge density waves in the transition metal Dichalcogenide TiSe 2

Charge density waves (CDWs) in transition metal dichalcogenides are the subject of growing scientific interest due to their rich interplay with exotic phases of matter and their potential technological applications. Here, using density functional theory with advanced meta-generalized gradient approximations (meta-GGAs) and linear response time-dependent density functional theory (TDDFT) with state-of-the-art exchange-correlation kernels, we investigate the electronic, vibrational, and optical properties in 1T-TiSe 2 with and without CDW. In both bulk and monolayer TiSe 2 , the electronic bands and phonon dispersions in either normal or CDW (semiconducting) phase are described well via meta-GGAs, which separate the valence and conduction bands just as HSE06 does but with significantly more computational feasibility. The experimentally observed humps of electron energy loss spectroscopy are successfully reproduced in TDDFT. Our work opens the door to simulating these complexities in CDW compounds from first principles by revealing meta-GGAs as an accurate low-cost alternative to HSE06.

Electronic properties and materials↗

Pressure effects on the vibrational and rotational relaxation of vibrationally excited OH (ν, J ) in an argon bath

Quasi-classical molecular dynamics simulations were used to study the energy relaxation of an initially non-rotating, vibrationally excited ( v = 4) hydroxyl radical (OH) in an Ar bath at 300 K and at high pressures from 50 atm to 400 atm. A Morse oscillator potential represented the OH, and two sets of interaction potentials were used based on whether the Ar-H potential was a Buckingham (Exp6) or a Lennard-Jones (LJ) potential. The vibrational and rotational energies were monitored for 25 000-90 000 ps for Exp6 trajectories and 5000 ps for LJ trajectories. Comparisons to measured vibrational relaxation rates show that Exp6 rates are superior. Simulated initial vibrational relaxation rates are linearly proportional to pressure, implying no effect of high-pressure breakdown in the isolated binary collision approximation. The vibrational decay curves upward from single-exponential decay. A model based on transition rates that exponentially depend on the anharmonic energy gap between vibrational levels fits the vibrational decay well at all pressures, suggesting that anharmonicity is a major cause of the curvature. Due to the competition of vibration-to-rotation energy transfer and bath gas relaxation, the rotational energy overshoots and then relaxes to its thermal value. Approximate models with adjustable rates for this competition successfully reproduced the rotational results. These models show that a large fraction of the vibrational energy loss is initially converted to rotational energy but that fraction decreases rapidly as the vibrational energy content of OH decreases. Finally, while simulated rates change dramatically between Exp6 and LJ potentials, the mechanisms remain the same.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A robust return-map algorithm for general multisurface plasticity

Three new contributions to the field of multisurface plasticity are presented for general situations with an arbitrary number of nonlinear yield surfaces with hardening or softening. A method for handling linearly dependent flow directions is described. A residual that can be used in a line search is defined. An algorithm that has been implemented and comprehensively tested is discussed in detail. Examples are presented to illustrate the computational cost of various components of the algorithm. The overall result is that a single Newton-Raphson iteration of the algorithm costs between 1.5 and 2 times that of an elastic calculation. Examples also illustrate the successful convergence of the algorithm in complicated situations. For example, without using the new contributions presented here, the algorithm fails to converge for approximately 50% of the trial stresses for a common geomechanical model of sedementary rocks, while the current algorithm results in complete success. Since it involves no approximations, the algorithm is used to quantify the accuracy of an efficient, pragmatic, but approximate, algorithm used for sedimentary-rock plasticity in a commercial software package. Furthermore, the main weakness of the algorithm is identified as the difficulty of correctly choosing the set of initially active constraints in the general setting.

15 GEOTHERMAL ENERGY↗

A weighted reverse Cuthill-McKee procedure for finite element method algorithms to solve strongly anisotropic electrodynamic problems

This paper presents a technique for improving the convergence rate of a generalized minimum residual (GMRES) algorithm applied for the solution of a algebraic system produced by the discretization of an electrodynamic problem with a tensorial electrical conductivity. The electrodynamic solver considered in this work is a part of a magnetohydrodynamic (MHD) code in the low magnetic Reynolds number approximation. The code has been developed for the analysis of MHD interaction during the re-entry phase of a space vehicle. This application is a promising technique intensively investigated for the shock mitigation and the vehicle control in the higher layers of a planetary atmosphere. The medium in the considered application is a low density plasma, characterized by a tensorial conductivity. This is a result of the behavior of the free electric charges, which tend to drift in a direction perpendicular both to the electric field and to the magnetic field. In the given approximation, the electrodynamics is described by an elliptical partial differential equation, which is solved by means of a finite element approach. The linear system obtained by discretizing the problem is solved by means of a GMRES iterative method with an incomplete LU factorization threshold preconditioning. The convergence of the solver appears to be strongly affected by the tensorial characteristic of the conductivity. In order to deal with this feature, the bandwidth reduction in the coefficient matrix is considered and a novel technique is proposed and discussed. First, the standard reverse Cuthill-McKee (RCM) procedure has been applied to the problem. Then a modification of the RCM procedure (the weighted RCM procedure, WRCM) has been developed. In the last approach, the reordering is performed taking into account the relation between the mesh geometry and the magnetic field direction. In order to investigate the effectiveness of the methods, two cases are considered. The RCM and WRCM procedures has successfully improved the convergence rate of the GMRES solver. For strong anisotropies, the WRCM procedure appears to have a higher convergence rate. The same behavior is shown when applying the methods to the rebuilding of an hypersonic MHD experiment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Steady-State Gyrokinetics Transport Code (SSGKT), A Scientific Application Partnership with the Framework Application for Core-Edge Transport Simulations, Final Report

This project initiated the development of TGYRO - a steady-state Gyrokinetic transport code (SSGKT) that integrates micro-scale GYRO turbulence simulations into a framework for practical multi-scale simulation of conventional tokamaks as well as future reactors. Using a lightweight master transport code, multiple independent (each massively parallel) gyrokinetic simulations are coordinated. The capability to evolve profiles using the TGLF model was also added to TGYRO and represents a more typical use-case for TGYRO. The goal of the project was to develop a steady-state Gyrokinetic transport code (SSGKT) that integrates micro-scale gyrokinetic turbulence simulations into a framework for practical multi-scale simulation of a burning plasma core ? the International Thermonuclear Experimental Reactor (ITER) in particular. This multi-scale simulation capability will be used to predict the performance (the fusion energy gain, Q) given the H-mode pedestal temperature and density. At present, projections of this type rely on transport models like GLF23, which are based on rather approximate fits to the results of linear and nonlinear simulations. Our goal is to make these performance projections with precise nonlinear gyrokinetic simulations. The method of approach is to use a lightweight master transport code to coordinate multiple independent (each massively parallel) gyrokinetic simulations using the GYRO code. This project targets the practical multi-scale simulation of a reactor core plasma in order to predict the core temperature and density profiles given the H-mode pedestal temperature and density. A master transport code will provide feedback to O(16) independent gyrokinetic simulations (each massively parallel). A successful feedback scheme offers a novel approach to predictive modeling of an important national and international problem. Success in this area of fusion simulations will allow US scientists to direct the research path of ITER over the next two decades. The design of an efficient feedback algorithm is a serious numerical challenge. Although the power source and transport balance coding in the master are standard, it is nontrivial to design a feedback loop that can cope with outputs that are both intermittent and extremely expensive. A prototypical feedback scheme has already been successfully demonstrated for a single global GYRO simulation, although the robustness and efficiency are likely far from optimal. Once the transport feedback scheme is perfected, it could, in principle, be embedded into any of the more elaborate transport codes (ONETWO, TRANSP, and CORSICA), or adopted by other FSP-related multi-scale projects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Orbital-free molecular dynamics simulations of a warm dense mixture: Examination of the excess-pressure matching rule

A form of the linear mixing rule involving the equality of excess pressures is tested with various mole fractions and various types of orbital-free molecular dynamics simulations. For all the cases considered, this mixing rule yields, within statistical error, the pressure of a mixture of helium and iron obtained by a direct simulation. In an attempt to interpret the robustness of the mixing rule, we show that it can be derived from thermodynamic stability if the system is regarded as a mixture of independent effective average atoms. The success of the mixing rule applied with equations of state including various degrees of approximation leads us to suggest its use in the thermodynamic domain where quantum molecular dynamics can be implemented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterization of the Nimbus-7 SBUV radiometer for the long-term monitoring of stratospheric ozone

Precise knowledge of in-orbit sensitivity change is critical for the successful monitoring of stratospheric ozone by satellite-based remote sensors. This paper evaluates those aspects of the in-flight operation that influence the long-term stability of the upper stratospheric ozone measurements made by the Nimbus-7 SBUV spectroradiometer and chronicles methods used to maintain the long-term albedo calibration of this UV sensor. It is shown that the instrument's calibration for the ozone measurement, the albedo calibration, has been maintained over the first 6 yr of operation to an accuracy of approximately + or - 2 percent. The instrument's wavelength calibration is shown to drift linearly with time. The knowledge of the SBUV wavelength assignment is maintained to a 0.02-nm precision.

Cebula, Richard P.↗

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗

Resilient Operating Constraints for Power Distribution Systems under Setpoint Attacks

Integration and operation of distributed generation (DG) and energy storage (ES) in power distribution systems are enabled by communication networks and embedded sensor and control devices that increase the vulnerability of the systems to cyber-threats, broadening the attack surface and making adversary actions more unpredictable. This paper proposes a methodology that uses ellipsoidal approximations to quantify the potential damage caused by successful attacks that affect, directly or indirectly, the desired operation setpoints and may drive the power distribution operation to unsafe states by violating the limits of voltage or line flows. More specifically, a new methodology is introduced to find the optimal non-symmetric operating constraints that can be imposed to each DG and ES in order to guarantee that the power distribution system is resilient to any malicious setpoints. The proposed method takes as inputs the system topology, DG and ES capabilities, and load limits to solve a convex optimization problem formulated using linear matrix inequalities (LMIs) and the power flow equations. The proposed solution is agnostic to the attacker's action or load profile and it does not require any assumption about the location or means of the attack. The numerical results on a test distribution feeder with several DG and ES illustrate how the proposed resilient operating constraints guarantee the security of the power distribution system under setpoint attacks.

Giraldo, Jairo↗

Stochastic Microgrid Scheduling With Chance‐Constrained Resilience Consideration

Traditionally, it is assumed that microgrids transition seamlessly from grid‐connected operation to islanded mode in the event of sudden main grid outages. In reality, the islanding process, especially unintentional islanding, is rarely seamless. Instead, it is subject to voltage and frequency fluctuations caused by the instantaneous disconnection of the point of common coupling (PCC) switch, variations in loads and renewable generation output and even the protection tripping of distributed energy resources (DERs). To mitigate these fluctuations and facilitate a smooth islanding process, we propose a stochastic microgrid scheduling model that incorporates chance‐constrained resilience measures. Specifically, the resilience measure is defined as the probability of successful islanding (PSI), that is, the probability that a microgrid can mitigate the generation‐demand imbalance caused by the disconnection of the PCC switch, variations in load and renewable generation and DER tripping. This measure is modelled using chance constraints. Unlike existing reliability and resilience indices, which typically neglect the possibility of microgrid/DER failure under extreme events and assume their survival while primarily focussing on reducing impact duration or magnitude, the proposed PSI‐based framework explicitly addresses microgrid and DER survival during the islanding transition. The formulated nonlinear chance constraints are approximated using a multiinterval approach and equivalently represented as a mixed‐integer linear programming (MILP) formulation. Case study results validate the proposed method, showing that the PSI estimation error is reduced to less than 8%, compared to approximately 28% with existing methods. Various sensitivity analyses on the DER tripping rate and PSI settings were performed to validate the robustness of the proposed method. In particular, the necessity of accounting for DER tripping in the PSI calculation was demonstrated.

chance constrained optimization↗

Sensor Fish: an autonomous sensor package for characterizing complex flow fields and fish passage

Fish passing through dams or other hydraulic structures may be injured or killed despite advances in turbine design, project operations, and other fish bypass systems. The Sensor Fish (SF) device is an autonomous sensor package that characterizes the physical conditions and stressors to which fish are exposed during passage through hydro facilities. It was designed to move passively as a neutrally buoyant object through severe hydraulic environments, while collecting high-resolution sensor data. Since its first generation1, the SF device has been successfully deployed in many fish passage studies and has evolved to be a major tool for characterizing fish passage conditions during fish passage in the Columbia River Basin. To better accelerate hydropower development, the U.S. Department of Energy Water Power Program provided funding to develop a new generation (Gen 2 SF) to incorporate more capabilities and accommodate a wider range of users over a broader range of turbine designs and operating environments. The Gen 2 SF (Figure 1) is approximately the size and density of a yearling salmon smolt and is nearly neutrally buoyant. It contains three-dimensional (3D) rotation sensors, 3D linear acceleration sensors, a pressure sensor, a temperature sensor, a 3D orientation sensor, a radiofrequency (RF) transmitter, and a recovery module2. A low-power microcontroller collects data from the sensors and stores up to 5 min of data on internal flash memory at a sampling frequency of 2048 Hz. The recovery module makes the SF positively buoyant after a pre-programmed period of time, causing it to float to the surface for recovery.

Sensor Fish↗