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 55 records · Page 3

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↗

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗

Guaranteed Quality Conformal Mesh Decomposition.

Interface-conforming elements generated by the conformal decomposition finite element method can have arbitrarily poor quality due to the arbitrary intersection of the base triangular or tetrahedral mesh with material interfaces. This can have severe consequences for both the solvability of linear systems and for the interpolation error of fields represented on these meshes. The present work demonstrates that snapping the base mesh nodes to the interface whenever the interface cuts close to a node results in conforming meshes of good quality. Theoretical limits on the snapping tolerance are derived, and even conservative tolerance choices result in limiting the stiffness matrix condition number to within a small multiple of that of the base mesh. Interpolation errors are also well controlled in the norms of interest. In 3D, use of node-to-interface snapping also permits a simpler and more robust vertex ID-based element decomposition algorithm to be used with no serious detriment to mesh quality.

42 ENGINEERING↗

Efficiently enclosing the compact binary parameter space by singular-value decomposition

Gravitational-wave searches for the merger of compact binaries use matched filtering as the method of detecting signals and estimating parameters. Such searches construct a fine mesh of filters covering a signal parameter space at high density. Previously it has been shown that singular-value decomposition can reduce the effective number of filters required to search the data. Here we study how the basis provided by the singular-value decomposition changes dimension as a function of template-bank density. We will demonstrate that it is sufficient to use the basis provided by the singular-value decomposition of a low-density bank to accurately reconstruct arbitrary points within the boundaries of the template bank. Since this technique is purely numerical, it may have applications to interpolating the space of numerical relativity waveforms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Compression and smart coding of offset and gain maps for intraoral digital x-ray sensors

The response of indirect x-ray digital imaging sensors is often not homogenous on the entire surface area. In this case, calibration is needed to build offset and gain maps, which are used to correct the sensor output. The sensors of new generation are equipped with an on-board memory, which serves to store these maps. However, because of its limited dimension, the maps have to be compressed before saving them. This step is critical because of the extremely high compression rate required. The authors propose here a novel method to achieve such a high compression rate, without degrading the quality of the sensor output. It is based on quad tree decomposition, which performs an adaptive sampling of the offset and gain maps, matched with a RBF-based interpolation strategy. The method was tested on a typical intraoral radiographic sensor and compared with traditional compression techniques. Qualitative and quantitative results show that the method achieves a higher compression rate and produces images of superior quality. The method can be adopted also in different fields where a high compression rate is required.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗

Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces

This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.

Data-driven model reduction↗

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

Kenwright, David↗

Some domain decomposition algorithms for mixed formulations of elasticity and incompressible fluids.

In this talk, we present a collection of domain decomposition algorithms for mixed finite element formulations of elasticity and incompressible fluids. The key component of each of these algorithms is the coarse space. Here, the coarse spaces are obtained in an algebraic manner by harmonically extending coarse boundary data. Various aspects of the coarse spaces are discussed for both continuous and discontinuous interpolation of pressure. Further, both classical overlapping Schwarz and hybrid iterative substructuring preconditioners are described. Numerical results are presented for almost incompressible elasticity and the Navier Stokes equations which demonstrate the utility of the methods for both structured and irregular mesh decompositions. We also discuss a simple residual scaling approach which often leads to significant reductions in iterations for these algorithms.

99 GENERAL AND MISCELLANEOUS↗

Certified dual-corrected radiation patterns of phased antenna arrays by offline–online order reduction of finite-element models

This paper presents a fast numerical method for computing certified far-field patterns of phased antenna arrays over broad frequency bands as well as wide ranges of steering and look angles. The proposed scheme combines finite-element analysis, dual-corrected model-order reduction, and empirical interpolation. To assure the reliability of the results, improved a posteriori error bounds for the radiated power and directive gain are derived. Both the reduced-order model and the error-bounds algorithm feature offline–online decomposition. A real-world example is provided to demonstrate the efficiency and accuracy of the suggested approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Eulerian finite element implementations of a dislocation density-based continuum model

In Eulerian finite element simulations, the mesh moves relative to the material. After every change of position between the mesh and the material, the state variables are interpolated to the new mesh position, which is referred to as advection. Large strain crystal plasticity models are based on the multiplicative decomposition of the total deformation gradient. Further, the stress is evaluated as a function of the thermoelastic strain, temperature, and other state variables. Advection of tensor quantities, such as the strain, is coupled with possibly significant advection errors. In an effort to reduce the advection errors, we develop two rate forms of an established dislocation density-based continuum model. To that end, we replace the multiplicative decomposition of the deformation gradient with the additive decomposition of the velocity gradient, and define the stress rate instead of the total stress. The Eulerian implementation is compared with Lagrangian calculations, and two numerical examples with severe deformation levels are presented.

36 MATERIALS SCIENCE↗