Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem structuring 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.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

CP decomposition for tensors via alternating least squares with QR decomposition

The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗
DOE OSTI2021

Compact representations of structured BFGS matrices

For general large-scale optimization problems compact representations exist in which recursive quasi-Newton update formulas are represented as compact matrix factorizations. For problems in which the objective function contains additional structure, recent structured quasi-Newton methods exploit available second-derivative information and approximate unavailable second derivatives. Here, this article develops the compact representations of two structured Broyden-Fletcher-Goldfarb-Shanno update formulas. The compact representations enable efficient limited memory and initialization strategies. Two limited memory line search algorithms are described for which extensive numerical results demonstrate the efficacy of the algorithms, including comparisons to IPOPT on large machine learning problems, and to L-BFGS on a real world large scale ptychographic imaging application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Ground State Energy Functional with Hartree–Fock Efficiency and Chemical Accuracy

We introduce the deep post Hartree–Fock (DeePHF) method, a machine learning-based scheme for constructing accurate and transferable models for the ground-state energy of electronic structure problems. DeePHF predicts the energy difference between results of highly accurate models such as the coupled cluster method and low accuracy models such as the Hartree–Fock (HF) method, using the ground-state electronic orbitals as the input. It preserves all the symmetries of the original high accuracy model. The added computational cost is less than that of the reference HF or DFT and scales linearly with respect to system size. We examine the performance of DeePHF on organic molecular systems using publicly available data sets and obtain the state-of-art performance, particularly on large data sets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Multiscale design of nonlinear materials using a Eulerian shape optimization scheme

Motivated by recent advances in manufacturing, the design of materials is the focal point of interest in the material research community. One of the critical challenges in this field is finding optimal material microstructure for a desired macroscopic response. This work presents a computational method for the mesoscale-level design of particulate composites for an optimal macroscale-level response. The method relies on a custom shape optimization scheme to find the extrema of a nonlinear cost function subject to a set of constraints. Three key “modules” constitute the method: multiscale modeling, sensitivity analysis, and optimization. Multiscale modeling relies on a classical homogenization method and a nonlinear NURBS-based generalized finite element scheme to efficiently and accurately compute the structural response of particulate composites using a nonconformal discretization. A three-parameter isotropic damage law is used to model microstructure-level failure. An analytical sensitivity method is developed to compute the derivatives of the cost/constraint functions with respect to the design variables that control the microstructure's geometry. The derivation uncovers subtle but essential new terms contributing to the sensitivity of finite element shape functions and their spatial derivatives. Several structural problems are solved to demonstrate the applicability, performance, and accuracy of the method for the design of particulate composites with a desired macroscopic nonlinear stress-strain response.

42 ENGINEERING↗
DOE OSTI2021

Inverse Biot–Savart Optimization for Superconducting Accelerator Magnets

Superconducting (SC) magnets for accelerator concepts are often synthesized by numerically optimizing magnetic field waveforms, a process that requires a subsequent solution of a constrained inverse problem to identify suitable SC magnet windings. When the desired field distribution is intuitive, the inverse process is facilitated by seeding preconceived coil distributions into design optimization methods for refinement. With more complex magnetic field distributions, an initial design may be unknown, and topology optimization tools are required to synthesize current distributions without a priori guidance from a subject matter expert. In this work, we develop a constrained inverse Biot-Savart topology optimization methodology that synthesizes optimal distributions of current density in racetrack-like SC coils. The problem structure is exploited through a computationally efficient quadratic programming formulation, and the method is applied to recently published magnetic field waveforms for a recirculating proton phase shifter, a proton therapy gantry, and dipole magnets with sharp field transitions. The method and results herein identify novel winding configurations that can help magnet designers bring accelerator concepts to fruition.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Measuring the Moisture Content of Wood Sheathing with Continuous Wave Radars

Radars were studied for measuring the moisture content of wood-based materials because of their non-destructive nature and their ability to measure the moisture content of several layers at once. These convenient characteristics enable a quick and non-invasive method to find areas of high moisture content in building envelopes so that problems can be fixed before the structure degrades. The need to operate the radar at millimeter ranges required the development of new techniques and methods for analyzing and calculating the moisture content of individual layers of building material. The techniques are providing accurate results for oriented strand board, and efforts are continuing for investigating other construction materials, meeting FCC requirements, and building a system that will be easy to deploy.

Killough, Stephen M↗
DOE OSTI2020

Realizable hyperuniform and nonhyperuniform particle configurations with targeted spectral functions via effective pair interactions

The capacity to identify realizable many-body configurations associated with targeted functional forms for the pair correlation function $g_2(r)$ or its corresponding structure factor $\textit{S(k)}$ is of great fundamental and practical importance. While there are obvious necessary conditions that a prescribed structure factor at number density ρ must satisfy to be configurationally realizable, sufficient conditions are generally not known due to the infinite degeneracy of configurations with different higher-order correlation functions. A major aim of this paper is to expand our theoretical knowledge of the class of pair correlation functions or structure factors that are realizable by classical disordered ensembles of particle configurations, including exotic “hyperuniform” varieties. We first introduce a theoretical formalism that provides a means to draw classical particle configurations from canonical ensembles with certain pairwise-additive potentials that could correspond to targeted analytical functional forms for the structure factor. This formulation enables us to devise an improved algorithm to construct systematically canonical-ensemble particle configurations with such targeted pair statistics, whenever realizable. As a proof of concept, we test the algorithm by targeting several different structure factors across dimensions that are known to be realizable and one hyperuniform target that is known to be nontrivially unrealizable. Our algorithm succeeds for all realizable targets and appropriately fails for the unrealizable target, demonstrating the accuracy and power of the method to numerically investigate the realizability problem. Subsequently, we also target several families of structure-factor functions that meet the known necessary realizability conditions but are not known to be realizable by disordered hyperuniform point configurations, including $\textit{d}$-dimensional Gaussian structure factors, $\textit{d}$-dimensional generalizations of the two-dimensional one-component plasma (OCP), and the $\textit{d}$-dimensional Fourier duals of the previous OCP cases. Moreover, we also explore unusual nonhyperuniform targets, including “hyposurficial” and “antihyperuniform” examples. In all of these instances, the targeted structure factors are achieved with high accuracy, suggesting that they are indeed realizable by equilibrium configurations with pairwise interactions at positive temperatures. Remarkably, we also show that the structure factor of nonequilibrium perfect glass, specified by two-, three-, and four-body interactions, can also be realized by equilibrium pair interactions at positive temperatures. In this work, our findings lead us to the conjecture that any realizable structure factor corresponding to either a translationally invariant equilibrium or nonequilibrium system can be attained by an equilibrium ensemble involving only effective pair interactions. Our investigation not only broadens our knowledge of analytical functional forms for $g_2(r)$ and $\textit{S(k)}$ associated with disordered point configurations across dimensions but also deepens our understanding of many-body physics. Moreover, our work can be applied to the design of materials with desirable physical properties that can be tuned by their pair statistics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Meshfree Methods

Meshfree methods have undergone substantial development and have received much attention in the last two decades. This new family of numerical methods is designed to inherit the main advantages of the finite element method such as compact supports of shape functions and good approximation properties while, at the same time, overcome the main disadvantages of the finite element method caused by the mesh dependence. The meshfree methods share a common feature that no mesh is needed and shape functions are constructed from sets of points, thus eliminating the need for time consuming mesh generation. The most significant advantage of meshfree methods is the flexibility in customizing approximation functions for desired regularity and for capturing essential physics and features of the particular problems of interest. Adaptivity formulation and multiple-scale solution strategies also can be implemented with relative ease. It has become clear that the meshfree methods provide considerable advantages over the conventional finite element methods in solving problems involving moving discontinuities, evolving material interfaces, multiple-scale phenomena, large material distortion and structural deformation, and fracture and damage processes. This Chapter gives an overview of many classes of meshfree methods, with more detailed discussions on Smoothed Particle Hydrodynamics (SPH), the Reproducing Kernel Particle Method (RKPM), Peridynamics (PD), the Material Point Method (MPM), as well as their applications in various challenging engineering problems.2

Chen, Jiun-Shyan↗
DOE OSTI2023

Wcomp (Wind Farm Wake Comparison Framework) [SWR-23-72]

The Wind Farm Wake Comparison Framework (Wcomp) is a software tool to facilitate the comparison of a specific collection of wind farm wake modeling tools: Python-based, steady-state, analytical wake modeling utilities. Wcomp integrates another software project, windIO, to create a consistent method for describing a wind farm flow control problem. Additionally, a data structure is included to represent the outputs a wind farm flow control simulation. Well-described interfaces allow existing wake modeling tools to plug into this framework.

Mudafort, Rafael↗
DOE OSTI2025

Position Papers for Inverse Methods for Complex Systems under Uncertainty Workshop

The ability to solve inverse problems – inferring unknown parameters, structures, or states of a system from observed data – is essential for advancing scientific discovery and innovation capabilities for the DOE mission. Basic research needs and challenges are particularly acute in emerging areas such as the interactive, data-driven, modeling and simulation of digital twins; decision support for experiments at DOE scientific user facilities; and for other complex systems and workflows. Inverse problems are at the heart of understanding and controlling complex systems due to factors such as observational data with varying modalities and fidelities, inherent uncertainties in physical measurements and numerical models, and the computational demands of rapid and high-fidelity simulations. The convergence of recent scientific computing trends – scientific machine learning, artificial intelligence, and computing advances such as exascale computing – is creating unprecedented opportunities. These advancements offer the potential to revolutionize how we approach inverse problems to extract actionable insights with the required level of accuracy and computational efficiency. This workshop and the Call for Position Papers are vital steps in bringing together experts to collectively explore and identify the new computational and mathematical directions needed in inverse methods for complex systems under uncertainty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Efficient Space–Time Reduced Order Model for Linear Dynamical Systems in Python Using Less than 120 Lines of Code

A classical reduced order model (ROM) for dynamical problems typically involves only the spatial reduction of a given problem. Recently, a novel space–time ROM for linear dynamical problems has been developed [Choi et al., Space–tume reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems, Journal of Computational Physics, 2020], which further reduces the problem size by introducing a temporal reduction in addition to a spatial reduction without much loss in accuracy. The authors show an order of a thousand speed-up with a relative error of less than 10−5 for a large-scale Boltzmann transport problem. In this work, we present for the first time the derivation of the space–time least-squares Petrov–Galerkin (LSPG) projection for linear dynamical systems and its corresponding block structures. Utilizing these block structures, we demonstrate the ease of construction of the space–time ROM method with two model problems: 2D diffusion and 2D convection diffusion, with and without a linear source term. For each problem, we demonstrate the entire process of generating the full order model (FOM) data, constructing the space–time ROM, and predicting the reduced-order solutions, all in less than 120 lines of Python code. We compare our LSPG method with the traditional Galerkin method and show that the space–time ROMs can achieve O(10−3) to O(10−4) relative errors for these problems. Depending on parameter–separability, online speed-ups may or may not be achieved. For the FOMs with parameter–separability, the space–time ROMs can achieve O(10) online speed-ups. Finally, we present an error analysis for the space–time LSPG projection and derive an error bound, which shows an improvement compared to traditional spatial Galerkin ROM methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗
DOE OSTI2021

Reduction of the molecular hamiltonian matrix using quantum community detection

Abstract Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Protein Conformational States—A First Principles Bayesian Method

Automated identification of protein conformational states from simulation of an ensemble of structures is a hard problem because it requires teaching a computer to recognize shapes. We adapt the naïve Bayes classifier from the machine learning community for use on atom-to-atom pairwise contacts. The result is an unsupervised learning algorithm that samples a ‘distribution’ over potential classification schemes. We apply the classifier to a series of test structures and one real protein, showing that it identifies the conformational transition with >95% accuracy in most cases. A nontrivial feature of our adaptation is a new connection to information entropy that allows us to vary the level of structural detail without spoiling the categorization. This is confirmed by comparing results as the number of atoms and time-samples are varied over 1.5 orders of magnitude. Further, the method’s derivation from Bayesian analysis on the set of inter-atomic contacts makes it easy to understand and extend to more complex cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A coupling approach for linear elasticity problems with spatially non-coincident discretized interfaces

Here we present a new method for coupled linear elasticity problems whose finite element discretization may lead to spatially non-coincident discretized interfaces. Our approach combines the classical Dirichlet–Neumann coupling formulation with a new set of discretized interface conditions obtained through Taylor series expansions. We show that these conditions ensure linear consistency of the coupled finite element solution. We then formulate an iterative solution method for the coupled discrete system and apply the new coupling approach to two representative settings for which we also provide several numerical illustrations. The first setting is a mesh-tying problem in which both coupled structures have the same Lamé parameters whereas the second setting is an interface problem for which the Lamé parameters in the two coupled structures are different.

97 MATHEMATICS AND COMPUTING↗