Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximation”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Recent advances in approximation concepts for optimum structural design

The basic approximation concepts used in structural optimization are reviewed. Some of the most recent developments in that area since the introduction of the concept in the mid-seventies are discussed. The paper distinguishes between local, medium-range, and global approximations; it covers functions approximations and problem approximations. It shows that, although the lack of comparative data established on reference test cases prevents an accurate assessment, there have been significant improvements. The largest number of developments have been in the areas of local function approximations and use of intermediate variable and response quantities. It also appears that some new methodologies are emerging which could greatly benefit from the introduction of new computer architecture.

Barthelemy, J.-F. M.↗
NASA NTRS1953

Analytical Derivation and Experimental Evaluation of Short-Bearing Approximation for Full Journal Bearing

An approximate analytical solution including the effect of end leakage from the oil film of short plain bearings is presented because of the importance of endwise flow in sleeve bearings of the short lengths commonly used. The analytical approximation is supported by experimental data, resulting in charts which facilitate analysis of short plain bearings. The analytical approximation includes the endwise flow and that part of the circumferential flow which is related to surface velocity and film thickness but neglects the effect of film pressure on the circumferential flow. In practical use, this approximation applies best to bearings having a length-diameter ratio up to 1, and the effects of elastic deflection, inlet oil pressure, and changes of clearance with temperature minimize the relative importance of the neglected term. The analytical approximation was found to be an extension of a little-known pressure-distribution function originally proposed by Michell and Cardullo.

Dubois, George B↗
NASA NTRS1990

Improved approximations of displacements for structural optimization

In most structural optimization problems the implicit behavior constraints are evaluated for successive modifications in the design. For each trial design, the analysis equations must be solved and the multiple repeated analyses usually involve extensive computational effort. This difficulty motivated several studies on explicit approximations of the structural behavior in terms of the design variables. The latter approach can considerably reduce the amount of computations, but the quality of the approximations might not be sufficient. Many of the approximate behavior models proposed in the past are valid only for relatively small changes in the design variables. The accuracy of the results is often insufficient for large changes in the design. The object of this study is to present efficient and high quality approximations of the structural behavior. It will be shown that the quality of the approximations can greatly be improved by combining scaling of the initial design, using intervening variables, and scaling a set of fictitious loads. Integrating these means, a powerful solution procedure can be introduced. In addition, the errors in satisfying the analysis equations can readily be evaluated. A numerical example illustrates the solution methodology and the effectiveness of the proposed approach.

Kirsch, Uri↗
NASA NTRS1993

Rational trigonometric approximations using Fourier series partial sums

A class of approximations (S(sub N,M)) to a periodic function f which uses the ideas of Pade, or rational function, approximations based on the Fourier series representation of f, rather than on the Taylor series representation of f, is introduced and studied. Each approximation S(sub N,M) is the quotient of a trigonometric polynomial of degree N and a trigonometric polynomial of degree M. The coefficients in these polynomials are determined by requiring that an appropriate number of the Fourier coefficients of S(sub N,M) agree with those of f. Explicit expressions are derived for these coefficients in terms of the Fourier coefficients of f. It is proven that these 'Fourier-Pade' approximations converge point-wise to (f(x(exp +))+f(x(exp -)))/2 more rapidly (in some cases by a factor of 1/k(exp 2M)) than the Fourier series partial sums on which they are based. The approximations are illustrated by several examples and an application to the solution of an initial, boundary value problem for the simple heat equation is presented.

Geer, James F.↗
NASA NTRS1994

Structural optimization with approximate sensitivities

Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.

Patnaik, S. N.↗
NASA NTRS1994

On the convergence of local approximations to pseudodifferential operators with applications

We consider the approximation of a class pseudodifferential operators by sequences of operators which can be expressed as compositions of differential operators and their inverses. We show that the error in such approximations can be bounded in terms of L(1) error in approximating a convolution kernel, and use this fact to develop convergence results. Our main result is a finite time convergence analysis of the Engquist-Majda Pade approximants to the square root of the d'Alembertian. We also show that no spatially local approximation to this operator can be convergent uniformly in time. We propose some temporally local but spatially nonlocal operators with better long time behavior. These are based on Laguerre and exponential series.

Hagstrom, Thomas↗
NASA NTRS1995

An approximate Kalman filter for ocean data assimilation: An example with an idealized Gulf Stream model

A practical method of data assimilation for use with large, nonlinear, ocean general circulation models is explored. A Kalman filter based on approximation of the state error covariance matrix is presented, employing a reduction of the effective model dimension, the error's asymptotic steady state limit, and a time-invariant linearization of the dynamic model for the error integration. The approximations lead to dramatic computational savings in applying estimation theory to large complex systems. We examine the utility of the approximate filter in assimilating different measurement types using a twin experiment of an idealized Gulf Stream. A nonlinear primitive equation model of an unstable east-west jet is studied with a state dimension exceeding 170,000 elements. Assimilation of various pseudomeasurements are examined, including velocity, density, and volume transport at localized arrays and realistic distributions of satellite altimetry and acoustic tomography observations. Results are compared in terms of their effects on the accuracies of the estimation. The approximate filter is shown to outperform an empirical nudging scheme used in a previous study. The examples demonstrate that useful approximate estimation errors can be computed in a practical manner for general circulation models.

Fukumori, Ichiro↗
NASA NTRS1996

Wavelet Sparse Approximate Inverse Preconditioners

There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle and Chow and Saad also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse entries so that sparse approximate inverse is possible. However, for the class of matrices that, come from elliptic PDE problems, this assumption may not necessarily hold. Our main idea is to look for a basis, other than the standard one, such that a sparse representation of the inverse is feasible. A crucial observation is that the kind of matrices we are interested in typically have a piecewise smooth inverse. We exploit this fact, by applying wavelet techniques to construct a better sparse approximate inverse in the wavelet basis. We shall justify theoretically and numerically that our approach is effective for matrices with smooth inverse. We emphasize that in this paper we have only presented the idea of wavelet approximate inverses and demonstrated its potential but have not yet developed a highly refined and efficient algorithm.

Chan, Tony F.↗
NASA NTRS1997

Interfacing Relativistic and Nonrelativistic Methods: A Systematic Sequence of Approximations

A systematic sequence of approximations for the introduction of relativistic effects into nonrelativistic molecular finite-basis set calculations is described. The theoretical basis for the approximations is the normalized elimination of the small component (ESC) within the matrix representation of the modified Dirac equation. The key features of the normalized method are the retention of the relativistic metric and the ability to define a single matrix U relating the pseudo-large and large component coefficient matrices. This matrix is used to define a modified set of one- and two-electron integrals which have the same appearance as the integrals of the Breit-Pauli Hamiltonian. The first approximation fixes the ratios of the large and pseudo-large components to their atomic values, producing an expansion in atomic 4-spinors. The second approximation defines a local fine-structure constant on each atomic centre, which has the physical value for centres considered to be relativistic and zero for nonrelativistic centres. In the latter case, the 4-spinors are the positive-energy kinetic al ly-balanced solutions of the Levy-Leblond equation, and the integrals involving pseudo-large component basis functions on these centres, are set to zero. Some results are presented for test systems to illustrate the various approximations.

Dyall, Ken↗
NASA NTRS2004

Flexible Approximation Model Approach for Bi-Level Integrated System Synthesis

Bi-Level Integrated System Synthesis (BLISS) is an approach that allows design problems to be naturally decomposed into a set of subsystem optimizations and a single system optimization. In the BLISS approach, approximate mathematical models are used to transfer information from the subsystem optimizations to the system optimization. Accurate approximation models are therefore critical to the success of the BLISS procedure. In this paper, new capabilities that are being developed to generate accurate approximation models for BLISS procedure will be described. The benefits of using flexible approximation models such as Kriging will be demonstrated in terms of convergence characteristics and computational cost. An approach of dealing with cases where subsystem optimization cannot find a feasible design will be investigated by using the new flexible approximation models for the violated local constraints.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRS2011

A CANDELS WFC3 Grism Study of Emission-Line Galaxies at Z approximates 2: A mix of Nuclear Activity and Low-Metallicity Star Formation

We present Hubble Space Telescope Wide Field Camera 3 slitless grism spectroscopy of 28 emission-line galaxies at z approximates 2, in the GOODS-S region of the Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey (CANDELS). The high sensitivity of these grism observations, with > 5-sigma detections of emission lines to f > 2.5 X 10(exp -18( erg/s/ square cm, means that the galaxies in the sample are typically approximately 7 times less massive (median M(star). = 10(exp 9.5)M(solar)) than previously studied z approximates 2 emission-line galaxies. Despite their lower mass, the galaxies have [O-III]/H-Beta ratios which are very similar to previously studied z approximates 2 galaxies and much higher than the typical emission-line ratios of local galaxies. The WFC3 grism allows for unique studies of spatial gradients in emission lines, and we stack the two-dimensional spectra of the galaxies for this purpose. In the stacked data the [O-III] emission line is more spatially concentrated than the H-Beta emission line with 98.1% confidence. We additionally stack the X-ray data (all sources are individually undetected), and find that the average L(sub [O-III])/L(sub 0.5.10keV) ratio is intermediate between typical z approximates 0 obscured active galaxies and star-forming galaxies. Together the compactness of the stacked [O-III] spatial profile and the stacked X-ray data suggest that at least some of these low-mass, low-metallicity galaxies harbor weak active galactic nuclei.

Trump, Jonathan R.↗
NASA NTRS1994

An Approximate Kalman Filter for Ocean Data Assimilation; An Example with an Idealized Gulf Stream Model

A practical method of data assimilation for use with large, nonlinear, ocean general circulation models is explored. A Kalman filter based on approximations of the state error covariance matrix is presented, employing a reduction of the effective model dimension, the error's asymptotic steady-state limit, and a time-invariant linearization of the dynamic model for the error integration. The approximations lead to dramatic computational savings in applying estimation theory to large complex systems. We examine the utility of the approximate filter in assimilating different measurement types using a twin experiment of an idealized Gulf Stream. A nonlinear primitive equation model of an unstable east-west jet is studied with a state dimension exceeding 170,000 elements. Assimilation of various pseudo measurements is examined, including velocity, density, and volume transport at localized arrays, and realistic distributions of satellite altimetry and acoustic tomography observations. Results are compared in terms of their effects on the accuracies of the estimation. The approximate filter is shown to outperform a previous study that used an empirical nudging scheme. The examples demonstrate that useful approximate estimation errors can be computed in a practical manner for general circulation models.

['Kalman↗
NASA NTRSDate not supplied

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗
DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A Meta-Generalized Gradient Approximation for the Cavity-Dependent Exchange-Correlation Interaction in Strongly Coupled Light–Matter Systems

Strong light–matter coupling in optical cavities enables the manipulation of chemical and physical properties without altering molecular composition. Theoretical modeling of such phenomena requires exchange-correlation (XC) functionals that account for both electron–electron and electron–photon (ep) interactions within quantum electrodynamical density functional theory (QEDFT). In this work, we develop a meta-generalized gradient approximation (meta-GGA) specifically targeting the cavity-dependent XC interaction in strongly coupled light–matter systems. This novel approximation is built upon a new semilocal polarizability approximation, which draws from the jellium-with-a-gap model, and can be extended to a “global hybrid” variant that goes beyond the isotropic model from previous approximations. The polarizability model yields significantly improved dispersion coefficients and benchmark calculations with the cavity-dependent XC functional demonstrate improved agreement with QED Hartree–Fock (QED-HF) reference energies. Application to the regioselectivity of brominated nitrobenzene intermediates reveals the functional’s capacity to capture cavity-induced energetic shifts. In conclusion, our results advance the Jacob’s ladder of functionals for QEDFT and provide a practical tool for modeling polaritonic chemistry.

Approximation↗
DOE OSTI2025

Embedded random phase approximation for magnetic systems: H 2 dissociative adsorption on Fe(110)

The random phase approximation (RPA), a method for treating electron correlation, has been shown to be superior to standard density functional theory (DFT) approximations in numerous cases. However, the RPA’s computational cost is substantially higher than that of DFT, particularly restricting its application to extended surfaces. The recently introduced embedded RPA (emb-RPA) approach [Wei et al., J. Chem. Phys. 159(19), 194108 (2023)] reduces this computational cost by approximately two orders of magnitude. While previous applications of emb-RPA focused on non-spin-polarized systems, here we extend the approach to ferromagnetic ones. Unlike other embedded correlated wavefunction methods, such as embedded complete active space self-consistent field theory, emb-RPA is advantageous for spin-polarized systems because the RPA is compatible with unrestricted DFT solutions, which are eigenfunctions of the spin angular momentum operator S z but not the total spin-squared operator S 2 . By applying emb-RPA with specific magnetization constraints, we achieved a speedup of two to three orders of magnitude (one order when accounting for the one-time embedding potential optimization cost) with only small errors (∼50 meV) compared to full periodic RPA. Moreover, emb-RPA significantly reduces the over-binding errors of DFT approximations. In conclusion, we anticipate that the acceleration enabled by the spin-polarized emb-RPA approach will broaden the applicability of RPA to magnetic materials.

Density functional theory↗
DOE OSTI2024

Adaptive Power Flow Approximations With Second-Order Sensitivity Insights

The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these challenges, recent research has proposed adaptive power flow linearizations that aim to achieve accuracy over wide operating ranges. The accuracy of these approximations inherently depends on the curvature of the power flow equations within these ranges, which necessitates considering second-order sensitivities. In this paper, we leverage second-order sensitivities to both analyze and improve power flow approximations. We evaluate the curvature across broad operational ranges and subsequently utilize this information to inform the computation of various sample-based power flow approximation techniques. Additionally, we leverage second-order sensitivities to guide the development of rational approximations that yield linear constraints in optimization problems. In conclusion, this approach is extended to enhance accuracy beyond the limitations of linear functions across varied operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗