Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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,531 records · Page 85

Four-dimensional (4D) tracking of high-temperature microparticles

High-speed tracking of hot and molten microparticles in motion provides rich information about burning plasmas in magnetic fusion. An exploding-wire apparatus is used to produce moving high-temperature metallic microparticles and to develop four-dimensional (4D) or time-resolved 3D particle tracking techniques. The pinhole camera model and algorithms developed for computer vision are used for scene calibration and 4D reconstructions. 3D positions and velocities are then derived for different microparticles. Velocity resolution approaches 0.1 m/s by using the local constant velocity approximation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

Scanning the skeleton of the 4D F-theory landscape

Using a one-way Monte Carlo algorithm from several different starting points, we get an approximation to the distribution of toric threefold bases that can be used in four-dimensional F-theory compactification. We separate the threefold bases into “resolvable” ones where the Weierstrass polynomials (f, g) can vanish to order (4, 6) or higher on codimension-two loci and the “good” bases where these (4, 6) loci are not allowed. A simple estimate suggests that the number of distinct resolvable base geometries exceeds 10 3000 , with over 10 250 “good” bases, though the actual numbers are likely much larger. We find that the good bases are concentrated at specific “end points” with special isolated values of h 1,1 that are bigger than 1,000. These end point bases give Calabi-Yau fourfolds with specific Hodge numbers mirror to elliptic fibrations over simple threefolds. The non-Higgsable gauge groups on the end point bases are almost entirely made of products of E 8 , F 4 , G 2 and SU(2). Nonetheless, we find a large class of good bases with a single non-Higgsable SU(3). Moreover, by randomly contracting the end point bases, we find many resolvable bases with h 1,1 (B) ~ 50-200 that cannot be contracted to another smooth threefold base.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Oscillator strengths and transition probabilities from the Breit–Pauli R-matrix method: Ne IV

The atomic parameters–oscillator strengths, line strengths, radiative decay rates (A), and lifetimes–for fine structure transitions of electric dipole (E1) type for the astrophysically abundant ion Ne IV are presented. The results include 868 fine structure levels with n≤ 10, l≤ 9, and 1/2≤J≤ 19/2 of even and odd parities, and the corresponding 83,767 E1 transitions. The calculations were carried out using the relativistic Breit–Pauli R-matrix method in the close coupling approximation. The transitions have been identified spectroscopically using an algorithm based on quantum defect analysis and other criteria. The calculated energies agree with the 103 observed and identified energies to within 3% or better for most of the levels. Some larger differences are also noted. The A-values show good to fair agreement with the very limited number of available transitions in the table compiled by NIST, but show very good agreement with the latest published multi-configuration Hartree–Fock calculations. The present transitions should be useful for diagnostics as well as for precise and complete spectral modeling in the soft X-ray to infra-red regions of astrophysical and laboratory plasmas. -- Highlights: •The first application of BPRM method for accurate E1 transitions in Ne IV is reported. •Amount of atomic data (n going up to 10) is complete for most practical applications. •The calculated energies are in very good agreement with most observed levels. •Very good agreement of A-values and lifetimes with other relativistic calculations. •The results should provide precise nebular abundances, chemical evolution etc.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Downfolding of many-body Hamiltonians using active-space models: Extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms

Here, we discuss the extension of the recently introduced subsystem embedding subalgebra coupled cluster (SES-CC) formalism to unitary CC formalisms. In analogy to the standard single-reference SES-CC formalism, its unitary CC extension allows one to include the dynamical (outside the active space) correlation effects in an SES induced complete active space (CAS) effective Hamiltonian. In contrast to the standard single-reference SES-CC theory, the unitary CC approach results in a Hermitian form of the effective Hamiltonian. Additionally, for the double unitary CC (DUCC) formalism, the corresponding CAS eigenvalue problem provides a rigorous separation of external cluster amplitudes that describe dynamical correlation effects—used to define the effective Hamiltonian—from those corresponding to the internal (inside the active space) excitations that define the components of eigenvectors associated with the energy of the entire system. The proposed formalism can be viewed as an efficient way of downfolding many-electron Hamiltonian to the low-energy model represented by a particular choice of CAS. In principle, this technique can be extended to any type of CAS representing an arbitrary energy window of a quantum system. The Hermitian character of low-dimensional effective Hamiltonians makes them an ideal target for several types of full configuration interaction type eigensolvers. As an example, we also discuss the algebraic form of the perturbative expansions of the effective DUCC Hamiltonians corresponding to composite unitary CC theories and discuss possible algorithms for hybrid classical and quantum computing. Given growing interest in quantum computing, we provide energies for H 2 and Be systems obtained with the quantum phase estimator algorithm available in the Quantum Development Kit for the approximate DUCC Hamiltonians.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A local framework for calculating coupled cluster singles and doubles excitation energies (LoFEx-CCSD)

Here, the recently developed Local Framework for calculating Excitation energies (LoFEx) is extended to the coupled cluster singles and doubles (CCSD) model. In the new scheme, a standard CCSD excitation energy calculation is carried out within a reduced excitation orbital space (XOS), which is composed of localised molecular orbitals and natural transition orbitals determined from time-dependent Hartree–Fock theory. The presented algorithm uses a series of reduced second-order approximate coupled cluster singles and doubles (CC2) calculations to optimise the XOS in a black-box manner. This ensures that the requested CCSD excitation energies have been determined to a predefined accuracy compared to a conventional CCSD calculation. We present numerical LoFEx-CCSD results for a set of medium-sized organic molecules, which illustrate the black-box nature of the approach and the computational savings obtained for transitions that are local compared to the size of the molecule. In fact, for such local transitions, the LoFEx-CCSD scheme can be applied to molecular systems where a conventional CCSD implementation is intractable.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

braggedgemodeling

braggedgemodeling (bem) is an open-source Python package for modeling neutron Bragg-edge imaging. It computes the wavelength-dependent total neutron cross-section of a material (coherent and incoherent elastic, coherent and incoherent inelastic scattering, and absorption) from its crystal structure, and implements the March-Dollase texture model and the Jorgensen peak profile, supporting quantitative analysis of energy-resolved neutron imaging data (phase, stress/strain, and texture). Published in the Journal of Open Source Software (2018).

Lin, Jiao [Oak Ridge National Laboratory (ORNL), O↗

WECC Variable Generation Planning Reference Book: Appendices

The document titled “WECC Variable Generation Planning Reference Book”. This book is divided into two volumes; one is the main document (volume 1)and the other is appendices (volume 2). The main document is a collection of the best practices and the information regarding the application and impact of variables generation on power system planning. This volume (appendices) has additional information on the following topics: Probabilistic load flow problems. 2. Additional useful indices. 3. high-impact low-frequency (HILF) events. 4. Examples of wide-area nomograms. 5. Transmission line ratings, types of dynamic rating methods. 6. Relative costs per MW-km of different electric power transmission technologies. 7. Ultra-high voltage (UHV) transmission. 8.High voltage direct current (VSC-HVDC). 9. HVDC. 10. Rewiring of existing transmission lines. 11. High-temperature low sag (HTLS) conductors. 12. The direct method and energy functions for transient stability analysis in power systems. 13.Blackouts caused by voltage instability. 14. Algorithm for parameter continuation predictor-corrector methods. 15. Approximation techniques available for security regions. 16. Impacts of wind power on power system small signals stability. 17. FIDVR. 18. FACTS. 19. European planning standard and practices. 20. International experience in wind and solar energy sources. 21. Western Renewable Energy Zones (WREZ). 22. various energy storage technologies. 23. demand response. 24. BA consolidation and cooperation options. 25. generator power management requirements and 26. European planning guidelines.

Makarov, Yuri V.↗

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.↗

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.↗

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.↗

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.↗

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.↗

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.↗

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↗

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.↗

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

A novel approach is developed using experimental data from the structural testing of a physical system to identify a reduced-order model and its 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 an H(infinity) control method is applied to design a controller for the system. A set of experimental data from an existing setup, namely the Mini-Mast system, is used to illustrate and verify the approach development in this paper.

Juang, Jer-Nan↗