Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximation methods”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

An efficient method to estimate the probability density of seismic Green's functions

We present a computationally efficient method to approximate the probability distribution of seismic Green's functions given the uncertainty of an Earth model. The method is based on the Karhunen-Loève (KL) theorem and an approximation of the Green's function (or seismogram) covariance. Using Monte Carlo (MC) simulations as a control case, we demonstrate that our KL-based method can accurately reproduce a probability distribution of seismograms that results from an uncertain Earth model for a MC-derived seismogram covariance. We then describe a method to estimate the covariance of the seismograms resulting from those Earth models that is not based on MC simulations. We use the estimated Green's function covariance in conjunction with our KL-based method to produce a Green's function probability distribution, and compare that distribution to a Green's function probability distribution produced using a MC finite difference method. We find that the Green's function probability distribution approximated using our KL-based method generally mimics that produced using the MC simulations, especially for direct-arriving body waves. However the accuracy of the KL-based method generally decreases for later times in the simulated Green's function distribution.

58 GEOSCIENCES↗
DOE OSTI2018

Rational RBF-based partition of unity method for efficiently and accurately approximating 3D objects

We consider the problem of reconstructing 3D objects via meshfree interpolation methods. In this framework, we usually deal with large data sets and thus develop an efficient local scheme via the well-known partition of unity method. The main contribution in this paper consists in constructing the local interpolants for the implicit interpolation by means of rational radial basis functions. Numerical experiments, devoted to test the accuracy of the scheme, confirm that the proposed method is particularly performing when 3D objects, or more in general implicit functions defined by scattered points, need to be approximated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An Ellipsoidal Model for Small Multilayer Particles

This paper presents an ellipsoidal model that is constructed for small layered nonspherical particles and methods for constructing “effective” multilayer ellipsoids, the light-scattering properties of which would be close to the corresponding properties of original particles. In the case of axisymmetric particles, prolate or oblate spheroids (ellipsoids of revolution) are implied. Numerical calculations of the polarizability and scattering cross sections of small layered nonspherical particles, including nonconfocal (similar) spheroids, Chebyshev particles, and pseudospheroids, are performed by different approximate and rigorous methods. Approximate approaches involve the use of an ellipsoidal model, in which the polarizability of a layered particle is determined in two ways. In the first case, the polarizability is calculated in the approximation of confocal spheroids, while, in the second case, it is sought as a linear combination of the polarizabilities of embedded spheroids proportionally to the volumes of layers. Among rigorous methods, the extended boundary conditions method and the generalized separation of variables method are applied. On the basis of a comparison of the results obtained with rigorous and approximate approaches, their drawbacks and advantages are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Numerical multi-scaling method to solve the linear stochastic partial differential equations

In this paper, we propose a multi-scaling method to solve a class of the stochastic partial differential equations (SPDEs) of Itô-type. By this method, we approximate the solution of the SPDEs with strongly elliptic operator on a finite domain. The method is based on B-spline wavelet approximations; some of these functions are reshaped to satisfy on boundary conditions exactly. We prove the consistency and stability of the method. Illustrative examples are included to demonstrate the validity and applicability of our proposed technique.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Accelerated solution of discrete ordinates approximation to the Boltzmann transport equation via model reduction

Radiation heat transfer is an important phenomenon in many physical systems of practical interest. When participating media is important, the radiative transfer equation (RTE) must be solved for the radiative intensity as a function of location, time, direction, and wavelength. In many heat-transfer applications, a quasi-steady assumption is valid, thereby removing time dependence. The dependence on wavelength is often treated through a weighted sum of gray gases (WSGG) approach. The discrete ordinates method (DOM) is one of the most common methods for approximating the angular (i.e., directional) dependence. The DOM exactly solves for the radiative intensity for a finite number of discrete ordinate directions and computes approximations to integrals over the angular space using a quadrature rule; the chosen ordinate directions correspond to the nodes of this quadrature rule. This paper applies a projection-based model-reduction approach to make high-order quadrature computationally feasible for the DOM for purely absorbing applications. First, the proposed approach constructs a reduced basis from (high-fidelity) solutions of the radiative intensity computed at a relatively small number of ordinate directions. Then, the method computes inexpensive approximations of the radiative intensity at the (remaining) quadrature points of a high-order quadrature using a reduced-order model constructed from the reduced basis. Finally, this results in a much more accurate solution than might have been achieved using only the ordinate directions used to compute the reduced basis. One- and three-dimensional test problems highlight the efficiency of the proposed method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Nucleon clustering at kinetic freezeout of heavy-ion collisions via path-integral Monte Carlo

Clustering of the four-nucleon system at kinetic freezeout conditions is studied using path-integral Monte Carlo techniques. This method seeks to improve upon previous calculations which relied on approximate semiclassical methods or few-body quantum mechanics. Estimates are given for the decay probabilities of the 4N system into various light nuclei decay channels and the strength of spatial correlations is characterized. Additionally, a simple model is presented to describe the impact of this clustering on nucleon multiplicity distributions. Additionally, the effects of a possible modification of the inter-nucleon interaction due to the close critical line (and hypothetical QCD critical point) on the clustering are also studied.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Trigonometric polynomial approximation, K-functionals and generalized moduli of smoothness

Best approximation and approximation by families of linear polynomial operators (FLPO) in the spaces L{sub p}, 0<p⩽+∞, are investigated for periodic functions of an arbitrary number of variables in terms of the generalized modulus of smoothness generated by a periodic generator which, near the origin, is assumed to be close in a certain sense to some homogeneous function of positive order. Direct and inverse theorems (Jackson- and Bernstein-type estimates) are proved; conditions on the generators are obtained under which the approximation error by an FLPO is equivalent to an appropriate modulus of smoothness. These problems are solved by going over from the modulus to an equivalent K-functional. The general results obtained are applied to classical objects in the theory of approximation and smoothness. In particular, they are applied to the methods of approximation generated by Fejér, Riesz and Bochner-Riesz kernels, and also to the moduli of smoothness and K-functionals corresponding to the conventional, Weyl and Riesz derivatives and to the Laplace operator. Bibliography: 24 titles. (paper)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The Transference Number

The performance of rechargeable batteries and other electrochemical systems depends on the rate at which the working ion (often a cation) is transported from one electrode to the other. The cation transference number is an important transport parameter that affects this rate. The purpose of this perspective is to distinguish between approximate and rigorous methods used in the literature to measure the transference number. We emphasize the fact that this parameter is dependent on the reference frame used in the analysis; care must be taken when comparing values obtained from different sources to account for differences in reference frames. We present data obtained from a well‐characterized electrolyte. We compare rigorously determined transference numbers in two reference frames with values obtained by an approximate method. We conclude with a qualitative discussion of the relationship between the transference number and salt concentration gradients that are obtained when current is drawn through a battery.

Gao, Kevin W.↗
DOE OSTI2021

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗
DOE OSTI2015

Fourth order exponential time differencing method with local discontinuous Galerkin approximation for coupled nonlinear Schrodinger equations

In this paper, we study a local discontinuous Galerkin method combined with fourth order exponential time differencing Runge-Kutta time discretization and a fourth order conservative method for solving the nonlinear Schrödinger equations. Based on different choices of numerical fluxes, we propose both energy-conserving and energy-dissipative local discontinuous Galerkin methods, and have proven the error estimates for the semi-discrete methods applied to linear Schrödinger equation. The numerical methods are proven to be highly efficient and stable for long-range soliton computations. Finally, extensive numerical examples are provided to illustrate the accuracy, efficiency and reliability of the proposed methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Automated detection of pulmonary nodules in PET/CT images: Ensemble false-positive reduction using a convolutional neural network technique

Purpose: Automated detection of solitary pulmonary nodules using positron emission tomography (PET) and computed tomography (CT) images shows good sensitivity; however, it is difficult to detect nodules in contact with normal organs, and additional efforts are needed so that the number of false positives (FPs) can be further reduced. In this paper, the authors propose an improved FP-reduction method for the detection of pulmonary nodules in PET/CT images by means of convolutional neural networks (CNNs). Methods: The overall scheme detects pulmonary nodules using both CT and PET images. In the CT images, a massive region is first detected using an active contour filter, which is a type of contrast enhancement filter that has a deformable kernel shape. Subsequently, high-uptake regions detected by the PET images are merged with the regions detected by the CT images. FP candidates are eliminated using an ensemble method; it consists of two feature extractions, one by shape/metabolic feature analysis and the other by a CNN, followed by a two-step classifier, one step being rule based and the other being based on support vector machines. Results: The authors evaluated the detection performance using 104 PET/CT images collected by a cancer-screening program. The sensitivity in detecting candidates at an initial stage was 97.2%, with 72.8 FPs/case. After performing the proposed FP-reduction method, the sensitivity of detection was 90.1%, with 4.9 FPs/case; the proposed method eliminated approximately half the FPs existing in the previous study. Conclusions: An improved FP-reduction scheme using CNN technique has been developed for the detection of pulmonary nodules in PET/CT images. The authors’ ensemble FP-reduction method eliminated 93% of the FPs; their proposed method using CNN technique eliminates approximately half the FPs existing in the previous study. These results indicate that their method may be useful in the computer-aided detection of pulmonary nodules using PET/CT images.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗
DOE OSTI2015

A new efficient approach for 3D hydrodynamics simulation

LANL’s CHICOMA code solves the compressible hydrodynamic equations on moving tetrahedral grids. Hydrodynamic equations can be solved in Lagrangian, Eulerian, and Arbitrary Lagrangian-Eulerian reference frames. The equations are solved using a finite element method coupled to approximate Riemann solvers. The methods have been extensively verified against relevant analytical solutions. CHICOMA is 10 3 -10 4 times faster than current production codes for the same level of accuracy!

42 ENGINEERING↗
DOE OSTI2022

Well-Balanced Second-Order Convex Limiting Technique for Solving the Serre–Green–Naghdi Equations

In this article, we introduce a numerical method for approximating the dispersive Serre–Green–Naghdi equations with topography using continuous finite elements. The method is an extension of the hyperbolic relaxation technique introduced in Guermond et al. (J Comput Phys 450:110809, 2022). It is explicit, second-order accurate in space, third-order accurate in time, and is invariant-domain preserving. It is also well balanced and parameter free. Special attention is given to the convex limiting technique when physical source terms are added in the equations. The method is verified with academic benchmarks and validated by comparison with laboratory experimental data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Deep Koopman operators for causal discovery

Causal discovery aims to identify cause-effect mechanisms for better scientific understanding, explainable decision-making, and more accurate modeling. Standard statistical frameworks, such as Granger causality, lack the ability to quantify causal relationships in nonlinear dynamics due to the presence of complex feedback mechanisms, timescale mixing, and nonstationarity. Thus, applying these methods to study causal dynamics in real-world systems, such as the Earth, is a major challenge. Addressing this shortcoming, we leverage deep learning and a Koopman operator-theoretic formalism to present a class of causal discovery algorithms. Kausal uses deep Koopman operator methods to approximate nonlinear dynamics in a linearized vector space in which traditional causal inference methods such as Granger causality can be more easily applied. Our idealized experiments demonstrate Kausal’s superior ability in discovering and characterizing causal signals compared to existing deep learning and non-deep learning state-of-the-art approaches. Finally, the successful identification of major El Niño and La Niña events in observations showcases Kausal’s skill to handle real-world applications.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Supervised Learning for Distribution Secondary Systems Modeling: Improving Solar Interconnection Processes

The current interconnection process and hosting capacity analysis for distributed energy resources (DERs), such as photovoltaics (PV) and battery energy storage systems, are based on analyzing grid network constraints (voltage and thermal) using only medium-voltage distribution network models. This is because most utilities do not have secondary low-voltage system models that connect service transformers and residential customers. This is important because in many cases the main impact of interconnecting DERs could occur on the low-voltage distribution systems. This paper proposes a supervised learning method to approximate local secondary models to improve the interconnection process. The proposed supervised learning method includes a decision tree model that predicts the secondary topology and a logistic regression model that predicts conductor types. The case studies demonstrate the benefits of including secondary low-voltage circuits in the interconnection process. We report the proposed modeling methodology is readily scalable and thus can reduce the cost and effort of PV interconnection for the industry and stakeholders.

14 SOLAR ENERGY↗
DOE OSTI2016

Computed Tomography by Combining Transmission and Scatter Radiography Methods

In 2015, approximately 13 billion tons of freight was transported in the US, roughly 40 tons per person. 40% of all freight on a ton-mile basis will be transported by railroads. Class I railroads have approximately 140,000 miles (224,000 km) of railroad track across the country. Approximately 3,200 crossties per mile secure the rails at the proper gauge, transmit loads to the ballast, and prevent lateral and longitudinal shifting. Wood crossties can fail in many ways including rotting, breaking, cracking, and splitting. Developing new technologies to inspect these crossties are necessary to help maintain and ensure safe railroad operations. The Georgetown Railroad Equipment Company partnered with the University of Florida to develop the Aurora Xi X-ray backscatter inspection system. This system generates 2D backscatter images at 25 mph to detect weakness in wood crossties long before the internal degradation is visible on the tie surface. The railroad industry has a need for a high-speed high resolution 3D inspection method to inspect approximately 20 million newly fabricated railroad crossties per year. Currently new ties are not radiographically inspected to reject internal flaws and verify that rot prevention treatments have adequately penetrated into the crosstie. Current spiral scan computed tomography (CT) systems are not designed for the 100 cm/s to 400 cm/s speed of a wood crosstie production line. Building on the technology developed for the 2D Aurora Xi system, a new 3D fan-beam inspection system and CT method is being developed. A previous scatter CT method by Arsenault and Hussein required moving the Xray source to many positions, averaging the X-ray spectra, and ignoring the Compton scatter change of energy. The proposed design and method combines transmission and scatter radiography in all directions without moving or rotating the X-ray sources or detectors. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗