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 181 records · Page 10

All sources NASA NTRS DOE OSTI

NASA NTRS2009

The Principle of Energetic Consistency

A basic result in estimation theory is that the minimum variance estimate of the dynamical state, given the observations, is the conditional mean estimate. This result holds independently of the specifics of any dynamical or observation nonlinearity or stochasticity, requiring only that the probability density function of the state, conditioned on the observations, has two moments. For nonlinear dynamics that conserve a total energy, this general result implies the principle of energetic consistency: if the dynamical variables are taken to be the natural energy variables, then the sum of the total energy of the conditional mean and the trace of the conditional covariance matrix (the total variance) is constant between observations. Ensemble Kalman filtering methods are designed to approximate the evolution of the conditional mean and covariance matrix. For them the principle of energetic consistency holds independently of ensemble size, even with covariance localization. However, full Kalman filter experiments with advection dynamics have shown that a small amount of numerical dissipation can cause a large, state-dependent loss of total variance, to the detriment of filter performance. The principle of energetic consistency offers a simple way to test whether this spurious loss of variance limits ensemble filter performance in full-blown applications. The classical second-moment closure (third-moment discard) equations also satisfy the principle of energetic consistency, independently of the rank of the conditional covariance matrix. Low-rank approximation of these equations offers an energetically consistent, computationally viable alternative to ensemble filtering. Current formulations of long-window, weak-constraint, four-dimensional variational methods are designed to approximate the conditional mode rather than the conditional mean. Thus they neglect the nonlinear bias term in the second-moment closure equation for the conditional mean. The principle of energetic consistency implies that, to precisely the extent that growing modes are important in data assimilation, this term is also important.

Cohn, Stephen E.↗

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↗

NASA NTRS1989

Projection methods for the numerical solution of Markov chain models

Projection methods for computing stationary probability distributions for Markov chain models are presented. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of methods based on this principle is that of Krylov subspace methods which utilize subspaces of the form span(v,av,...,A(exp m-1)v). These methods are effective in solving linear systems and eigenvalue problems (Lanczos, Arnoldi,...) as well as nonlinear equations. They can be combined with more traditional iterative methods such as successive overrelaxation, symmetric successive overrelaxation, or with incomplete factorization methods to enhance convergence.

Saad, Youcef↗

NASA NTRS2000

Processing and Properties of SiC/MoSi2-SiC Composites Fabricated by Melt Infiltration

Hi-Nicalon SiC fiber reinforced MoSi2-SiC matrix composites (SiC/MoSi2-SiC) have been fabricated by the melt infiltration approach. The composite consists of approximately 60 vol%, 2-D woven BN/SiC coated Hi-Nicalon SiC fibers and approximately 40 vol% MoSi2-SiC matrix. The room temperature tensile properties and thermal conductivity of the SiC/MoSi2-SiC composites were measured and compared with those of the melt infiltrated SiC/SiC composites. The influence oi fiber architecture on tensile properties was also evaluated. Results indicate that the primary modulus, stress corresponding to deviation from linearity, and transverse thermal conductivity values for the SiC/MoSi2-SiC composites are significantly lower than those for the SiC/SiC composites. Microcracking of the matrix due to the large difference in thermal expansion between MoSi2 and SiC appears to be the reason for the lower matrix dominated properties of SiC/MoSi2-SiC composites.

Bhatt, Ramakrishna T.↗

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↗

NASA NTRS1978

ORACLS: A system for linear-quadratic-Gaussian control law design

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Armstrong, E. S.↗

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↗

NASA NTRS1994

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗

NASA NTRS1990

Derivation of generalized transition/boundary conditions for planar multiple-layer structures

Infinite-order generalized impedance boundary conditions (GIBCs) and generalized sheet transition conditions (GSTCs) for planar multilayer configurations are developed via the Taylor series expansion method. The conditions are derived in a matrix product form where each matrix corresponds to a specific layer. An overall composite boundary/transition condition is obtained by making finite-order approximations to the elements of each matrix for the cases of 'low-contrast' and 'high-contrast' material layers. The accuracy of the truncated boundary conditions is examined by comparing their implied reflection and transmission coefficients with the corresponding exact coefficients. Design curves are also given which relate the maximum order of the conditions required to simulate a coating or layer of specific thickness and contrast. Expressions are then derived for the reflection and transmission coefficients of the GIBC/GSTC sheets, and these are compared to exact coefficients to demonstrate the validity of the derived GIBCs/GSTCs.

Ricoy, M. A.↗

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↗

NASA NTRS1977

Thermal environment effects on strength and impact properties of boron-aluminum composites

Thermal effects on fracture strength and impact energy were studied in 50 volume percent unidirectional composites of 143 and 203 micron boron fibers in 6061 and 1100 aluminum matrices. For 6061 matrix composites, strength was maintained to approximately 400 C in the cyclic tests and higher than 400 C in the static tests. For the 1100 matrix composites, strength degradation appeared near 260 C after cycling and higher than 260 C in static heating. This composite strength degradation is explained by a fiber degradation mechanism resulting from a boron-aluminum interface reaction. The impact energy absorption degraded significantly only above 400 C for both matrix alloys. Thus, while impact loss for the 6061 composite correlates with the fiber strength loss, other energy absorption processes appear to extend the impact resistance of the 1100 matrix composites to temperatures beyond where its strength is degraded. Interrupted impact tests on as-received and thermally cycled composites define the range of load over which the fibers break in the impact event.

Grimes, H. H.↗

NASA NTRS2008

Energetic Consistency and Coupling of the Mean and Covariance Dynamics

The dynamical state of the ocean and atmosphere is taken to be a large dimensional random vector in a range of large-scale computational applications, including data assimilation, ensemble prediction, sensitivity analysis, and predictability studies. In each of these applications, numerical evolution of the covariance matrix of the random state plays a central role, because this matrix is used to quantify uncertainty in the state of the dynamical system. Since atmospheric and ocean dynamics are nonlinear, there is no closed evolution equation for the covariance matrix, nor for the mean state. Therefore approximate evolution equations must be used. This article studies theoretical properties of the evolution equations for the mean state and covariance matrix that arise in the second-moment closure approximation (third- and higher-order moment discard). This approximation was introduced by EPSTEIN [1969] in an early effort to introduce a stochastic element into deterministic weather forecasting, and was studied further by FLEMING [1971a,b], EPSTEIN and PITCHER [1972], and PITCHER [1977], also in the context of atmospheric predictability. It has since fallen into disuse, with a simpler one being used in current large-scale applications. The theoretical results of this article make a case that this approximation should be reconsidered for use in large-scale applications, however, because the second moment closure equations possess a property of energetic consistency that the approximate equations now in common use do not possess. A number of properties of solutions of the second-moment closure equations that result from this energetic consistency will be established.

Cohn, Stephen E.↗

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↗

NASA NTRS1985

A Kalman filter for a two-dimensional shallow-water model

A two-dimensional Kalman filter is described for data assimilation for making weather forecasts. The filter is regarded as superior to the optimal interpolation method because the filter determines the forecast error covariance matrix exactly instead of using an approximation. A generalized time step is defined which includes expressions for one time step of the forecast model, the error covariance matrix, the gain matrix, and the evolution of the covariance matrix. Subsequent time steps are achieved by quantifying the forecast variables or employing a linear extrapolation from a current variable set, assuming the forecast dynamics are linear. Calculations for the evolution of the error covariance matrix are banded, i.e., are performed only with the elements significantly different from zero. Experimental results are provided from an application of the filter to a shallow-water simulation covering a 6000 x 6000 km grid.

Parrish, D. F.↗

NASA NTRS1982

Dynamic modeling of structures from measured complex modes

A technique is presented to use a set of identified complex modes together with an analytical mathematical model of a structure under test to compute improved mass, stiffness and damping matrices. A set of identified normal modes, computed from the measured complex modes, is used in the mass orthogonality equation to compute an improved mass matrix. This eliminates possible errors that may result from using approximated complex modes as normal modes. The improved mass matrix, the measured complex modes and the higher analytical modes are then used to compute the improved stiffness and damping matrices. The number of degrees-of-freedom of the improved model is limited to equal the number of elements in the measured modal vectors. A simulated experiment shows considerable improvements, in the system's analytical dynamic model, over the frequency range of the given measured modal information.

Ibrahim, s. R.↗

NASA NTRS1985

Dynamic Modeling of Structures from Measured Complex Modes

Ibrahim, S. R.↗

NASA NTRS1996

Geochemical Comparison of Four Cores from the Manson Impact Structure

Concentrations of 33 elements were determined in relatively unaltered, matrix-rich samples of impact breccia at approximately 3-m-depth intervals in the M-1 core from the Manson impact structure, Iowa. In addition, 46 matrix-rich samples from visibly altered regions of the M-7, M-8, and M-10 cores were studied, along with 42 small clasts from all four cores. Major element compositions were determined for a subset of impact breccias from the M-1 core, including matrix-rich impact-melt breccia. Major- and trace-element compositions were also determined for a suite of likely target rocks. In the M-1 core, different breccia units identified from lithologic examination of cores are compositionally distinct. There is a sharp compositional discontinuity at the boundary between the Keweenawan-shale-clast breccia and the underlying unit of impact-melt breccia (IMB) for most elements, suggesting minimal physical mixing between the two units during emplacement. Samples from the 40-m-thick IMB (M-1) are all similar to each other in composition, although there are slight increases in concentration with depth for those elements that have high concentrations in the underlying fragmental-matrix suevite breccia (SB) (e.g., Na, Ca, Fe, Sc), presumably as a result of greater clast proportions at the bottom margin of the unit of impact-melt breccia. The high degree of compositional similarity we observe in the impact-melt breccias supports the interpretation that the matrix of this unit represents impact melt. That our analyses show such compositional similarity results in part from our technique for sampling these breccias: for each sample we analyzed a few small fragments (total mass: approximately 200 mg) selected to be relatively free of large clasts and visible signs of alteration instead of subsamples of powders prepared from a large mass of breccia. The mean composition of the matrix-rich part of impact-melt breccia from the M-1 core can be modeled as a mixture of approximately 35% shale and siltstone (Proterozoic "Red Clastics"), 23% granite, 40% hornblende-biotite gneiss, and a small component (less than 2%) of mafic-dike rocks.

Korotev, Randy L.↗