Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 757 records · Page 42

Nonlinear filters for efficient shock computation

A new type of methods for the numerical approximation of hyperbolic conservation laws with discontinuous solution is introduced. The methods are based on standard finite difference schemes. The difference solution is processed with a nonlinear conservation form filter at every time level to eliminate spurious oscillations near shocks. It is proved that the filter can control the total variation of the solution and also produce sharp discrete shocks. The method is simpler and faster than many other high resolution schemes for shock calculations. Numerical examples in one and two space dimensions are presented.

Engquist, Bjorn↗

An Efficient and Accurate Algorithm for Computing Grid-Averaged Solar Fluxes for Horizontally Inhomogeneous Clouds

A computationally efficient method is presented to account for the horizontal cloud inhomogeneity by using a radiatively equivalent plane parallel homogeneous (PPH) cloud. The algorithm can accurately match the calculations of the reference (rPPH) independent column approximation (ICA) results, but use only the same computational time required for a single plane parallel computation. The effective optical depth of this synthetic sPPH cloud is derived by exactly matching the direct transmission to that of the inhomogeneous ICA cloud. The ffective9 scattering asymmetry factor is found from a pre-calculated albedo inverse look-up-table that is allowed to vary over the range from -1.0 to 1.0. In the special cases of conservative scattering and total absorption, the synthetic method is exactly equivalent to the ICA, with only a small bias (about 0.2% in flux) relative to ICA due to imperfect interpolation in using the look-up tables. In principle, the ICA albedo can be approximated accurately regardless of cloud inhomogeneity. For a more complete comparison, the broadband shortwave albedo and transmission calculated from the synthetic sPPH cloud and averaged over all incident directions, have the RMS biases of 0.26% and 0.76%, respectively, for inhomogeneous clouds over a wide variation of particle size. The advantages of the synthetic PPH method are that (1) it is not required that all the cloud subcolumns have uniform microphysical characteristic, (2) it is applicable to any 1D radiative transfer scheme, and (3) it can handle arbitrary cloud optical depth distributions and an arbitrary number of cloud subcolumns with uniform computational efficiency.

cloud inhomogeneity↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Comparison of heliospheric current sheet structure obtained from potential magnetic field computations and from observed polarization coronal brightness

A comparison is conducted of the structure of the heliospheric current sheet early in sunspot cycle 21 as computed from the observed photospheric magnetic field with a potential field approximation and as inferred from synoptic maps of the observed coronal polarization brightness. On most of the solar rotations compared, the two methods give essentially the same results; the basic shape of the warped current sheet and the amplitude (in solar latitude) of the displacements of the sheet from the solar equator are similar. On one rotation the current sheet computed with the potential field approximation appears to be distorted by a large photospheric region of unbalanced magnetic flux.

Wilcox, J. M.↗

Interpolation Method Needed for Numerical Uncertainty Analysis of Computational Fluid Dynamics

Using Computational Fluid Dynamics (CFD) to predict a flow field is an approximation to the exact problem and uncertainties exist. There is a method to approximate the errors in CFD via Richardson's Extrapolation. This method is based off of progressive grid refinement. To estimate the errors in an unstructured grid, the analyst must interpolate between at least three grids. This paper describes a study to find an appropriate interpolation scheme that can be used in Richardson's extrapolation or other uncertainty method to approximate errors. Nomenclature

CFD↗

Analysis and computation of viscous subsonic primary and secondary flows

A new approximate flow analysis, designed to enable numerical solution as an initial value problem, is developed for a wide class of viscous subsonic flows at high Reynolds number and in straight or smoothly curved three-dimensional flow geometries. The analysis is coordinate-independent and corrects an a priori known inviscid primary flow for viscous and thermal effects, secondary flows, total pressure distortion, internal flow blockage and pressure drop. Computed results include laminar solutions for three-dimensional boundary layer flow, fully viscous flow in circular arc ducts, and also flow in a curved duct shaped like a turbine blade passage.

Briley, W. R.↗

As-built design specification for PARHIS

The program is part of the CLASFYG package. It produces histograms of the greeness profile derived parameters alpha, beta, t sub o, and chi squared, which are computed by the CLASFYG program. Alpha is the approximate greeness rise time, beta is the approximate greeness decay time, t sub o is the spectral crop emergence date, and chi squared per degree of freedom is the goodness of fit of the actual data to the computed greeness profile. The program also produces statistical information concerning the parameters.

Tompkins, M. A.↗

Computational structures technology

Computational structures technology (CST), which has emerged from FEM developments, is a fusion of materials modeling, structural and dynamic analysis and synthesis methods, on the one hand, and numerical analysis and approximation theory, on the other. In addition to computational materials modeling, CST encompasses computational methods for predicting the response, performance, failure, and service life of structures and their components, as well as automated methods for structural synthesis and optimization.

Noor, Ahmed K.↗

Atmospheric transfer of radiation above an inhomogeneous non-Lambertian reflective ground. II - Computational considerations and results

The theoretical foundation for solution of the three-dimensional radiative transfer problem described in the preceding paper is reviewed. Practical considerations involved in implementing the Fourier transform/Gauss-Seidel method on a minicomputer are discussed, along with derivations of symmetry relations and approximations which can be used to enhance the computational efficiency. Model results for a surface whose albedo varies as a step function are presented and compared with published solutions obtained by using the Monte Carlo method.

Diner, D. J.↗

Optimization Algorithms as Quantum Performance Benchmarks

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) have the potential to demonstrate significant run-time performance benefits over current state-of-the-art solutions. Using existing methods for characterizing classical optimization algorithms, we analyze solution quality obtained by solving Max-Cut problems using a quantum annealing device and gate-model quantum simulators and devices. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through effective visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. The framework is an enhancement to the existing open-source QED-C Application-Oriented Benchmark suite and can connect to the open-source analysis libraries. The suite can be executed on various quantum simulators and quantum hardware systems.

benchmarking↗

Ab initio ground states of strongly-correlated materials on quantum computers

The accurate first-principles description of strongly-correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving accurate many-body Hamiltonians including strong correlations, representing a subspace of interest of a material, using density functional theory calculations as a starting point. However, the solution of these material-specific models can scale exponentially on classical computers, constituting a challenge. Here we propose that utilizing quantum computers for obtaining the properties of downfolded Hamiltonians yields an accurate description of the ground state properties of strongly-correlated systems, while circumventing the exponential scaling problem. We benchmark the solution of Hubbard-like models obtained through downfolding by utilizing a classical tensor network implementation of variational quantum eigensolvers (VQE), and we reveal a strategy for driving the optimization through a hybrid minimization of the energy and maximization of the overlap with an approximate solution obtained through low-cost computational methods. This results in a reduction of the energy error by orders of magnitude compared to conventional VQE approaches, and allows us to reproduce long-range correlations for the first time. We demonstrate our first-principles approach for diverse strongly-correlated materials, correctly predicting the antiferromagnetic state of one-dimensional cuprate Ca 2 CuO 3 , the excitonic ground state of monolayer WTe2, and the charge-ordered state of correlated metal SrVO 3 . Our efficient computational implementation allows us to simulate large systems with up to 54 qubits and encompassing up to four correlated bands, which is indicative of the complexity that our framework can address.

Antonios M Alvertis↗

Calculation of unsteady transonic aerodynamics for oscillating wings with thickness (computer program)

A computer program has been developed to account approximately for the effects of finite wing thickness in the transonic potential flow over an oscillating wing of finite span. The program is based on the original sonic-box program of Rodemich and Andrew, and accounts for the nonuniform flow caused by finite thickness by application of the local linearization concept. A brief description of each subroutine is given, and the method of input is shown in detail. A sample problem as well as a complete listing of the computer program are presented.

Ruo, S. Y.↗

An improved error analysis of finite element solutions for postbuckled plates

The accurate calculation of stresses at boundaries and interfaces where FEM analysis may be unreliable is presently undertaken by an error analysis that derives a continuous approximation to discrete finite-element data, which can be differentiated to compute continuous stresses for component-failure predictions. An evaluation is conducted of this approximation in the context of the nonlinear PDEs. A novel interpolation formula which is a simple modification of the double Fourier sine series is used to reduce truncation errors near the rectangular plate boundary by means of an 'extended grid'. Results are presented from a FEM solution, a conventional double-Fourier series' continuous approximation, and a solution applying interpolation on the extended grid, which yields superior convergence properties near the plate boundaries.

Sistla, Rajaram↗

Size-reduction techniques for the determination of efficient aeroservoelastic models

Size-reduction techniques for determining efficient time-domain state-space aeroservoelastic models are presented. Various rational function approximation methods of the unsteady aerodynamic force coefficients are brought to a common motion, emphasizing their differences. Among these, the classic Roger's method is the easier to apply but its resulting number of aerodynamic states is typically equal to or larger than the number of structural states. On the other hand, the minimum-state (MS) method, which typically reduces the number of aerodynamic states by 70 percent or more, requires the solution of an iterative nonlinear least-square solution. The MS computational efforts are reduced significantly when three approximation constraints are applied.

Karpel, Mordechay↗

Solution of 3-dimensional time-dependent viscous flows. Part 2: Development of the computer code

There is considerable interest in developing a numerical scheme for solving the time dependent viscous compressible three dimensional flow equations to aid in the design of helicopter rotors. The development of a computer code to solve a three dimensional unsteady approximate form of the Navier-Stokes equations employing a linearized block emplicit technique in conjunction with a QR operator scheme is described. Results of calculations of several Cartesian test cases are presented. The computer code can be applied to more complex flow fields such as these encountered on rotating airfoils.

Weinberg, B. C.↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^8 determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

J Wayne Mullinax↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗