Search NASA⌕ Search

SEARCH · Search NASA

Results for “hybrid algorithm”

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 703 records · Page 39

THE MILKY WAY PROJECT: LEVERAGING CITIZEN SCIENCE AND MACHINE LEARNING TO DETECT INTERSTELLAR BUBBLES

We present Brut, an algorithm to identify bubbles in infrared images of the Galactic midplane. Brut is based on the Random Forest algorithm, and uses bubbles identified by >35,000 citizen scientists from the Milky Way Project to discover the identifying characteristics of bubbles in images from the Spitzer Space Telescope. We demonstrate that Brut's ability to identify bubbles is comparable to expert astronomers. We use Brut to re-assess the bubbles in the Milky Way Project catalog, and find that 10%-30% of the objects in this catalog are non-bubble interlopers. Relative to these interlopers, high-reliability bubbles are more confined to the mid-plane, and display a stronger excess of young stellar objects along and within bubble rims. Furthermore, Brut is able to discover bubbles missed by previous searches—particularly bubbles near bright sources which have low contrast relative to their surroundings. Brut demonstrates the synergies that exist between citizen scientists, professional scientists, and machine learning techniques. In cases where ''untrained' citizens can identify patterns that machines cannot detect without training, machine learning algorithms like Brut can use the output of citizen science projects as input training sets, offering tremendous opportunities to speed the pace of scientific discovery. A hybrid model of machine learning combined with crowdsourced training data from citizen scientists can not only classify large quantities of data, but also address the weakness of each approach if deployed alone.

79 ASTRONOMY AND ASTROPHYSICS↗

Truncation correction for oblique filtering lines

State-of-the-art filtered backprojection (FBP) algorithms often define the filtering operation to be performed along oblique filtering lines in the detector. A limited scan field of view leads to the truncation of those filtering lines, which causes artifacts in the final reconstructed volume. In contrast to the case where filtering is performed solely along the detector rows, no methods are available for the case of oblique filtering lines. In this work, the authors present two novel truncation correction methods which effectively handle data truncation in this case. Method 1 (basic approach) handles data truncation in two successive preprocessing steps by applying a hybrid data extrapolation method, which is a combination of a water cylinder extrapolation and a Gaussian extrapolation. It is independent of any specific reconstruction algorithm. Method 2 (kink approach) uses similar concepts for data extrapolation as the basic approach but needs to be integrated into the reconstruction algorithm. Experiments are presented from simulated data of the FORBILD head phantom, acquired along a partial-circle-plus-arc trajectory. The theoretically exact M-line algorithm is used for reconstruction. Although the discussion is focused on theoretically exact algorithms, the proposed truncation correction methods can be applied to any FBP algorithm that exposes oblique filtering lines.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Electrical Power Grid Delivery Dynamic Analysis: Using Prime Mover Engines to Balance Dynamic Wind Turbine Output

This paper presents an investigation into integrated wind + combustion engine high penetration electrical generation systems. Renewable generation systems are now a reality of electrical transmission. Unfortunately, many of these renewable energy supplies are stochastic and highly dynamic. Conversely, the existing national grid has been designed for steady state operation. The research team has developed an algorithm to investigate the feasibility and relative capability of a reciprocating internal combustion engine to directly integrate with wind generation in a tightly coupled Hybrid Energy System. Utilizing the Idaho National Laboratory developed Phoenix Model Integration Platform, the research team has coupled demand data with wind turbine generation data and the Aspen Custom Modeler reciprocating engine electrical generator model to investigate the capability of reciprocating engine electrical generation to balance stochastic renewable energy.

17 WIND ENERGY↗

MHD SIMULATIONS OF ACCRETION ONTO Sgr A*: QUIESCENT FLUCTUATIONS, OUTBURSTS, AND QUASIPERIODICITY

High-resolution observations of Sgr A* have revealed a wide variety of phenomena, ranging from intense rapid flares to quasi-periodic oscillations (QPOs), making this object an ideal system to study the properties of low luminosity accreting black holes. In this paper, we use a pseudospectral algorithm to construct and evolve a three-dimensional magnetohydrodynamic (MHD) model of the accretion disk in Sgr A*. Assuming a hybrid thermal-nonthermal emission scheme and calibrating the parameters by observations, we show that the MHD turbulence in the environment of Sgr A* can by itself only produce factor two fluctuations in luminosity. These fluctuations cannot explain the magnitude of flares observed in this system. However, we also demonstrate that external forcing of the accretion disk, which may be generated by the 'clumpy material' raining down onto the disk from the large-scale flow, do produce outbursts qualitatively similar to those observed by XMM-Newton in X-rays and by ground-based facilities in the near infrared. Strong, but short-term QPOs emerge naturally in the simulated light curves. We attribute these to nonaxisymmetric density perturbations that emerge as the disk evolves back toward its quiescent state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calibration of linear contact stiffnesses in discrete element models using a hybrid analytical-computational framework

Efficient selections of particle-scale contact parameters in discrete element modelling remain an open question. The purpose of this study is to provide a hybrid calibration framework to estimate linear contact stiffnesses (normal and tangential) for both two-dimensional and three-dimensional simulations. Analytical formulas linking macroscopic parameters (Young's modulus, Poisson's ratio) to mesoscopic particle parameters for granular systems are derived based on statistically isotropic packings under small-strain isotropic stress conditions. By taking the derived analytical solutions as initial approximations, the gradient descent algorithm automatically obtains a reliable numerical estimation. The introduced framework is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. The results show that this hybrid method practically reduces the time for artificial trials and errors to obtain reasonable stiffness parameters. The proposed framework can also be extended to other parameter calibration problems in DEM.

Calibration method↗

A communication-avoiding, hybrid-parallel, rank-revealing orthogonalization method.

Orthogonalization consumes much of the run time of many iterative methods for solving sparse linear systems and eigenvalue problems. Commonly used algorithms, such as variants of Gram-Schmidt or Householder QR, have performance dominated by communication. Here, 'communication' includes both data movement between the CPU and memory, and messages between processors in parallel. Our Tall Skinny QR (TSQR) family of algorithms requires asymptotically fewer messages between processors and data movement between CPU and memory than typical orthogonalization methods, yet achieves the same accuracy as Householder QR factorization. Furthermore, in block orthogonalizations, TSQR is faster and more accurate than existing approaches for orthogonalizing the vectors within each block ('normalization'). TSQR's rank-revealing capability also makes it useful for detecting deflation in block iterative methods, for which existing approaches sacrifice performance, accuracy, or both. We have implemented a version of TSQR that exploits both distributed-memory and shared-memory parallelism, and supports real and complex arithmetic. Our implementation is optimized for the case of orthogonalizing a small number (5-20) of very long vectors. The shared-memory parallel component uses Intel's Threading Building Blocks, though its modular design supports other shared-memory programming models as well, including computation on the GPU. Our implementation achieves speedups of 2 times or more over competing orthogonalizations. It is available now in the development branch of the Trilinos software package, and will be included in the 10.8 release.

99 GENERAL AND MISCELLANEOUS↗

Singular value decomposition utilizing parallel algorithms on graphical processors

One of the current challenges in underwater acoustic array signal processing is the detection of quiet targets in the presence of noise. In order to enable robust detection, one of the key processing steps requires data and replica whitening. This, in turn, involves the eigen-decomposition of the sample spectral matrix, Cx = 1/K xKX(k)XH(k) where X(k) denotes a single frequency snapshot with an element for each element of the array. By employing the singular value decomposition (SVD) method, the eigenvectors and eigenvalues can be determined directly from the data without computing the sample covariance matrix, reducing the computational requirements for a given level of accuracy (van Trees, Optimum Array Processing). (Recall that the SVD of a complex matrix A involves determining V, , and U such that A = U VH where U and V are orthonormal and is a positive, real, diagonal matrix containing the singular values of A. U and V are the eigenvectors of AAH and AHA, respectively, while the singular values are the square roots of the eigenvalues of AAH.) Because it is desirable to be able to compute these quantities in real time, an efficient technique for computing the SVD is vital. In addition, emerging multicore processors like graphical processing units (GPUs) are bringing parallel processing capabilities to an ever increasing number of users. Since the computational tasks involved in array signal processing are well suited for parallelization, it is expected that these computations will be implemented using GPUs as soon as users have the necessary computational tools available to them. Thus, it is important to have an SVD algorithm that is suitable for these processors. This work explores the effectiveness of two different parallel SVD implementations on an NVIDIA Tesla C2050 GPU (14 multiprocessors, 32 cores per multiprocessor, 1.15 GHz clock - peed). The first algorithm is based on a two-step algorithm which bidiagonalizes the matrix using Householder transformations, and then diagonalizes the intermediate bidiagonal matrix through implicit QR shifts. This is similar to that implemented for real matrices by Lahabar and Narayanan ("Singular Value Decomposition on GPU using CUDA", IEEE International Parallel Distributed Processing Symposium 2009). The implementation is done in a hybrid manner, with the bidiagonalization stage done using the GPU while the diagonalization stage is done using the CPU, with the GPU used to update the U and V matrices. The second algorithm is based on a one-sided Jacobi scheme utilizing a sequence of pair-wise column orthogonalizations such that A is replaced by AV until the resulting matrix is sufficiently orthogonal (that is, equal to U ). V is obtained from the sequence of orthogonalizations, while can be found from the square root of the diagonal elements of AH A and, once is known, U can be found from column scaling the resulting matrix. These implementations utilize CUDA Fortran and NVIDIA's CUB LAS library. The primary goal of this study is to quantify the comparative performance of these two techniques against themselves and other standard implementations (for example, MATLAB). Considering that there is significant overhead associated with transferring data to the GPU and with synchronization between the GPU and the host CPU, it is also important to understand when it is worthwhile to use the GPU in terms of the matrix size and number of concurrent SVDs to be calculated.

99 GENERAL AND MISCELLANEOUS↗

A new configurational bias scheme for sampling supramolecular structures

We present a new simulation scheme which allows an efficient sampling of reconfigurable supramolecular structures made of polymeric constructs functionalized by reactive binding sites. The algorithm is based on the configurational bias scheme of Siepmann and Frenkel and is powered by the possibility of changing the topology of the supramolecular network by a non-local Monte Carlo algorithm. Such a plan is accomplished by a multi-scale modelling that merges coarse-grained simulations, describing the typical polymer conformations, with experimental results accounting for free energy terms involved in the reactions of the active sites. We test the new algorithm for a system of DNA coated colloids for which we compute the hybridisation free energy cost associated to the binding of tethered single stranded DNAs terminated by short sequences of complementary nucleotides. In order to demonstrate the versatility of our method, we also consider polymers functionalized by receptors that bind a surface decorated by ligands. In particular, we compute the density of states of adsorbed polymers as a function of the number of ligand–receptor complexes formed. Such a quantity can be used to study the conformational properties of adsorbed polymers useful when engineering adsorption with tailored properties. We successfully compare the results with the predictions of a mean field theory. We believe that the proposed method will be a useful tool to investigate supramolecular structures resulting from direct interactions between functionalized polymers for which efficient numerical methodologies of investigation are still lacking.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The XFaster Power Spectrum and Likelihood Estimator for the Analysis of Cosmic Microwave Background Maps

We present the XFaster analysis package, XFaster is a fast, iterative angular power spectrum estimator based on a diagonal approximation to the quadratic Fisher matrix estimator. XFaster uses Monte Carlo simulations to compute noise biases and filter transfer functions and is thus a hybrid of both Monte Carlo and quadratic estimator methods. In contrast to conventional pseudo-C ℓ based methods, the algorithm described here requires a minimal number of simulations, and does not require them to be precisely representative of the data to estimate accurate covariance matrices for the bandpowers. The formalism works with polarization-sensitive observations and also data sets with identical, partially overlapping, or independent survey regions. The method was first implemented for the analysis of BOOMERanG data (Netterfield et al. 2002; Jones et al. 2006), and also used as part of the Planck analysis (Rocha et al. 2011). Here, we describe the full, publicly available analysis package, written in Python, as developed for the analysis of data from the 2015 flight of the SPIDER instrument (SPIDER Collaboration 2021). The package includes extensions for self-consistently estimating null spectra and for estimating fits for Galactic foreground contributions. We show results from the extensive validation of XFaster using simulations, and its application to the SPIDER data set.

79 ASTRONOMY AND ASTROPHYSICS↗

ExaWind: Open‐source CFD for hybrid‐RANS/LES geometry‐resolved wind turbine simulations in atmospheric flows

Abstract Predictive high‐fidelity modeling of wind turbines with computational fluid dynamics, wherein turbine geometry is resolved in an atmospheric boundary layer, is important to understanding complex flow accounting for design strategies and operational phenomena such as blade erosion, pitch‐control, stall/vortex‐induced vibrations, and aftermarket add‐ons. The biggest challenge with high‐fidelity modeling is the realization of numerical algorithms that can capture the relevant physics in detail through effective use of high‐performance computing. For modern supercomputers, that means relying on GPUs for acceleration. In this paper, we present ExaWind, a GPU‐enabled open‐source incompressible‐flow hybrid‐computational fluid dynamics framework, comprising the near‐body unstructured grid solver Nalu‐Wind, and the off‐body block‐structured‐grid solver AMR‐Wind, which are coupled using the Topology Independent Overset Grid Assembler. Turbine simulations employ either a pure Reynolds‐averaged Navier–Stokes turbulence model or hybrid turbulence modeling wherein Reynolds‐averaged Navier–Stokes is used for near‐body flow and large eddy simulation is used for off‐body flow. Being two‐way coupled through overset grids, the two solvers enable simulation of flows across a huge range of length scales, for example, 10 orders of magnitude going from O(μm) boundary layers along the blades to O(10 km) across a wind farm. In this paper, we describe the numerical algorithms for geometry‐resolved turbine simulations in atmospheric boundary layers using ExaWind. We present verification studies using canonical flow problems. Validation studies are presented using megawatt‐scale turbines established in literature. Additionally presented are demonstration simulations of a small wind farm under atmospheric inflow with different stability states.

17 WIND ENERGY↗

SU-F-T-606: Monte Carlo Evaluation of Tissue Inhomogeneity Corrections in the Treatment of Liver Cancer Patients Using Stereotactic Body Radiotherapy

Purpose: To evaluate the dosimetric performance of X-ray Voxel Monte Carlo(XVMC) algorithm in effort to clinically validate Monte Carlo-approach in heterogeneous liver phantom and liver SBRT plans. Methods: An anthropomorphic RPC liver phantom incorporating a liver structure with two cylindrical targets and organs-at-risk (OARs) was used in phantom validation. Subsequently, five patients with metastatic liver cancer were treated using heterogeneity-corrected pencil-beam(PB-hete)algorithm were analyzed following RTOG-1112 criteria .ITV was delineated on MinIP and OARs were contoured on MeanIP images of 4D-CT. PTV was generated from ITV with 5-10mm uniform margin. Mean PTV was 81.3±46.4cc. Prescription was 30–45Gy in 5 fractions, with at least PTV(D95%)=100%. Hybrid SBRT plans were generated with noncoplanar/3D-conformal arcs plus static-beams at Novalis-TX consisting of HD-MLC and 6MV-SRS. SBRT plans were re-computed using XVMC algorithm utilizing identical beam-geometry, MLC-positions, and monitor units and subsequently compared to clinical PB-hete plans. Results: Our results using RPC liver motion phantom validation were all compliance with MD Anderson standards. However, compared to PB-hete, average target volume encompassed by the prescribed percent isodose (Vp) was 9.1% and 8.5% less for PTV1 and PTV2 with XVMC. For the clinical liver SBRT plans, PB-hete systematically overestimated PTV dose (D95, Dmean and D10) within ±2.0% (p<0.05) compared to XVMC. Mean value of Vp was about 3.8% less with XVMC compared to PB-hete (ranged 2.9–5.7% (p<0.003)). However, mean liver dose (MLD) was 3.2% higher (p<0.003), on average, with XVMC compared to clinical PB-hete (ranged −1.0to−3.9%). OARs doses were statistically insignificant. Conclusion: Results from our XVMC dose calculations and validation study for liver SBRT indicate small-to-moderate under-dosing of the tumor volume when compared to PB-hete. Results were consistent with phantom validation and patients plans. However, Vp was less by up to 5.7% for some liver SBRT patients with XVMC–suggesting under-dosing of the target volume and overdosing of MLD by up to 3.9% occurred with PB-hete plan. These differences between PB-hete and XVMC dose calculations may be of clinical interest.

60 APPLIED LIFE SCIENCES↗

FY11 annual Report: PHEV Engine Control and Energy Management Strategy

Objectives are to: (1) Investigate novel engine control strategies targeted at rapid engine/catalyst warming for the purpose of mitigating tailpipe emissions from plug-in hybrid electric vehicles (PHEV) exposed to multiple engine cold start events; and (2) Validate and optimize hybrid supervisory control techniques developed during previous and on-going research projects by integrating them into the vehicle level control system and complementing them with the modified engine control strategies in order to further reduce emissions during both cold start and engine re-starts. Approach used are: (1) Perform a literature search of engine control strategies used in conventional powertrains to reduce cold start emissions; (2) Develop an open source engine controller providing full access to engine control strategies in order to implement new engine/catalyst warm-up behaviors; (3) Modify engine cold start control algorithms and characterize impact on cold start behavior; and (4) Develop an experimental Engine-In-the-Loop test stand in order to validate control methodologies and verify transient thermal behavior and emissions of the real engine when combined with a virtual hybrid powertrain. Some major accomplishments are: (1) Commissioned a prototype engine controller on a GM Ecotec 2.4l direct injected gasoline engine on an engine test cell at the University of Tennessee. (2) Obtained from Bosch (with GM's approval) an open calibration engine controller for a GM Ecotec LNF 2.0l Gasoline Turbocharged Direct Injection engine. Bosch will support the bypass of cold start strategies if calibration access proves insufficient. The LNF engine and its open controller were commissioned on an engine test cell at ORNL. (3) Completed a literature search to identify key engine cold start control parameters and characterized their impact on the real engine using the Bosch engine controller to calibrate them. (4) Ported virtual hybrid vehicle model from offline simulation environment to real-time Hardware-In-the-Loop platform.

33 ADVANCED PROPULSION SYSTEMS↗

A scalable approach to solving dense linear algebra problems on hybrid CPU-GPU systems

Aiming to fully exploit the computing power of all CPUs and all graphics processing units (GPUs) on hybrid CPU-GPU systems to solve dense linear algebra problems, in this paper we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, and to accommodate the heterogeneity between CPUs and GPUs. The new heterogeneous tile algorithms are executed upon our decentralized dynamic scheduling runtime system, which schedules a task graph dynamically and transfers data between compute nodes automatically. The runtime system uses a new distributed task assignment protocol to solve data dependencies between tasks without any coordination between processing units. By overlapping computation and communication through dynamic scheduling, we are able to attain scalable performance for the double-precision Cholesky factorization and QR factorization. Finally, our approach demonstrates a performance comparable to Intel MKL on shared-memory multicore systems and better performance than both vendor (e.g., Intel MKL) and open source libraries (e.g., StarPU) in the following three environments: heterogeneous clusters with GPUs, conventional clusters without GPUs, and shared-memory systems with multiple GPUs.

97 MATHEMATICS AND COMPUTING↗

OpenACC acceleration of an unstructured CFD solver based on a reconstructed discontinuous Galerkin method for compressible flows

Here, an OpenACC directive-based graphics processing unit (GPU) parallel scheme is presented for solving the compressible Navier–Stokes equations on 3D hybrid unstructured grids with a third-order reconstructed discontinuous Galerkin method. The developed scheme requires the minimum code intrusion and algorithm alteration for upgrading a legacy solver with the GPU computing capability at very little extra effort in programming, which leads to a unified and portable code development strategy. A face coloring algorithm is adopted to eliminate the memory contention because of the threading of internal and boundary face integrals. A number of flow problems are presented to verify the implementation of the developed scheme. Timing measurements were obtained by running the resulting GPU code on one Nvidia Tesla K20c GPU card (Nvidia Corporation, Santa Clara, CA, USA) and compared with those obtained by running the equivalent Message Passing Interface (MPI) parallel CPU code on a compute node (consisting of two AMD Opteron 6128 eight-core CPUs (Advanced Micro Devices, Inc., Sunnyvale, CA, USA)). Speedup factors of up to 24× and 1.6× for the GPU code were achieved with respect to one and 16 CPU cores, respectively. The numerical results indicate that this OpenACC-based parallel scheme is an effective and extensible approach to port unstructured high-order CFD solvers to GPU computing.

97 MATHEMATICS AND COMPUTING↗

Quantum advantage for noisy channel discrimination

Many quantum mechanical experiments can be viewed as multiround interactive protocols between known quantum circuits and an unknown quantum process. Fully quantum “coherent” access to the unknown process is known to provide an advantage in many discrimination tasks compared to when only incoherent access is permitted, but it is unclear if this advantage persists when the process is noisy. Here, we show that a quantum advantage can be maintained when distinguishing between two noisy single-qubit rotation channels. Numerical and analytical calculations reveal a distinct transition between the performance of fully coherent and fully incoherent protocols as a function of noise strength. Moreover, the size of the region of coherent quantum advantage shrinks inverse polynomially in the number of channel uses, and in an intermediate regime an improved strategy is a hybrid of fully coherent and fully incoherent subroutines. The fully coherent protocol is based on quantum signal processing, suggesting a generalizable algorithmic framework for the study of quantum advantage in the presence of realistic noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗

Striving to translate shale physics across ten orders of magnitude: What have we learned?

Shales will play an important role in the successful transition of energy from fossil-based resources to renewables in the coming decades. Aside from being a significant source of low-carbon intensity fuels, like natural gas, they also serve as geologic seals of subsurface formations that may be used to isolate nuclear waste, sequester CO 2 , or store intermittent energy (e.g., solar hydrogen). Despite their importance, shales pose significant engineering and environmental challenges due to their nanoporous structure and extreme heterogeneity that spans at least ~10 orders of magnitude in spatial scale. Two challenges inhibit a system-level understanding: (1) the physics of fluid flow and phase behavior in shales are poorly understood due to the dominant molecular interactions between minerals and fluids under confinement, and (2) the apparent lack of scale separation that prevents a reliable (closed) description of the physics at any single scale of observation. In this review, we focus on the latter issue and discuss scale translation, which in its broadest sense is transforming data or simulations from one spatiotemporal scale to another. While effective scale translation is not exclusive to shales, but all geologic porous media, the need for it is especially acute in shales given their high degree of heterogeneity. Classical theories like homogenization, while indispensable, fail when scales are not separated. Other methods, like numerical upscaling, scale-translate in only one direction: small to large, but not the reverse, called downscaling. However, the confluence of advances in three areas are bringing challenging problems such as shales within reach: increased computational power and scalable algorithms; high-resolution imaging and multi-modal data acquisition; and machine learning to process massive amounts of data. While these advances equip geoscientists with a wide array of experimental and computational tools, no individual tool can probe the entire gamut of heterogeneity in shales. Their effective use, therefore, requires an ability to bridge between various data types obtained at different scales. The aim of this review is to present a coherent account of computational and experimental methods that may be used to achieve just that, i.e., to perform scale translation. We provide a broader definition of scale translation, one that transcends classical homogenization and upscaling methods, but is consistent with them and accommodates notions like downscaling and data translation. After a brief introduction to homogenization, we review hybrid methods, numerical upscaling and its recent extensions, multiscale computing, high-resolution imaging, and machine learning. We place particular emphasis on multiscale computing and propose an algorithmic framework to bridge between the pore (micro) and Darcy (macro) scales. Throughout the paper, we draw comparisons between the various methods and highlight their (often hidden) similarities, differences, benefits, and pitfalls. We finally conclude with two case studies on shales that exemplify some of the methods presented.

58 GEOSCIENCES↗

Even Faster Exact Exchange for Solids via Tensor Hypercontraction

Hybrid density functional theory (DFT) remains intractable for large periodic systems due to the demanding computational cost of exact exchange. We apply the tensor hypercontraction (THC) (or interpolative separable density fitting) approximation to periodic hybrid DFT calculations with Gaussian-type orbitals using the Gaussian plane wave approach. This is done to lower the computational scaling with respect to the number of basis functions (N) and k-points (N k ) at a fixed system size. Additionally, we propose an algorithm to fit only occupied orbital products via THC (i.e., a set of points, N ISDF ) to further reduce computation time and memory usage. This algorithm has linear scaling cost with k-points, no explicit dependence of N ISDF on basis set size, and overall cubic scaling with unit cell size. Significant speedups and reduced memory usage may be obtained for moderately sized k-point meshes, with additional gains for large k-point meshes. Adequate accuracy can be obtained using THC-oo-K for self-consistent calculations. In conclusion, we perform illustrative hybrid density function theory calculations on the benzene crystal in the basis set and thermodynamic limits to highlight the utility of this algorithm.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗