Search NASA⌕ Search

SEARCH · Search NASA

Results for “interpolative decomposition”

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 37 records · Page 2

Coupling lattice Boltzmann and continuum equations for flow and reactive transport in porous media.

In spatially and temporally localized instances, capturing sub-reservoir scale information is necessary. Capturing sub-reservoir scale information everywhere is neither necessary, nor computationally possible. The lattice Boltzmann Method for solving pore-scale systems. At the pore-scale, LBM provides an extremely scalable, efficient way of solving Navier-Stokes equations on complex geometries. Coupling pore-scale and continuum scale systems via domain decomposition. By leveraging the interpolations implied by pore-scale and continuum scale discretizations, overlapping Schwartz domain decomposition is used to ensure continuity of pressure and flux. This approach is demonstrated on a fractured medium, in which Navier-Stokes equations are solved within the fracture while Darcy's equation is solved away from the fracture Coupling reactive transport to pore-scale flow simulators allows hybrid approaches to be extended to solve multi-scale reactive transport.

97 MATHEMATICS AND COMPUTING↗

Shape of primordial non-Gaussianity and the CMB bispectrum

We present a set of formalisms for comparing, evolving, and constraining primordial non-Gaussian models through the CMB bispectrum. We describe improved methods for efficient computation of the full CMB bispectrum for any general (nonseparable) primordial bispectrum, incorporating a flat sky approximation and a new cubic interpolation. We review all the primordial non-Gaussian models in the present literature and calculate the CMB bispectrum up to l<2000 for each different model. This allows us to determine the observational independence of these models by calculating the cross correlation of their CMB bispectra. We are able to identify several distinct classes of primordial shapes--including equilateral, local, warm, flat, and feature (non-scale invariant)--which should be distinguishable given a significant detection of CMB non-Gaussianity. We demonstrate that a simple shape correlator provides a fast and reliable method for determining whether or not CMB shapes are well correlated. We use an eigenmode decomposition of the primordial shape to characterize and understand model independence. Finally, we advocate a standardized normalization method for f{sub NL} based on the shape autocorrelator, so that observational limits and errors {delta}f{sub NL} can be consistently compared for different models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning Conservation Laws in Unknown Quantum Dynamics

We present a learning algorithm for discovering conservation laws given as sums of geometrically local observables in quantum dynamics. This includes conserved quantities that arise from local and global symmetries in closed and open quantum many-body systems. The algorithm combines the classical shadow formalism for estimating expectation values of observable and data analysis techniques based on singular value decompositions and robust polynomial interpolation to discover all such conservation laws in unknown quantum dynamics with rigorous performance guarantees. Our method can be directly realized in quantum experiments, which we illustrate with numerical simulations, using closed and open quantum system dynamics in a ℤ 2 gauge theory and in many-body localized spin chains.

Machine learning↗

Discrete Empirical Interpolation Method Based Dynamic Load Model Reduction

Dynamic load models add significant complexity to bulk power system time-domain simulations. The complexity is due to the large number of ordinary differential equations (ODEs) introduced by the dynamic load components such as induction motors. It is challenging to derive reduced-order models (ROMs) for dynamic loads due to the nonlinear functions in their governing equations. This paper applies the discrete empirical interpolation method enhanced proper orthogonal decomposition (DEIM-POD) to approximate the full dynamic load model with the ROM that minimizes the projection error of the nonlinear functions in dynamic load ODEs onto their dominant modes. This approach only requires evaluation of nonlinear functions at selected observation points. The observation points selected by DEIM also provide information for screening critical load buses where dynamic load model parameters contribute the most to the accuracy of ROM across multiple contingencies. The proposed approach is validated on IEEE 9-bus, WECC 179-bus and 2384-bus Polish systems.

bulk power system↗

Rendezvous algorithms for large-scale modeling and simulation

Rendezvous algorithms encode a communication pattern that is useful when processors sending data do not know who the receiving processors should be, or vice versa. The idea is to define an intermediate decomposition where datums from different sending processors can ”rendezvous” to perform a computation, in a manner that both the senders and eventual receivers of the results can identify the appropriate rendezvous processor. Though they were originally designed for interpolating between overlaid grids with independent parallel decompositions (Plimpton et al., 2004), we have recently found rendezvous algorithms useful for a variety of operations in particle- or grid-based simulation codes when running large problems on large numbers of processors. In particular, we show they can perform well when a load-balanced intermediate decomposition is randomized and not spatial, requiring all-to-all communication to move data between processors. In this case rendezvous algorithms leverage the large bisection communication bandwidths which parallel machines provide. We describe how rendezvous algorithms work in a scientific computing context and give specific examples for molecular dynamics and Direct Simulation Monte Carlo codes which result in dramatic performance improvements versus simpler algorithms which do not scale as well. We explain how a generic rendezvous algorithm can be implemented, and also point out similarities with the MapReduce paradigm popularized by Google and Hadoop.

97 MATHEMATICS AND COMPUTING↗

Extended dynamic mode decomposition for model reduction in fluid dynamics simulations

High computational cost and storage/memory requirements of fluid dynamics simulations constrain their usefulness as a predictive tool. Reduced-order models (ROMs) provide a viable solution to this challenge by extracting the key underlying dynamics of a complex system directly from data. We investigate the efficacy and robustness of an extended dynamic mode decomposition (xDMD) algorithm in constructing ROMs of three-dimensional cardiovascular computations. Focusing on the ROMs' accuracy in representation and interpolation, we relate these metrics to the truncation rank of singular value decomposition, which underpins xDMD and other approaches to ROM construction. Our key innovation is to relate the truncation rank to the singular values of the original flow problem. This result establishes a priori guidelines for the xDMD deployment and its likely success as a means of data compression and reconstruction of the system's dynamics from dominant spatiotemporal structures present in the data.

Mechanics↗

An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations

In recent years, there has been a growing interest in analyzing and quantifying the effects of random inputs in the solution of ordinary/partial differential equations. To this end, the spectral stochastic finite element method (SSFEM) is the most popular method due to its fast convergence rate. Recently, the stochastic sparse grid collocation method has emerged as an attractive alternative to SSFEM. It approximates the solution in the stochastic space using Lagrange polynomial interpolation. The collocation method requires only repetitive calls to an existing deterministic solver, similar to the Monte Carlo method. However, both the SSFEM and current sparse grid collocation methods utilize global polynomials in the stochastic space. Thus when there are steep gradients or finite discontinuities in the stochastic space, these methods converge very slowly or even fail to converge. In this paper, we develop an adaptive sparse grid collocation strategy using piecewise multi-linear hierarchical basis functions. Hierarchical surplus is used as an error indicator to automatically detect the discontinuity region in the stochastic space and adaptively refine the collocation points in this region. Numerical examples, especially for problems related to long-term integration and stochastic discontinuity, are presented. Comparisons with Monte Carlo and multi-element based random domain decomposition methods are also given to show the efficiency and accuracy of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Breaking the curse of dimensionality: Solving configurational integrals for crystalline solids by tensor networks

Accurately evaluating configurational integrals for dense solids remains a central and difficult challenge in the statistical mechanics of condensed systems. Here, we present a tensor network approach that reformulates the high-dimensional configurational integral for identical-particle crystals into a sequence of computationally efficient summations. We represent the integrand as a high-dimensional tensor and apply tensor-train (TT) decomposition together with a custom TT-cross interpolation. This approach circumvents the need to explicitly construct the full tensor. We introduce tailored rank-1 and rank-2 schemes optimized for sharply peaked Boltzmann probability densities, typical for identical-particle crystals. When applied to the calculation of internal energy and pressure-temperature curves for crystalline Cu and Ar at high (GPa) pressures, as well as the alpha-to-beta phase transition diagram of Sn, our method accurately reproduces molecular dynamics simulation results using tight-binding, machine learning, hierarchical interacting particle–neural network, and modified embedded atom method potentials,all within seconds of computation time.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Direct Vlasov solvers with high-order spectral element method.

This paper presents the development of parallel direct Vlasov solvers using the Spectral Element Method (SEM). Instead of the standard Particle-In-Cell (PIC) approach for kinetic space plasma simulation, i.e. solving the Vlasov-Maxwell equations, the direct method has been used in this paper. There are several benefits to solve the Vlasov equation directly, such as avoiding noise associated with the finite number of particles and the capability to capture the fine structure in the plasma, etc. The most challenging part of direct Vlasov solver comes from high dimension, as the computational cost increases as N{sup 2d}, where d is the dimension of the physical space. Recently due to fast development of supercomputers, the possibility of high dimensions becomes more realistic. A significant effort has been devoted to solve the Vlasov equation in low dimensions so far, now more interests focus on higher dimensions. Different numerical methods have been tried so far, such as finite difference method, Fourier spectral method, finite volume method, etc. In this paper SEM has been successfully applied to construct these solvers. SEM has shown several advantages, such as easy interpolation due to local element structure and long time integration due to its high order accuracy. Domain decomposition in high dimensions have been used for parallelization, these include scalable parallel 1D and 2D Poisson solvers. Benchmark results have been shown and simulation results have been reported for two different cases: one dimension (1P1V), and two dimensions (2P2V) in both physical and velocity spaces.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

THE PLUTO CODE FOR ADAPTIVE MESH COMPUTATIONS IN ASTROPHYSICAL FLUID DYNAMICS

We present a description of the adaptive mesh refinement (AMR) implementation of the PLUTO code for solving the equations of classical and special relativistic magnetohydrodynamics (MHD and RMHD). The current release exploits, in addition to the static grid version of the code, the distributed infrastructure of the CHOMBO library for multidimensional parallel computations over block-structured, adaptively refined grids. We employ a conservative finite-volume approach where primary flow quantities are discretized at the cell center in a dimensionally unsplit fashion using the Corner Transport Upwind method. Time stepping relies on a characteristic tracing step where piecewise parabolic method, weighted essentially non-oscillatory, or slope-limited linear interpolation schemes can be handily adopted. A characteristic decomposition-free version of the scheme is also illustrated. The solenoidal condition of the magnetic field is enforced by augmenting the equations with a generalized Lagrange multiplier providing propagation and damping of divergence errors through a mixed hyperbolic/parabolic explicit cleaning step. Among the novel features, we describe an extension of the scheme to include non-ideal dissipative processes, such as viscosity, resistivity, and anisotropic thermal conduction without operator splitting. Finally, we illustrate an efficient treatment of point-local, potentially stiff source terms over hierarchical nested grids by taking advantage of the adaptivity in time. Several multidimensional benchmarks and applications to problems of astrophysical relevance assess the potentiality of the AMR version of PLUTO in resolving flow features separated by large spatial and temporal disparities.

79 ASTRONOMY AND ASTROPHYSICS↗

Proper orthogonal decomposition based reduced-order modeling of flux-Limited gray thermal radiation

Here, in this work, a proper orthogonal decomposition (POD) based reduced-order model (ROM) is developed to solve gray, flux-limited thermal radiation diffusion. We focus on the variable opacity radiation penetration benchmark posed by Olson, Auer, and Hall. The T -3 relationship for opacity in conjunction with high-temperature radiation penetrating an initially cold material produces a strong thermal radiation shock. This class of problems is particularly challenging for standard POD-based reduced-order modeling due to the nonlinearities presented by 1) the T 4 source term, and 2) flux-limited diffusion operator. To address these challenges and develop a cost competitive ROM, we employ a “hyper-reduction” technique through discrete empirical interpolation (DEIM) and allow for adaptive reduced-order projections through principal interval decomposition (PID). Performance of the proposed methodology is quantified by comparing the cost savings and accuracy relative to a full-order computation. Reference solutions and snapshot data are obtained through a full-order calculation performed by the University of Chicago maintained astrophysics code, FLASH. For consistency and potential extensibility, the developed ROM is also implemented in FLASH. We find that in the initialization regime, where the thermal radiation wave is initially created by the warming of the material, this class of problems is highly reducible and suitable for POD-based ROMs. However, the strong convective nature of the wave propagation regime is less reducible and more challenging to create an efficient ROM.

42 ENGINEERING↗

A conformal decomposition finite element method for modeling stationary fluid interface problems.

A method is developed for modeling fluid transport in domains that do not conform to the finite element mesh. One or more level set functions are used to describe the fluid domain. A background, non-conformal mesh is decomposed into elements that conform to the level set interfaces. Enrichment takes place by adding nodes that lie on the interfaces. Unlike other enriched finite element methods, the proposed technique requires no changes to the underlying element assembly, element interpolation, or element quadrature. The complexity is entirely contained within the element decomposition routines. It is argued that the accuracy of the method is no less than that for eXtended Finite Element Methods (XFEM) with Heaviside enrichment. The accuracy is demonstrated using multiple numerical tests. In all cases, optimal rates of convergence are obtained for both volume and surface quantities. Jacobi preconditioning is shown to remove the ill-conditioning that may result from the nearly degenerate conformal elements.

97 MATHEMATICS AND COMPUTING↗

A deterministic solver for a hybrid quantum-classical transport model in nanoMOSFETs

We model a nanoMOSFET by a mesoscopic, time-dependent, coupled quantum-classical system based on a sub-band decomposition and a simple scattering operator. We first compute the sub-band decomposition and electrostatic force field described by a Schroedinger-Poisson coupled system solved by a Newton-Raphson iteration using the eigenvalue/eigenfunction decomposition. The transport in the classical direction for each sub-band modeled by semiclassical Boltzmann-type equations is solved by conservative semi-lagrangian characteristic-based methods. Numerical results are shown for both the thermodynamical equilibrium and time-dependent simulations in typical nowadays nanoMOSFETs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders

Nearly all model-reduction techniques project the governing equations onto a linear subspace of the original state space. Such subspaces are typically computed using methods such as balanced truncation, rational interpolation, the reduced-basis method, and (balanced) proper orthogonal decomposition (POD). Unfortunately, restricting the state to evolve in a linear subspace imposes a fundamental limitation to the accuracy of the resulting reduced-order model (ROM). In particular, linear-subspace ROMs can be expected to produce low-dimensional models with high accuracy only if the problem admits a fast decaying Kolmogorov n -width (e.g., diffusion-dominated problems). Unfortunately, many problems of interest exhibit a slowly decaying Kolmogorov n-width (e.g., advection-dominated problems). To address this, we propose a novel framework for projecting dynamical systems onto nonlinear manifolds using minimum-residual formulations at the time-continuous and time-discrete levels; the former leads to manifold Galerkin projection, while the latter leads to manifold least-squares Petrov–Galerkin (LSPG) projection. We perform analyses that provide insight into the relationship between these proposed approaches and classical linear-subspace reduced-order models; we also derive a posteriori discrete-time error bounds for the proposed approaches. In addition, we propose a computationally practical approach for computing the nonlinear manifold, which is based on convolutional autoencoders from deep learning. Lastly, we demonstrate the ability of the method to significantly outperform even the optimal linear-subspace ROM on benchmark advection-dominated problems, thereby demonstrating the method's ability to overcome the intrinsic n -width limitations of linear subspaces.

97 MATHEMATICS AND COMPUTING↗

DRIPS: A framework for dimension reduction and interpolation in parameter space

Reduced-order models are often used to describe the behavior of complex systems, whose simulation with a full model is too expensive, or to extract salient features from the full model’s output. We introduce a new model-reduction framework DRIPS (dimension reduction and interpolation in parameter space) that combines the offline local model reduction with the online parameter interpolation of reduced-order bases (ROBs). The offline step of this framework relies on dynamic mode decomposition (DMD) to build a low-rank linear surrogate model, equipped with a local ROB, for quantities of interest derived from the training data generated by repeatedly solving the (nonlinear) high-fidelity model for multiple parameter points. The online step consists of the construction of a parametric reduced-order model for each target/test point in the parameter space, with the interpolation of ROBs done on a Grassman manifold and the interpolation of reduced-order operators done on a matrix manifold. The DMD component enables DRIPS to model (typically low-dimensional) quantities of interest directly, without having to access the (typically high-dimensional and possibly nonlinear) operators in a high-fidelity model that governs the dynamics of the underlying high-dimensional state variables, as required in projection-based reduced-order modeling. A series of numerical experiments suggests that DRIPS yields a model reduction, which is computationally more efficient than the commonly used projection-based proper orthogonal decomposition; it does so without requiring a prior knowledge of the governing equation for quantities of interest. Furthermore, for the nonlinear systems considered, DRIPS is more accurate than Gaussian-process interpolation (Kriging).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the existence of maximal semidefinite invariant subspaces for J-dissipative operators

For a certain class of operators we present some necessary and sufficient conditions for a J-dissipative operator in a Krein space to have maximal semidefinite invariant subspaces. We investigate the semigroup properties of restrictions of the operator to these invariant subspaces. These results are applied to the case when the operator admits a matrix representation with respect to the canonical decomposition of the space. The main conditions are formulated in terms of interpolation theory for Banach spaces. Bibliography: 25 titles.

97 MATHEMATICS AND COMPUTING↗

libROM

libROM is a collection of C++ classes that compute reduced order models and hyperreduced order models for systems of ordinary differential equations. libROM includes parallel, adaptive methods for proper orthogonal decomposition, and parallel, non-adaptive methods for hyperreduction using the discrete empirical interpolation method.

Choi, Youngsoo↗

Oxygen nonstoichiometry and thermo-chemical stability of La{sub 0.6}Sr{sub 0.4}CoO{sub 3-{delta}}

The oxygen nonstoichiometry of La{sub 0.6}Sr{sub 0.4}CoO{sub 3-{delta}} has been the topic of various reports in the literature, but has been exclusively measured at high oxygen partial pressures, pO{sub 2}, and/or elevated temperatures. For applications of La{sub 0.6}Sr{sub 0.4}CoO{sub 3-{delta}}, such as solid oxide fuel cell cathodes or oxygen permeation membranes, knowledge of the oxygen nonstoichiometry and thermo-chemical stability over a wide range of pO{sub 2} is crucial, as localized low pO{sub 2} could trigger failure of the material and device. By employing coulometric titration combined with thermogravimetry, the oxygen nonstoichiometry of La{sub 0.6}Sr{sub 0.4}CoO{sub 3-{delta}} was measured at high and intermediate pO{sub 2} until the material decomposed (at log(pO{sub 2}/bar) Almost-Equal-To -4.5 at 1073 K). For a gradually reduced sample, an offset in oxygen content suggests that La{sub 0.6}Sr{sub 0.4}CoO{sub 3-{delta}} forms a 'super-reduced' solid solution before decomposing. When the sample underwent alternate reduction-oxidation, a hysteresis-like pO{sub 2} dependence of the oxygen content in the decomposition pO{sub 2} range was attributed to the reversible formation of ABO{sub 3} and A{sub 2}BO{sub 4} phases. Reduction enthalpy and entropy were determined for the single-phase region and confirmed interpolated values from the literature. - Graphical abstract: Oxygen nonstoichiometry (shown as 3-{delta}) of La{sub 0.6}Sr{sub 0.4}CoO{sub 3-{delta}} as a function of pO{sub 2} at 773-1173 K. The experimental data were obtained by thermogravimetric analysis (TG) and coulometric titration (measured either by a simple reduction (CT1) or a 'two-step-forward one-step-back' reduction-oxidation (CT2) procedure). D1 and D2 denote the decomposition pO{sub 2}. The solid lines are the fit to the thermogravimetry and CT1 data. The dashed lines represent the non-equilibrium region where the sample shows a super-reduced state. Highlights: Black-Right-Pointing-Pointer Oxygen nonstoichiometry of La{sub 0.6}Sr{sub 0.4}CoO{sub 3-{delta}} at intermediate temperatures and p(O2). Black-Right-Pointing-Pointer Experimental confirmation of previously interpolated reduction enthalpy. Black-Right-Pointing-Pointer Decomposition p(O2) assessed by coulometric titration. Black-Right-Pointing-Pointer Hysteresis-like p(O2) dependence of oxygen content at decomposition p(O2).

36 MATERIALS SCIENCE↗