Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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,621 records · Page 90

An Adaptive Derivative-based Method for Function Approximation

To alleviate the high computational cost of large-scale multi-physics simulations to study the relationships between the model parameters and the outputs of interest, response surfaces are often used in place of the exact functional relationships. This report explores a method for response surface construction using adaptive sampling guided by derivative information at each selected sample point. This method is especially suitable for applications that can readily provide added information such as gradients and Hessian with respect to the input parameters under study. When higher order terms (third and above) in the Taylor series are negligible, the approximation error for this method can be controlled. We present details of the adaptive algorithm and numerical results on a few test problems.

99 GENERAL AND MISCELLANEOUS↗

Software for universal noiseless coding

An overview is provided of the universal noiseless coding algorithms as well as their relationship to the now available FORTRAN implementations. It is suggested that readers considering investigating the utility of these algorithms for actual applications should consult both NASA's Computer Software Management and Information Center (COSMIC) and descriptions of coding techniques provided by Rice (1979). Examples of applying these techniques have also been given by Rice (1975, 1979, 1980). Attention is given to reversible preprocessing, general implementation instructions, naming conventions, and calling arguments. A general applicability of the considered algorithms to solving practical problems is obtained because most real data sources can be simply transformed into the required form by appropriate preprocessing.

Rice, R. F.↗

A new algorithm for constrained nonlinear least-squares problems, part 1

A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.

Hanson, R. J.↗

A survey of the state-of-the-art and focused research in range systems

In this one-year renewal of NASA Contract No. 2-304, basic research, development, and implementation in the areas of modern estimation algorithms and digital communication systems have been performed. In the first area, basic study on the conversion of general classes of practical signal processing algorithms into systolic array algorithms is considered, producing four publications. Also studied were the finite word length effects and convergence rates of lattice algorithms, producing two publications. In the second area of study, the use of efficient importance sampling simulation technique for the evaluation of digital communication system performances were studied, producing two publications.

Kung, Yao↗

A Comparison of Monte Carlo Particle Transport Algorithms for an Interior Source Binary Stochastic Medium Benchmark Suite

Particle transport through binary stochastic mixtures has received considerable research attention in the last two decades. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the Levermore-Pomraning equations and another Monte Carlo algorithm (Algorithm B) that should be more accurate as a result of improved local material realization modeling. Zimmerman and Adams numerically confirmed these aspects of the Monte Carlo algorithms by comparing the reflection and transmission values computed using these algorithms to a standard suite of planar geometry binary stochastic mixture benchmark transport solutions. The benchmark transport problems are driven by an isotropic angular flux incident on one boundary of a binary Markovian statistical planar geometry medium. In a recent paper, we extended the benchmark comparisons of these Monte Carlo algorithms to include the scalar flux distributions produced. This comparison is important, because as demonstrated, an approximate model that gives accurate reflection and transmission probabilities can produce unphysical scalar flux distributions. Brantley and Palmer recently investigated the accuracy of the Levermore-Pomraning model using a new interior source binary stochastic medium benchmark problem suite. In this paper, we further investigate the accuracy of the Monte Carlo algorithms proposed by Zimmerman and Adams by comparing to the benchmark results from the interior source binary stochastic medium benchmark suite, including scalar flux distributions. Because the interior source scalar flux distributions are of an inherently different character than the distributions obtained for the incident angular flux benchmark problems, the present benchmark comparison extends the domain of problems for which the accuracy of these Monte Carlo algorithms has been investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Newly Available Single Field-of-view Sounder Atmospheric Product (SiFSAP) and Its Derivative Product

The Single Field-of-view Sounder Atmospheric product (SiFSAP) has been developed and delivered to NASA GES DISC. The SiFSAP Algorithm Theoretical Basis Documents (ATBD) and users manuals are ready to be released to public. This novel data product supplements other operational products such as AIRS version 7 and the Community Long-term Infrared Microwave Combined Atmospheric Product System (CLIMCAPS) from two main perspectives: 1) improving the spatial resolution of sounder Level-2 data to extend its usage in weather and dynamics focus area; 2) establishing radiance closure between Level-2 data and directly measured Level-1 radiances to facilitate the climate trend analysis. SiFSAP has 3-times higher spatial resolution and 9-times denser data products comparing to current NASA and NOAA operational IR sounder products. SiFSAP is derived using the optimal estimation method based physical retrieval algorithm. The Principal Component-based Radiative Transfer Model (PCRTM) which includes the cloud scattering simulation is used for the forward model so that the solution can fit the spectral radiances under all-sky conditions for individual single field-of-view (SFOV) measurements. A general introduction of the SiFSAP algorithm and corresponding validation work will be presented. Also introduced here is the Climate Fingerprinting Sounder product (ClimFiSP) that is the derivative product of SiFSAP and will be released in the near future. The ClimFiSP algorithm uses pre-constructed fingerprinting relationship to achieve a low-latency Level-3 data production and facilitate the fusion of data of different sounders.

Wan Wu↗

Determining frequentist confidence limits using a directed parameter space search

We consider the problem of inferring constraints on a high-dimensional parameter space with a computationally expensive likelihood function. We propose a machine learning algorithm that maps out the Frequentist confidence limit on parameter space by intelligently targeting likelihood evaluations so as to quickly and accurately characterize the likelihood surface in both low- and high-likelihood regions. We compare our algorithm to Bayesian credible limits derived by the well-tested Markov Chain Monte Carlo (MCMC) algorithm using both multi-modal toy likelihood functions and the seven yr Wilkinson Microwave Anisotropy Probe cosmic microwave background likelihood function. We find that our algorithm correctly identifies the location, general size, and general shape of high-likelihood regions in parameter space while being more robust against multi-modality than MCMC.

79 ASTRONOMY AND ASTROPHYSICS↗

Navier-Stokes computations for aerodynamic configurations at high angles of attack

Navier-Stokes computations at high angles of attack over aerodynamic configurations are presented using an implicit finite-volume algorithm. The spatial differencing is upwind-biased for the convective and pressure terms and central for the shear stress and heat transfer terms. The equations are relaxed to steady state with a spatially factored implicit algorithm. In order to treat general geometries, a multiblock patched-grid framework is implemented. Applications and detailed comparisons with experimental data are made for two simple but representative geometric shapes: (1) a highly swept delta wing and (2) a prolate spheroid of 6:1 length-to-diameter. Recent extensions of the algorithm to compute the flow over an F-18 forebody-strake configuration are shown, including comparisons with wind tunnel and flight test results. Comparisons across the range of Reynolds number for all cases indicate that either low Reynolds number or high Reynolds number flows are simulated well, but that flows at intermediate Reynolds number cannot be simulated accurately without a detailed knowledge of the transitional zone between laminar and turbulent flow.

Thomas, J. L.↗

New approaches to Bayesian uncertainty quantification for Nuclear Science (Final Technical Report)

Inverse problems play a central role in experimentation and theory/data comparisons for many areas of modern Nuclear Physics (NP) and High-Energy Physics (HEP). Bayes’s Theorem is a powerful tool for solving Inverse Problems, providing conceptually transparent and unbiased constraints on theoretical parameters and their uncertainties (“Bayesian Inference”) and enabling the quantification of agreement or tension between models and data. However, analyses based on Bayesian Inference are often challenging for NP and HEP applications, either because of the large number of parameters in the problem, the high computational cost, or both. We propose a multi-institutional collaboration to develop and deploy novel Bayesian analysis tools that advance the scientific scope of a broad range of current and future NP experiments. This project brings together NP domain scientists working on several high-profile NP projects for which new, high-performance Bayesian Uncertainty Quantification (“Bayesian UQ”) methods are essential to carry out the science, and data scientists who are developing state-of-the-art methods applicable to these problems. The NP projects in this proposal comprise measurements of the mass and fundamental nature of the neutrino; study of the Quark-Gluon Plasma that filled the early universe; and mapping of natural and anthropogenic radiation environments. While these NP projects have very different scientific goals, with datasets and analysis approaches that differ significantly, they share common requirements for improving computationally intensive Bayesian analyses using advanced Machine Learning algorithms and will benefit strongly from a coherent effort to develop general solutions. This proposal brings together these projects and forefront ML-based data science algorithms to develop such general solutions. The methods developed in this project will also be more widely applicable, thereby advancing science in the larger Nuclear Physics portfolio.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

General method for assessing the geographically correlated error for an orbiter with applications to Topex

An estimation based computational algorithm for evaluating geographically dependent orbit determination errors is presented. A derivation is included of the generalized geographically correlated error analysis algorithm and the algorithm is applied to a Topex simulation. Then a general numerical technique which provides the capability to analyze any type of mismodeled parameter with the geopotential as a special case is described. The numerical algorithm is compared with the analytic method of Rosborough (1986) and it is shown that both methods generate consistent geographically dependent orbit error profiles when the ephemeris error is dominated by the mismodeled geopotential.

Wolff, P. J.↗

Fast algorithms for combustion kinetics calculations: A comparison

To identify the fastest algorithm currently available for the numerical integration of chemical kinetic rate equations, several algorithms were examined. Findings to date are summarized. The algorithms examined include two general-purpose codes EPISODE and LSODE and three special-purpose (for chemical kinetic calculations) codes CHEMEQ, CRK1D, and GCKP84. In addition, an explicit Runge-Kutta-Merson differential equation solver (IMSL Routine DASCRU) is used to illustrate the problems associated with integrating chemical kinetic rate equations by a classical method. Algorithms were applied to two test problems drawn from combustion kinetics. These problems included all three combustion regimes: induction, heat release and equilibration. Variations of the temperature and species mole fraction are given with time for test problems 1 and 2, respectively. Both test problems were integrated over a time interval of 1 ms in order to obtain near-equilibration of all species and temperature. Of the codes examined in this study, only CREK1D and GCDP84 were written explicitly for integrating exothermic, non-isothermal combustion rate equations. These therefore have built-in procedures for calculating the temperature.

Radhakrishnan, K.↗

Stochastic formulation of patient positioning using linac-mounted cone beam imaging with prior knowledge

Purpose: In this work, a novel stochastic framework for patient positioning based on linac-mounted CB projections is introduced. Based on this formulation, the most probable shifts and rotations of the patient are estimated, incorporating interfractional deformations of patient anatomy and other uncertainties associated with patient setup. Methods: The target position is assumed to be defined by and is stochastically determined from positions of various features such as anatomical landmarks or markers in CB projections, i.e., radiographs acquired with a CB-CT system. The patient positioning problem of finding the target location from CB projections is posed as an inverse problem with prior knowledge and is solved using a Bayesian maximum a posteriori (MAP) approach. The prior knowledge is three-fold and includes the accuracy of an initial patient setup (such as in-room laser and skin marks), the plasticity of the body (relative shifts between target and features), and the feature detection error in CB projections (which may vary depending on specific detection algorithm and feature type). For this purpose, MAP estimators are derived and a procedure of using them in clinical practice is outlined. Furthermore, a rule of thumb is theoretically derived, relating basic parameters of the prior knowledge (initial setup accuracy, plasticity of the body, and number of features) and the parameters of CB data acquisition (number of projections and accuracy of feature detection) to the expected estimation accuracy. Results: MAP estimation can be applied to arbitrary features and detection algorithms. However, to experimentally demonstrate its applicability and to perform the validation of the algorithm, a water-equivalent, deformable phantom with features represented by six 1 mm chrome balls were utilized. These features were detected in the cone beam projections (XVI, Elekta Synergy) by a local threshold method for demonstration purposes only. The accuracy of estimation (strongly varying for different plasticity parameters of the body) agreed with the rule of thumb formula. Moreover, based on this rule of thumb formula, about 20 projections for 6 detectable features seem to be sufficient for a target estimation accuracy of 0.2 cm, even for relatively large feature detection errors with standard deviation of 0.5 cm and spatial displacements of the features with standard deviation of 0.5 cm. Conclusions: The authors have introduced a general MAP-based patient setup algorithm accounting for different sources of uncertainties, which are utilized as the prior knowledge in a transparent way. This new framework can be further utilized for different clinical sites, as well as theoretical developments in the field of patient positioning for radiotherapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Electromagnetic total- f algorithm for gyrokinetic particle-in-cell simulations of boundary plasma in XGC

We report the simplified δf mixed-variable/pullback electromagnetic simulation algorithm implemented in XGC for core plasma simulations by Cole et al. [Phys. Plasmas 28, 034501 (2021)] has been generalized to a total- f electromagnetic algorithm that can include, for the first time, the boundary plasma in diverted magnetic geometry with neutral particle recycling, turbulence, and neoclassical physics. The δf mixed-variable/pullback electromagnetic implementation is based on the pioneering work by Kleiber and Mischenko et al. [Kleiber et al., Phys. Plasmas 23, 032501 (2016); Mishchenko et al., Comput. Phys. Commun. 238, 194 (2019)]. An electromagnetic demonstration simulation is performed in a DIII-D-like, H-mode boundary plasma, including a corresponding comparative electrostatic simulation, which confirms that the electromagnetic simulation is necessary for a higher fidelity understanding of the electron particle and heat transport even at the low- β pedestal foot in the vicinity of the magnetic separatrix.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.

optimization↗

Slanted-wall beam propagation : erratum.

Recently, a new algorithm for wide-angle beam propagation was reported that allowed grid points to move in an arbitrary fashion between propagation planes and was thus capable of modeling waveguides whose widths or centerlines varied with propagation distance. That algorithm was accurate and stable for TE polarization but unstable for wide-angle TM propagation. This deficiency has been found to result from an omission in one of the wide-angle terms in the derivation of the finite-difference equation and is remedied here, resulting in a complete algorithm accurate for both polarizations.

97 MATHEMATICS AND COMPUTING↗