SEARCH · Engineering Papers
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.
Meshless Methods for Manifolds GMLS Approximations of Hydrodynamic Responses in Curved Fluid Interfaces.
Abstract not provided.
Sparse Approximate Multifrontal Factorization with Composite Compression Methods
This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.
A new approach to three-dimensional neutron transport solution based on the method of characteristics and linear axial approximation
A new approach based on the method of characteristics (MOC) is proposed to solve the neutron transport equation. A new three-dimensional (3D) spatial discretization is applied to avoid the instability issue of the transverse leakage iteration of the traditional 2D/1D approach. In this new approach, the axial and radial variables are discretized in two different ways: the linear expansion is performed in the axial direction, then, the 3D solution of the angular flux is transformed to be the planar solution of 2D angular expansion moments, which are solved by the planar MOC sweeping. Based on the boundary and interface continuity conditions, the 2D expansion moment solution is equivalently transformed to be the solution of the axially averaged angular flux. Using the piecewise averaged angular flux at the top and bottom surfaces of 3D meshes, the planes are coupled to give the 3D angular flux distribution. The 3D CMFD linear system is established from the surface net current of every 3D pin-mesh to accelerate the convergence of power iteration. The STREAM code is extended to be capable of handling 3D problems based on the new approach. Several benchmarks are tested to verify its feasibility and accuracy, including the 3D homogeneous benchmarks and heterogeneous benchmarks. The computational sensitivity is discussed. The results show good accuracy in all tests. With the CMFD acceleration, the convergence is stable. In addition, a pin-cell problem with void gap is calculated. This shows the advantage compared to the traditional 2D/1D MOC methods.
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.
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.
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.
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.
Geometric multigrid for an implicit-time immersed boundary method
The immersed boundary (IB) method is an approach to fluid-structure interaction that uses Lagrangian variables to describe the deformations and resulting forces of the structure and Eulerian variables to describe the motion and forces of the fluid. Explicit time stepping schemes for the IB method require solvers only for Eulerian equations, for which fast Cartesian grid solution methods are available. Such methods are relatively straightforward to develop and are widely used in practice but often require very small time steps to maintain stability. Implicit-time IB methods permit the stable use of large time steps, but efficient implementations of such methods require significantly more complex solvers that effectively treat both Lagrangian and Eulerian variables simultaneously. Moreover, several different approaches to solving the coupled Lagrangian-Eulerian equations have been proposed, but a complete understanding of this problem is still emerging. This paper presents a geometric multigrid method for an implicit-time discretization of the IB equations. This multigrid scheme uses a generalization of box relaxation that is shown to handle problems in which the physical stiffness of the structure is very large. Numerical examples are provided to illustrate the effectiveness and efficiency of the algorithms described herein. Finally, these tests show that using multigrid as a preconditioner for a Krylov method yields improvements in both robustness and efficiency as compared to using multigrid as a solver. They also demonstrate that with a time step 100–1000 times larger than that permitted by an explicit IB method, the multigrid-preconditioned implicit IB method is approximately 50–200 times more efficient than the explicit method.
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.
Approximate Hessian for accelerating ab initio structure relaxation by force fitting
We present a method to approximate the Hessian matrix of the Born-Oppenheimer energy landscape by using a simple force field model whose parameters are fitted to on-the-flight ab initio results. The inversed Hessian matrix is used as the preconditioner of conjugate gradient algorithms to speed up the atomic structure relaxation, resulting in a speedup factor of 2 to 5 on systems of bulk, slab, sheets, and atomic clusters. Because the force field model employed is simple and general, the parameter fitting is straightforward; the method is applicable to a variety of complicated systems for minimum structure relaxation. In the metal cluster new structure search, the new method yields better structures than the one obtained before with conventional algorithms.
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.
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)
Excitations and spectra from equilibrium real-time Green's functions
Not Available
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.
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.
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.