Engineering Papers⌕ Search

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.

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 OSTI2020

High spatial resolution thermal conductivity mapping of SiC/SiC composites

Herein, silicon carbide (SiC) ceramic matrix composites are being investigated as a new generation of fuel cladding materials due to its higher accident tolerance compared to Zircaloy. Characterization of the thermal conductivity of SiC constituents and their interfaces and interphases in SiC/SiC composites is needed as inputs to models of cladding performance. We used time-domain thermoreflectance (TDTR) to map the thermal conductivity with a spatial resolution of 2 µm. The SiC/SiC composite is comprised of Hi-Nicalon Type S fibers in a matrix made by chemical vapor infiltration (CVI matrix). The interphase material is a pyrolytic carbon/SiC multilayer. We report thermal conductivity maps of the SiC fiber and SiC matrix at temperatures of 25 °C, 90 °C, 164 °C, and 250 °C. The fiber has a uniform and isotropic thermal conductivity of 22 W m -1 K -1 at 25 °C; the thermal conductivity of fiber is approximately independent of temperature. The matrix thermal conductivity is not uniform and varies from 50 to 120 W m -1 K -1 at 25 °C; the thermal conductivity of the matrix scales approximately with the inverse of the square root of temperature, i.e., ∝ 1/T 1/2 . The thermal conductivity of the interphase at room temperature is 6 W m -1 K -1 . The calculated spatially averaged thermal conductivity of this SiC/SiC composite at 1000°C is 29 W m -1 K -1 .

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

A review of low-rank methods for time-dependent kinetic simulations

Time-dependent kinetic models are ubiquitous in computational science and engineering. The underlying integro-differential equations in these models are high-dimensional, comprised of a six–dimensional phase space, making simulations of such phenomena extremely expensive. In this article we demonstrate that in many situations, the solution to kinetics problems lives on a low dimensional manifold that can be described by a low-rank matrix or tensor approximation. We then review the recent development of so-called low-rank methods that evolve the solution on this manifold. The two classes of methods we review are the dynamical low-rank (DLR) method, which derives differential equations for the low-rank factors, and a Step-and-Truncate (SAT) approach, which projects the solution onto the low-rank representation after each time step. Thorough discussions of time integrators, tensor decompositions, and method properties such as structure preservation and computational efficiency are included. We further show examples of low-rank methods as applied to particle transport and plasma dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Optimal 1D Ly α forest power spectrum estimation – I. DESI-lite spectra

ABSTRACT The 1D Ly α forest flux power spectrum P1D is sensitive to scales smaller than a typical galaxy survey, and hence ties to the intergalactic medium’s thermal state, suppression from neutrino masses, and new dark matter models. It has emerged as a competitive framework to study new physics, but also has come with various challenges and systematic errors in analysis. In this work, we revisit the optimal quadratic estimator for P1D, which is robust against the relevant problems such as pixel masking, time evolution within spectrum, and quasar continuum errors. We further improve the estimator by introducing a fiducial power spectrum, which enables us to extract more information by alleviating the discreteness of band powers. We meticulously apply our method to synthetic Dark Energy Spectroscopic Instrument (DESI) spectra and demonstrate how the estimator overcomes each challenge. We further apply an optimization scheme that approximates the Fisher matrix to three elements per row and reduces computation time by 60 per cent. We show that we can achieve per cent precision in P1D with 5-yr DESI data in the absence of systematics and provide forecasts for different spectral qualities.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

nuclear-score-maximization v1.0

This software library presents efficient and multithreaded implementations of matrix low rank approximation via column selection in C++17 code. The algorithms are described in Fornace, Mark, and Michael Lindsey. "Column and row subset selection using nuclear scores: algorithms and theory for Nystro m approximation, CUR decomposition, and graph Laplacian reduction." arXiv preprint arXiv:2407.01698 (2024). The presented methods are by-and-large ver novel, have provable approximation guarantees, multiple use-cases, and exhibit higher quality approximations on a variety of studied examples.

Fornace, Mark↗
DOE OSTI2023

Aggregation of Leslie matrix models with application to ten diverse animal species

Some grouping is necessary when constructing a Leslie matrix model because it involves discretizing a continuous process of births and deaths. Here, the level of grouping is determined by the number of age classes and frequency of sampling. It is largely unknown what is lost or gained by using fewer age classes, and I address this question using aggregation theory. I derive an aggregator for a Leslie matrix model using weighted least squares, determine what properties an aggregated matrix inherits from the original matrix, evaluate aggregation error, and measure the influence of aggregation on asymptotic and transient behaviors. To gauge transient dynamics, I employ reactivity of the standardized Leslie matrix. I apply the aggregator to 10 Leslie models developed for animal populations drawn from a diverse set of species. Several properties are inherited by the aggregated matrix: (a) it is a Leslie matrix; (b) it is irreducible whenever the original matrix is irreducible; (c) it is primitive whenever the original matrix is primitive; and (d) its stable population growth rate and stable age distribution are consistent with those of the original matrix if the least squares weights are equal to the original stable age distribution. In the application, depending on the population modeled, when the least squares weights do not follow the stable age distribution, the stable population growth rate of the aggregated matrix may or may not be approximately consistent with that of the original matrix. Transient behavior is lost with high aggregation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

140,142 Ce Neutron Cross Section Resolved Resonance Region Evaluation

A resolved resonance region evaluation of 140,142 Ce was conducted 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. It is also based on recently measured thermal constants available from the EX FOR 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 in formation 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, whereas 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.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

R-matrix Resolved Resonance Region Evaluation of 140,142 Ce

Oak Ridge National Laboratory completed the resolved resonance region (RRR) evaluation of the two most abundant cerium isotopes, 140 Ce (88.45%) and 142 Ce (11.11%), as requested by the US Nuclear Criticality Safety Program. These evaluations are based on recent high-resolution transmission and capture measurements performed on nat Ce and highly enriched 142 Ce samples at the JRC-Geel Linear Accelerator facility, as well as measured thermal constants available from the EXFOR database. Starting from the resonance parameters of the ENDF/B-VIII.0 library followed by a preliminary R-matrix analysis, an updated set of resonance parameters and corresponding covariance information were derived by fitting these measured data using the Reich–Moore approximation of the R -matrix theory, as implemented in the SAMMY code system. The 140 Ce RRR upper energy limit was kept at 200 keV, whereas the 142 Ce resonance region was extended from 13 to 26 keV. Updated statistical properties were obtained for the new evaluations and compared to those derived from the ENDF/B-VIII.0 nuclear data library. The new evaluation work improved some of the discrepancies found in previous work, such as the capture resonance integral and stellar Maxwellian-averaged cross sections. These integral quantities were mainly derived from the fit of the latest measured data, especially the neutron capture yield data for 142 Ce isotope.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Multirate Exponential Rosenbrock Methods

In this paper we propose a novel class of methods for high-order accurate integration of multirate systems of ordinary differential equation initial-value problems. The proposed methods construct multirate schemes by approximating the action of matrix φ functions within explicit exponential Rosenbrock (ExpRB) methods, thereby called multirate ExpRB (MERB) methods. They consist of the solution to a sequence of modified “fast” initial-value problems, which may themselves be approximated through subcycling any desired initial-value problem solver. In addition to proving how to construct MERB methods from certain classes of ExpRB methods, we provide rigorous convergence analysis of these methods and derive efficient MERB schemes of orders 2 through 6 (the highest-order infinitesimal multirate methods to date). Lastly, we then present numerical simulations to confirm these theoretical convergence rates and to compare the efficiency of MERB methods against other recently introduced high-order multirate methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A new 181 Ta neutron resolved resonance region evaluation

A new 181 Ta neutron resolved resonance region evaluation has been performed from the thermal energy range up to approximately 2.5 keV. The R-matrix SAMMY code was used with the Reich–Moore approximation to evaluate resonance parameters from several experimental data sets. A Monte Carlo approach was used for resonance spin assignments and generating 59 small fictitious resonance levels which were shown to improve the cumulative level, Porter-Thomas, and Wigner distributions as compared to theoretical predictions. Covariance information was also generated for the entire resolved resonance region. Finally, the positive impact of the new evaluation was validated through benchmark calculations which were sensitive to the 181 Ta cross section and showed improvement in the reactivity bias for several benchmark cases.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

Electronic Structure Theory and Novel Materials

This grant supported research on electronic structure and materials theory, with focus on three main issues: (i) novel techniques to deal with correlation in the electronic ground-state, (ii) topological materials, (iii) the phase diagram of lattice spin models. Regarding (i), we applied to the homogeneous electron liquid an approach that we previously developed in the context of molecular systems. In this scheme the electronic occupation probabilities and the natural spin orbitals are used to construct an approximate two-body density matrix for the electronic ground-state. Regarding (ii) we used standard electronic structure methods based on density functional theory to model topological materials and interpret experimental observations. Finally, regarding (iii) we further developed a numerical approach to compute the renormalized couplings within real space renormalization group theory in the context of lattice spin models. The main findings were the following. (i) We found that with our approximate two-body density matrix, which works well for small molecules, is not sufficiently accurate for condensed phase systems. Missing a systematic way of improving on the adopted approximations, we decided not to pursue this approach. (ii) We performed two studies. In one, we investigated the influence of Te defects on the topological properties of a WTe2 monolayer, finding that while Te vacancies, even in modest concentration, destroy the topological character, Te adatoms do not, consistent with a recent experiment. In another study, we predicted Weyl semimetal character and strong anomalous Hall effect in the Heusler compensated ferrimagnet Ti2MnAl. (iii) We developed a new Monte Carlo method to do real space renormalization group calculations for lattice spin models. We subsequently extended the scheme to deal with lattice spin models in presence of quenched disorder, finding that the approach can distinguish systems with finite and strong disorder. In the finite disorder case, the method allows one to find with good approximation the critical coupling distribution and the critical exponents.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Phenomenological R -Matrix parameterization of direct, doorway, and compound nuclear reactions [Abstract]

Although formal expressions for scattering matrix accounting for direct, doorway, and compound nuclear (CN) resonant reactions have been derived several decades ago in both the transition ( T -)matrix formalism and the reactance ( K -)matrix formalism, the absence of corresponding expressions in phenomenological R -matrix formalism has limited the application of the latter to CN resonant reactions only. We remove this limitation by parameterizing direct, doorway, and CN resonant reactions in a phenomenological R -matrix scattering matrix, and provide a parameterization for a corresponding Reich-Moore approximation of eliminated capture channels. Direct reactions induce (previously neglected) mixing among the incoming or outgoing R -matrix channel wave functions, parameterized by real and orthonormal channel-rotation matrix, M , whereby the original scattering matrix U is transformed into M T UM . Any real and orthonormal matrix, M , can be equivalently expressed as e η , where η is a real and skew-symmetric 2 rotation-generating matrix that subsequently yields a more intuitive parameterization of eliminated direct capture reactions in Reich-Moore approximation. A phenomenological R -matrix parameterization of doorway reactions is inferred by equating the expression for reactance ( K -)matrix, given in terms of Brune’s alternative R -matrix parameterization, to a corresponding expression derived using Feshbach’s projection operator formalism. Assuming that all doorway states, just like CN states, are confined within spheres defined by R -matrix channel radii, a new R -matrix-like term induced by doorway states is gleaned, wherein each doorway state is parameterized by its energy, width, and the strength of its coupling to each CN state. Since a Reich-Moore approximation for retained-channel scattering matrix ought to approximate the effect of eliminated capture channels taking place via direct, doorway, or CN reactions, each of the three kinds of reactions contributing to the capture entails a corresponding Reich-Moore parameterization in a first-order approximation: direct contribution is parameterized by introducing finite diagonal elements of a retained-channel rotation-generating matrix, doorway contribution is parameterized by doorway capture widths, while CN contribution is parameterized by conventional Reich-Moore capture widths. We will present evidence of direct and doorway reactions observed in recent measurements of resolved resonance cross sections at the Gaerttner LINAC Center at Rensselaer Polytechnic Institute, and will outline a path for implementing this new R -matrix parameterization into the SAMMY nuclear data evaluation code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Filtered Rayleigh-Ritz is all you need

Recent work has shown that the (block) Lanczos algorithm can be used to extract approximate energy spectra and matrix elements from (matrices of) correlation functions in quantum field theory, and identified exact coincidences between Lanczos analysis methods and others. In this work, we note another coincidence: the Lanczos algorithm is equivalent to the well-known Rayleigh-Ritz method applied to Krylov subspaces. Rayleigh-Ritz provides optimal eigenvalue approximations within subspaces; we find that spurious-state filtering allows these optimality guarantees to be retained in the presence of statistical noise. We explore the relation between Lanczos and Prony's method, their block generalizations, generalized pencil of functions (GPOF), and methods based on the generalized eigenvalue problem (GEVP), and find they all fall into a larger "Prony-Ritz equivalence class", identified as all methods which solve a finite-dimensional spectrum exactly given sufficient correlation function (matrix) data. This equivalence allows simpler and more numerically stable implementations of (block) Lanczos analyses.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

High volume packing fraction TRISO-based fuel in light water reactors

We report that for a decade, fully ceramic microencapsulated (FCM) fuel, containing tri-structural isotropic (TRISO) fuel particles in a silicon carbide (SiC) matrix, has been investigated as an accident-tolerant fuel for light water reactors (LWRs). Other examples exist of TRISO-based concepts for LWR fuels with different matrix materials. Previous studies assumed TRISO particle volume packing of approximately 0.44 in SiC (or another) matrix, the highest realistic packing fractions possible with conventional manufacturing. Recent advances in advanced manufacturing have yielded the development and demonstration of a fuel form that consists of conventionally manufactured TRISO particles in a 3D-printed SiC matrix with significantly higher possible TRISO packing fractions (0.5–0.7). This increased uranium loading enhances the viability of using TRISO-based particle fuel forms in LWRs. The viability of high-packing-fraction TRISO-based particle fuel forms in LWRs is assessed from the perspective of fuel cycle length, achievable fuel burnup, reactivity coefficients, and fuel cycle performance. Higher-packing-fraction TRISO-based fuel enables either longer cycle lengths (by ~25% at a packing fraction of 0.55 relative to 0.44) at a constant enrichment or decreased enrichments (by ~25% at a packing fraction of 0.55 relative to 0.44) at a constant cycle length. Studies of different fuel kernel types (uranium nitride, uranium oxycarbide, and uranium carbide) yield similar results, although the cycle length of uranium oxycarbide is shorter than for uranium nitride or uranium carbide (due to the lower density of uranium oxide). This work also characterized the production of 14 C resulting from neutron absorption in 14 N during operation for uranium mononitride fuel kernels; the ratio of 14 C/N was 1–2 at. % at discharge. For the fuel cycle evaluation, the activity of spent nuclear fuel and high-level waste at 100 and 100,000 years was lower for high-packing-fraction fuels than for conventional LWR fuel. Environmental impact metrics were similar overall, but higher on the front end of the fuel cycle and lower on the back end of the fuel cycle. Reactivity coefficients of higher-packing-fraction TRISO-based fuel were reasonable compared with those of conventional fuels.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗
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↗