Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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,441 records · Page 80

An iterative finite difference method for solving the quantum hydrodynamic equations of motion

The quantum hydrodynamic equations of motion associated with the de Broglie-Bohm description of quantum mechanics describe a time evolving probability density whose 'fluid' elements evolve as a correlated ensemble of particle trajectories. These equations are intuitively appealing due to their similarities with classical fluid dynamics and the appearance of a generalized Newton's equation of motion in which the total force contains both a classical and quantum contribution. However, the direct numerical solution of the quantum hydrodynamic equations (QHE) is fraught with challenges: the probability 'fluid' is highly-compressible, it has zero viscosity, the quantum potential ('pressure') is non-linear, and if that weren't enough the quantum potential can also become singular during the course of the calculations. Collectively these properties are responsible for the notorious numerical instabilities associated with a direct numerical solution of the QHE. The most successful and stable numerical approach that has been used to date is based on the Moving Least Squares (MLS) algorithm. The improved stability of this approach is due to the repeated local least squares fitting which effectively filters or reduces the numerical noise which tends to accumulate with time. However, this method is also subject to instabilities if it is pushed too hard. In addition, the stability of the MLS approach often comes at the expense of reduced resolution or fidelity of the calculation (i.e., the MLS filtering eliminates the higher-frequency components of the solution which may be of interest). Recently, a promising new solution method has been developed which is based on an iterative solution of the QHE using finite differences. This method (referred to as the Iterative Finite Difference Method or IFDM) is straightforward to implement, computationally efficient, stable, and its accuracy and convergence properties are well understood. A brief overview of the IFDM will be presented followed by a couple of benchmark applications on one- and two-dimensional Eckart barrier scattering problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Distributed-memory Parallel Algorithms for Matching and Coloring

Graph matching and coloring constitute two fundamental classes of combinatorial problems having numerous established as well as emerging applications in computational science and engineering, high-performance computing, and informatics. We provide a snapshot of an on-going work on the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical problems from these classes, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency and poor data locality, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including approximation, speculation and iteration, optimized communication, and randomization, in concert. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale.

Combinatorial scientific computing↗

Comparison between the NWF and DC methods for implementing HR Schemes within a Fully Coupled Finite Volume Solver

This paper reports on the performance of a high resolution implemented as part of an implicit fully coupled velocity-pressure algorithm for the solution of laminar incompressible flow problems. The numerical implementation of high resolution convective schemes follows two techniques; (i) the Deferred Correction (DC) approach, and (ii) the Normalized Weighting Factor (NWF) method. The superiority of the NWF method over the DC approach is demonstrated by solving the sudden expansion in a square cavity problem. Results indicate that the number of iterations needed by the NWF solver is grid independent. Moreover, recorded CPU time values reveal that the NWF method substantially reduces the computational cost.

42 ENGINEERING↗

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

Evolution of domain wall networks: The Press-Ryden-Spergel algorithm

The Press-Ryden-Spergel (PRS) algorithm is a modification to the field theory equations of motion, parametrized by two parameters ({alpha} and {beta}), implemented in numerical simulations of cosmological domain wall networks, in order to ensure a fixed comoving resolution. In this paper we explicitly demonstrate that the PRS algorithm provides the correct domain wall dynamics in (N+1)-dimensional Friedmann-Robertson-Walker universes if {alpha}+{beta}/2=N, fully validating its use in numerical studies of cosmic domain evolution. We further show that this result is valid for generic thin featureless domain walls, independently of the Lagrangian of the model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Correlated speckle noise in white-light interferometry: theoretical analysis of measurement uncertainty

The partial coherent illumination of the specimen, which is required for white-light interferometric measurements of optically rough surfaces, directly leads to speckle. The electric field of such speckle patterns strongly fluctuates in amplitude and phase. This spatially correlated noise influences the accuracy of the measuring device. Although a variety of noise sources in white-light interferometry has been studied in recent years, they do not account for spatial correlation and, hence, they cannot be applied to speckle noise. Thus, we derive a new model enabling quantitative predictions for measurement uncertainty caused by speckle. The model reveals that the accuracy can be attributed mainly to the degree of spatial correlation, i.e., the average size of a speckle, and to the coherence length of the light source. The same parameters define the signal-to-noise ratio in the spectral domain. The model helps to design filter functions that are perfectly adapted to the noise characteristics of the respective device, thus improving the accuracy of postprocessing algorithms for envelope detection. The derived expressions are also compared to numerical simulations and experimental data of two different types of interferometers. These results are a first validation of the theoretical considerations of this article.

36 MATERIALS SCIENCE↗

Cyber Physical Grid-Interactive Distributed Energy Resources Control for VPP Dispatch and Regulation

This paper presents a cyber-physical algorithm for grid-interactive Distributed Energy Resource (DER) control to enable two features of Virtual Power Plants (VPPs) dispatch and grid voltage regulation, considering the communication and security impacts. We first formulate the DER dispatch problem as a real-time, iterative, and grid-interactive DER control problem. Thereafter, we consider a probabilistic traffic model to characterize packet delays and loss in a communication network, and study how the delays enter the process of information exchange among the grid measurement units, local DER controllers and the grid control center that coordinately execute this dispatch algorithm. Finally, a strategy combining delay threshold and modified message update rules is proposed to immune the asynchrony resulting from the communications network traffic and it avoids possible numerical instabilities and sensitivities of the tracking and regulation capabilities of this DER control algorithm. By implementing the proposed cyber-physical algorithm on the modified IEEE 37-node system, our preliminary results exhibit that the uncertainties of the underlying communications infrastructure must be considered for the VPP tracking and regulation capabilities of any DER in a generic Cyber-Physical System (CPS), because the delayed voltage measurements in the uplink/bi-link cases result in the off-track in VPP dispatch and jittery in voltage regulation.

cyber-physical algorithm↗

Cholesky-based experimental design for Gaussian process and kernel-based emulation and calibration.

Gaussian processes and other kernel-based methods are used extensively to construct approximations of multivariate data sets. The accuracy of these approximations is dependent on the data used. This paper presents a computationally efficient algorithm to greedily select training samples that minimize the weighted L p error of kernel-based approximations for a given number of data. The method successively generates nested samples, with the goal of minimizing the error in high probability regions of densities specified by users. The algorithm presented is extremely simple and can be implemented using existing pivoted Cholesky factorization methods. Training samples are generated in batches which allows training data to be evaluated (labeled) in parallel. For smooth kernels, the algorithm performs comparably with the greedy integrated variance design but has significantly lower complexity. Numerical experiments demonstrate the efficacy of the approach for bounded, unbounded, multi-modal and non-tensor product densities. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data using Bayesian inference.

97 MATHEMATICS AND COMPUTING↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

Machine Learning for Fairness-Aware Load Shedding: A Real-Time Solution via Identifying Binding Constraints: Preprint

Timely and effective load shedding in power systems is critical for maintaining supply-demand balance and preventing cascading blackouts. To eliminate load shedding bias against specific regions in the system, optimization-based methods are uniquely positioned to help balance between economic and fairness considerations. However, the resulting optimization problem involves complex constraints, which can be time-consuming to solve and thus cannot meet the real-time requirements of load shedding. To tackle this challenge, in this paper we present an efficient machine learning algorithm to enable millisecond-level computation for the optimization-based load shedding problem. Numerical studies on both a 3-bus toy example and a realistic RTS-GMLC system have demonstrated the validity and efficiency of the proposed algorithm for delivering fairness-aware and real-time load shedding decisions.

97 MATHEMATICS AND COMPUTING↗

Short-Term Solar Forecasting Performance of Popular Machine Learning Algorithms: Preprint

A framework for assessing the performance of short-term solar forecasting is presented in conjunction with a range of numerical results using global horizontal irradiation (GHI) from the open-source Surface Radiation Budget (SURFRAD) data network. A suite of popular machine learning algorithms is compared according to a set of statistically distinct metrics and benchmarked against the persistence-of-cloudiness forecast and a cloud motion forecast. Results show significant improvement compared to the benchmarks with trade-offs among the machine learning algorithms depending on the desired error metric. Training inputs include time series observations of GHI for a history of years, historical weather and atmospheric measurements, and corresponding date and time stamps such that training sensitivities might be inferred. Prediction outputs are GHI forecasts for 1, 2, 3, and 4 hours ahead of the issue time, and they are made for every month of the year for 7 locations. Photovoltaic power and energy outputs can then be made using the solar forecasts to better understand power system impacts.

14 SOLAR ENERGY↗

A Range and Performance Optimized Version of the Computer-Aided Speckle Interferometry Algorithm for Real-Time Displacement-Strain Field Monitoring

Abstract This work presents an optimized implementation of the Computer-Aided Speckle Interferometry algorithm which enables full-field determination of displacements and strains on commodity Graphics Processing Units at high resolution and frame rates. By combining careful control of the average speckle size in a laser speckle pattern with a simple sampling rate conversion scheme, a compact representation of the optical speckle is achieved. This allows for optimal use of Graphics Processing Unit architecture with robust range extension. The optimal mapping of the Computer-Aided Speckle Interferometry algorithm to Graphics Processing Unit architecture is shown in detail, and a straightforward method for disambiguating large displacements is illustrated. Lastly, this paper demonstrates a two-step subimage-tapering modification to the original algorithm that enables robust range enhancement while maintaining resolution. Results from numerical simulations on synthetic speckle patterns are shown, and runtime performance metrics are provided, with performance ranging up to 60 frames per second in some cases. The method is suitable for interactive experimental mechanics research, process and testing or any application where real-time high-resolution displacement-strain monitoring is needed. A .NET Framework class library enabling the incorporation of the algorithm into 3rd -party applications is available for download.

42 ENGINEERING↗

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗

Adaptive experimental design for multi-fidelity surrogate modeling of multi-disciplinary systems

We present an adaptive algorithm for constructing surrogate models of multi-disciplinary systems composed of a set of coupled components. With this goal we introduce “coupling” variables with a priori unknown distributions that allow surrogates of each component to be built independently. Once built, the surrogates of the components are combined to form an integrated-surrogate that can be used to predict system-level quantities of interest at a fraction of the cost of the original model. The error in the integrated-surrogate is greedily minimized using an experimental design procedure that allocates the amount of training data, used to construct each component-surrogate, based on the contribution of those surrogates to the error of the integrated-surrogate. Here, the multi-fidelity procedure presented is a generalization of multi-index stochastic collocation that can leverage ensembles of models of varying cost and accuracy, for one or more components, to reduce the computational cost of constructing the integrated-surrogate. Extensive numerical results demonstrate that, for a fixed computational budget, our algorithm is able to produce surrogates that are orders of magnitude more accurate than methods that treat the integrated system as a black-box.

42 ENGINEERING↗

Multibeam field emission x-ray system with half-scan reconstruction algorithm

Purpose: In this article, the authors propose a multibeam field emission x-ray (MBFEX) system along with a half-scan fan-beam reconstruction algorithm. Methods: The proposed system consists of a linear CNT-based MBFEX source array, a single large area detector that is divided into same number of segments as the number of x-ray beams, a multihole collimator that aligns each beam with a corresponding detector segment, and a sample rotation stage. The collimator is placed between the source and the object to restrict the x-ray radiations through the target object only. In this design, all the x-ray beams are activated simultaneously to provide multiple projection views of the object. The detector is virtually segmented and synchronized with the x-ray exposure and the physiological signals when gating is involved. The transmitted x-ray intensity from each beam is collected by the corresponding segment on the detector. After each exposure, the object is rotated by a step angle until sufficient data set is collected. The half-scan reconstruction formula for MBFEX system is derived from the conventional filtered backprojection algorithm. To demonstrate the advantages of the system and method in reducing motion artifacts, the authors performed simulations with both standard and dynamic Shepp-Logan phantoms. Results: The numerical results indicate that the proposed multibeam system and the associated half-scan algorithm can effectively reduce the scanning time and improve the image quality for a time-varying object. Conclusions: The MBFEX technique offers an opportunity for the innovation of multisource imaging system.

60 APPLIED LIFE SCIENCES↗

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

Including the effects of temperature-dependent opacities in the implicit Monte Carlo algorithm

The Implicit Monte Carlo technique of Fleck and Cummings is often employed to numerically simulate radiative transfer. This method achieves greater stability than one with a fully explicit time discretization by estimating the t{sup n+1} value of T{sup 4} from the thermal emission term, which is proportional to T{sup 4}. In the Fleck and Cummings algorithm, this results in decreasing the absorption by the so-called 'Fleck factor', and adding a corresponding amount of effective scattering. We show how to include the effects of the temperature-dependent opacity to the estimated t{sup n+1} value of the thermal emission term. This results in the addition to the 'Fleck factor' of a term that depends on (d{sigma})/(dT) . We demonstrate that this modification allows for more accurate solutions with much larger time steps for problems with opacities that have a strong temperature dependence.

97 MATHEMATICS AND COMPUTING↗

A multi-dimensional, moment-accelerated deterministic particle method for time-dependent, multi-frequency thermal radiative transfer problems

Thermal Radiative Transfer (TRT) is the dominant energy transfer mechanism in high-energy density physics with applications in inertial confinement fusion and astrophysics. The stiff interactions between the material and radiation fields make TRT problems challenging to model. In this study, we propose a multi-dimensional extension of the deterministic particle (DP) method. The DP method combines aspects from both particle and deterministic methods. If the emission source is known a priori, and no physical scattering is present, the intensity of a particle can be integrated analytically. This introduces no statistical noise compared to Monte-Carlo methods, while maintaining the flexibility of particle methods. The method is closely related to the popular method of long characteristics. The combination of the DP-method with a discretely-consistent, nonlinear, gray low-order system enables an efficient solution algorithm for multi-frequency TRT problems. Here, we demonstrate with numerical examples that the use of a linear-source approximation based on spatial moments improves the behavior of our method in the thick diffusion limit significantly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗