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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Direct reconstruction of isolated XUV or soft x-ray attosecond pulses from high-harmonic generation streaking spectra

Characterization of an isolated attosecond pulse (IAP) in the extreme ultraviolet (XUV) or soft x-ray (SXR) region is essential for its applications. Here we propose to retrieve an IAP in the time domain directly through the modulation of high-harmonic generation (HHG) spectra in the presence of a time-delayed intense few-cycle infrared or mid-infrared laser. The retrieval algorithm is derived based on the strong-field approximation and an extended quantitative rescattering model. We show that both isolated XUV pulses with a narrow spectral bandwidth and isolated SXR pulses with a broad bandwidth can be well characterized through the HHG streaking spectra. Such an all-optical method for characterizing the IAP differs from the commonly used approach based on the streaked photoelectron spectra that would require electron spectrometers. We check the robustness of the retrieval method by changing the dressing laser or by adjusting the steps of time delay. We also show that the XUV pulse can be accurately retrieved by treating the HHG streaking spectra calculated from solving the time-dependent Schrödinger equation for single atoms as the ‘experimental’ data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2012

Accuracy Assessment of Aqua-MODIS Aerosol Optical Depth Over Coastal Regions: Importance of Quality Flag and Sea Surface Wind Speed

Coastal regions around the globe are a major source for anthropogenic aerosols in the atmosphere, but the underlying surface characteristics are not favorable for the Moderate Resolution Imaging Spectroradiometer (MODIS) algorithms designed for retrieval of aerosols over dark land or open-ocean surfaces. Using data collected from 62 coastal stations worldwide from the Aerosol Robotic Network (AERONET) from approximately 2002-2010, accuracy assessments are made for coastal aerosol optical depth (AOD) retrieved from MODIS aboard Aqua satellite. It is found that coastal AODs (at 550 nm) characterized respectively by the MODIS Dark Land (hereafter Land) surface algorithm, the Open-Ocean (hereafter Ocean) algorithm, and AERONET all exhibit a log-normal distribution. After filtering by quality flags, the MODIS AODs respectively retrieved from the Land and Ocean algorithms are highly correlated with AERONET (with R(sup 2) is approximately equal to 0.8), but only the Land algorithm AODs fall within the expected error envelope greater than 66% of the time. Furthermore, the MODIS AODs from the Land algorithm, Ocean algorithm, and combined Land and Ocean product show statistically significant discrepancies from their respective counterparts from AERONET in terms of mean, probability density function, and cumulative density function, which suggest a need for future improvement in retrieval algorithms. Without filtering with quality flag, the MODIS Land and Ocean AOD dataset can be degraded by 30-50% in terms of mean bias. Overall, the MODIS Ocean algorithm overestimates the AERONET coastal AOD by 0.021 for AOD less than 0.25 and underestimates it by 0.029 for AOD greater than 0.25. This dichotomy is shown to be related to the ocean surface wind speed and cloud contamination effects on the satellite aerosol retrieval. The Modern Era Retrospective-Analysis for Research and Applications (MERRA) reveals that wind speeds over the global coastal region 25 (with a mean and median value of 2.94 meters per second and 2.66 meters per second, respectively) are often slower than 6 meters per second assumed in the MODIS Ocean algorithm. As a result of high correlation (R(sup 2) greater than 0.98) between the bias in binned MODIS AOD and the corresponding binned wind speed over the coastal sea surface, an empirical scheme for correcting the bias of AOD retrieved from the MODIS Ocean algorithm is formulated and is shown to be effective over the majority of the coastal AERONET stations, and hence can be used in future analysis of AOD trend and MODIS AOD data assimilation.

Anderson, J. C.↗
DOE OSTI2021

Pulse-shape discrimination against low-energy Ar-39 beta decays in liquid argon with 4.5 tonne-years of DEAP-3600 data

The DEAP-3600 detector searches for the scintillation signal from dark matter particles scattering on a 3.3 tonne liquid argon target. The largest background comes from 39 Ar beta decays and is suppressed using pulse-shape discrimination (PSD). We use two types of PSD estimator: the prompt-fraction, which considers the fraction of the scintillation signal in a narrow and a wide time window around the event peak, and the log-likelihood-ratio, which compares the observed photon arrival times to a signal and a background model. We furthermore use two algorithms to determine the number of photons detected at a given time: (1) simply dividing the charge of each PMT pulse by the mean single-photoelectron charge, and (2) a likelihood analysis that considers the probability to detect a certain number of photons at a given time, based on a model for the scintillation pulse shape and for afterpulsing in the light detectors. The prompt-fraction performs approximately as well as the log-likelihood-ratio PSD algorithm if the photon detection times are not biased by detector effects. We explain this result using a model for the information carried by scintillation photons as a function of the time when they are detected.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗
NASA NTRS1991

Approximate factorization with source terms

A comparative evaluation is made of three methodologies with a view to that which offers the best approximate factorization error. While two of these methods are found to lead to more efficient algorithms in cases where factors which do not contain source terms can be diagonalized, the third method used generates the lowest approximate factorization error. This method may be preferred when the norms of source terms are large, and transient solutions are of interest.

Shih, T. I.-P.↗
NASA NTRS2019

Machine Learning, Markov Chain Monte Carlo, and Optimal Algorithms to Characterize the AdvACT Kilopixel Transition-Edge Sensor Arrays

Next-generation focal planes comprising dozens of kilopixel transition-edge sensor (TES) arrays require new methods to rapidly screen candidate arrays, evaluate array non-idealities in the field, identify outlier devices for removal, and optimize the array performance in the field. We demonstrate robust methods to estimate TES parameters (critical temperatures and thermal conductivity parameters) and their uncertainties using a custom Markov Chain Monte Carlo (MCMC) algorithm. We also constrain systematic effects in estimating the TES parameters from non-isothermal current-voltage curves (IVs) at approximately a ~3% level. Additionally, for the first time, we have applied Machine Learning (ML) algorithms to tune detector arrays and optimize their performance.

Maria Salatino↗
DOE OSTI2022

Optimal Control of Biomass Feedstock Processing System Under Uncertainty in Biomass Quality

Planning of biorefinery operations is complicated by the stochastic nature of physical and chemical characteristics of biomass feedstock, such as, moisture level and carbohydrate content. Biomass characteristics affect the performance of the equipment which feed the reactor and the efficiency of the conversion process in a biorefinery. We propose a stochastic optimization model to identify a blend of feedstocks, inventory levels, and operating conditions of equipment to ensure a continuous flowing of biomass to the reactor while meeting the requirements of the biochemical conversion process. We propose a sample average approximation (SAA) of the model, and develop an efficient algorithm to solve the SAA model. A feedstock preprocessing process consists of two-stage grinding and pelleting is used to develop a case study. Extensive numerical analysis are conducted which lead to a number of observations. Our main observation is that sequencing bales based on moisture level and carbohydrate content leads to robust solutions that improve processing time and processing rate of the reactor. We provide a number of managerial insights that facilitate the implementation of the model proposed. Note to Practitioners—This paper is motivated by the challenges faced in the bioenergy industry. The focus of this paper is on plants which use the biochemical conversion process to generate liquid fuels. It has been observed that variations in biomass characteristics, such as moisture content, cause variations in feeding of the system which lead to under-utilization of equipment. A requirement of biochemical conversion process is to maintain the carbohydrate content of biomass processed by the reactor, larger than a threshold. We propose a model that identifies the inventory levels and operating conditions of equipment to ensure a continuous flowing of biomass to the reactor. The goal is to improve equipment utilization while satisfying the requirements of the conversion process. The model is tested using real-life data. We found out that by sequencing bales based on moisture level and carbohydrate content, a plant can reduce variability in the system leading to improved system reliability, higher processing rates of the reactor, and higher throughput.

09 BIOMASS FUELS↗
NASA NTRS1987

Performance evaluation of fault tolerant systems represented by Markov models

A method to evaluate the performance of fault tolerant systems whose configuration can be represented by time-invariant, discrete-time, discrete-state Markov models is introduced. Each state is assumed to be associated with a constant qualitative measure of the system's performance. The method first computes the moments of the performance probability mass function (PMF) and then finds an approximating function that has the same moments. The form of this function is a maximum entropy solution of the moment matching problem. A simple algorithm for calculating the necessary moments is derived and a method for finding the approximate performance PMF is suggested. After some modification, the method is applied to an example, the Inertial Upper Stage navigation system.

Missana, Jean-Olivier A. A.↗
DOE OSTI2021

Algorithm advances and applications of time‐dependent first‐principles simulations for ultrafast dynamics

Abstract Far from equilibrium phenomenon is a central theme of contemporary material research. Such phenomenon can exhibit itself in atomic structure and dynamics, but very often it also happens as non‐equilibrium phenomenon in the electronic structure. In ab initio material simulation, density functional theory (DFT) has played an essential role in studying electronic ground state problems. For excited states, besides many‐body perturbation theory, another powerful tool is the time dependent DFT (TDDFT) method. In particular, the real‐time TDDFT (rt‐TDDFT) method can be used to simulate many non‐equilibrium phenomena directly. Here we introduce our works on some algorithm advances based on our recently rt‐TDDFT method. This method uses the plane‐wave basis set, and significantly accelerates its efficiency by increasing the time step from 0.1–1 as in traditional methods to 0.2–0.5 fs. The noncollinear magnetic moments and spin–orbit coupling have also been included in our rt‐TDDFT method. Furthermore, a Boltzmann‐TDDFT algorithm has been developed to solve the hot carrier overheating problem in Ehrenfest dynamics, and a natural orbital branching algorithm has been developed to overcome the mean‐field approximation in Ehrenfest dynamics nuclear trajectory, thus allows stochastic multiple paths in chemical reactions. Utilizing these methods, we have studied the photoinduced ultrafast demagnetization, ultrafast phase transition, energy transfer between plasmon and hot carriers, as well as the high‐energy ion implantation and low‐energy atomic diffusion in semiconductors. We believe the tools as the ones introduced here can enable us to study a wide range of phenomena which are of great interest in modern day material research. This article is categorized under: Structure and Mechanism > Computational Materials Science Electronic Structure Theory > Ab Initio Electronic Structure Methods Electronic Structure Theory > Density Functional Theory

Liu, Wen‐Hao↗
DOE OSTI2021

Quantum mereology: Factorizing Hilbert space into subsystems with quasiclassical dynamics

We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any preexisting structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into “system” and “environment.” Such a decomposition can be defined by looking for subsystems that exhibit quasiclassical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and remain localized around approximately classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. Furthermore, this formalism is relevant to questions in the foundations of quantum mechanics and the emergence of spacetime from quantum entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1972

The k-space formulation of the n-dimensional scattering problem

The n-dimensional scattering problem is solved by means of a k-space formulation of the field equations, thereby replacing the conventional integral equation formulation by a set of two algebraic equations in two unknowns in two spaces (the constitutive equation being an algebraic equation in x-space). These equations are solved by an iterative method with the aid of the fast Fourier transform (FFT) algorithm connecting the two spaces, requiring very simple initial approximations. Since algebraic and FFT equations are used, the number of arithmetic multiple-add operations and storage allocations required for a numerical solution are reduced from the order of N sq (for solving the matrix equations resulting from the conventional integral equations) to the order of N(log base 2 of N) and N, respectively (where N is the number of data points required for the specification of the problem). The advantage gained in speed and storage is thus of the order of N/log base 2 of N and N, respectively. This method is thus considerably more efficient than the conventional matrix method, and permits exact numerical solutions for much larger problems. Arguments are presented toward the view that the field equations are more fundamental in k-space. The details and some numerical results of the application of this method to the three-dimensional electromagnetic scattering problems are presented as an example.

Bojarski, N. N.↗
NASA NTRS1976

Finite element representations for thin shell instability analysis

The development of finite element calculational procedures for thin-shell instability analysis has involved the definition of appropriate element representations (i.e. the geometric form of the element and the approximation of displacement and/or stress), constitutive expressions, and computational algorithms. Among these, the status of thin-shell finite element representations remains unsettled. This paper, therefore, emphasizes recent developments in the basic aspects of thin-shell finite element analysis and discusses one simplified approach in more detail. Formulative and computational procedures for elastic instability analysis are then summarized, and numerical results are shown for the simplified shell element formulation.

Gallagher, R. H.↗
NASA NTRS1985

Image gathering and processing - Information and fidelity

In this paper we formulate and use information and fidelity criteria to assess image gathering and processing, combining optical design with image-forming and edge-detection algorithms. The optical design of the image-gathering system revolves around the relationship among sampling passband, spatial response, and signal-to-noise ratio (SNR). Our formulations of information, fidelity, and optimal (Wiener) restoration account for the insufficient sampling (i.e., aliasing) common in image gathering as well as for the blurring and noise that conventional formulations account for. Performance analyses and simulations for ordinary optical-design constraints and random scences indicate that (1) different image-forming algorithms prefer different optical designs; (2) informationally optimized designs maximize the robustness of optimal image restorations and lead to the highest-spatial-frequency channel (relative to the sampling passband) for which edge detection is reliable (if the SNR is sufficiently high); and (3) combining the informationally optimized design with a 3 by 3 lateral-inhibitory image-plane-processing algorithm leads to a spatial-response shape that approximates the optimal edge-detection response of (Marr's model of) human vision and thus reduces the data preprocessing and transmission required for machine vision.

Huck, F. O.↗
NASA NTRS1987

Viscous calculations of supersonic flows past cylinders at angles of attack

Two- and three-dimensional separated flows around cylindrical sections and a body-of-revolution at angles of attack from -10 deg to +20 deg are computed. The blunt-nose-cylinders chosen for the analyses have different configurations, and one of them has a boat-tail. The freestream Mach numbers are 1.5 and 1.6, the unit Reynolds number and the total temperature are 2 million/ft, and 585 R, respectively. Among the possible areas of application for this study are the aerodynamics of separating stores and missiles. The Reynolds-averaged Navier-Stokes equations are solved by an approximately-factored, implicit, upwind-biased, finite-volume algorithm. The convergence to steady state was accelerated using a multigrid strategy. The results helped understanding the structure of the flowfield with varying incidence and configuration, and the suitability of the computational algorithm used for this class of flows. A two-layer algebraic eddy viscosity model is used for the two-dimensional turbulent flows. Laminar three-dimensional calculations are benchmarked through comparisons with wind tunnel test results.

Baysal, O.↗
NASA NTRS1988

Fully-coupled analysis of jet mixing problems. Three-dimensional PNS model, SCIP3D

Numerical procedures formulated for the analysis of 3D jet mixing problems, as incorporated in the computer model, SCIP3D, are described. The overall methodology closely parallels that developed in the earlier 2D axisymmetric jet mixing model, SCIPVIS. SCIP3D integrates the 3D parabolized Navier-Stokes (PNS) jet mixing equations, cast in mapped cartesian or cylindrical coordinates, employing the explicit MacCormack Algorithm. A pressure split variant of this algorithm is employed in subsonic regions with a sublayer approximation utilized for treating the streamwise pressure component. SCIP3D contains both the ks and kW turbulence models, and employs a two component mixture approach to treat jet exhausts of arbitrary composition. Specialized grid procedures are used to adjust the grid growth in accordance with the growth of the jet, including a hybrid cartesian/cylindrical grid procedure for rectangular jets which moves the hybrid coordinate origin towards the flow origin as the jet transitions from a rectangular to circular shape. Numerous calculations are presented for rectangular mixing problems, as well as for a variety of basic unit problems exhibiting overall capabilities of SCIP3D.

Wolf, D. E.↗
NASA NTRS1987

Improved shape-signature and matching methods for model-based robotic vision

Researchers describe new techniques for curve matching and model-based object recognition, which are based on the notion of shape-signature. The signature which researchers use is an approximation of pointwise curvature. Described here is curve matching algorithm which generalizes a previous algorithm which was developed using this signature, allowing improvement and generalization of a previous model-based object recognition scheme. The results and the experiments described relate to 2-D images. However, natural extensions to the 3-D case exist and are being developed.

Schwartz, J. T.↗
NASA NTRS1990

Intergration of system identification and robust controller designs for flexible structures in space

An approach is developed using experimental data to identify a reduced-order model and its model error for a robust controller design. There are three steps involved in the approach. First, an approximately balanced model is identified using the Eigensystem Realization Algorithm, which is an identification algorithm. Second, the model error is calculated and described in frequency domain in terms of the H(infinity) norm. Third, a pole placement technique in combination with a H(infinity) control method is applied to design a controller for the considered system. A set experimental data from an existing setup, namely the Mini-Mast system, is used to illustrate and verify the approach.

Juang, Jer-Nan↗
NASA NTRS1990

State-space design of low-order stabilizers

An algorithm is presented for stabilizing a linear multivariable system with a controller of fixed dynamic order. This is an output feedback stabilization problem. The algorithm attempts to solve this by a sequence of approximate pole assignment problems. The approximation is driven by the optimization of an objective function consisting of a weighted sum of the condition number of the closed-loop eigenvectors and the norm of the difference between the computed and actual equivalent state-feedback controls.

Keel, L. H.↗