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,567 records · Page 87

Analysis of long term heart rate variability: methods, 1/f scaling and implications

The use of spectral techniques to quantify short term heart rate fluctuations on the order of seconds to minutes has helped define the autonomic contributions to beat-to-beat control of heart rate. We used similar techniques to quantify the entire spectrum (0.00003-1.0 Hz) of heart rate variability during 24 hour ambulatory ECG monitoring. The ECG from standard Holter monitor recordings from normal subjects was sampled with the use of a phase locked loop, and a heart rate time series was constructed at 3 Hz. Frequency analysis of the heart rate signal was performed after a nonlinear filtering algorithm was used to eliminate artifacts. A power spectrum of the entire 24 hour record revealed power that was inversely proportional to frequency, 1/f, over 4 decades from 0.00003 to 0.1 Hz (period approximately 10 hours to 10 seconds). Displaying consecutive spectra calculated at 5 minute intervals revealed marked variability in the peaks at all frequencies throughout the 24 hours, probably accounting for the lack of distinct peaks in the spectra of the entire records.

Non-NASA Center↗

Comparison of two numerical techniques for aerodynamic model identification

An algorithm, called the Minimal Residual QR algorithm, is presented to solve subset regression problems. It is shown that this scheme can be used as a numerically reliable implementation of the stepwise regression technique, which is widely used to identify an aerodynamic model from flight test data. This capability as well as the numerical superiority of this scheme over the stepwise regression technique is demonstrated in an experimental simulation study.

Verhaegen, M. H.↗

System Modeling and Simulation of In-Stream Hydrokinetic Turbines for Power Management and Control

Electricity generation from moving currents without using dams (i.e., in-stream hydrokinetic electricity) has the potential to introduce multiple GW of renewable power to U.S. grids. Here this study evaluates a control system designed to regulate the generator rotor rate (rpm) to improve power production from in-stream hydrokinetic turbines. The control algorithm is evaluated using numerical models of both a rigidly mounted tidal turbine (TT) and a moored ocean current turbine (OCT) coupled to an induction electric machine model. The moored simulation utilizes an innovative approach for coupling a multiple degrees-of-freedom (DOF) nonlinear hydrodynamic/mechanical turbine model with a nonlinear electromechanical generator model. Based on the turbine torque-speed characteristic, as well as the asynchronous machine features, a proportional–integral (PI) controller is used to generate a correction term for the frequency of the three-phase sinusoidal voltages that are supplied to the asynchronous generator. The speed control of the induction generator through the supply frequency is accomplished by a simplified voltage source inverter (VSI). The simplified VSI consists of control voltage sources (CVSs), while the comparison with a real VSI using diodes and transistors, which are controlled by pulse width modulation (PWM) technique, is also presented. Simulations are used to evaluate the developed algorithms showing that rpm fluctuations are around 0.02 for a tidal turbine operating in a wave field with a 6 m significant wave height and around 0.005 for a moored ocean current turbine operating in a wave field with a 2 m significant wave height.

16 TIDAL AND WAVE POWER↗

A simple fourth order propagator based on the Magnus expansion in the Liouville space: Application to a Λ-system and assessment of the rotating wave approximation

A simple fourth-order propagator [Ture and Jang, J. Phys. Chem. A 128, 2871 (2024)] based on the Magnus expansion is extended to the Liouville space for both closed-system and Lindbladian open-system quantum dynamics. For both dynamics, commutator free versions of fourth-order propagators are provided as well. These propagators are then applied to the dynamics of a driven Λ-system, where Lindblad terms represent the effect of a photonic bath. For both dynamics, the accuracy of the rotating wave approximation (RWA) for the matter–radiation interaction is assessed. We confirmed reasonable performance of RWA for weak and resonant fields. However, small errors appear for moderate fields and substantial errors can be found for strong fields where coherent population trapping can still be expected. We also found that the presence of bath for open-system quantum dynamics consistently reduces the errors of the RWA. These results provide quantitative information on how the RWA breaks down beyond weak field or for non-resonant cases. Major results are benchmarked against results of our sixth-order ME-based propagator. Finally, we also provide numerical comparison of our algorithms with other fourth-order algorithms for the Λ-system. These confirm reasonable performance of our simple propagators and the improvement gained through commutator-free expressions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Parallel Multi-Domain Solution Methodology Applied to Nonlinear Thermal Transport Problems in Nuclear Fuel Pins

This paper describes an efficient and nonlinearly consistent parallel solution methodology for solving coupled nonlinear thermal transport problems that occur in nuclear reactor applications over hundreds of individual 3D physical subdomains. Efficiency is obtained by leveraging knowledge of the physical domains, the physics on individual domains, and the couplings between them for preconditioning within a Jacobian Free Newton Krylov method. Details of the computational infrastructure that enabled this work, namely the open source Advanced Multi-Physics (AMP) package developed by the authors is described. Details of verification and validation experiments, and parallel performance analysis in weak and strong scaling studies demonstrating the achieved efficiency of the algorithm are presented. Furthermore, numerical experiments demonstrate that the preconditioner developed is independent of the number of fuel subdomains in a fuel rod, which is particularly important when simulating different types of fuel rods. Finally, we demonstrate the power of the coupling methodology by considering problems with couplings between surface and volume physics and coupling of nonlinear thermal transport in fuel rods to an external radiation transport code.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Multigrid with Overlapping Patches

Solving boundary value problems with optimal efficiency requires adaptivity and multilevel techniques. Previously, an implementation of the AFACx algorithm is presented that is based on rectangular Cartesian grids. This implementation does not allow for the over]ap of grids that lie on the same level of refinement. We investigate the case in which these grids overlap. A standard technique for overlapping grids is the Schwarz algorithm. Some ways of using the Schwarz algorithm in a standard multigrid scheme are presented. Also, a problem that arises in some situations with non-aligned, overlapping grids is described. This situation comes up in a natural way when the Schwarz algorithm is used as a relaxation scheme within a multilevel algorithm. We identify the reason for the bad convergence and show that by more sophisticated interpolation the difficulties can be overcome. Then we present a multiplicative Schwarz algorithm for a large number of grids that has a high potential for parallelization. Finally we give some numerical results for the FACx algorithm with overlapping grids on each refinement level. The implementation of the described codes uses C++ and the array class libraries A++ and P++. Using the A++/P++ programming environment, it was possible to move from a serial code to a parallel code within a few days.

Berndt, Markus↗

Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations

In this paper we consider a new generalized algorithm for the efficient calculation of component object volumes given their equivalent constructive solid geometry (CSG) definition. The new method relies on domain decomposition to recursively subdivide the original component into smaller pieces with volumes that can be computed analytically or stochastically, if needed. Unlike simpler brute-force approaches, the proposed decomposition scheme is guaranteed to be robust and accurate to within a user-defined tolerance. The new algorithm is also fully general and can handle any valid CSG component definition, without the need for additional input from the user. The new technique has been specifically optimized to calculate volumes of component definitions commonly found in models used for Monte Carlo particle transport simulations for criticality safety and reactor analysis applications. However, the algorithm can be easily extended to any application which uses CSG representations for component objects. The paper provides a complete description of the novel volume calculation algorithm, along with a discussion of the conjectured error bounds on volumes calculated within the method. In addition, numerical results comparing the new algorithm with a standard stochastic volume calculation algorithm are presented for a series of problems spanning a range of representative component sizes and complexities. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Transonic lifting line theory - Numerical procedure for shock-free flows

An algorithm for computing transonic lifting-line theory without shocks is presented; the numerical procedure relies on two-dimensional analyses developed to solve inviscid flow equations for slender airfoils. From a series of solutions to two-dimensional problems in which span effects appear parametrically, the three-dimensional potential field characterization is obtained. Numerical results are given for a lifting wing with an elliptic (spanwise) distribution of chord and a NACA-0012 cross section (a freestream Mach number of 0.63 and an angle of attack of 2 deg are assumed).

Small, R. D.↗

Correcting transport errors during advection of aerosol and cloud moment sequences in eulerian models

Moment methods are finding increasing usage for simulations of particle population balance in box models and in more complex flows including two-phase flows. These highly efficient methods have nevertheless had little impact to date for multi-moment representation of aerosols and clouds in atmospheric models. There are evidently two reasons for this: First, atmospheric models, especially if the goal is to simulate climate, tend to be extremely complex and take many man-years to develop. Thus there is considerable inertia to the implementation of novel approaches. Second, and more fundamental, the nonlinear transport algorithms designed to reduce numerical diffusion during advection of various species (tracers) from cell to cell, in the typically coarse grid arrays of these models, can and occasionally do fail to preserve correlations between the moments. Other correlated tracers such as isotopic abundances, composition of aerosol mixtures, hydrometeor phase, etc., are subject to this same fate. In the case of moments, this loss of correlation can and occasionally does give rise to unphysical moment sets. When this happens the simulation can come to a halt. Following a brief description and review of moment methods, the goal of this paper is to present two new approaches that both test moment sequences for validity and correct them when they fail. The new approaches work on individual grid cells without requiring stored information from previous time-steps or neighboring cells.

54 ENVIRONMENTAL SCIENCES↗

Asynchronously parallel optimization solver for finding multiple minima

This paper proposes and analyzes an asynchronously parallel optimization algorithm for finding multiple, high-quality minima of nonlinear optimization problems. Our multistart algorithm considers all previously evaluated points when determining where to start or continue a local optimization run. Theoretical results show that, under certain assumptions, the algorithm almost surely starts a finite number of local optimization runs and identifies, or has a single local optimization run converging to, every minimum. The algorithm is applicable to general optimization settings, but our numerical results focus on the case when derivatives are unavailable. In numerical tests, a PYTHON implementation of the algorithm is shown to yield good approximations of many minima (including a global minimum), and this ability scales well with additional resources. Our implementation’s time to solution is shown also to scale well even when the time to evaluate the function evaluation is highly variable.

97 MATHEMATICS AND COMPUTING↗

An active-set algorithm and a trust-region approach in constrained minimax problem

In this paper, we propose an algorithm to solve a finite minimax problem with side constraints. An active-set strategy is used in the algorithm to transform inequality constraints to equality constraints. This allows the use of the well-developed techniques for solving the equality constrained optimization problems. A trust-region globalization strategy is added to the proposed algorithm to ensure global convergence. A projected Hessian technique is used in the algorithm to overcome the difficulty of having an infeasible trust-region subproblem.A global convergence theory for the proposed algorithm is presented under standard assumptions. Finally, numerical experiments are reported to indicate that the new algorithm performs efficiently in practice.

97 MATHEMATICS AND COMPUTING↗

In-flight determination of spacecraft magnetic bias independent of attitude

A simple algorithm for the in-flight determination of the magnetic bias of a spacecraft is presented. The algorithm, developed for use during the Hubble Space Telescope mission, determines this bias independently of any attitude estimates and requires no spacecraft sensor data other than that from the spacecraft magnetometer(s). Estimates of the algorithm's accuracy and results from a number of numerical studies on the use of this algorithm are also presented.

Davenport, P. B.↗

Pricing and Energy Trading in Peer-to-Peer Zero Marginal-Cost Microgrids

Efforts to utilize 100% renewable energy in community microgrids require new approaches to energy markets and transactions to efficiently address periods of scarce energy supply. In this paper we contribute to the promising approach of peer-to-peer (P2P) energy trading in two main ways: analysis of a centralized, welfare-maximizing economic dispatch that characterizes optimal price and allocations, and a novel P2P system for negotiating energy trades that yields physically feasible and at least weakly Pareto-optimal outcomes. Our main results are 1) that optimal pricing is insufficient to induce agents with batteries to take optimal actions, 2) a novel P2P algorithm to addresses this while keeping private information, 3) a formal proof that this algorithm converges to the centralized solution in the case of two agents negotiating for a single period, and 4) numerical simulations of the P2P algorithm performance with up to 10 agents and 24 periods that show it converges on average to total welfare within 0.1% of the social optimum in on the order of 10s to 100s of iterations, increasing with the number of agents, time periods, and total storage capacity.

batteries↗

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗

Numerical simulation of steady and unsteady viscous flow in turbomachinery using pressure based algorithm

The objective of this research is to simulate steady and unsteady viscous flows, including rotor/stator interaction and tip clearance effects in turbomachinery. The numerical formulation for steady flow developed here includes an efficient grid generation scheme, particularly suited to computational grids for the analysis of turbulent turbomachinery flows and tip clearance flows, and a semi-implicit, pressure-based computational fluid dynamics scheme that directly includes artificial dissipation, and is applicable to both viscous and inviscid flows. The values of these artificial dissipation is optimized to achieve accuracy and convergency in the solution. The numerical model is used to investigate the structure of tip clearance flows in a turbine nozzle. The structure of leakage flow is captured accurately, including blade-to-blade variation of all three velocity components, pitch and yaw angles, losses and blade static pressures in the tip clearance region. The simulation also includes evaluation of such quantities of leakage mass flow, vortex strength, losses, dominant leakage flow regions and the spanwise extent affected by the leakage flow. It is demonstrated, through optimization of grid size and artificial dissipation, that the tip clearance flow field can be captured accurately. The above numerical formulation was modified to incorporate time accurate solutions. An inner loop iteration scheme is used at each time step to account for the non-linear effects. The computation of unsteady flow through a flat plate cascade subjected to a transverse gust reveals that the choice of grid spacing and the amount of artificial dissipation is critical for accurate prediction of unsteady phenomena. The rotor-stator interaction problem is simulated by starting the computation upstream of the stator, and the upstream rotor wake is specified from the experimental data. The results show that the stator potential effects have appreciable influence on the upstream rotor wake. The predicted unsteady wake profiles are compared with the available experimental data and the agreement is good. The numerical results are interpreted to draw conclusions on the unsteady wake transport mechanism in the blade passage.

Lakshminarayana, B.↗

High-Order Shock-Fitting and Front-Tracking Methods for Numerical Simulation of Shock-Disturbance Interactions

High-order methods that can resolve interactions of flow-disturbances with shock waves are critical for reliable numerical simulation of strong-shock and turbulence interaction problems. Such problems are not well understood due to limitations of numerical methods. Most of the popular shock-capturing methods are inherently dissipative and may incur numerical oscillations near the shock. Present paper is continuation of our previous work [1] on development and implementation of new algorithms based on shock-fitting and fronttracking methodology which can solve the flow with high-order accuracy near as well as away from the shocks. The shock-fitting algorithm avoids dissipation and possible numerical oscillations incurred in shock-capturing methods by treating shocks sharply. We explore two ways for shock-fitting: conventional moving grid set-up and a new fixed grid set-up with front tracking. In conventional shock-fitting method, a moving grid is fitted to the shock while in the newly developed fixed grid set-up shock is tracked using Lagrangian points and is free to move across underlying fixed grid. High order front-tracking method gives satisfactory results for 2-D shock disturbance interaction problem. We also studied various methods to find shock velocity. It was found that conventional method of advancing the shock using characteristics based shock-acceleration relation gives more accurate results than other methods considered. Shock-turbulence interaction problems may produce nonlinearities like secondary shocks in the post-shock flow. Hence, we have combined our shock-fitting methodology with shock-capturing methods. Convergence analysis was carried out for combined shock-fitting and WENO methods for an unsteady shock disturbance problem and expected fifth order accuracy was achieved. It was found that, where applicable, shock-fitting algorithm provides superior results to those obtained from purely shock-capturing schemes.

Rawat, Pradeep↗

Ensemble-type numerical uncertainty information from single model integrations

We suggest an algorithm that quantifies the discretization error of time-dependent physical quantities of interest (goals) for numerical models of geophysical fluid dynamics. The goal discretization error is estimated using a sum of weighted local discretization errors. The key feature of our algorithm is that these local discretization errors are interpreted as realizations of a random process. The random process is determined by the model and the flow state. From a class of local error random processes we select a suitable specific random process by integrating the model over a short time interval at different resolutions. The weights of the influences of the local discretization errors on the goal are modeled as goal sensitivities, which are calculated via automatic differentiation. The integration of the weighted realizations of local error random processes yields a posterior ensemble of goal approximations from a single run of the numerical model. From the posterior ensemble we derive the uncertainty information of the goal discretization error. This algorithm bypasses the requirement of detailed knowledge about the models discretization to generate numerical error estimates. The algorithm is evaluated for the spherical shallow-water equations. For two standard test cases we successfully estimate the error of regional potential energy, track its evolution, and compare it to standard ensemble techniques. The posterior ensemble shares linear-error-growth properties with ensembles of multiple model integrations when comparably perturbed. The posterior ensemble numerical error estimates are of comparable size as those of a stochastic physics ensemble.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗