Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithms”

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 1,081 records · Page 60

Probabilistic N - k failure-identification for power systems

This work considers a probabilistic generalization of the N - k failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the N - k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances; the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

PEAK FLUX DISTRIBUTIONS OF SOLAR RADIO TYPE-I BURSTS FROM HIGHLY RESOLVED SPECTRAL OBSERVATIONS

Solar radio type-I bursts were observed on 2011 January 26 by high resolution observations with the radio telescope AMATERAS in order to derive their peak flux distributions. We have developed a two-dimensional auto burst detection algorithm that can distinguish each type-I burst element from complex noise storm spectra that include numerous instances of radio frequency interference (RFI). This algorithm removes RFI from the observed radio spectra by applying a moving median filter along the frequency axis. Burst and continuum components are distinguished by a two-dimensional maximum and minimum search of the radio dynamic spectra. The analysis result shows that each type-I burst element has one peak flux without double counts or missed counts. The peak flux distribution of type-I bursts derived using this algorithm follows a power law with a spectral index between 4 and 5.

79 ASTRONOMY AND ASTROPHYSICS↗

Performance of Three Mode-Meter Block-Processing Algorithms for Automated Dynamic Stability Assessment

The frequency and damping of electromechanical modes offer considerable insight into the dynamic stability properties of a power system. The performance properties of three block-processing algorithms from the perspective of near real-time automated stability assessment are demonstrated and examined. The algorithms are: the extended modified Yule Walker (YW); extended modified Yule Walker with Spectral analysis (YWS); and numerical state-space subspace system identification(N4SID) algorithm. The YW and N4SID have been introduced in previous publications while the YWS is introduced here. Issues addressed include: stability assessment requirements; automated subset selecting identified modes; using algorithms in an automated format; data assumptions and quality; and expected algorithm estimation performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Minimum entropy filtering for a single output non-Gaussian stochastic system using state transformation

This paper presents a novel filter design for the single-output stochastic non-linear systems subjected to non-Gaussian noises and the proposed assumptions. Based on a state transformation, the unmeasurable states of the systems can be estimated where non-linear terms in the systems have been eliminated. It has been shown that the estimation error is linearly dynamical regarding to the presented vector-valued filter gain which can be optimised by minimising the entropy-based performance criterion. In addition, the convergence of the presented algorithm is analysed in mean-square sense and a numerical example is given to verify the effectiveness of the presented filtering algorithm. Meanwhile, the extended Kalman filter, unscented particle filter and minimum entropy filter are given for the comparisons of the filtering performance. Following the presented framework, some extensions of the presented filtering algorithm are discussed to indicate the flexibility of the filter design. The contribution of this paper can be summarised as establishing a novel minimum entropy filtering framework which consists of model transformation, entropy optimisation and convergence analysis.

42 ENGINEERING↗

Study of lower hybrid wave propagation in ionized gas by Hamiltonian theory

In order to find an approximate solution to the Vlasov-Maxwell equation system describing the lower hybrid wave propagation in magnetic confined plasmas, the use of the WKB method leads to the ray tracing equations. The Hamiltonian character of the ray tracing equations is investigated analytically and numerically in order to deduce the physical properties of the wave propagating without absorption in the confined plasma. The consequences of the Hamiltonian character of the equations on the travelling wave, in particular, on the evolution of the parallel wavenumber along the propagation path have been accounted and the chaotic diffusion of the timeaveraged parallel wave-number towards higher values has been evaluated. Numerical analysis by means of a Runge-Kutta based algorithm implemented in a ray tracing code supplies the analytical considerations. A numerical tool based on the symplectic integration of the ray trajectories has been developed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Generalized Multiscale Inversion for Heterogeneous Problems

In this work, we propose a generalized multiscale inversion algorithm for heterogeneous problems that aims at solving an inverse problem on a computational coarse grid. Previous inversion techniques for multiscale problems seek a coarse-grid medium properties, e.g., permeability and conductivity, and by doing so, they assume that there exists a homogenized representation of the underlying fine-scale permeability field on a coarse grid. Generally such assumptions do not hold for highly heterogeneous fields, e.g., fracture media or channelized fields, where the width of channels are very small compared to the scale of coarse grids. In these cases, grid refinement can lead to many degrees of freedom, and thus numerically unattractive to apply. The proposed algorithm is based on the Generalized Multiscale Finite Element Method (GMsFEM), which uses local spectral problems to identify non-localized features, i.e., channels (high-conductivity inclusions that connect the boundaries of the coarse-grid block). The inclusion of these features in the coarse space enables one to achieve a good accuracy. The approach is valid under the assumption that the solution can be well represented in a reduced-dimensional space spanned by multiscale basis functions. In practice, these basis functions are non-observable as we do not identify the fine-scale features of the permeability field. Our inversion algorithm finds the discretization parameters of the resulting system on the coarse grid. By doing so, we identify the appropriate coarse-grid parameters representing the permeability field instead of fine-grid permeability field. We illustrate the potential of the approach by numerical results for fractured media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Quantum Generative Training using an Unbounded Loss Function

We propose a generative quantum learning algorithm using the Adaptive Derivative-Assembled Problem Tailored ansatz (ADAPT) framework in which the loss function to be minimized is the maximal quantum Rényi divergence of order two, an unbounded function that mitigates barren plateaus which inhibit training variational circuits. We benchmark this method against other state-of-the-art adaptive algorithms by learning random two-local thermal states. We perform numerical experiments of up to 12 qubits comparing our method learning algorithms that use linear objective functions and show that Rényi-ADAPT is capable of constructing shallow quantum circuits competitive with existing methods, while the gradients remain favorable resulting from the maximal Rényi divergence loss function.

quantum algorithms, quantum machine learning, quan↗

Full Law Analysis Scattering System Hub (FLASSH)

In neutronic systems such as thermal reactors, the thermal neutron plays a fundamental role in the system behavior. Therefore, high fidelity thermal neutron scattering cross section evaluations are required in the design of such systems. Because the de Broglie wavelength of thermal neutrons is comparable to the atomic separation distance in matter, the neutron scattering behavior in the energy region of atomic thermal motion is fundamentally different from high energy regions. In recent years, algorithms and theories of thermal neutron scattering have been developed and verified. Based on that effort, a capability for full analysis of the scattering law in an atomistic system (FLASSH) has been developed. FLASSH not only reproduces the evaluations of conventional thermal neutron scattering codes, such as the LEAPR and THERMR modules of the NJOY code, but also improves the accuracy of evaluations by removing or relaxing numerous approximations and by implementing advanced algorithm. In this work, α-SiO{sub 2} and crystalline beryllium metal are taken as examples to demonstrate the evaluation of the inelastic thermal scattering cross section and the coherent elastic scattering cross section using FLASSH.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Nonconforming Mesh Refinement for High-Order Finite Elements

In this study, we propose a general algorithm for nonconforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on $h$-refinement with a fixed polynomial order. The algorithm handles triangular, quadrilateral, hexahedral, and prismatic meshes of arbitrarily high-order curvature, for any order finite element space in the de Rham sequence. We present a flexible data structure for meshes with hanging nodes and a general procedure to construct the conforming interpolation operator, both in serial and in parallel. The algorithm and data structure allow anisotropic refinement of tensor product elements in two and three dimensions and support unlimited refinement ratios of adjacent elements. We report numerical experiments verifying the correctness of the algorithms and perform a parallel scaling study to show that we can adapt meshes containing billions of elements and run efficiently on 393,000 parallel tasks. Finally, we illustrate the integration of dynamic AMR into a high-order Lagrangian hydrodynamics solver.

97 MATHEMATICS AND COMPUTING↗

Disruptive Innovation in Numerical Hydrodynamics

We propose the research and development of a high-fidelity hydrodynamic algorithm for tetrahedral meshes that will lead to a disruptive innovation in the numerical modeling of Laboratory problems. Our proposed innovation has the potential to reduce turnaround time by orders of magnitude relative to Advanced Simulation and Computing (ASC) codes; reduce simulation setup costs by millions of dollars per year; and effectively leverage Graphics Processing Unit (GPU) and future Exascale computing hardware. If successful, this work will lead to a dramatic leap forward in the Laboratory's quest for a predictive simulation capability.

97 MATHEMATICS AND COMPUTING↗

Modern modulation schemes: a linear programming based tone injection algorithm for PAPR reduction of OFDM and linearly precoded systems

This work investigates the improvement of power amplifier efficiency through the reduction of peak-to-average power ratio (PAPR) of linearly precoded QAM data signals. In particular, we fo cus on the special cases of linear precoded modulation including the practical OFDM, OFDMA, and SC-FDMA signals that have been widely adopted in W-LAN and W-MAN. We apply the method of tone injection optimization for PAPR reduction. To reduce numerical complexity, we propose a linear programming algorithm which closely approximates the original tone injection optimization problem. Our comprehensive numerical results demonstrate substantial PAPR reduc tion and superior BER performance using several practical examples.

Jacklin, Neil↗

Integral Kernel Methods for Nonlinear Parabolic-Elliptic Systems

Nonlinear parabolic-elliptic systems arise in many physical, biological, and chemical phenomena such as chemotaxis, ion transport, self-gravitating particles, and Brownian vortices. Existing methods struggle with the strong coupling and high nonlinearity and nonlocality of some of these systems, especially the ill-conditioned, convection-dominated problems. To overcome numerical difficulties, current approaches rely on initial guesses, preconditioning, or iterative techniques with no convergence guarantees. They might suffer from poor scalability, large memory usage, and difficulty to parallelize. Inspired by the connection of parabolic-elliptic systems to stochastic processes, we introduce a novel meshless, monolithic, and fully explicit method that naturally encapsulates the elliptic and parabolic operators into a single step which updates each node deterministically with global information. By being fully quadrature-based, it avoids solving systems of discretized equations and does not utilize initial guesses or preconditioning, while requiring little memory and being easy to parallelize. We first derive the method in an integral kernel formulation with quadratic complexity in the number of integration nodes and then leverage kernel-independent fast multipole methods (FMM) to present a scalable algorithm with linear complexity. We provide numerical examples for the Poisson-Nernst-Planck equations in one, two, and three dimensions, together with the derivation of the integral kernel for each case. Furthermore, the examples demonstrate the fast convergence and scalability of the FMM-accelerated algorithm, as well as its suitability for convection-dominated problems, making it competitive against traditional PDE solvers.

PDE systems↗

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Hybrid Models and Algorithms for Fluids (FHDeX) v1

This software contains numerical modules and application codes for studying the behavior of fluid dynamical systems where fluctuations play an important role in the dynamics. There is support for finite-volume/finite-difference solvers for partial differential equations, particle methods, and hybrid fluid-particle approaches.

Bell, JohnB.↗

Geometry of Non-Diffusive Tracer Transport in Gridded Atmospheric Models

A first-order linear and numerically non-diffusive Eulerian transport algorithm, minVAR, was recently developed for preservation of correlations between interrelated tracers during advective transport. The present study extends this work by: (1) providing further investigation of several interesting geometric constructions found in contours of constant minVAR, short for minimum variance, through extension to three coordinate dimensions. These contours capture point-by-point representations of thousands of individual atmospheric aerosol and/or cloud particles as they evolve and are rendered on Eulerian grids at a level of sub-grid resolution limited only by numerical precision; and (2) exploration of geometric similarities between the Arakawa C-grid, used to obtain interpolated values of the wind field at grid scale and minVAR. In particular, we consider interpolation of the u and v horizontal components of wind velocity from grid to sub-grid scales. The last results are motivated by recent applications of the Weather Research and Forecasting (WRF) model applied in the coastal Houston region, where the recent TRacking Aerosol Convection Interactions ExpeRiment (TRACER) field campaign was organized. A unique and fully consistent mapping is obtained between particles moving along meteorological wind trajectories and the non-diffusive, non-dispersive representation of such trajectories on an Eulerian grid.

54 ENVIRONMENTAL SCIENCES↗

Non-Adiabatic Excited State Molecular Dynamics Methodologies: comparison and convergence

Direct atomistic simulation of nonadiabatic molecular dynamics is a challenging goal that allows important insights into fundamental physical phenomena. A variety of frameworks, ranging from fully quantum treatment of nuclei to semiclassical and mixed quantum–classical approaches, were developed. These algorithms are then coupled to specific electronic structure techniques. Such diversity and lack of standardized implementation make it difficult to compare the performance of different methodologies when treating realistic systems. Here, we compare three popular methods for large chromophores: Ehrenfest, surface hopping, and multiconfigurational Ehrenfest with ab initio multiple cloning (MCE-AIMC). These approaches are implemented in the NEXMD software, which features a common computational chemistry model. The resulting comparisons reveal the method performance for population relaxation and coherent vibronic dynamics. Finally, we study the numerical convergence of MCE-AIMC algorithms by considering the number of trajectories, cloning thresholds, and Gaussian wavepacket width. Our results provide helpful reference data for selecting an optimal methodology for simulating excited-state molecular dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A high-order adaptive algorithm for multispecies gaseous flows on mapped domains

We report a fourth-order accurate finite-volume method is developed and verified for solving strongly nonlinear, time-dependent, compressible, thermally perfect, and multispecies gaseous flows on mapped grids that are adaptively refined in space and time. The algorithm introduces a new scheme for numerical flux calculations in order to cope with the nonlinear, spatially and temporally varying thermodynamic and transport properties of the gaseous mixture. The fourth-order numerical error convergence and solution accuracy are verified using Couette flow, species mass diffusion bubble, and vortex convection and diffusion problem. The thermally perfect, multispecies functionality is validated using a one-dimensional shock tube and two-dimensional shock box problem. Results are obtained for the Mach reflection problem where a strong shock propagates in the multispecies gaseous flow along a ramp and are compared to the solution of the shock propagation in a single species, calorically perfect, gaseous flow over the same ramp. The validated algorithm is then applied to simulate a relatively complex flow configuration to examine the secondary flow mixing due to the double air jets along with the main inlet where a premixed fuel mixture flows in. Future investigations will focus on three-dimensional configurations.

42 ENGINEERING↗