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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Studies of mineralization in tissue culture: optimal conditions for cartilage calcification

The optimal conditions for obtaining a calcified cartilage matrix approximating that which exists in situ were established in a differentiating chick limb bud mesenchymal cell culture system. Using cells from stage 21-24 embryos in a micro-mass culture, at an optimal density of 0.5 million cells/20 microliters spot, the deposition of small crystals of hydroxyapatite on a collagenous matrix and matrix vesicles was detected by day 21 using X-ray diffraction, FT-IR microscopy, and electron microscopy. Optimal media, containing 1.1 mM Ca, 4 mM P, 25 micrograms/ml vitamin C, 0.3 mg/ml glutamine, no Hepes buffer, and 10% fetal bovine serum, produced matrix resembling the calcifying cartilage matrix of fetal chick long bones. Interestingly, higher concentrations of fetal bovine serum had an inhibitory effect on calcification. The cartilage phenotype was confirmed based on the cellular expression of cartilage collagen and proteoglycan mRNAs, the presence of type II and type X collagen, and cartilage type proteoglycan at the light microscopic level, and the presence of chondrocytes and matrix vesicles at the EM level. The system is proposed as a model for evaluating the events in cell mediated cartilage calcification.

Non-NASA Center↗
NASA NTRS1988

An approximate loop transfer recovery method for designing fixed-order compensators

A method for designing fixed-order dynamic compensators for multivariable time invariant linear systems is presented which is based on the minimization of a linear quadratic performance index. The present formulation is performed in an output feedback setting which uses an observer cononical form to represent the compensator dynamics. Techniques for penalizing the plant and compensator states and for selecting the distribution on initial conditions such that the loop transfer matrix approximates that of a full-state feedback design have been developed. The effectiveness of the method is demonstrated using the examples of the pointing of a flexible structure and a helicopter flight control problem.

Calise, Anthony J.↗
DOE OSTI2022

How Bayesian methods can improve R -matrix analyses of data: The example of the d t reaction

The 3 H(d, n) 4 He reaction is of significant interest in nuclear astrophysics and nuclear applications. It is an important, early step in big-bang nucleosynthesis and a key process in nuclear fusion reactors. We use one- and two-level R-matrix approximations to analyze data on the cross section for this reaction at center-of-mass energies below 215 keV. We critically examine the data sets using a Bayesian statistical model that allows for both common-mode and additional point-to-point un- certainties. We use Markov Chain Monte Carlo sampling to evaluate this R-matrix-plus-statistical model and find two-level R-matrix results that are stable with respect to variations in the channel radii. The S factor at 40 keV evaluates to 25.36(19) MeV b (68% credibility interval). We discuss our Bayesian analysis in detail and provide guidance for future applications of Bayesian methods to R-matrix analyses. We also discuss possible paths to further reduction of the S-factor uncertainty.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Exciton-Defect Interaction and Optical Properties from a First-Principles T-Matrix Approach

Understanding exciton-defect interactions is critical for optimizing optoelectronic and quantum information applications in many materials. However, ab initio simulations of material properties with defects are often limited to high defect density. Here, we study effects of exciton-defect interactions on optical absorption and photoluminescence spectra in monolayer MoS 2 using a first-principles T-matrix approach. We demonstrate that exciton-defect bound states can be captured by the disorderaveraged Green’s function with the T-matrix approximation and further analyze their optical properties. Our approach yields photoluminescence spectra in good agreement with experiments and provides a new, computationally efficient framework for simulating optical properties of disordered 2D materials from firstprinciples.

T-matrix↗
DOE OSTI2022

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗
DOE OSTI2023

Scalable computations for nonstationary Gaussian processes

Nonstationary Gaussian process models can capture complex spatially varying dependence structures in spatial datasets. However, the large number of observations in modern datasets makes fitting such models computationally intractable with conventional dense linear algebra. In addition, derivative-free or even first-order optimization methods can be very slow to converge when estimating many spatially varying parameters. In this paper, we present a computational framework which couples an algebraic block diagonal plus low-rank covariance matrix approximation with stochastic trace estimation to facilitate the efficient use of second-order solvers for maximum likelihood estimation of Gaussian process models with many parameters. We demonstrate the effectiveness of these methods by simultaneously fitting 192 parameters in the popular nonstationary model of Paciorek and Schervish using 107,600 sea surface temperature anomaly measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Weak bosons as partons below 10 TeV partonic center-of-momentum

We investigate the modeling of weak boson number densities for leptons and hadrons in practical calculations in the Standard Model. Working in the framework of the Effective $W$ Approximation (EWA) and in $R_\xi$ and axial gauges, we derive the unrenormalized, tree-level parton number density functions for weak bosons from massless leptons at next-to-leading power in the collinear expansion. Corrections exhibit a number of properties, including those conjectured but never universally derived. Parallels with heavy quark factorization are also found. We avoid pathologies through a novel set of kinematical consistency conditions. When satisfied, good agreement between the full and approximated matrix elements is achieved. Findings suggest that the EWA may be testable at the Large Hadron Collider with $450$ fb$^{-1}$ luminosity of same-sign $WW$ scattering data at $\sqrt{s}=13.6$ TeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

L-BFGS Class Implementation in C++

This report presents a header-only C++ class implementation of the Limited-memory BroydenFletcher-Goldfarb-Shanno (L-BFGS) algorithm. The L-BFGS method is a general purpose quasi-Netwon optimization method that builds an approximation of the descent direction from consecutive iterate and gradient vectors. The limited-memory aspect stems from the replacement of the N × N approximation matrix of the original BFGS method with M vectors of length N. An example usage of the class is included along with the reference source code.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1974

The recovery of polarized apparent temperature distributions of flat scenes from antenna temperature measurements

The reception theory for quasi-monochromatic partially polarized emissions is employed to describe the antenna temperature when observing a flat scene from within or above an absorbing/emitting atmosphere. When the polarization aspects of the antenna and scene are carefully observed, the resulting integral expression for the antenna temperature differs significantly from that reported for polarization invariant temperature distributions. It is observed that the antenna couples to both emitted surface polarizations, and the phase character of the antenna introduces a term involving the product of the polarized and cross-polarized antenna patterns. A matrix approximation of the integral expression is suggested and developed as a means for inverting polarized antenna temperature observations for the underlying partially polarized apparent temperature distributions.

Claassen, J. P.↗
NASA NTRS1989

Robust fixed order dynamic compensation for large space structure control

A simple formulation for designing fixed order dynamic compensators which are robust to both uncertainty at the plant input and structured uncertainty in the plant dynamics is presented. The emphasis is on designing low order compensators for systems of high order. The formulation is done in an output feedback setting which exploits an observer canonical form to represent the compensator dynamics. The formulation also precludes the use of direct feedback of the plant output. The main contribution lies in defining a method for penalizing the states of the plant and of the compensator, and for choosing the distribution on initial conditions so that the loop transfer matrix approximates that of a full state design. To improve robustness to parameter uncertainty, the formulation avoids the introduction of sensitivity states, which has led to complex formulations in earlier studies where only structured uncertainty has been considered.

Calise, Anthony J.↗
NASA NTRS1992

Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods

Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.

Sidi, Avram↗
NASA NTRS2010

Basis Function Approximation of Transonic Aerodynamic Influence Coefficient Matrix

A technique for approximating the modal aerodynamic influence coefficients [AIC] matrices by using basis functions has been developed and validated. An application of the resulting approximated modal AIC matrix for a flutter analysis in transonic speed regime has been demonstrated. This methodology can be applied to the unsteady subsonic, transonic and supersonic aerodynamics. The method requires the unsteady aerodynamics in frequency-domain. The flutter solution can be found by the classic methods, such as rational function approximation, k, p-k, p, root-locus et cetera. The unsteady aeroelastic analysis for design optimization using unsteady transonic aerodynamic approximation is being demonstrated using the ZAERO(TradeMark) flutter solver (ZONA Technology Incorporated, Scottsdale, Arizona). The technique presented has been shown to offer consistent flutter speed prediction on an aerostructures test wing [ATW] 2 configuration with negligible loss in precision in transonic speed regime. These results may have practical significance in the analysis of aircraft aeroelastic calculation and could lead to a more efficient design optimization cycle

Li, Wesley Waisang↗
NASA NTRS1977

State-space formulations for flutter analysis

Two state-space methods for true-damping flutter analysis are presented here. The aerodynamic matrix is assumed to be function of the complex reduced frequency p (off-the-imaginary axis aerodynamics) as the ones provided for instance by the computer code SOUSSA (Steady, Oscillatory and Unsteady, Subsonic and Supersonic Aerodynamics). This matrix is approximated by a third order polynomial or by a Pade's matrix approximant. Then the equations are cast into a suitable state space format including the Laplace transform of the space vector, a frequency-independent matrix, and the flight speed. The solution is then obtained by standard root-locus methods. Results are in good agreement with existing ones in a suitable range of the flutter reduced frequency. A discussion on spurious roots is also included.

Weiss, S. J.↗
NASA NTRS2011

Basis Function Approximation of Transonic Aerodynamic Influence Coefficient Matrix

A technique for approximating the modal aerodynamic influence coefficients matrices by using basis functions has been developed and validated. An application of the resulting approximated modal aerodynamic influence coefficients matrix for a flutter analysis in transonic speed regime has been demonstrated. This methodology can be applied to the unsteady subsonic, transonic, and supersonic aerodynamics. The method requires the unsteady aerodynamics in frequency-domain. The flutter solution can be found by the classic methods, such as rational function approximation, k, p-k, p, root-locus et cetera. The unsteady aeroelastic analysis for design optimization using unsteady transonic aerodynamic approximation is being demonstrated using the ZAERO flutter solver (ZONA Technology Incorporated, Scottsdale, Arizona). The technique presented has been shown to offer consistent flutter speed prediction on an aerostructures test wing 2 configuration with negligible loss in precision in transonic speed regime. These results may have practical significance in the analysis of aircraft aeroelastic calculation and could lead to a more efficient design optimization cycle.

Li, Wesley W.↗
NASA NTRS1986

Approximate Cartesian state transition matrix

Based on a Taylor series expansion, an easily-computed approximation to the Cartesian state transition matrix is presented for a general velocity-independent force field. Suitable for the short time intervals encountered in onboard navigation applications of the extended Kalman filter, it provides approximately five decimal digits of accuracy for earth orbiting spacecraft with update intervals of one minute, and better accuracy for shorter intervals.

Markley, F. L.↗
DOE OSTI2023

Accelerating self-consistent field iterations in Kohn-Sham density functional theory using a low-rank approximation of the dielectric matrix

We present an efficient preconditioning technique for accelerating the fixed-point iteration in real-space Kohn-Sham density functional theory (DFT) calculations. The preconditioner uses a low-rank approximation of the dielectric matrix (LRDM) based on Gâteaux derivatives of the residual of fixed-point iteration along appropriately chosen direction functions. We develop a computationally efficient method to evaluate these Gâteaux derivatives in conjunction with the Chebyshev filtered subspace iteration procedure, an approach widely used in large-scale Kohn-Sham DFT calculations. Further, we propose a variant of LRDM preconditioner based on adaptive accumulation of low-rank approximations from previous self-consistent field iterations, and also extend the LRDM preconditioner to spin-polarized Kohn-Sham DFT calculations. We demonstrate the robustness and efficiency of the LRDM preconditioner against other widely used preconditioners on a range of benchmark systems with sizes ranging from ~100 to 1100 atoms (~500–20,000 electrons). The benchmark systems include various combinations of metal-insulating-semiconducting heterogeneous material systems, nanoparticles with localized d orbitals near the Fermi energy, nanofilm with metal dopants, and magnetic systems. In all benchmark systems, the LRDM preconditioner converges robustly within 20–30 iterations. In contrast, other widely used preconditioners show slow convergence in many cases, as well as divergence of the fixed-point iteration in some cases. Lastly, we demonstrate the computational efficiency afforded by the LRDM method, with up to 3.4-fold reduction in computational cost for the total ground-state calculation compared to other preconditioners.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1994

Model reduction of nonsquare linear MIMO systems using multipoint matrix continued-fraction expansions

This paper deals with the multipoint Cauer matrix continued-fraction expansion (MCFE) for model reduction of linear multi-input multi-output (MIMO) systems with various numbers of inputs and outputs. A salient feature of the proposed MCFE approach to model reduction of MIMO systems with square transfer matrices is its equivalence to the matrix Pade approximation approach. The Cauer second form of the ordinary MCFE for a square transfer function matrix is generalized in this paper to a multipoint and nonsquare-matrix version. An interesting connection of the multipoint Cauer MCFE method to the multipoint matrix Pade approximation method is established. Also, algorithms for obtaining the reduced-degree matrix-fraction descriptions and reduced-dimensional state-space models from a transfer function matrix via the multipoint Cauer MCFE algorithm are presented. Practical advantages of using the multipoint Cauer MCFE are discussed and a numerical example is provided to illustrate the algorithms.

Guo, Tong-Yi↗
NASA NTRS1980

An analytical technique for approximating unsteady aerodynamics in the time domain

An analytical technique is presented for approximating unsteady aerodynamic forces in the time domain. The order of elements of a matrix Pade approximation was postulated, and the resulting polynomial coefficients were determined through a combination of least squares estimates for the numerator coefficients and a constrained gradient search for the denominator coefficients which insures stable approximating functions. The number of differential equations required to represent the aerodynamic forces to a given accuracy tends to be smaller than that employed in certain existing techniques where the denominator coefficients are chosen a priori. Results are shown for an aeroelastic, cantilevered, semispan wing which indicate a good fit to the aerodynamic forces for oscillatory motion can be achieved with a matrix Pade approximation having fourth order numerator and second order denominator polynomials.

Dunn, H. J.↗