Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate computing”

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 199 records · Page 11

Universal single level implicit algorithm for gasdynamics

A single level effectively explicit implicit algorithm for gasdynamics is presented. The method meets all the requirements for unconditionally stable global iteration over flows with mixed supersonic and supersonic zones including blunt body flow and boundary layer flows with strong interaction and streamwise separation. For hyperbolic (supersonic flow) regions the method is automatically equivalent to contemporary space marching methods. For elliptic (subsonic flow) regions, rapid convergence is facilitated by alternating direction solution sweeps which bring both sets of eigenvectors and the influence of both boundaries of a coordinate line equally into play. Point by point updating of the data with local iteration on the solution procedure at each spatial step as the sweeps progress not only renders the method single level in storage but, also, improves nonlinear accuracy to accelerate convergence by an order of magnitude over related two level linearized implicit methods. The method derives robust stability from the combination of an eigenvector split upwind difference method (CSCM) with diagonally dominant ADI(DDADI) approximate factorization and computed characteristic boundary approximations.

Lombard, C. K.↗

A spectral analysis of the domain decomposed Monte Carlo method for linear systems

The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear operator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approximation and the mean chord approximation are applied to estimate the leakage fraction of stochastic histories from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem to test the models for symmetric operators. In general, the derived approximations show good agreement with measured computational results. (authors)

97 MATHEMATICS AND COMPUTING↗

Quarkyonic Matter and the Revised Phase Diagram of QCD

At high baryon number density, it has been proposed that a new phase of QCD matter controlsthe physics. This matter is confining but can have densities much larger than 3QCD. Its existenceis argued from large Nc approximations, and model computations. It is approximately chirallysymmetric.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rapid State Space Modeling Tool for Rectangular Wing Aeroservoelastic Studies

This paper introduces a modeling and simulation tool for aeroservoelastic analysis of rectangular wings with trailing-edge control surfaces. The inputs to the code are planform design parameters such as wing span, aspect ratio, and number of control surfaces. Using this information, the generalized forces are computed using the doublet-lattice method. Using Roger's approximation, a rational function approximation is computed. The output, computed in a few seconds, is a state space aeroservoelastic model which can be used for analysis and control design. The tool is fully parameterized with default information so there is little required interaction with the model developer. All parameters can be easily modified if desired. The focus of this paper is on tool presentation, verification, and validation. These processes are carried out in stages throughout the paper. The rational function approximation is verified against computed generalized forces for a plate model. A model composed of finite element plates is compared to a modal analysis from commercial software and an independently conducted experimental ground vibration test analysis. Aeroservoelastic analysis is the ultimate goal of this tool, therefore, the flutter speed and frequency for a clamped plate are computed using damping-versus-velocity and frequency-versus-velocity analysis. The computational results are compared to a previously published computational analysis and wind-tunnel results for the same structure. A case study of a generic wing model with a single control surface is presented. Verification of the state space model is presented in comparison to damping-versus-velocity and frequency-versus-velocity analysis, including the analysis of the model in response to a 1-cos gust.

Modeling and Simulation↗

Rapid State Space Modeling Tool for Rectangular Wing Aeroservoelastic Studies

This report introduces a modeling and simulation tool for aeroservoelastic analysis of rectangular wings with trailing-edge control surfaces. The inputs to the code are planform design parameters such as wing span, aspect ratio, and number of control surfaces. Using this information, the generalized forces are computed using the doublet-lattice method. Using Roger's approximation, a rational function approximation is computed. The output, computed in a few seconds, is a state space aeroservoelastic model which can be used for analysis and control design. The tool is fully parameterized with default information so there is little required interaction with the model developer. All parameters can be easily modified if desired. The focus of this report is on tool presentation, verification, and validation. These processes are carried out in stages throughout the report. The rational function approximation is verified against computed generalized forces for a plate model. A model composed of finite element plates is compared to a modal analysis from commercial software and an independently conducted experimental ground vibration test analysis. Aeroservoelastic analysis is the ultimate goal of this tool, therefore, the flutter speed and frequency for a clamped plate are computed using damping-versus-velocity and frequency-versus-velocity analysis. The computational results are compared to a previously published computational analysis and wind-tunnel results for the same structure. A case study of a generic wing model with a single control surface is presented. Verification of the state space model is presented in comparison to damping-versus-velocity and frequency-versus-velocity analysis, including the analysis of the model in response to a 1-cos gust.

Verification and Validation↗

Callan-Symanzik-Lifshitz approach to generic competing systems

We present the massive method to approaching the critical behaviors of systems with arbitrary competing interactions. Every distinct competition subspace in the anisotropic cases define an independent set of renormalized vertex parts via normalization conditions with nonvanishing distinct masses at zero external momenta. Otherwise, only one mass scale is required in the isotropic behaviors. At the critical dimension, we prove: (i) the existence of the Callan-Symanzik-Lifshitz equations and (ii) the multiplicative renormalizability of the vertex functions using the inductive method. Away from the critical dimension, we utilize the orthogonal approximation to compute higher loop Feynman integrals, anisotropic as well as isotropic, necessary to get the exponents {eta}{sub n} and {nu}{sub n} at least up to two-loop level. Moreover, we calculate the latter exactly for isotropic behaviors at the same perturbative order. Similarly to the computation in the massless formalism, the orthogonal approximation is found to be exact at one-loop order. The outcome for all critical exponents matches exactly with those computed using the zero mass field-theoretic description renormalized at nonvanishing external momenta.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient on-the-fly ab initio semiclassical method for computing time-resolved nonadiabatic electronic spectra with surface hopping or Ehrenfest dynamics

We derive a somewhat crude, yet very efficient semiclassical approximation for computing nonadiabatic spectra. The resulting method, which is a generalization of the multiple-surface dephasing representation, includes quantum effects through interference of mixed quantum-classical trajectories and through quantum treatment of the collective electronic degree of freedom. The method requires very little computational effort beyond the fewest-switches surface hopping or Ehrenfest locally mean-field dynamics and is very easy to implement. The proposed approximation is tested by computing the absorption and time-resolved stimulated emission spectra of pyrazine using the four-dimensional three-surface model which allows for comparison with the numerically exact quantum spectra. As expected, the multiple-surface dephasing representation is not suitable for high-resolution linear spectra, yet it seems to capture all the important features of pump-probe spectra. Finally, the method is combined with on-the-fly ab initio evaluation of the electronic structure (i.e., energies, forces, electric-dipole, and nonadiabatic couplings) in order to compute fully dimensional nonadiabatic spectra of pyrazine without approximations inherent to analytical, including vibronic-coupling models. The Appendix provides derivations of perturbative expressions for linear and pump-probe spectra of arbitrary mixed states and for arbitrary laser pulse shapes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

First-principles energetics of water clusters and ice: A many-body analysis

Standard forms of density-functional theory (DFT) have good suggestive power for many materials, but are not yet fully satisfactory for cluster, solid, and liquid forms of water. Current work has stressed the importance of DFT errors in describing dispersion, but we note that errors in other parts of the energy may also contribute. We obtain information about the nature of DFT errors by using a many-body separation of the total energy into its 1-body, 2-body, and beyond-2-body components to analyze the deficiencies of the popular PBE and BLYP approximations for the energetics of water clusters and ice structures. The errors of these approximations are computed by using accurate benchmark energies from the coupled-cluster technique of molecular quantum chemistry and from quantum Monte Carlo calculations. The systems studied are isomers of the water hexamer cluster, the crystal structures Ih, II, XV, and VIII of ice, and two clusters extracted from ice VIII. For the binding energies of these systems, we use the machine-learning technique of Gaussian Approximation Potentials to correct successively for 1-body and 2-body errors of the DFT approximations. We find that even after correction for these errors, substantial beyond-2-body errors remain. The characteristics of the 2-body and beyond-2-body errors of PBE are completely different from those of BLYP, but the errors of both approximations disfavor the close approach of non-hydrogen-bonded monomers. We note the possible relevance of our findings to the understanding of liquid water.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A fast mollified impulse method for biomolecular atomistic simulations

Classical integration methods for molecular dynamics are inherently limited due to resonance phenomena occurring at certain time-step sizes. The mollified impulse method can partially avoid this problem by using appropriate filters based on averaging or projection techniques. However, existing filters are computationally expensive and tedious in implementation since they require either analytical Hessians or they need to solve nonlinear systems from constraints. In this work we follow a different approach based on corotation for the construction of a new filter for (flexible) biomolecular simulations. The main advantages of the proposed filter are its excellent stability properties and ease of implementation in standard softwares without Hessians or solving constraint systems. By simulating multiple realistic examples such as peptide, protein, ice equilibrium and ice–ice friction, the new filter is shown to speed up the computations of long-range interactions by approximately 20%. The proposed filtered integrators allow step sizes as large as 10 fs while keeping the energy drift less than 1% on a 50 ps simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗

Relaxed Multibang Regularization for the Combinatorial Integral Approximation

Multibang regularization and combinatorial integral approximation decompositions are two actively researched techniques for integer optimal control. In this work, we consider a class of polyhedral functions that arise particularly as convex lower envelopes of multibang regularizers and show that they have beneficial properties with respect to regularization of relaxations of integer optimal control problems. We extend the algorithmic framework of the combinatorial integral approximation such that a subsequence of the computed discrete-valued controls converges to the infimum of the regularized integer control problem.

97 MATHEMATICS AND COMPUTING↗

Auto covariance computer

A laser velocimeter covariance processor which calculates the auto covariance and cross covariance functions for a turbulent flow field based on Poisson sampled measurements in time from a laser velocimeter is described. The device will process a block of data that is up to 4096 data points in length and return a 512 point covariance function with 48-bit resolution along with a 512 point histogram of the interarrival times which is used to normalize the covariance function. The device is designed to interface and be controlled by a minicomputer from which the data is received and the results returned. A typical 4096 point computation takes approximately 1.5 seconds to receive the data, compute the covariance function, and return the results to the computer.

Hepner, T. E.↗

Anderson acceleration with approximate calculations: Applications to scientific computing

Here we provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the convergence of AA is maintained while the computational time could be reduced. We also provide computable heuristic quantities, guided by the theoretical error bounds, which can be used to automate the tuning of accuracy while performing approximate calculations. For linear problems, the use of heuristics to monitor the error introduced by approximate calculations, combined with the check on monotonicity of the residual, ensures the convergence of the numerical scheme within a prescribed residual tolerance. Motivated by the theoretical studies, we propose a reduced variant of AA, which consists in projecting the least-squares used to compute the Anderson mixing onto a subspace of reduced dimension. The dimensionality of this subspace adapts dynamically at each iteration as prescribed by the computable heuristic quantities. We numerically show and assess the performance of AA with approximate calculations on: (i) linear deterministic fixed-point iterations arising from the Richardson's scheme to solve linear systems with open-source benchmark matrices with various preconditioners and (ii) non-linear deterministic fixed-point iterations arising from non-linear time-dependent Boltzmann equations.

97 MATHEMATICS AND COMPUTING↗

Data-driven wind turbine wake modeling via probabilistic machine learning

Wind farm design primarily depends on the variability of the wind turbine wake flows to the atmospheric wind conditions and the interaction between wakes. Physics-based models that capture the wake flow field with high-fidelity are computationally very expensive to perform layout optimization of wind farms, and, thus, data-driven reduced-order models can represent an efficient alternative for simulating wind farms. In this work, we use real-world light detection and ranging (LiDAR) measurements of wind-turbine wakes to construct predictive surrogate models using machine learning. Specifically, we first demonstrate the use of deep autoencoders to find a low-dimensional latent space that gives a computationally tractable approximation of the wake LiDAR measurements. Then, we learn the mapping between the parameter space and the (latent space) wake flow fields using a deep neural network. Additionally, we also demonstrate the use of a probabilistic machine learning technique, namely, Gaussian process modeling, to learn the parameter-space-latent-space mapping in addition to the epistemic and aleatoric uncertainty in the data. Finally, to cope with training large datasets, we demonstrate the use of variational Gaussian process models that provide a tractable alternative to the conventional Gaussian process models for large datasets. Furthermore, we introduce the use of active learning to adaptively build and improve a conventional Gaussian process model predictive capability. Overall, we find that our approach provides accurate approximations of the wind-turbine wake flow field that can be queried at an orders-of-magnitude cheaper cost than those generated with high-fidelity physics-based simulations.

Deep neural networks↗

Cold, dilute spinless particles interacting via a weak, finite-range potential: an application of asymptotic approximation of integrals in computational physics

The properties of many-particle quantum systems can change drastically if the particles are attractive overall (e.g. a Fermi gas of atoms can become a Bose gas of dimers). It is therefore important to know if pairing can occur, particularly in the dilute strong coupling limit. We focus on cold helium atoms, which interact weakly via a finite-range potential. This problem can, of course, be approached numerically. However, with the extremely delicate balance of kinetic and potential energy, how do we know we can trust the number (e.g. the binding energy) that the computer produces? We could try several numerical schemes implemented with utmost care, and if they agree, we might feel confident in the answer. However, this does not constitute a proof: each scheme could be making the same mistake. We implement, instead, an analytical approach with guaranteed error bounds, which exploits an accident of Nature; namely, a small parameter in the pair wave function that invites the use of asymptotic theory. Leveraging the true long-range form of the wave function, a variational approach for bounds on the binding energy and dimer size produces integrals of a form that is well-known in the theory of asymptotic approximation of integrals. Despite being 'merely' a variational method, the upper bound obtained for the binding energy of the {sup 4}He{sub 2} dimer in three dimensions is remarkably close to a recent experimental value of 1.7 mK. Moreover, the calculated variational dimer size is also good. We have demonstrated the analytical framework by simulating the search for {sup 3}He{sub 2}, {sup 4}He{sub 2} and {sup 3}He-{sup 4}He dimers in one, two and three dimensions. The details will be published elsewhere.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data free inference with processed data products

Here, we consider the context of probabilistic inference of model parameters given error bars or confidence intervals on model output values, when the data is unavailable. We introduce a class of algorithms in a Bayesian framework, relying on maximum entropy arguments and approximate Bayesian computation methods, to generate consistent data with the given summary statistics. Once we obtain consistent data sets, we pool the respective posteriors, to arrive at a single, averaged density on the parameters. This approach allows us to perform accurate forward uncertainty propagation consistent with the reported statistics.

97 MATHEMATICS AND COMPUTING↗