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,279 records · Page 71

Probe corrected far-field reconstruction from measurements on a cylinder: A novel formulation and efficient algorithm

A novel and numerically efficient method of far field evaluation from measurements taken on a cylinder is based on the representation of both the antenna and the probe fields as superpositions of plane waves. A system of two integral equations are established whose unknown functions are the azimuthal and elevation components of the antenna pattern and whose known terms are the set of measurement data taken with two different probes - the second probe in most practical instances being simply the same probe with a different geometrical orientation. The equations express the known data - for each angular position of the antenna under measurement - as the integrals of the products of the corresponding components of the unknown antenna and known probe patterns multiplied by a phase term. The convolutional nature of the integral equations makes their solutions straight-forward. If, as is virtually always the case, the probe is small or of moderate size so that the axis of rotation of the antenna mount is in the far field of the probe, the intervention of asymptotic techniques makes the solution numerically very efficient. The agreement of calculated and experimental patterns is excellent.

Borgiotti, G. V.↗

Numerical simulation of underexpanded plumes using upwind algorithms

The solution of the flow characteristics of highly underexpanded plumes is presently sought by means of a high-resolution total variation-diminishing upwind scheme featuring finite-volume metrics, Roe averaging with entropy correction, and monotonic upstream schemes for conservation laws. The existing approximate factorization schemes are used both as preconditioners and in order to apply the conjugate residual algorithm. The plumes treated are axisymmetric and laminar, and for an ideal gas that is allowed to be thermally incomplete. Simulations of the SSME and SRB plumes have been successfully conducted.

Obayashi, Shigeru↗

Towards a Verifiable Domain-Specific Language for Hardware-Accelerated Stencils

Defining a domain-specific language (DSL) that supports vector-calculus abstractions eases the porting of partial differential equation (PDE) solvers to specialized architectures. Sufficiently high-level abstractions empower users to express universal laws with sufficient generality that the laws must always hold true within their domain of validity. A broad class of PDE solvers employs stencil-based algorithms, the target domain of Berkeley Lab's stencil accelerator chip co-design project. First released as open-source in January 2026, the Formal software framework lays a foundation for defining an embedded DSL based on composable operators that implement mimetic numerical methods -- stencil algorithms that guarantee satisfaction of discrete versions of important vector calculus theorems. The Formal DSL will be the frontend to a new class of stencil-PDE accelerators developed jointly by LBNL, UHCL, and UC Berkeley through the DOE Competitive Portfolios for Computer Science Project. This offers the potential of an order of magnitude acceleration for this important category of computational methods to serve the DOE mission. Future work on the Formal DSL will facilitate software verification via type-safe templates that enable problem-specific correctness proofs relying upon generic function theory and carefully crafted unit tests.

Rouson, Damian↗

A crisis for the verification and validation of turbulence simulations

Three algorithms have been proposed for solution of the Rayleigh–Taylor turbulent mixing problem. They are based upon three different physical principles governing the Euler equations for fluid flow. The principles serve to select the physically relevant solution from among many nonunique solutions. The admissibility principle is in dispute. The three different algorithms, expressing the three physical admissibility principles can be formulated in terms of the three energy dissipation rates or the entropy production rates, as selected by the size of the sub grid scale coefficients. These have maximal values or less than maximal values. The resulting solutions are markedly different. We find strong validation evidence that supports the maximum rate principle, based on a review of prior results and on new results presented here. We review experimental data used for validation and sufficient to discriminate among the three. We present a new analysis of this data. We show that the hypothesized long wave length perturbations in the initial conditions are not significant, so that validation can be based on this data in a straight forward manner. One of the algorithms is labeled direct numerical simulation, but is not, and as a consequence, the two algorithms with less than maximal SGS coefficients are variants of one another. Finally recommendations for the numerical modeling of the deflagration to detonation transition in type Ia supernova are discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient numerical simulation of electron states in quantum wires

A new algorithm is presented for the numerical simulation of electrons in a quantum wire as described by a two-dimensional eigenvalue problem for Schroedinger's equation coupled with Poisson's equation. Initially, the algorithm employs an underrelaxed fixed point iteration to generate an approximation which is reasonably close to the solution. Subsequently, this approximate solution is employed as an initial guess for a Jacobian-free implementation of an approximate Newton method. In this manner the nonlinearity in the model is dealt with effectively. The effectiveness of this approach is demonstrated in a set of numerical experiments which study the electron states on the cross section of a quantum wire structure based on III-V semiconductors at 4.2 and 77 K.

Kerkhoven, Thomas↗

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗

Nonlinear dynamics of drift structures in a magnetized dissipative plasma

A study is made of the nonlinear dynamics of solitary vortex structures in an inhomogeneous magnetized dissipative plasma. A nonlinear transport equation for long-wavelength drift wave structures is derived with allowance for the nonuniformity of the plasma density and temperature equilibria, as well as the magnetic and collisional viscosity of the medium and its friction. The dynamic equation describes two types of nonlinearity: scalar (due to the temperature inhomogeneity) and vector (due to the convectively polarized motion of the particles of the medium). The equation is fourth order in the spatial derivatives, in contrast to the second-order Hasegawa-Mima equations. An analytic steady solution to the nonlinear equation is obtained that describes a new type of solitary dipole vortex. The nonlinear dynamic equation is integrated numerically. A new algorithm and a new finite difference scheme for solving the equation are proposed, and it is proved that the solution so obtained is unique. The equation is used to investigate how the initially steady dipole vortex constructed here behaves unsteadily under the action of the factors just mentioned. Numerical simulations revealed that the role of the vector nonlinearity is twofold: it helps the dispersion or the scalar nonlinearity (depending on their magnitude) to ensure the mutual equilibrium and, thereby, promote self-organization of the vortical structures. It is shown that dispersion breaks the initial dipole vortex into a set of tightly packed, smaller scale, less intense monopole vortices-alternating cyclones and anticyclones. When the dispersion of the evolving initial dipole vortex is weak, the scalar nonlinearity symmetrically breaks a cyclone-anticyclone pair into a cyclone and an anticyclone, which are independent of one another and have essentially the same intensity, shape, and size. The stronger the dispersion, the more anisotropic the process whereby the structures break: the anticyclone is more intense and localized, while the cyclone is less intense and has a larger size. In the course of further evolution, the cyclone persists for a relatively longer time, while the anticyclone breaks into small-scale vortices and dissipation hastens this process. It is found that the relaxation of the vortex by viscous dissipation differs in character from that by the frictional force. The time scale on which the vortex is damped depends strongly on its typical size: larger scale vortices are longer lived structures. It is shown that, as the instability develops, the initial vortex is amplified and the lifetime of the dipole pair components-cyclone and anticyclone-becomes longer. As time elapses, small-scale noise is generated in the system, and the spatial structure of the perturbation potential becomes irregular. The pattern of interaction of solitary vortex structures among themselves and with the medium shows that they can take part in strong drift turbulence and anomalous transport of heat and matter in an inhomogeneous magnetized plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast verified computation for the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation

A fast iterative algorithm is proposed for numerically computing an interval matrix containing the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation associated with M-matrix. This algorithm involves only cubic complexity per iteration, and moreover verifies the uniqueness of the contained solution. Numerical results show properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Asynchronous Truncated Multigrid-Reduction-in-Time

In this paper, we present the new “asynchronous truncated multigrid-reduction-in-time” (AT-MGRIT) algorithm for introducing time parallelism to the solution of discretized time-dependent problems. The new algorithm is based on the multigrid-reduction-in-time (MGRIT) approach, which, in certain settings, is equivalent to another common multilevel parallel-in-time method, Parareal. In contrast to Parareal and MGRIT that both consider a global temporal grid over the entire time interval on the coarsest level, the AT-MGRIT algorithm uses truncated local time grids on the coarsest level, each grid covering certain temporal subintervals. Further, these local grids can be solved completely in an independent way from each other, which reduces the sequential part of the algorithm and, thus, increases parallelism in the method. Here, we study the effect of using truncated local coarse grids on the convergence of the algorithm, both theoretically and numerically, and show, using challenging nonlinear problems, that the new algorithm consistently outperforms classical Parareal/MGRIT in terms of time to solution.

97 MATHEMATICS AND COMPUTING↗

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗

Standardized Radiation Shield Design Methods: 2005 HZETRN

Research committed by the Langley Research Center through 1995 resulting in the HZETRN code provides the current basis for shield design methods according to NASA STD-3000 (2005). With this new prominence, the database, basic numerical procedures, and algorithms are being re-examined with new methods of verification and validation being implemented to capture a well defined algorithm for engineering design processes to be used in this early development phase of the Bush initiative. This process provides the methodology to transform the 1995 HZETRN research code into the 2005 HZETRN engineering code to be available for these early design processes. In this paper, we will review the basic derivations including new corrections to the codes to insure improved numerical stability and provide benchmarks for code verification.

Wilson, John W.↗

Large-scale atomistic calculations of clusters in intense x-ray pulses

Here, we present the methodology of our recently developed Monte-Carlo/ Molecular-Dynamics method for studying the fundamental ultrafast dynamics induced by high-fluence, high-intensity x-ray free electron laser (XFEL) pulses in clusters. The quantum nature of the initiating ionization process is accounted for by a Monte Carlo method to calculate probabilities of electronic transitions, including photo absorption, inner-shell relaxation, photon scattering, electron collision and recombination dynamics, and thus track the transient electronic configurations explicitly. The freed electrons and ions are followed by classical particle trajectories using a molecular dynamics algorithm. These calculations reveal the surprising role of electron-ion recombination processes that lead to the development of nonuniform spatial charge density profiles in x-ray excited clusters over femtosecond timescales. In the high-intensity limit, it is important to include the recombination dynamics in the calculated scattering response even for a 2- fs pulse. We also demonstrate that our numerical codes and algorithms can make e!cient use of the computational power of massively parallel supercomputers to investigate the intense-field dynamics in systems with increasing complexity and size at the ultrafast timescale and in non-linear x-ray interaction regimes. In particular, picosecond trajectories of XFEL clusters with attosecond time resolution containing millions of particles can be e!ciently computed on upwards of 262,144 processes.

74 ATOMIC AND MOLECULAR PHYSICS↗

Exponential-fitted methods for integrating stiff systems of ordinary differential equations: Applications to homogeneous gas-phase chemical kinetics

Conventional algorithms for the numerical integration of ordinary differential equations (ODEs) are based on the use of polynomial functions as interpolants. However, the exact solutions of stiff ODEs behave like decaying exponential functions, which are poorly approximated by polynomials. An obvious choice of interpolant are the exponential functions themselves, or their low-order diagonal Pade (rational function) approximants. A number of explicit, A-stable, integration algorithms were derived from the use of a three-parameter exponential function as interpolant, and their relationship to low-order, polynomial-based and rational-function-based implicit and explicit methods were shown by examining their low-order diagonal Pade approximants. A robust implicit formula was derived by exponential fitting the trapezoidal rule. Application of these algorithms to integration of the ODEs governing homogenous, gas-phase chemical kinetics was demonstrated in a developmental code CREK1D, which compares favorably with the Gear-Hindmarsh code LSODE in spite of the use of a primitive stepsize control strategy.

Pratt, D. T.↗

Study of Crystal Growth and Solute Precipitation through Front Tracking Method

Crystal growth and solute precipitation is a Stefan problem. It is a free boundary problem for a parabolic partial differential equation with a time-dependent phase interface. The velocity of the moving interface between solute and crystal is a local function. The dendritic structure of the crystal interface, which develops dynamically, requires high resolution of the interface geometry. These facts make the Lagrangian front tracking method well suited for the problem. In this paper, we introduce an upgraded version of the front tracking code and its associated algorithms for the numerical study of crystal formation. We compare our results with the smoothed particle hydrodynamics method (SPH) in terms of the crystal fractal dimension with its dependence on the Damkohler number and density ratio.

97 MATHEMATICS AND COMPUTING↗

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗

Spatially hybrid computations for streamer discharges with generic features of pulled fronts: I. Planar fronts

Streamers are the first stage of sparks and lightning; they grow due to a strongly enhanced electric field at their tips; this field is created by a thin curved space charge layer. These multiple scales are already challenging when the electrons are approximated by densities. However, electron density fluctuations in the leading edge of the front and non-thermal stretched tails of the electron energy distribution (as a cause of X-ray emissions) require a particle model to follow the electron motion. But present computers cannot deal with all electrons in a fully developed streamer. Therefore, super-particle have to be introduced, which leads to wrong statistics and numerical artifacts. The method of choice is a hybrid computation in space where individual electrons are followed in the region of high electric field and low density while the bulk of the electrons is approximated by densities (or fluids). We here develop the hybrid coupling for planar fronts. First, to obtain a consistent flux at the interface between particle and fluid model in the hybrid computation, the widely used classical fluid model is replaced by an extended fluid model. Then the coupling algorithm and the numerical implementation of the spatially hybrid model are presented in detail, in particular, the position of the model interface and the construction of the buffer region. The method carries generic features of pulled fronts that can be applied to similar problems like large deviations in the leading edge of population fronts, etc.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State estimation of an acid gas removal (AGR) plant as part of an integrated gasification combined cycle (IGCC) plant with CO2 capture

An accurate estimation of process state variables not only can increase the effectiveness and reliability of process measurement technology, but can also enhance plant efficiency, improve control system performance, and increase plant availability. Future integrated gasification combined cycle (IGCC) power plants with CO2 capture will have to satisfy stricter operational and environmental constraints. To operate the IGCC plant without violating stringent environmental emission standards requires accurate estimation of the relevant process state variables, outputs, and disturbances. Unfortunately, a number of these process variables cannot be measured at all, while some of them can be measured, but with low precision, low reliability, or low signal-to-noise ratio. As a result, accurate estimation of the process variables is of great importance to avoid the inherent difficulties associated with the inaccuracy of the data. Motivated by this, the current paper focuses on the state estimation of an acid gas removal (AGR) process as part of an IGCC plant with CO2 capture. This process has extensive heat and mass integration and therefore is very suitable for testing the efficiency of the designed estimators in the presence of complex interactions between process variables. The traditional Kalman filter (KF) (Kalman, 1960) algorithm has been used as a state estimator which resembles that of a predictor-corrector algorithm for solving numerical problems. In traditional KF implementation, good guesses for the process noise covariance matrix (Q) and the measurement noise covariance matrix (R) are required to obtain satisfactory filter performance. However, in the real world, these matrices are unknown and it is difficult to generate good guesses for them. In this paper, use of an adaptive KF will be presented that adapts Q and R at every time step of the algorithm. Results show that very accurate estimations of the desired process states, outputs or disturbances can be achieved by using the adaptive KF.

97 MATHEMATICS AND COMPUTING↗