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,693 records · Page 94

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 2

It is shown how the look-ahead Lanczos process (combined with a quasi-minimal residual QMR) approach) can be used to develop a robust black box solver for large sparse non-Hermitian linear systems. Details of an implementation of the resulting QMR algorithm are presented. It is demonstrated that the QMR method is closely related to the biconjugate gradient (BCG) algorithm; however, unlike BCG, the QMR algorithm has smooth convergence curves and good numerical properties. We report numerical experiments with our implementation of the look-ahead Lanczos algorithm, both for eigenvalue problem and linear systems. Also, program listings of FORTRAN implementations of the look-ahead algorithm and the QMR method are included.

Freund, Roland W.↗

An implicit method for the nonlinear modelling and simulation of piezoceramic actuators displaying hysteresis

Experiments have shown that piezoceramic materials display a nonlinear relationship between the applied electric field and the actuation strain. This relationship also displays a substantial hysteresis upon reversal of the applied field. In this paper, piezoceramic actuator models are incorporated into the structural equations of motion to arrive at a set of nonlinear actively controlled structural equations of motion. A new implicit algorithm for determining the time history of the actively controlled structure is presented. The algorithm employs the trapezoidal rule for stepping the equations forward in time. The algorithm is compared to an explicit algorithm and is shown to provide greater numerical accuracy. In addition, the numerical stability and convergence characteristics are presented via example. The new algorithm displays convergence and stability properties that are comparable to the standard trapezoidal rule used for dynamic systems without hysteresis.

Leigh, Timothy D.↗

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Barnard, Stephen T.↗

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗

Robust control systems design by H-infinity optimization theory

In this paper, step-by-step procedures of applying the H-infinity theory to robust control systems design are given. The objective of the paper is to eliminate the possible difficulties a control engineer may encounter in applying H-infinity control theory and to clear up some misconceptions about H-infinity theory like high-gain controller and numerical obstacles, etc. An efficient algorithm is used to compute the optimal H-infinity norm. The Glover and Doyle (1988) controller formulas are slightly modified and used to construct an optimal controller without any numerical difficulties.

Chang, B. C.↗

A Newton algorithm for complex curve fitting

The problem of synthesizing transfer functions from frequency response measurements is considered. Given a complex vector representing the measured frequency response of a physical system, a transfer function of specified order is determined that minimizes the sum of the magnitude-squared of the frequency response errors. This nonlinear least squares minimization problem is solved by an iterative global descent algorithm of the Newton type which converges quadratically near the minimum. The unknown transfer function is expressed as a sum of second order rational polynomials, a parameterization that facilitates a numerically robust computer implementation. The algorithm is developed for single-input, single-output, causal, stable transfer functions.

Spanos, J. T.↗

A Spectral Algorithm for Solving the Relativistic Vlasov-Maxwell Equations

A spectral method algorithm is developed for the numerical solution of the full six-dimensional Vlasov-Maxwell system of equations. Here, the focus is on the electron distribution function, with positive ions providing a constant background. The algorithm consists of a Jacobi polynomial-spherical harmonic formulation in velocity space and a trigonometric formulation in position space. A transform procedure is used to evaluate nonlinear terms. The algorithm is suitable for performing moderate resolution simulations on currently available supercomputers for both scientific and engineering applications.

Shebalin, John V.↗

Comparative analysis of algorithms for compensation of nonlinear distortions in fibre-optic links

We report the results of numerical modelling and comparative analysis of two algorithms for digital signal processing intended for signal demodulation in fibre-optic links (FOLs) operating in a nonlinear mode. The first algorithm is based on the use of nonlinear Schrödinger filters and the second one utilises the ‘reception in general with bit-by-bit decision making’ technique. It is found that the latter algorithm is more noiseproof, compared to the first one (with a SNR gain of about 0.5 dB), in single-channel fibre-optic links, and its operation does not require knowledge of the link parameters; therefore, the second algorithm can also be constructed for wavelength-division multiplexing systems. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A numerical model including PID control of a multizone crystal growth furnace

This paper presents a 2D axisymmetric combined conduction and radiation model of a multizone crystal growth furnace. The model is based on a programmable multizone furnace (PMZF) designed and built at NASA Lewis Research Center for growing high quality semiconductor crystals. A novel feature of this model is a control algorithm which automatically adjusts the power in any number of independently controlled heaters to establish the desired crystal temperatures in the furnace model. The control algorithm eliminates the need for numerous trial and error runs previously required to obtain the same results. The finite element code, FIDAP, used to develop the furnace model, was modified to directly incorporate the control algorithm. This algorithm, which presently uses PID control, and the associated heat transfer model are briefly discussed. Together, they have been used to predict the heater power distributions for a variety of furnace configurations and desired temperature profiles. Examples are included to demonstrate the effectiveness of the PID controlled model in establishing isothermal, Bridgman, and other complicated temperature profies in the sample. Finally, an example is given to show how the algorithm can be used to change the desired profile with time according to a prescribed temperature-time evolution.

Panzarella, Charles H.↗

Liquid and liquid–gas flows at all speeds

All speed flows and in particular low Mach number flow algorithms are addressed for the numerical approximation of the Kapila et al. [1] multiphase flow model. This model is valid for fluid mixtures evolving in mechanical equilibrium but out of temperature equilibrium and is efficient for material interfaces computation separating miscible and non-miscible fluids. In this context, the interface is considered as a numerically diffused zone, captured as well as all present waves (shocks, expansion waves). The same flow model can be used to solve cavitating and boiling flows [2]. Many applications occurring with liquid–gas interfaces and cavitating flows involve a very wide range of Mach number, from 10{sup −3} to supersonic (and even hypersonic) conditions with respect to the mixture sound speed. It is thus important to address numerical methods free of restrictions regarding the Mach number. To do this, a preconditioned Riemann solver is built and embedded into the Godunov explicit scheme. It is shown that this method converges to exact solutions but needs too small time steps to be efficient. An implicit version is then derived, first in one dimension and second in the frame of 2D unstructured meshes. Two-phase flow preconditioning is then addressed in the frame of the Saurel et al. [3] algorithm. Modifications of the preconditioned Riemann solver are needed and detailed. Convergence of both single phase and two-phase numerical solutions are demonstrated with the help of single phase and two-phase steady nozzle flow solutions. Last, the method is illustrated by the computation of real cavitating flows in Venturi nozzles. Vapour pocket size and instability frequencies are reproduced by the model and method without using any adjustable parameter.

42 ENGINEERING↗

Advances in Numerical Boundary Conditions for Computational Aeroacoustics

Advances in Computational Aeroacoustics (CAA) depend critically on the availability of accurate, nondispersive, least dissipative computation algorithm as well as high quality numerical boundary treatments. This paper focuses on the recent developments of numerical boundary conditions. In a typical CAA problem, one often encounters two types of boundaries. Because a finite computation domain is used, there are external boundaries. On the external boundaries, boundary conditions simulating the solution outside the computation domain are to be imposed. Inside the computation domain, there may be internal boundaries. On these internal boundaries, boundary conditions simulating the presence of an object or surface with specific acoustic characteristics are to be applied. Numerical boundary conditions, both external or internal, developed for simple model problems are reviewed and examined. Numerical boundary conditions for real aeroacoustic problems are also discussed through specific examples. The paper concludes with a description of some much needed research in numerical boundary conditions for CAA.

Tam, Christopher K. W.↗

Relative performance of algorithms for autonomous satellite orbit determination

Limited word size in contemporary microprocessors causes numerical problems in autonomous satellite navigation applications. Numerical error introduced in navigation computations performed on small wordlength machines can cause divergence of sequential estimation algorithms. To insure filter reliability, square root algorithms have been adopted in many applications. The optimal navigation algorithm requires a careful match of the estimation algorithm, dynamic model, and numerical integrator. In this investigation, the relationship of several square root filters and numerical integration methods is evaluated to determine their relative performance for satellite navigation applications. The numerical simulations are conducted using the Phase I GPS constellation to determine the orbit of a LANDSAT-D type satellite. The primary comparison is based on computation time and relative estimation accuracy.

Tapley, B. D.↗

Target tracking using DMLC for volumetric modulated arc therapy: A simulation study

Purpose: Target tracking using dynamic multileaf collimator (DMLC) is a promising approach for intrafraction motion management in radiation therapy. The purpose of this work is to develop a DMLC tracking algorithm capable of delivering volumetric-modulated arc therapy (VMAT) to the targets that experience two-dimensional (2D) rigid motion in the beam's eye view. Methods: The problem of VMAT delivery to moving targets is formulated as a control problem with constraints. The relationships between gantry speed, gantry acceleration, MLC leaf-velocity, dose rate, and target motion are derived. An iterative search algorithm is developed to find numerical solutions for efficient delivery of a specific VMAT plan to the moving target using 2D DMLC tracking. The delivery of five VMAT lung plans is simulated. The planned and delivered fluence maps in the target-reference frame are calculated and compared. Results: The simulation demonstrates that the 2D tracking algorithm is capable of delivering the VMAT plan to a moving target fast and accurately without violating the machine constraints and the integrity of the treatment plan. The average delivery time is only 29 s longer than that of no-tracking delivery, 101 versus 72 s, respectively. The fluence maps are normalized to 200 MU and the average root-mean-square error between the desired and the delivered fluence is 2.1 MU, compared to 14.8 MU for no-tracking and 3.6 MU for one-dimensional tracking. Conclusions: A locally optimal MLC tracking algorithm for VMAT delivery is proposed, aiming at shortest delivery time while maintaining treatment plan invariant. The inconsequential increase of treatment time due to DMLC tracking is clinically desirable, which makes VMAT with DMLC tracking attractive in treating moving tumors.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DATeS: a highly extensible data assimilation testing suite v1.0

A flexible and highly extensible data assimilation testing suite, named DATeS, is described in this paper. DATeS aims to offer a unified testing environment that allows researchers to compare different data assimilation methodologies and understand their performance in various settings. The core of DATeS is implemented in Python and takes advantage of its object-oriented capabilities. The main components of the package (the numerical models, the data assimilation algorithms, the linear algebra solvers, and the time discretization routines) are independent of each other, which offers great flexibility to configure data assimilation applications. DATeS can interface easily with large third-party numerical models written in Fortran or in C,and with a plethora of external solvers.

97 MATHEMATICS AND COMPUTING↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Characterization of tissue magnetic susceptibility-induced distortions for MRIgRT

Purpose: MR image geometric integrity is one of the building blocks of MRI-guided radiotherapy. In particular, tissue magnetic susceptibility-induced effects are patient-dependent and their behavior is difficult to assess and predict. In this study, the authors investigated in detail the characteristics of susceptibility ({chi}) distortions in the context of MRIgRT, including the case of two common MR-linac system configurations. Methods: The magnetic field distortions were numerically simulated for several imaging parameters and anatomical sites, i.e., brain, lung, pelvis (with air pockets), and prostate. The simulation process consisted of (a) segmentation of patient CT data into susceptibility relevant anatomical volumes (i.e., soft-tissue, bone and air/lung), (b) conversion of CT data into susceptibility masks by assigning bulk {chi} values to the structures defined at (a), (c) numerical computations of the local magnetic fields by using a finite difference algorithm, and (d) generation of the geometric distortion maps from the magnetic field distributions. For each patient anatomy, the distortions were quantified at the interfaces of anatomical structures with significantly different {chi} values. The analysis was performed for two specific orientations of the external main magnetic field (B{sub 0}) characteristic to the MR-linac systems, specifically along the z-axis for a bore MR scanner and in the (x,y)-plane for a biplanner magnet. The magnetic field local perturbations were reported in ppm. The metrics used to quantify the geometric distortions were the maximum, mean, and range of distortions. The numerical simulation algorithm was validated using phantom data measurements. Results: Susceptibility-induced distortions were determined for both quadratic and patient specific geometries. The numerical simulations showed a good agreement with the experimental data. The measurements were acquired at 1.5 and 3 T and with an encoding gradient varying between 3 and 20 mT/m by using an annular phantom mimicking the water-air and water-oil {chi} interfaces. For quadratic geometries, the magnitude of field distortion increased rapidly with the size of the inhomogeneity up to about 10 mm and then tended to plateau. This trend became more evident for materials with a larger {Delta}{chi} relative to water. The simulations showed only a slight increase in the maximum distortion values when the B{sub 0} orientation was varied with regard to the shape of the {chi} inhomogeneity. In the case of patient anatomy, the largest distortion values arose at the air-soft-tissue interface. Considering the two MR-linac system configurations and comparing the field distortion values corresponding to all organ structures, the distortions tended to be larger for the biplanar magnet. The authors provide a reference table with ppm values which can be used to easily evaluate the geometric distortions for patient data as a function of B{sub 0} and the strength of the encoding gradient. Conclusions: The susceptibility distortions were quantified as a function of multiple parameters such as the {chi} inhomogeneity size and shape, the magnitude of B{sub 0} and the readout gradient, and the orientation of B{sub 0} with respect to the sample geometry. The analysis was performed for several anatomical sites and corresponding to two B{sub 0} orientations as featured by MR-linac systems.

60 APPLIED LIFE SCIENCES↗

Transient natural convection heat and mass transfer in crystal growth

A numerical analysis of transient combined heat and mass transfer across a rectangular cavity is performed by a numerical method based on the SIMPLE algorithm. The physical parameters are selected to represent a range of possible crystal growth in solutions. Numerical results are compared with available experimental data to confirm the accuracy of the results. Good qualitative agreements are obtained for the average mass transfer rate across the cavity. Also, qualitative agreements are observed for the global development of thermal and solute fields. It is found that the thermal and solute fields become highly oscillatory when the thermal and solute Grashof numbers are large. Oscillations are probably caused by a number of different instability mechanisms. By reducing the gravity some of these instabilities were made to disappear at the lower Grashof numbers. Transient temperature and solute distribution near the crystal growing surface are highly non-uniform at the higher Grashof numbers. These non-uniformities are less severe in the reduced gravity environments but still exist. The effects of convection on the rate of average mass transfer are more than one order of magnitude higher than those of conduction in the range of Grashof numbers studied. Dependency of mass transfer rate on the Grashof number indicates that the convection effects many not be negligible even in the microgravity environments for the range of parameters investigated.

Han, Samuel S.↗