Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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,459 records · Page 81
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Benchmark solutions for the galactic ion transport equations with spatial and energy coupling

In order to anticipate future space shielding requirements, NASA has initiated an effort to formulate computational methods to simulate radiation effects in space. As part of the program, numerical transport algorithms have been developed for the deterministic Boltzman equation describing galactic cosmic ray (GCR) interactions with matter. It thus becomes necessary to assess the accuracy of proposed deterministic algorithms. For this reason, analytical benchmark solutions to mathematically tractable galactic cosmic ray equations have recently been obtained. Even though these problems involve simplifying assumptions of the associated physics, they still contain the essential features of the basic transport processes. The solutions obtained are features of the basic transport processes. The solutions obtained are compared to results from numerical algorithms in order to ensure proper coding and to provide a measure of the accuracy of the numerical methods used in the algorithm. For the first time, mathematical methods have been applied to the galactic ion transport (GIT) equations in the straight ahead approximation with constant nuclear properties. The approach utilizes a Laplace transforms inversion yielding a closed form benchmark solution which is also computationally efficient.

Ganapol, Barry D.↗
NASA NTRS1989

Quotient-difference type generalizations of the power method and their analysis

The recursion relations that were proposed by W. F. Ford and A. Sidi (Appl. Numer. Math, 4 (1988), pp. 477-489) for implementing vector extrapolation methods are used for devising generalizations of the power method for linear operators. These generalizations are shown to produce approximations to largest eigenvalues of a linear operator under certain conditions. They are similar in form to the quotient-difference algorithm and share similar convergence properties with the latter. These convergence properties also resemble those obtained for the basic LR and QR algorithms. Finally, it is shown that the convergence rate produced by one fo these generalizations is twice as fast for normal operators as it is for nonnormal operators.

Sidi, Avram↗
NASA NTRS1988

Analytical study of the liquid phase transient behavior of a high temperature heat pipe

The transient operation of the liquid phase of a high temperature heat pipe is studied. The study was conducted in support of advanced heat pipe applications that require reliable transport of high temperature drops and significant distances under a broad spectrum of operating conditions. The heat pipe configuration studied consists of a sealed cylindrical enclosure containing a capillary wick structure and sodium working fluid. The wick is an annular flow channel configuration formed between the enclosure interior wall and a concentric cylindrical tube of fine pore screen. The study approach is analytical through the solution of the governing equations. The energy equation is solved over the pipe wall and liquid region using the finite difference Peaceman-Rachford alternating direction implicit numerical method. The continuity and momentum equations are solved over the liquid region by the integral method. The energy equation and liquid dynamics equation are tightly coupled due to the phase change process at the liquid-vapor interface. A kinetic theory model is used to define the phase change process in terms of the temperature jump between the liquid-vapor surface and the bulk vapor. Extensive auxiliary relations, including sodium properties as functions of temperature, are used to close the analytical system. The solution procedure is implemented in a FORTRAN algorithm with some optimization features to take advantage of the IBM System/370 Model 3090 vectorization facility. The code was intended for coupling to a vapor phase algorithm so that the entire heat pipe problem could be solved. As a test of code capabilities, the vapor phase was approximated in a simple manner.

Roche, Gregory Lawrence↗
NASA NTRS1991

An iterative implicit diagonally-dominant factorization algorithm for solving the Navier-Stokes equations

Presented here is an algorithm for solving the multidimensional unsteady Navier-Stokes equations for compressible flows. It is based on a diagonally-dominant approximate factorization procedure. The factorization error and the timewise linearization error associated with this procedure are reduced by performing Newton-type inner iterations at each time step. The inviscid fluxes are evaluated by the fourth-order central differencing scheme amended with a numerical dissipation directly proportional to the entire dissipative part of the truncation error intrinsic to the third order biased upwind scheme. The important features of the proposed solution are elucidated by the numerical results of the convection of a vortex and the backward-facing step flows.

Chen, Shu-Cheng↗
NASA NTRS1992

Hysteresis effects in instantaneous frequency scaling of attenuation on 20 and 30 GHz satellite links

It has been observed with 20/30 GHz satellite beacon measurements that the ratio of 30 GHz to 20 GHz attenuation changes during some fade events. This ratio displays a hysteresis effect. This effect can be explained by a change in the drop size distribution (DSD) during the event. However, it appears only above approximately 6-8 dB of attenuation at 20 GHz. Instantaneous frequency scaling of attenuation is being proposed as part of an algorithm for uplink power control (ULPC) and the dynamic range of such an algorithm must be appropriately limited to avoid the hysteresis.

Sweeney, D. G.↗
NASA NTRS1991

A signal preprocessing algorithm applicable to both DTF and SSME spectral diagnostics

An account is given of research conducted by NASA-Stennis' Diagnostic Test Facility (DTF), which is designed to obtain spectra approximating those of the SSME while allowing full control of dopant and thruster conditions. A simple preprocessing technique which emphasizes the essential spectral components of plume spectra that are indicative of dopant levels has been used and found to remain sensitive to wavelength shift even for high-resolution spectra. Mathematical analyses of the problem are presented which are based on the Taylor's series linearization procedure.

Nail, Bert↗
NASA NTRS1993

Improving the reconstruction of the velocity potential and primordial density fluctuations by choice of smoothing windows

Recently considerable attention has been focused on improving algorithms for restoring primordial density fluctuations in the universe or investigating large-scale velocity fields by going to higher order approximations relating nonlinear states to their initial conditions. An alternative approach is to investigate the use of alternative smoothing windows within the context of first-order approximations. I present evidence that the universally used Gaussian smoothing window is far from optimal. A sharp truncation P(k) = 0 for k greater than k(c) leads to a much more direct connection to initial conditions for either 'Gaussianization' methods or use of the Zel'dovich approximation, as discussed in the text.

Melott, Adrian L.↗
NASA NTRS1993

Chemistry and transport in a multi-dimensional model

The focus of our research program is the achievement of a quantitative understanding of the spatial distribution and temporal variation of chemical species in the terrestrial middle atmosphere, with emphasis on ozone. Although not directed at assessments of anthropogenic impacts, our activities contribute to a refinement of model descriptions of chemical and dynamical processes that are needed for assessment tasks. A unique feature of our research effort is a close interaction with the chemical kinetics group at JPL and the field measurement groups at JPL. The principal tools used in our investigations are l-D and 2-D photochemical models. The advective component of the meridional transport in these models is approximated by the diabatic circulation, which is derived diagnostically from the net radiative heating rates. We are developing accurate radiative transfer algorithms to find the net heating rates and the diabatic circulation for use in the 2-D model.

Yung, Yuk L.↗
NASA NTRS2003

Automated Coronal Loop Identification Using Digital Image Processing Techniques

The results of a master thesis project on a study of computer algorithms for automatic identification of optical-thin, 3-dimensional solar coronal loop centers from extreme ultraviolet and X-ray 2-dimensional images will be presented. These center splines are proxies of associated magnetic field lines. The project is pattern recognition problems in which there are no unique shapes or edges and in which photon and detector noise heavily influence the images. The study explores extraction techniques using: (1) linear feature recognition of local patterns (related to the inertia-tensor concept), (2) parametric space via the Hough transform, and (3) topological adaptive contours (snakes) that constrains curvature and continuity as possible candidates for digital loop detection schemes. We have developed synthesized images for the coronal loops to test the various loop identification algorithms. Since the topology of these solar features is dominated by the magnetic field structure, a first-order magnetic field approximation using multiple dipoles provides a priori information in the identification process. Results from both synthesized and solar images will be presented.

Lee, Jong K.↗
NASA NTRS2004

A Most Probable Point-Based Method for Reliability Analysis, Sensitivity Analysis and Design Optimization

A major step in a most probable point (MPP)-based method for reliability analysis is to determine the MPP. This is usually accomplished by using an optimization search algorithm. The optimal solutions associated with the MPP provide measurements related to safety probability. This study focuses on two commonly used approximate probability integration methods; i.e., the Reliability Index Approach (RIA) and the Performance Measurement Approach (PMA). Their reliability sensitivity equations are first derived in this paper, based on the derivatives of their respective optimal solutions. Examples are then provided to demonstrate the use of these derivatives for better reliability analysis and Reliability-Based Design Optimization (RBDO).

Hou, Gene J.-W.↗
NASA NTRS1993

Validation of Atmospheric Correction of Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) Radiance Data Based on Radiative Transfer Modeling

An evaluation of atmospheric correction of AVIRIS data using radiative transfer codes LOWTRAN7 and MODTRAN is presented. The algorithm employed is based on a simple model of radiance L at each wavelength at the sensor that can be written approximately LAV=Lp+Tp, where subscript AV referes to AVIRIS, Lp is the path radiance and Tp is the diffuse + direct transmitted radiance of the atmosphere at AVIRIS.

Infrared Mapping↗
NASA NTRSDate not supplied

Exploring Quantum State Preparation Using Tensor Networks and Sparse Wavefunction Simulations

The variational quantum eigenvalue solver is a powerful hybrid quantum-classical approach that has been suggested as a candidate method to run on near-term quantum hardware for computing ground state electronic energies of molecular systems. However, even for small molecules, the number of variational parameters and qubits required to minimize the electronic energy is beyond the reach of current quantum computers except for small basis sets. We explore a new paradigm for state preparation where we test how much of the optimization can be approximately prepared with classical computers to reduce the number of optimization steps performed using a quantum device. By adapting a recent algorithm for the factorized form of the UCC ansatz, we can study molecular electronic structure problems with up to 64 qubits. In addition, we also test a related approach of using tensor networks to optimize quantum circuits in order to benchmark various lattice models. We present results using these approaches and discuss strategies for incorporating these ideas into variational algorithms involving near-term quantum computers. Our results help demonstrate the strength of the UCC ansatz and address pressing questions about optimal initial parameterizations and circuit construction.

quantum computing↗
DOE OSTI2023

Relativistic resolution-of-the-identity with Cholesky integral decomposition

In this study, we present an efficient integral decomposition approach called the restricted-kinetic-balance resolution-of-the-identity (RKB-RI) algorithm, which utilizes a tunable RI method based on the Cholesky integral decomposition for in-core relativistic quantum chemistry calculations. The RKB-RI algorithm incorporates the restricted-kinetic-balance condition and offers a versatile framework for accurate computations. Notably, the Cholesky integral decomposition is employed not only to approximate symmetric large-component electron repulsion integrals but also those involving small-component basis functions. In addition to comprehensive error analysis, we investigate crucial conditions, such as the kinetic balance condition and variational stability, which underlie the applicability of Dirac relativistic electronic structure theory. Here we compare the computational cost of the RKB-RI approach with the full in-core method to assess its efficiency. To evaluate the accuracy and reliability of the RKB-RI method proposed in this work, we employ actinyl oxides as benchmark systems, leveraging their properties for validation purposes. This investigation provides valuable insights into the capabilities and performance of the RKB-RI algorithm and establishes its potential as a powerful tool in the field of relativistic quantum chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Heterogeneous Multi-Domain Dataset Synthesis to Facilitate Privacy and Risk Assessments in Smart City IoT

The emergence of the Smart Cities paradigm and the rapid expansion and integration of Internet of Things (IoT) technologies within this context have created unprecedented opportunities for high-resolution behavioral analytics, urban optimization, and context-aware services. However, this same proliferation intensifies privacy risks, particularly those arising from cross-modal data linkage across heterogeneous sensing platforms. To address these challenges, this paper introduces a comprehensive, statistically grounded framework for generating synthetic, multimodal IoT datasets tailored to Smart City research. The framework produces behaviorally plausible synthetic data suitable for preliminary privacy risk assessment and as a benchmark for future re-identification studies, as well as for evaluating algorithms in mobility modeling, urban informatics, and privacy-enhancing technologies. As part of our approach, we formalize probabilistic methods for synthesizing three heterogeneous and operationally relevant data streams—cellular mobility traces, payment terminal transaction logs, and Smart Retail nutrition records—capturing the behaviors of a large number of synthetically generated urban residents over a 12-week period. The framework integrates spatially explicit merchant selection using K-Dimensional (KD)-tree nearest-neighbor algorithms, temporally correlated anchor-based mobility simulation reflective of daily urban rhythms, and dietary-constraint filtering to preserve ecological validity in consumption patterns. In total, the system generates approximately 116 million mobility pings, 5.4 million transactions, and 1.9 million itemized purchases, yielding a reproducible benchmark for evaluating multimodal analytics, privacy-preserving computation, and secure IoT data-sharing protocols. To show the validity of this dataset, the underlying distributions of these residents were successfully validated against reported distributions in published research. We present preliminary uniqueness and cross-modal linkage indicators; comprehensive re-identification benchmarking against specific attack algorithms is planned as future work. This framework can be easily adapted to various scenarios of interest in Smart Cities and other IoT applications. By aligning methodological rigor with the operational needs of Smart City ecosystems, this work fills critical gaps in synthetic data generation for privacy-sensitive domains, including intelligent transportation systems, urban health informatics, and next-generation digital commerce infrastructures.

IoT↗
NASA NTRS1990

Cloud parameters from GOES visible and infrared radiances during the FIRE Cirrus IFO, October 1986

Visible (VIS, 0.65 micron) and infrared (IR, 10.5 microns) channels on geostationary satellites are the key elements of the International Satellite Cloud Climatology Project (ISCCP). All daytime ISCCP cloud parameters are derived from a combination of VIS and IR data. Validation and improvement of the ISCCP and other cloud retrieval algorithms are important components of the First ISCCP Regional Experiment (FIRE) Intensive Field Observations (IFO). Data from the Cirrus IFO (October 19 to November 2, 1986) over Wisconsin are available for validating cirrus cloud retrievals from satellites. The Geostationary Operational Environmental Satellite (GOES) located over the Equator at approximately 100 deg W provided nearly continuous measurements of VIS and IR radiances over the IFO areas. The preliminary results of cloud parameters derived from the IFO GOES data are presented. Cloud attitudes are first derived using an algorithms without corrections for cloud emissivity. These same parameters will then be computed from the same data relying on an emissivity correction algorithm based on correlative data taken during the Cirrus IFO.

Heck, Patrick W.↗
NASA NTRS1998

Using Approximations to Accelerate Engineering Design Optimization

Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.

Torczon, Virginia↗
DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Atmospheric Ascent Guidance for Rocket-Powered Launch Vehicles

An advanced ascent guidance algorithm for rocket- powered launch vehicles is developed. This algorithm cyclically solves the calculus-of-variations two-point boundary-value problem starting at vertical rise completion through main engine cutoff. This is different from traditional ascent guidance algorithms which operate in a simple open-loop mode until high dynamic pressure (including the critical max-Q) portion of the trajectory is over, at which time guidance operates under the assumption of negligible aerodynamic acceleration (i.e., vacuum dynamics). The initial costate guess is corrected based on errors in the terminal state constraints and the transversality conditions. Judicious approximations are made to reduce the order and complexity of the state/costate system. Results comparing guided launch vehicle trajectories with POST open-loop trajectories are given verifying the basic formulation of the algorithm. Multiple shooting is shown to be a very effective numerical technique for this application. In particular, just one intermediate shooting point, in addition to the initial shooting point, is sufficient to significantly reduce sensitivity to the guessed initial costates. Simulation results from a high-fidelity trajectory simulation are given for the case of launch to sub-orbital cutoff conditions as well as launch to orbit conditions. An abort to downrange landing site formulation of the algorithm is presented.

Dukeman, Greg A.↗