Using Approximate Nearest Neighbor Methods to Rapidly Search Large Seismic Signal Archives.
Abstract not provided.
Young, Christopher J.↗
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.
The Implementation and Application of the Adaptive Cross Approximation in the Method of Moments Code EIGER.
Abstract not provided.
Kotulski, Joseph D.↗
The Implementation and Application of the Adaptive Cross Approximation in the Method of Moments Code EIGER.
Abstract not provided.
Kotulski, Joseph D.↗
The Implementation and Application of the Adaptive Cross Approximation in the Method of Moments Code EIGER.
Abstract not provided.
Kotulski, Joseph D.↗
Multiphysics coupling plan
In this chapter, multiphysics coupling simulations of nuclear reactor systems are reviewed. On the one hand, the mainstream methods of multiphysics coupling are demonstrated. The fundamental theory and coupling scheme of operator splitting methods, Jacobian-free Newton–Krylov methods, and approximate block Newton methods are summarized and presented. On the other hand, some significant works on neutronic and thermal-hydraulic codes coupling, and large research project, including NURESAFE European project, Multiphysics Object-Oriented Simulation Environment plan, and Consortium for the Advanced Simulation of Light Water Reactors project, are reviewed. This chapter helps the readers have a better understanding on the worldwide current status of multiphysics coupling research.
Gui, Miao↗
Using Approximate Nearest Neighbor Methods to Rapidly Search Large Seismic Signal Archives.
Abstract not provided.
Slinkard, Megan Elizabeth↗
Decomposition of the configuration-interaction coefficients in the multiconfiguration time-dependent Hartree-Fock method
An approximate implementation of the multiconfiguration time-dependent Hartree-Fock method is proposed, in which the matrix of configuration-interaction coefficients is decomposed into a product of matrices of smaller dimension. The applicability of this method in which all the configurations are kept in the expansion of the wave function, while the configuration-interaction coefficients are approximately calculated, is discussed by showing the results on three model systems: a one-dimensional model of a beryllium atom, a one-dimensional model of a carbon atom, and a one-dimensional model of a chain of four hydrogen atoms. The time-dependent electronic dynamics induced by a few-cycle, long-wavelength laser pulse is found to be well described at a lower computational cost compared to the standard multiconfiguration time-dependent Hartree-Fock treatment. Drawbacks of the method are also discussed.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Efficient Ensemble-Based Stochastic Gradient Methods for Optimization Under Geological Uncertainty
Ensemble-based stochastic gradient methods, such as the ensemble optimization (EnOpt) method, the simplex gradient (SG) method, and the stochastic simplex approximate gradient (StoSAG) method, approximate the gradient of an objective function using an ensemble of perturbed control vectors. These methods are increasingly used in solving reservoir optimization problems because they are not only easy to parallelize and couple with any simulator but also computationally more efficient than the conventional finite-difference method for gradient calculations. In this work, we show that EnOpt may fail to achieve sufficient improvement of the objective function when the differences between the objective function values of perturbed control variables and their ensemble mean are large. On the basis of the comparison of EnOpt and SG, we propose a hybrid gradient of EnOpt and SG to save on the computational cost of SG. We also suggest practical ways to reduce the computational cost of EnOpt and StoSAG by approximating the objective function values of unperturbed control variables using the values of perturbed ones. We first demonstrate the performance of our improved ensemble schemes using a benchmark problem. Results show that the proposed gradients saved about 30–50% of the computational cost of the same optimization by using EnOpt, SG, and StoSAG. As a real application, we consider pressure management in carbon storage reservoirs, for which brine extraction wells need to be optimally placed to reduce reservoir pressure buildup while maximizing the net present value. Results show that our improved schemes reduce the computational cost significantly.
58 GEOSCIENCES↗
Two-dimensional isometric tensor networks on an infinite strip
The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of TNS that allows for efficient simulation of such systems on finite square lattices. The isoTNS ansatz requires the identification of an “orthogonality column” of tensors, within which one-dimensional matrix product state (MPS) methods can be used for calculation of observables and optimization of tensors. Here we extend isoTNS to infinitely long strip geometries and introduce an infinite version of the Moses Move algorithm for moving the orthogonality column around the network. Using this algorithm, we iteratively transform an infinite MPS representation of a 2D quantum state into a strip isoTNS and investigate the entanglement properties of the resulting state. In addition, we demonstrate that the local observables can be evaluated efficiently. Lastly, we introduce an infinite time-evolving block decimation algorithm (iTEBD 2 ) and use it to approximate the ground state of the 2D transverse field Ising model on lattices of infinite strip geometry.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Cluster Method of Constructing Bethe Approximation for the Ising Model of a Dilute Magnet
The paper offers an interpretation of Bethe approximation based on comparison of spin clusters of different sizes on the Cayley tree. Based on this interpretation, the authors suggested the method to construct Bethe approximation for the node- or bond-diluted Ising magnet. The method provides an accurate value of the percolation threshold for the Bethe lattice. For different variations of this method, the authors constructed spontaneous magnetizations at zero and final temperatures as a function of concentration of magnetic atoms and found an analytical expression for the critical indicator of the correlation length.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Verification and validation of the open-source plasma fluid code: Zapdos
Zapdos is an open-source finite element plasma fluid solver based on the MOOSE multiphysics framework. This paper outlines Zapdos verification, benchmarking, and validation efforts for 1D and 2D RF capacitively coupled plasma discharge models for mid-range pressures (0.1 - 1 Torr). The verification process involved using the method of manufactured solutions to assess Zapdos spatial and temporal error convergence. L2 errors ranged from 10 -2 to 10 -4 , while the convergence’s slope were in agreement with the predicted slopes for the tested variable and time integration orders. The benchmarking process involved comparisons to previously results from the validated finite element code, LSODI. These works included 1D and 2D simulations for a range of plasma parameters (densities, temperatures, voltage, etc.). For the 1D cases, Zapdos and LSODI results were in very good agreement. In the 2D cases, variable behaviors matched, with slight discrepancies in peak values. The validation process involved comparisons to experimental works including electron density measurements by microwave interferometry and metastable density measurements by planar laser-induced fluorescence imaging. Results shown reasonable agreement at higher pressure, with results starting to diverge at low pressures. Furthermore, probable causes for this diverges are the limitation of the fluid assumption for plasmas at low pressure, or the need for more robust boundary conditions. Overall, Zapdos shown reasonable results for the verification, benchmarking, and validation efforts, and Zapdos can be downloaded at https://github.com/shannon-lab/zapdos.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Physically interpretable approximations of many-body spectral functions
The rational function approximation provides a natural and interpretable representation of response functions such as the many-body spectral functions. We apply the vector fitting (VFIT) algorithm to fit a variety of spectral functions calculated from the Holstein model of electron-phonon interactions. We show that the resulting rational functions are highly efficient in their fitting of sharp features in the spectral functions, and could provide a means to infer physically relevant information from a spectral data set. The position of the peaks in the approximated spectral function are determined by the location of poles in the complex plane. Additionally, we developed a variant of VFIT that incorporates regularization to improve the quality of fits. With this procedure, we demonstrate it is possible to achieve accurate spectral function fits that vary smoothly as a function of physical conditions.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
An adaptive Hessian approximated stochastic gradient MCMC method
Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.
97 MATHEMATICS AND COMPUTING↗
Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods
In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O ( p 2d ) storage and O ( p 3d ) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O ( p d+1 ) storage, O ( p d+1 ) work in two spatial dimensions, and O ( p d+2 ) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O ( p 9 ) to O ( p 5 ) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p .
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Randomized methods to characterize large-scale vortical flow networks
We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.
97 MATHEMATICS AND COMPUTING↗
Parallel domain decomposition method for finite element approximation of 3D steady state non‐Newtonian fluids
Summary We introduce a stabilized finite element method for the 3D non‐Newtonian Navier–Stokes equations and a parallel domain decomposition method for solving the sparse system of nonlinear equations arising from the discretization. Non‐Newtonian flow problems are, generally speaking, more challenging than Newtonian flows because the nonlinearities are not only in the convection term but also in the viscosity term, which depends on the shear rate. Many good iterative methods and preconditioning techniques that work well for the Newtonian flows do not work well for the non‐Newtonian flows. We employ a Galerkin/least squares finite element method, with stabilization parameters adjusted to count the non‐Newtonian effect, to discretize the equations, and the resulting highly nonlinear system of equations is solved by a Newton–Krylov–Schwarz algorithm. In this study, we apply the proposed method to some inelastic power‐law fluid flows through the eccentric annuli with inner cylinder rotation and investigate the robustness of the method with respect to some physical parameters, including the power‐law index and the Reynolds number ratios. We then report the superlinear speedup achieved by the domain decomposition algorithm on a computer with up to 512 processors. Copyright © 2015 John Wiley & Sons, Ltd.
Shiu, Wen‐Shin↗
Extended application of Kohn-Sham first-principles molecular dynamics method with plane wave approximation at high energy—From cold materials to hot dense plasmas
An extended first-principles molecular dynamics (FPMD) method based on Kohn-Sham scheme is proposed to elevate the temperature limit of the FPMD method in the calculation of dense plasmas. The extended method treats the wave functions of high energy electrons as plane waves analytically and thus expands the application of the FPMD method to the region of hot dense plasmas without suffering from the formidable computational costs. In addition, the extended method inherits the high accuracy of the Kohn-Sham scheme and keeps the information of electronic structures. This gives an edge to the extended method in the calculation of mixtures of plasmas composed of heterogeneous ions, high-Z dense plasmas, lowering of ionization potentials, X-ray absorption/emission spectra, and opacities, which are of particular interest to astrophysics, inertial confinement fusion engineering, and laboratory astrophysics.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗