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,657 records · Page 92

Distributed Automatic Load-Frequency Control with Optimality in Power Systems: Preprint

With increasing penetrations of renewable energy resources, power systems face new challenges in balancing supply and demand and maintaining nominal frequency. This paper studies load control to handle these challenges. In particular, a fully distributed automatic load control algorithm, which needs only local measurement and local communications, is proposed. We prove that the control algorithm globally converges to an optimal operating point that minimizes the total disutility of users, restores the nominal frequency and the scheduled tie-line power flows, and respects the thermal constraints of transmission lines. We also show that the convergence holds even when inaccurate system parameters are used in the control algorithm. Last, the effectiveness, optimality, and robustness of the proposed algorithm are demonstrated via numerical simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

"Recognizing Numerical Constants"

The advent of inexpensive, high performance computer and new efficient algorithms have made possible the automatic recognition of numerically computed constants. In other words, techniques now exist for determining, within certain limits, whether a computed real or complex number can be written as a simple expression involving the classical constants of mathematics. In this presentation, some of the recently discovered techniques for constant recognition, notably integer relation detection algorithms, will be presented. As an application of these methods, the author's recent work in recognizing "Euler sums" will be described in some detail.

Bailey, David H.↗

Kalman estimation for SEDS measurements

The first on-orbit experiment of the Small Expendable Deployer System (SEDS) for tethered satellites will collect telemetry data for tethered length, rate of deployment, and tether tension. The post-flight analysis will use this data to reconstruct the deployment history and determine payload position and tether shape. Two Kalman estimator algorithms were written, and output using simulated measurement data was compared. Both estimators exhibited the same estimated state histories, indicating that numerical instability in the traditional algorithm was not the cause of filter divergence. Estimation of acceleration biases was added, which reduced the error but did not correct the divergence. An add-a-bead estimator that adds lumped masses as the tether is deployed was written, which provides a state model that matches the BEADSIM simulation providing the true measurements and states. This twenty-one bead estimator produced state histories similar to those of the two-bead estimator, indicating that the filter divergence was not caused by a reduced-order model. The noise models used to date are relatively simple and may be the source of estimator divergence. The investigation of colored noise models, cross-correlated measurement and process covariances, and noise-adaptive filter techniques is recommended.

Carrington, Connie K.↗

IslandFAST: A Semi-numerical Tool for Simulating the Late Epoch of Reionization

We present the algorithm and main results of our semi-numerical simulation, islandFAST, which was developed from 21cmFAST and designed for the late stage of reionization. The islandFAST simulation predicts the evolution and size distribution of the large-scale underdense neutral regions (neutral islands), and we find that the late Epoch of Reionization proceeds very fast, showing a characteristic scale of the neutral islands at each redshift. Using islandFAST, we compare the impact of two types of absorption systems, i.e., the large-scale underdense neutral islands versus small-scale overdense absorbers, in regulating the reionization process. The neutral islands dominate the morphology of the ionization field, while the small-scale absorbers dominate the mean-free path of ionizing photons, and also delay and prolong the reionization process. With our semi-numerical simulation, the evolution of the ionizing background can be derived self-consistently given a model for the small absorbers. The hydrogen ionization rate of the ionizing background is reduced by an order of magnitude in the presence of dense absorbers.

79 ASTRONOMY AND ASTROPHYSICS↗

On numerical energy conservation for an implicit particle-in-cell method coupled with a binary Monte-Carlo algorithm for Coulomb collisions

We report conventional particle-in-cell (PIC) methods suffer from enhanced numerical heating (explicit PIC) or cooling (semi-implicit PIC) when coupled with a binary Monte-Carlo algorithm for Coulomb collisions. In this work, a fully-implicit θ-PIC scheme (with adjustable time-biasing parameter 1/2 ≤ θ ≤) is considered. The discrete change in energy of a closed system after a time step for this scheme scales with (1/2 - θ)C θ , where C θ is a positive definite quantity that depends on the frequency spectrum of the energy in the fields. Collisions lead to additional energy in the field fluctuations associated with high-frequency light waves produced by a numerical Bremsstrahlung process, which can result in a large increase in the numerical cooling rate for θ > 1/2. However, for θ = 1/2, energy is exactly conserved. The energy in the field fluctuations on long time scales agrees with that calculated using the equipartition theorem for a classical system in thermodynamic equilibrium.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Square-root algorithm for evaluating mismodeled process noise

As the application of sequential filters has grown, the need has arisen to evaluate the sensitivity of these filters to mismodeling of the random process. A numerically reliable square-root algorithm is developed for calculating the covariances of estimates from a sequential filter which incorrectly models process noise. Mismodeling is restricted to the correlation time and standard deviation of a random process represented as a first-order Gauss-Markov sequence. Using a computer program which employs this algorithm, a sensitivity analysis was performed for several types of earth-based tracking data from an interplanetary spacecraft.

Thornton, C. L.↗

Validation of the EDGES Low-band Antenna Beam Model

The response of the antenna is a source of uncertainty in measurements with the Experiment to Detect the Global Epoch of Reionization Signature (EDGES). We aim to validate the electromagnetic beam model of the low-band (50–100 MHz) dipole antenna with comparisons between models and against data. We find that simulations of a simplified model of the antenna over an infinite perfectly conducting ground plane are, with one exception, robust to changes in the numerical electromagnetic solver code or algorithm. For simulations of the antenna with the actual finite ground plane and realistic soil properties, we find that two out of three numerical solvers agree well. Applying our analysis pipeline to a simulated drift-scan observation from an early EDGES low-band instrument that had a 10 m × 10 m ground plane, we find residual levels after fitting and removing a five-term foreground model from the simulated data binned in local sidereal time (LST) average about 250 mK with ±40 mK variation between numerical solvers. A similar analysis of the primary 30 m × 30 m sawtooth ground plane reduced the LST-averaged residuals to about 90 mK with ±10 mK between the two viable solvers. More broadly we show that larger ground planes generally perform better than smaller ground planes. Simulated data have a power that is within 4% of real observations, a limitation of net accuracy of the sky and beam models. We observe that residual spectral structures after foreground model fits match qualitatively between simulated data and observations, suggesting that the frequency dependence of the beam is reasonably represented by the models. We find that a soil conductivity of 0.02 S m{sup -1} and relative permittivity of 3.5 yield good agreement between simulated spectra and observations. This is consistent with the soil properties reported by Sutinjo et al. for the Murchison Radio-astronomy Observatory, where EDGES is located.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

FORTRAN subroutines for out-of-core solutions of large complex linear systems

The design and usage of two main subprograms using direct methods to solve large linear complex systems, of the form Ax = b, whose coeffficient matrices are too large to be stored in core are described. The first main subprogram is for systems whose coefficient matrices are of a particular sparse structure, namely, the matrix A can be written in the form B + D, where B is a block-banded system, and D has only a few columns of nonzeros. Key elements of the algorithms used in the subprograms include: the data structure, the strategy for preserving numerical stability, the adaptability of the algorithms for dense systems as well as for block-profile systems.

Yip, E. L.↗

Spatially dependent regularization parameter selection for total generalized variation-based image denoising

We propose a novel image denoising model based on the total generalized variation (TGV) regularization. In the model, a spatially dependent regularization parameter is utilized to adaptively fit the local image features, resulting in further exploitation of the denoising potential of the TGV regularization. The proposed model is formulated under a joint optimization framework, by which the estimations of the restored image and the regularization parameter are achieved simultaneously. Furthermore, the model is general purpose that can handle various types of noise occurring in image processing. An alternating minimization-based numerical scheme is especially developed, which leads to an efficient algorithmic solution to the nonconvex optimization problem. Numerical experiments are reported to illustrate the effectiveness of our model in terms of both peak signal-to-noise ratio and visual perception.

97 MATHEMATICS AND COMPUTING↗

Comparison of numerical techniques for integration of stiff ordinary differential equations arising in combustion chemistry

The efficiency and accuracy of several algorithms recently developed for the efficient numerical integration of stiff ordinary differential equations are compared. The methods examined include two general-purpose codes, EPISODE and LSODE, and three codes (CHEMEQ, CREK1D, and GCKP84) developed specifically to integrate chemical kinetic rate equations. The codes are applied to two test problems drawn from combustion kinetics. The comparisons show that LSODE is the fastest code currently available for the integration of combustion kinetic rate equations. An important finding is that an interactive solution of the algebraic energy conservation equation to compute the temperature does not result in significant errors. In addition, this method is more efficient than evaluating the temperature by integrating its time derivative. Significant reductions in computational work are realized by updating the rate constants (k = at(supra N) N exp(-E/RT) only when the temperature change exceeds an amount delta T that is problem dependent. An approximate expression for the automatic evaluation of delta T is derived and is shown to result in increased efficiency.

Radhakrishnan, K.↗

Exact and efficient hybrid Monte Carlo algorithm for accelerated Bayesian inference of gene expression models from snapshots of single-cell transcripts

Single cells exhibit a significant amount of variability in transcript levels, which arises from slow, stochastic transitions between gene expression states. Elucidating the nature of these states and understanding how transition rates are affected by different regulatory mechanisms require state-of-the-art methods to infer underlying models of gene expression from single cell data. A Bayesian approach to statistical inference is the most suitable method for model selection and uncertainty quantification of kinetic parameters using small data sets. However, this approach is impractical because current algorithms are too slow to handle typical models of gene expression. To solve this problem, we first show that time-dependent mRNA distributions of discrete-state models of gene expression are dynamic Poisson mixtures, whose mixing kernels are characterized by a piecewise deterministic Markov process. Here, we combined this analytical result with a kinetic Monte Carlo algorithm to create a hybrid numerical method that accelerates the calculation of time-dependent mRNA distributions by 1000-fold compared to current methods. We then integrated the hybrid algorithm into an existing Monte Carlo sampler to estimate the Bayesian posterior distribution of many different, competing models in a reasonable amount of time. We demonstrate that kinetic parameters can be reasonably constrained for modestly sampled data sets if the model is known a priori. If there are many competing models, Bayesian evidence can rigorously quantify the likelihood of a model relative to other models from the data. We demonstrate that Bayesian evidence selects the true model and outperforms approximate metrics typically used for model selection.

59 BASIC BIOLOGICAL SCIENCES↗

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗

Control of large flexible space structures using pole placement design techniques

A design approach via the pole placement techniques for the class of large flexible space structures is developed. The numerical problems in pole placement algorithm, arising from large dimension systems and the extremely low frequency eigenvalues which occur in large space structure models are examined. It shows these numerical difficulties may be overcome by properly selecting the sensor/actuator locations and introducing a frequency scaling scheme. The concepts of this paper are illustrated by some numerical studies on the linear feedback control design of a representative large spacecraft consisting of a small rigid core with ten radial booms (five booms 1000 ft long and five shorter booms 700 ft long) lying in a plane.

Wu, Y. W.↗

Massively parallel solvers for elliptic partial differential equations in numerical weather and climate prediction

The demand for substantial increases in the spatial resolution of global weather and climate prediction models makes it essential to use numerically efficient and highly scalable algorithms to solve the equations of large-scale atmospheric fluid dynamics. For stability and efficiency reasons, several of the operational forecasting centres, in particular the Met Office and the European Centre for Medium-Range Weather Forecasts (ECMWF) in the UK, use semi-implicit semi-Lagrangian time-stepping in the dynamical core of the model. The additional burden with this method is that a three-dimensional elliptic partial differential equation (PDE) for the pressure correction has to be solved at every model time step and this often constitutes a significant proportion of the time spent in the dynamical core. In global models, this PDE must be solved in a thin spherical shell. To run within tight operational time-scales, the solver has to be parallelized and there seems to be a (perceived) misconception that elliptic solvers do not scale to large processor counts and hence implicit time-stepping cannot be used in very high-resolution global models. After reviewing several methods for solving the elliptic PDE for the pressure correction and their application in atmospheric models, we demonstrate the performance and very good scalability of Krylov subspace solvers and multigrid algorithms for a representative model equation with more than 1010 unknowns on 65 536 cores on the High-End Computing Terascale Resource (HECToR), the UK's national supercomputer. Here, we tested and optimized solvers from two existing numerical libraries (the Distributed and Unified Numerics Environment (DUNE) and Parallel High Performance Preconditioners (hypre)) and implemented both a conjugate gradient solver and a geometric multigrid algorithm based on a tensor-product approach, which exploits the strong vertical anisotropy of the discretized equation. We study both weak and strong scalability and compare the absolute solution times for all methods; in contrast to one-level methods, the multigrid solver is robust with respect to parameter variations.

58 GEOSCIENCES↗

Improvement of mixed time implicit-explicit algorithms for thermal analysis of structures

Computer implementation aspects and numerical evaluation of the recently introduced mixed time implicit-explicit algorithms in thermal analysis of structures are presented. A computationally useful method of estimating the critical time step for a linear quadrilateral element is given herein for the methods introduced by Liu and co-workers. Numerical tests confirm the stability criterion and accuracy characteristics of the methods. The superiority of these mixed time methods to the fully implicit method or the fully explicit method is also demonstrated.

Liu, W. K.↗

UDU/T/ covariance factorization for Kalman filtering

There has been strong motivation to produce numerically stable formulations of the Kalman filter algorithms because it has long been known that the original discrete-time Kalman formulas are numerically unreliable. Numerical instability can be avoided by propagating certain factors of the estimate error covariance matrix rather than the covariance matrix itself. This paper documents filter algorithms that correspond to the covariance factorization P = UDU(T), where U is a unit upper triangular matrix and D is diagonal. Emphasis is on computational efficiency and numerical stability, since these properties are of key importance in real-time filter applications. The history of square-root and U-D covariance filters is reviewed. Simple examples are given to illustrate the numerical inadequacy of the Kalman covariance filter algorithms; these examples show how factorization techniques can give improved computational reliability.

Thornton, C. L.↗

Robust and real-time rotor control with magnetic bearings

This paper deals with the sliding mode control of a rigid rotor via radial magnetic bearings. The digital control algorithm and the results from numerical simulations are presented for an experimental rig. The experimental system which has been set up to digitally implement and validate the sliding mode control algorithm is described. Two methods for the development of control softwares are presented. Experimental results for individual rotor axis are discussed.

Sinha, A.↗

TPSAS-NF1676L-21193-DND

Researchers at NASA Langley Research Center have been developing an automated pattern recognition algorithm to identify overshooting convective cloud tops (OTs) in support of the GOES-R satellite program. This algorithm identify regions of overshooting at the individual 1-4 km geostationary satellite pixel scale using visible (during daytime only) and infrared channel imagery and numerical weather analysis data. The algorithm has been developed based upon analysis of 0.25-1 km spatial resolution Aqua MODIS imagery, using a database of over 2000 manually identified OT features throughout the world in storms with varying intensity and morphology. The OT database includes storms ranging from small, warm topped cells in Alaska and Mongolia, tornadic supercells over the U.S. Central Plains and Europe, large tropical mesoscale convective systems, and overshooting in the eyewalls and spiral bands of category 5 tropical cyclones. This database is available for use by the research community. The algorithm is designed to operate on data from any current and historical satellite imager, allowing for development of a highly accurate global OT detection climatology that extends back into the 1990's at up to a 15-30 min temporal resolution throughout the diurnal cycle. As members of the McIDAS Users Group, NASA LaRC has immediate access to the full global archive of geostationary imager data which would allows rapid development of OT climatologies and short-term databases. This type of capability has never been available within the weather and climate research community. Regional geostationary OT databases have been already developed over CONUS during SEAC4RS, for 18-years over the Eastern U.S., and for 5-10 years over Australia, Europe, Southeast Asia, and East Africa among many other regions. Some of these datasets are being used by climate researchers and private industry to examine UTLS-penetrating storm spatial distributions and their temporal variability, in addition to weather hazards associated with these storms at unprecedented spatial detail. This presentation will describe the OT pattern recognition algorithm and highlight recent product applications.

Kristopher Bedka↗