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,783 records · Page 99

Monotonically convergent optimization in quantum control using Krotov's method

The non-linear optimization method developed by A. Konnov and V. Krotov [Autom. Remote Cont. (Engl. Transl.) 60, 1427 (1999)] has been used previously to extend the capabilities of optimal control theory from the linear to the non-linear Schroedinger equation [S. E. Sklarz and D. J. Tannor, Phys. Rev. A 66, 053619 (2002)]. Here we show that based on the Konnov-Krotov method, monotonically convergent algorithms are obtained for a large class of quantum control problems. It includes, in addition to nonlinear equations of motion, control problems that are characterized by non-unitary time evolution, nonlinear dependencies of the Hamiltonian on the control, time-dependent targets, and optimization functionals that depend to higher than second order on the time-evolving states. We furthermore show that the nonlinear (second order) contribution can be estimated either analytically or numerically, yielding readily applicable optimization algorithms. We demonstrate monotonic convergence for an optimization functional that is an eighth-degree polynomial in the states. For the ''standard'' quantum control problem of a convex final-time functional, linear equations of motion and linear dependency of the Hamiltonian on the field, the second-order contribution is not required for monotonic convergence but can be used to speed up convergence. We demonstrate this by comparing the performance of first- and second-order algorithms for two examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical simulation of single and multiple jet interaction within a combustor

Single and multiple jet interaction in a combustor is simulated numerically to determine the effects of various k-epsilon models and boundary conditions as part of an attempt to understand the physics of the flow field inside the preburner of the Space Shuttle Main Engine. Due to the complexity of the physical and chemical phenomena involved, the model is simplified to two dimensions and a single-component nonreacting fluid. The computer code used is the modified TEACH code, which is a steady state isothermal fluid code using the SIMPLE algorithm. The physical validity and numerical accuracy of the model are established through comparisons with experimentally determined isothermal flow fields in a combustor.

Bai, S. Don↗

2D axisymmetric analysis of SRM ignition transient

To analyze ignition transient of Space Shuttle solid rocket motor, a transient two-dimensional numerical model based on turbulent compressible Navier-Stokes equations in a generalized coordinate system was developed. One-dimensional numerical models (Peretz et al., 1973; Han, 1992; Pardue and Han, 1992) with empirical correlations data obtained from steady turbulent boundary layer flows agrees reasonably well with test rocket data by adjusting a few parameters. However, a 1D model can not provide a physical insight into the complex multidimensional thermal fields and flowfields in the chamber and the converging-diverging rocket nozzle. As an interim step, a 2D model was developed and compared with test data. A modified version of SIMPLE algorithm was used for the numerical model, and the standard k-epsilon model with a wall function was used for turbulence closure. Transient flowfields and thermal fields in the combustion chamber and the attached nozzle were obtained for a selected rocket geometry and propellant. Transient behaviors of the flow and thermal fields were analyzed, and were found to be in good agreement with physical expectations.

Bai, S. D.↗

Central Difference Interval Method for Solving the Wave Equation

This paper presents path of construction the interval method of second order for solving the wave equation. Taken into consideration is the central difference interval method for one-dimensional partial differential equation. Numerical results, obtained by two presented algorithms, in floating-point interval arithmetic are considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulated Stochastic Approximation Annealing for Global Optimization with a Square-Root Cooling Schedule

Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to have such a long CPU time. This paper proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation Markov chain Monte Carlo, it is shown that the new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, e.g., a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors.

Liang, Faming↗

Estimation of many-body quantum Hamiltonians via compressive sensing

We develop an efficient and robust approach for quantum measurement of nearly sparse many-body quantum Hamiltonians based on the method of compressive sensing. This work demonstrates that with only O(sln(d)) experimental configurations, consisting of random local preparations and measurements, one can estimate the Hamiltonian of a d-dimensional system, provided that the Hamiltonian is nearly s sparse in a known basis. The classical postprocessing is a convex optimization problem on the total Hilbert space which is generally not scalable. We numerically simulate the performance of this algorithm for three- and four-body interactions in spin-coupled quantum dots and atoms in optical lattices. Furthermore, we apply the algorithm to characterize Hamiltonian fine structure and unknown system-bath interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New results on the PLL false lock phenomenon

Conditions, based on the multipliers of a linear differential equation with periodic coefficients, for the occurrence of false lock in a phase lock loop (PLL) are presented. Two new and powerful algorithms are presented for computing the frequency difference between the reference and voltage controlled oscillator when the loop is false locked. The first algorithm expresses omega f sup -1 as a power series in the closed loop gain. The second algorithm expresses omega sup -1 as part of a solution to a nonlinear algebraic system of equations which can be solved by numerical methods. The power of both algorithms is illustrated by application and comparison.

Stensby, J. L.↗

The Secret Life of Quarks: National Computational Infrastructure for Lattice Gauge Theory

The objective of this grant was to develop algorithms and software for the numerical study of quantum chromodynamics (QCD) and of quantum field theories of interest for the understanding of physical phenomena that go beyond the standard model of high energy physics. Thirteen institutions were involved in this effort. The roles of the University of California, Santa Barbara in the project were to supply overall leadership and coordination, and to administer travel funds for participants at institutions that did not receive direct funding from the DOE. The purposes of these trips were to enable collaborative research on algorithms and software, and to report on algorithm and software development, and on scientific results obtained from it, at scientific meetings. These funds were also used to support travel by the Santa Barbara Principal Investigator in support of the project, and by co-Principal Investigators at institutions not receiving DOE funding. A total of 126 trips were supported.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Finite spatial-grid effects in energy-conserving particle-in-cell algorithms

Finite-grid (or aliasing) instabilities are pervasive in particle-in-cell (PIC) plasma simulation algorithms, and force the modeler to resolve the smallest (Debye) length scale in the problem regardless of dynamical relevance. These instabilities originate in the aliasing of interpolation errors between mesh quantities and particles (which live in the space–time continuum). Recently, strictly energy-conserving PIC (EC-PIC) algorithms have been developed that promise enhanced robustness against aliasing instabilities. In this study, we confirm by analysis that EC-PIC is stable against aliasing instabilities for stationary plasmas. For drifting plasmas, we demonstrate by analysis and numerical experiments that, while EC-PIC algorithms are not free from these instabilities in principle, they feature a benign stability threshold for finite-temperature plasmas that make them usable in practice for a large class of problems (featuring ambipolarity and realistic ion-electron mass ratios) without the need to consider the size of the Debye length. We also demonstrate that this threshold is absent for the popular momentum-conserving PIC algorithms, which are therefore unstable for both drifting and stationary plasmas beyond a threshold in cell size compared to Debye length. Finite-grid (or aliasing) instabilities are pervasive in particle-in-cell (PIC) plasma simulation algorithms, and force the modeler to resolve the smallest (Debye) length scale in the problem regardless of dynamical relevance. These instabilities originate in the aliasing of interpolation errors between mesh quantities and particles (which live in the space–time continuum). Recently, strictly energy-conserving PIC (EC-PIC) algorithms have been developed that promise enhanced robustness against aliasing instabilities. In this study, we confirm by analysis that EC-PIC is stable against aliasing instabilities for stationary plasmas. For drifting plasmas, we demonstrate by analysis and numerical experiments that, while EC-PIC algorithms are not free from these instabilities in principle, they feature a benign stability threshold for finite-temperature plasmas that make them usable in practice for a large class of problems (featuring ambipolarity and realistic ion-electron mass ratios) without the need to consider the size of the Debye length. Finally, we also demonstrate that this threshold is absent for the popular momentum-conserving PIC algorithms, which are therefore unstable for both drifting and stationary plasmas beyond a threshold in cell size compared to Debye length.

97 MATHEMATICS AND COMPUTING↗

Resonant tunneling assisted propagation and amplification of plasmons in high electron mobility transistors

A rigorous theoretical and computational model is developed for the plasma-wave propagation in high electron mobility transistor structures with electron injection from a resonant tunneling diode at the gate. We discuss the conditions in which low-loss and sustainable plasmon modes can be supported in such structures. The developed analytical model is used to derive the dispersion relation for these plasmon-modes. A non-linear full-wave-hydrodynamic numerical solver is also developed using a finite difference time domain algorithm. The developed analytical solutions are validated via the numerical solution. We also verify previous observations that were based on a simplified transmission line model. It is shown that at high levels of negative differential conductance, plasmon amplification is indeed possible. The proposed rigorous models can enable accurate design and optimization of practical resonant tunnel diode-based plasma-wave devices for terahertz sources, mixers, and detectors, by allowing a precise representation of their coupling when integrated with other electromagnetic structures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bridging Scales to Model Reactive Diffusive Transport in Porous Media

Published by ECS. Two novel scale-bridging algorithms to model reaction-diffusion transport in porous media are presented. The algorithms are based on direct numerical simulations and couple the information of a micro-scale model, which accounts for the large field of view provided by micro X-ray computed tomography (X-ray CT), and a nano-scale model, which locally resolves transport in the fine structure extracted from nano X-ray CT. The micro-scale model is discretized in the through-plane direction into a 1D grid, where effective properties and internal boundaries are determined based on the results from the nano-scale model. The validated algorithms are used to examine transport of oxygen in precious group metal-free electrodes considering both zero- and first-order kinetics. Unlike conventional methods, the results show that the effective diffusivity is not a passive property but increases in regions where the reaction-rate coefficient is large. The proposed algorithms account for the multiscale coupling of reaction-diffusion transport and material microstructure, thus improving the predictions compared to conventional methods.

42 ENGINEERING↗

Stability and convergence analysis of the quasi-dynamics method for the initial pebble packing

The simulation for the pebble flow recirculation within Pebble Bed Reactors (PBRs) requires an efficient algorithm to generate an initial overlap-free pebble configuration within the reactor core. In the previous work, a dynamics-based approach, the Quasi-Dynamics Method (QDM), has been proposed to generate densely distributed pebbles in PBRs with cylindrical and annular core geometries. However, the stability and the efficiency of the QDM were not fully addressed. In this work, the algorithm is reformulated with two control parameters and the impact of these parameters on the algorithm performance is investigated. Firstly, the theoretical analysis for a 1-D packing system is conducted and the range of the parameter in which the algorithm is convergent is estimated. Then, this estimation is verified numerically for a 3-D packing system. Finally, the algorithm is applied to modeling the PBR fuel loading configuration and the convergence performance at different packing fractions is presented. Results show that the QDM is efficient in packing pebbles within the realistic range of the packing fraction in PBRs, and it is capable in handling cylindrical geometry with packing fractions up to 63.5%. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A space-time discretization procedure for wave propagation problems

Higher order compact algorithms are developed for the numerical simulation of wave propagation by using the concept of a discrete dispersion relation. The dispersion relation is the imprint of any linear operator in space-time. The discrete dispersion relation is derived from the continuous dispersion relation by examining the process by which locally plane waves propagate through a chosen grid. The exponential structure of the discrete dispersion relation suggests an efficient splitting of convective and diffusive terms for dissipative waves. Fourth- and eighth-order convection schemes are examined that involve only three or five spatial grid points. These algorithms are subject to the same restrictions that govern the use of dispersion relations in the constructions of asymptotic expansions to nonlinear evolution equations. A new eighth-order scheme is developed that is exact for Courant numbers of 1, 2, 3, and 4. Examples are given of a pulse and step wave with a small amount of physical diffusion.

Davis, Sanford↗

An integrated approach to the synthesis of geometrically non-linear structures

An integrated approach to the minimum weight design of geometrically nonlinear three-dimensional truss structures with geometric imperfections, subject to inequality constraints on static displacements, stresses, local buckling and cross sectional areas, is investigated. The integrated structural synthesis problem involves design and response quantities as independent variables and equilibrium equations, describing the finite element model, as equality constraints. The nonlinear structural analysis and the optimization are thus merged together into a single process. A computer program developed to compute the constraint values and analytical gradients is coupled with a generalized reduced gradient algorithm to solve the integrated problem. Numerical results for a geometrically nonlinear shallow dome example problem are presented for various types of imperfections. Furthermore, it is found that the algorithm is capable of detecting and guarding against system as well as element elastic instability using equilibrium information only, that is, without imposing system and local buckling inequality constraints.

Smaoui, H.↗

Convergence of the multigrid reduction in time algorithm for the linear elasticity equations

This paper presents some recent advances for parallel-in-time methods applied to linear elasticity. With recent computer architecture changes leading to stagnant clock speeds, but ever increasing numbers of cores, future speedups will be available through increased concurrency. Thus, sequential algorithms, such as time stepping, will suffer a bottleneck. This paper explores multigrid reduction in time (MGRIT) for an important application area, linear elasticity. Previously, efforts at parallel-in-time for elasticity have experienced difficulties, for example, the beating phenomenon. As a result, practical parallel-in-time algorithms for this application area currently do not exist. This paper proposes some solutions made possible by MGRIT (e.g., slow temporal coarsening and FCF-relaxation) and, more importantly, a different formulation of the problem that is more amenable to parallel-in-time methods. Using a recently developed convergence theory for MGRIT and Parareal, we show that the changed formulation of the problem avoids the instability issues and allows the reduction of the error using two temporal grids. We then extend our approach to the multilevel case, where we demonstrate how slow temporal coarsening improves convergence. Finally, the paper ends with supporting numerical results showing a practical algorithm enjoying speedup benefits over the sequential algorithm.

97 MATHEMATICS AND COMPUTING↗

A proposed study of multiple scattering through clouds up to 1 THz

A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

Gerace, G. C.↗

Model reduction of nonsquare linear MIMO systems using multipoint matrix continued-fraction expansions

This paper deals with the multipoint Cauer matrix continued-fraction expansion (MCFE) for model reduction of linear multi-input multi-output (MIMO) systems with various numbers of inputs and outputs. A salient feature of the proposed MCFE approach to model reduction of MIMO systems with square transfer matrices is its equivalence to the matrix Pade approximation approach. The Cauer second form of the ordinary MCFE for a square transfer function matrix is generalized in this paper to a multipoint and nonsquare-matrix version. An interesting connection of the multipoint Cauer MCFE method to the multipoint matrix Pade approximation method is established. Also, algorithms for obtaining the reduced-degree matrix-fraction descriptions and reduced-dimensional state-space models from a transfer function matrix via the multipoint Cauer MCFE algorithm are presented. Practical advantages of using the multipoint Cauer MCFE are discussed and a numerical example is provided to illustrate the algorithms.

Guo, Tong-Yi↗

Steady inviscid three-dimensional flows

The present analysis combines some of the theoretical concepts suggested by Hawthorne (1955) with a numerical integration procedure suggested by Martin (1978). The resulting algorithm is for inviscid subsonic flows. Thus, it is restricted to high Reynolds number flows. Chang and Adamczyk (1983) have provided a detailed derivation of the present algorithm along with a discussion of its stability bounds. The present paper represents a summary of this work. The integration of the continuity equation is considered along with an evaluation of the entropy, total temperature, and vorticity field. Attention is given to the shear-flow algorithm construction, and an application to a shear flow in a turning channel. A description of numerical results is also provided. The discussed algorithm represents a new procedure for solving inviscid subsonic three-dimensional rotational flows.

Adamczyk, J. J.↗