SEARCH · Engineering Papers

Results for “matrix approximation”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗

DOE OSTI2023

A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations

Here, in this paper, we present a predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems. The strategy is a compromise between (i) low-rank step-truncation approaches that alternately evolve and compress solutions and (ii) strict DLRA approaches that augment the low-rank manifold using subspaces generated locally in time by the DLRA integrator. The strategy is based on an analysis of the error between a forward temporal update into the ambient full-rank space, which is typically computed in a step-truncation approach before recompressing, and the standard DLRA update, which is forced to live in a low-rank manifold. We use this error, without requiring its full-rank representation, to correct the DLRA solution. A key ingredient for maintaining a low-rank representation of the error is a randomized SVD, which introduces some degree of stochastic variability into the implementation. The strategy is formulated and implemented in the context of discontinuous Galerkin spatial discretizations of PDEs and applied to several versions of DLRA methods found in the literature as well as a new variant. Numerical experiments comparing the predictor-corrector strategy to other methods demonstrate robustness to overcome shortcomings of step truncation or strict DLRA approaches: The former may require more memory than is strictly needed, while the latter may miss transients solution features that cannot be recovered. The effect of randomization, tolerances, and other implementation parameters is also explored.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Pyomo.DOE: An open-source package for model-based design of experiments in Python

Predictive mathematical models are a cornerstone of science and engineering. Yet selecting, calibrating, and validating said science-based models often remains an art in practice. Model-based design of experiments (MBDoE) provides a systematic framework to maximize information gain from experiments while minimizing time and resource costs. But MBDoE remains limited to niche application areas, in part because practitioners must integrate expertise in statistics, computational optimization, and modeling. To help reduce this barrier, we introduce Pyomo.DOE, an open-source package for MBDoE. Pyomo.DOE uses a nonlinear sensitivity analysis code k_aug to quickly approximate the Fisher information matrix and leverages a new stochastic programming abstraction. We demonstrate Pyomo.DOE with the first application of MBDoE to fixed-bed breakthrough experiments, which highlights the power of Pyomo.DOE to quantify the value of experimental modifications a priori for large-scale partial differential-algebraic equation (PDAE) models. Here we also provide a mathematical primer on MBDoE targeted at general chemical engineers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

Imposing strong correlated energy spread on relativistic bunches with transverse deflecting cavities

We demonstrate a novel scheme for imposing or removing large energy chirp on relativistic electron bunches. This method relies on the transverse-to-longitudinal mixing accomplished with a set of transverse deflecting cavities. The working principles of the new concept are explained using the first-order matrix formalism in the approximation of the linear single-particle dynamics. The scheme demonstrates versatility regarding the average beam energy and, hence, positioning along the accelerator beam line. The performance of the scheme is numerically investigated with the elegant particle-tracking code. It is shown that the associated nonlinear effects causing emittance deterioration for the extreme quantities of the total energy spread can be effectively compensated by optimization of the Twiss parameters while relying on the eigenemittance analysis. The impact of the longitudinal space charge effects on the beam dynamics in the proposed scheme is also investigated.

43 PARTICLE ACCELERATORS↗

DOE OSTI2025

Rapid Initial-State Preparation for the Quantum Simulation of Strongly Correlated Molecules

Studies on quantum algorithms for ground-state energy estimation often assume perfect ground-state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here, we address that problem in two ways: by faster preparation of matrix-product-state (MPS) approximations and by more efficient filtering of the prepared state to find the ground-state energy. We show how to achieve unitary synthesis with a Toffoli complexity about 7 × lower than that in prior work and use that to derive a more efficient MPS-preparation method. For filtering, we present two different approaches: sampling and binary search. For both, we use the theory of window functions to avoid large phase errors and minimize the complexity. We find that the binary-search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about 0.003 . Finally, we estimate the total resources to perform ground-state energy estimation of Fe - S cluster systems, including the Fe Mo cofactor by estimating the overlap of different MPS initial states with potential ground states of the Fe Mo cofactor using an extrapolation procedure. With a modest MPS bond dimension of 4000 , our procedure produces an estimate of approximately 0.9 overlap squared with a candidate ground state of the Fe Mo cofactor, producing a total resource estimate of 7.3 × 10 10 Toffoli gates; neglecting the search over candidates and assuming the accuracy of the extrapolation, this validates prior estimates that have used perfect ground-state overlap. This presents an example of a practical path to prepare states of high overlap in a challenging-to-compute chemical system. Published by the American Physical Society 2025

Berry, Dominic W. (ORCID:0000000334461449)↗

DOE OSTI2020

Gas Hydrate Saturation Estimation Form Acoustic Log Data in the 2018 Alaska North Slope Hydrate-01 Stratigraphic Test

Completed in December 2018, the Alaska North Slope Hydrate 01 stratigraphic test well provides a wealth of logging-while-drilling (LWD) data for strata to below the base of gas hydrate stability (BGHS). This well is intended to be the first of three wells drilled for a comprehensive long-term gas hydrate production test conducted by the National Energy Technology Laboratory, the Japan Oil, Gas and Metals National Corporation, and the U.S. Geological Survey (USGS). The Hydrate 01 stratigraphic test well confirmed the presence of gas hydrate in two sand reservoirs within the hydrate stability zone, indicating the suitability of this location for a long-term gas hydrate production test.<p>The USGS, using an effective-medium-theory rock-physics approach, has estimated gas hydrate saturations from compressional (P) and shear (S) wave log data acquired in the Hydrate 01 well. We assume that gas hydrate occurs as pore-filling load-bearing material (i.e., part of the grain matrix). For Unit D, approximately 500 feet above the BGHS, both P-wave and S-wave acoustic logs indicate moderate gas hydrate saturations with S-wave results slightly lower than those for P-waves. For the Unit B, located just above the BGHS, we obtain moderate to high gas hydrate saturation estimates from both sonic logs. Our P-wave saturation estimates agree well with results from electrical-resistivity-based estimates, whereas estimates from nuclear magnetic resonance LWD data generally suggest 5 to 10 percent higher saturations; our S-wave results suggest lower saturations. These differences likely indicate complexities in the form of gas hydrate occurrence within the sediment pore space, potentially including differences between hydrate occurrence in Units D and B.</p>

Haines, Seth↗

DOE OSTI2020

BISON Robustness and Performance Improvements

BISON is a modern finite-element based nuclear fuel performance code that has been under development at the Idaho National Laboratory (USA) since 2009 [1]. The code is applicable to both steady and transient fuel behavior and can be used to analyze 1D (spherically symmetric), 2D (axisymmetric and generalized plane strain) or 3D geometries. BISON is the fuel performance code used within CASL for LWR fuel under both normal operating and accident conditions. BISON is built using the INL Multiphysics ObjectOriented Simulation Environment, or MOOSE [2, 3]. MOOSE is a massively parallel, finite element-based framework to solve systems of coupled non-linear partial differential equations using the Jacobian-Free Newton Krylov (JFNK) method [4]. This enables investigation of computationally large problems, for example a full stack of discrete pellets in a LWR fuel rod, or every rod in a full reactor core. MOOSE supports the use of complex two and three-dimensional meshes and uses implicit time integration, important for the widely varied time scale in nuclear fuel simulation. An object-oriented architecture is employed which greatly minimizes the programming effort required to add new material and behavioral models. The flexibility of the implicit and fully coupled multiphysics approach comes with a need for constructing suitable approximations for the Jacobian matrix of the coupled system used for either preconditioning a Krylov solve or in a direct Newton solve. Preconditioning options for Bison problems need to be revisited with new preconditioning methods becoming available.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2022

140,142 Ce Neutron Cross Section Resolved Resonance Region Evaluation [Abstract]

A resolved resonance region evaluation of 140,142 Ce has been carried out by Oak Ridge National Laboratory. Requested by the US Nuclear Criticality Safety Program, this evaluation is based on recent high-resolution transmission and capture high-resolution measurements of nat Ce and 142 Ce conducted at JRC-GEEL at the Geel Linear Accelerator facility, as well as recently measured thermal constants available from the EXFOR database. Starting from the resonance parameters from the ENDF/B-VIII.0 library and following a preliminary R-matrix analysis, an updated set of resonance parameters and corresponding covariance information was derived by the fit of these experimental datasets using the Reich-Moore approximation of the R-matrix theory as implemented in the SAMMY code system. The resolved resonance region upper energy limit for 140 Ce was kept at 200 keV while the 142 Ce resonance region was extended from 13 to 26 keV. This new evaluation was found to be in good agreement not only with several integral quantities of interest to the reactor physics community, but also with the stellar Maxwellian-averaged cross section.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2023

Perturbative readout-error mitigation for near-term quantum computers

Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, n . In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate q , we discuss a method to recover the probability of the all-zeros bit string p 0 by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly [ 2 n / ( n w ) ] , which we motivate using a simplified error model for which the approximation incurs only O ( q w ) error for some integer w . We then provide a generalized technique to efficiently recover full output distributions with O ( q w ) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Fast matrix algebra for Bayesian model calibration

In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. Here, we also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗

DOE OSTI2020

Finite-temperature density matrix embedding theory

We describe a formulation of the density matrix embedding theory at finite temperature. We present a generalization of the ground-state bath orbital construction that embeds a mean-field finite-temperature density matrix up to a given order in the Hamiltonian, or the Hamiltonian up to a given order in the density matrix. In this work, we assess the performance of the finite-temperature density matrix embedding on the one-dimensional Hubbard model both at half-filling and away from it, and the two-dimensional Hubbard model at half-filling, comparing to exact data where available, as well as results from finite-temperature density matrix renormalization group, dynamical mean-field theory, and dynamical cluster approximations. The accuracy of finite-temperature density matrix embedding appears comparable to that of the ground-state theory, with, at most, a modest increase in bath size, and competitive with that of cluster dynamical mean-field theory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Systems and methods for customizing kernel machines with deep neural networks

A method including receiving an input data set. The input data set can include one of a feature domain set or a kernel matrix. The method also can include constructing dense embeddings using: (i) Nyström approximations on the input data set when the input data set comprises the kernel matrix, and (ii) clustered Nyström approximations on the input data set when the input data set comprises the feature domain set. The method additionally can include performing representation learning on each of the dense embeddings using a multi-layer fully-connected network for each of the dense embeddings to generate latent representations corresponding to each of the dense embeddings. The method further can include applying a fusion layer to the latent representations corresponding to the dense embeddings to generate a combined representation. The method additionally can include performing classification on the combined representation. Other embodiments of related systems and methods are also disclosed.

Song, Huan↗

DOE OSTI2024

Spectral scheme for atomic structure calculations in density functional theory

In this study, we present a spectral scheme for atomic structure calculations in pseudopotential Kohn-Sham density functional theory. In particular, after applying an exponential transformation of the radial coordinates, we employ global polynomial interpolation on a Chebyshev grid, with derivative operators approximated using the Chebyshev differentiation matrix, and integrations using Clenshaw-Curtis quadrature. We demonstrate the accuracy and efficiency of the scheme through spin-polarized and unpolarized calculations for representative atoms, while considering local, semilocal, and hybrid exchange-correlation functionals. In particular, we find that $\mathcal{O}$(200) grid points are sufficient to achieve an accuracy of 1 microhartree in the eigenvalues for optimized norm conserving Vanderbilt pseudopotentials spanning the periodic table from atomic number Ζ = 1 to 83.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2021

Model-based and Model-free Designs for an Extended Continuous-time LQR with Exogenous Inputs

We present an extended linear quadratic regulator (LQR) design for continuous-time linear time-invariant (LTI) systems in the presence of exogenous inputs. We first propose a model-based solution with cost minimization guarantees for states and inputs using dynamic programming (DP). The control law consists of a combination of the optimal state feedback and an additional optimal term dependent on the exogenous inputs. The control gains for the two components are obtained by solving a set of matrix differential equations. We provide these solutions for both finite horizons and steady-state cases. In the second part of the paper, we formulate a reinforcement learning (RL) based algorithm which does not need any model information except the input matrix, and can compute an approximate steady-state LQR gain using measurements of the states, the control inputs, and the exogenous inputs. Both model-based and data-driven optimal control algorithms are tested with a numerical example under different exogenous inputs showcasing the effectiveness of the designs.

Mukherjee, Sayak↗

DOE OSTI2020

Covariance generation for the prompt neutron multiplicity of 239 Pu including the (n, γ f) process

Fission cross section of 239 Pu can be seen as a sum of the “immediate" fission and “two-step" (n,γf) reactions. In the Resolved Resonance Range of the reaction cross sections, the contribution of the (n,γf) process has an impact on the determination of the partial widths magnitude involved in the Reich-Moore approximation of the R-matrix theory. The present work aims to investigate this impact by using the CONRAD code and the partial width Γ γf for the (n,γf) reaction calculated by Lynn et al. A special attention will be paid to the covariance matrix obtained on ν p .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Expanded capabilities of the CarMa code in modeling resistive wall mode dynamics with 3-D conductors

In this work, an improved version of the CarMa code is presented, called CarMa-D, for the analysis of resistive wall modes (RWMs) in fusion devices, simultaneously considering the effects of volumetric three-dimensional conducting structures, plasma dynamics, toroidal rotation or drift-kinetic damping. Unlike static CarMa, CarMa-D does not rely on the simplifying assumptions such as neglecting the plasma mass, toroidal rotation and kinetic damping. The new coupling strategy is based on matrix-based Padé rational functions approximation of plasma a response. The arising mathematical model is formally equivalent to the original CarMa model, but with a higher number of degrees of freedom to model the dynamics of the plasma. CarMa-D overcomes the main limitations of the original CarMa, in particular: (i) the massless assumption for the plasma is removed, allowing modeling of global modes growing both on ideal kink time scales and in the typical RWM growth rate regime, with a suitable treatment of the model; (ii) the effects of toroidal plasma flow and drift kinetic damping can be included into the new model, providing a powerful tool to study macroscopic phenomena where both plasma dynamics and 3-D conducting structures play important roles.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗