Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix decomposition”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

Chew, W. C.↗
DOE OSTI2021

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Granger Causality for prediction in Dynamic Mode Decomposition: Application to power systems

Here, the dynamic mode decomposition (DMD) technique extracts the dominant modes characterizing the innate dynamical behavior of the system within the measurement data. For appropriate identification of dominant modes from the measurement data, the DMD algorithm necessitates ensuring the quality of the input measurement data sequences. On that account, for validating the usability of the dataset for the DMD algorithm, the paper proposed two conditions: Persistence of excitation (PE) and the Granger Causality Test (GCT). The virtual data sequences are designed with the hankel matrix representation such that the dimensions of the subspace spanning the essential system modes are increased with the addition of new state variables. The PE condition provides the lower bound for the trajectory length, and the GCT provides the order of the model. Satisfying the PE condition enables estimating an approximate linear model, but the predictability with the identified model is only assured with the temporal causation among data searched with GCT. The proposed methodology is validated with the application for coherency identification (CI) in a multi-machine power system (MMPS), an essential phenomenon in transient stability analysis. The significance of PE condition and GCT is demonstrated through various case studies implemented on 22 bus six generator system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Matrix ensembles with global symmetries and ’t Hooft anomalies from 2d gauge theory

The Hilbert space of a quantum system with internal global symmetry $\textit{G}$ decomposes into sectors labelled by irreducible representations of $\textit{G}$. If the system is chaotic, the energies in each sector should separately resemble ordinary random matrix theory. We show that such “sector-wise” random matrix ensembles arise as the boundary dual of two- dimensional gravity with a $\textit{G}$ gauge field in the bulk. Within each sector, the eigenvalue density is enhanced by a nontrivial factor of the dimension of the representation, and the ground state energy is determined by the quadratic Casimir. We study the consequences of ’t Hooft anomalies in the matrix ensembles, which are incorporated by adding specific topological terms to the gauge theory action. The effect is to introduce projective representations into the decomposition of the Hilbert space. Finally, we consider ensembles with $\textit{G}$ symmetry and time reversal symmetry, and analyze a simple case of a mixed anomaly between time reversal and an internal $\mathbb{Z}$ 2 symmetry.

2D Gravity↗
NASA NTRS1983

Accuracy and resolution of Earth Radiation Budget Estimates

A numerical filter inversion technique that reduces wide-angle satellite measurements to top-of-the-atmosphere radiant exitances has been proposed for the Earth Radiation Budget Experiment (ERBE). The matrix formulation of this technique is presented, and the design of the numerical filter is discussed. The filter is smoothed with a singular value decomposition. The inversion process is simulated by generating synthetic measurements from a 24 degree spherical harmonic radiation field derived from Nimbus 6 ERB data. The numerical filter is applied to these measurements after they are corrupted with instrument error. The results are curves of expected error versus resolution area.

Green, R. N.↗
NASA NTRS2010

Decomposition Algorithm for Global Reachability on a Time-Varying Graph

A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.

Kuwata, Yoshiaki↗
NASA NTRS2002

Decomposition-Based Failure Mode Identification Method for Risk-Free Design of Large Systems

When designing products, it is crucial to assure failure and risk-free operation in the intended operating environment. Failures are typically studied and eliminated as much as possible during the early stages of design. The few failures that go undetected result in unacceptable damage and losses in high-risk applications where public safety is of concern. Published NASA and NTSB accident reports point to a variety of components identified as sources of failures in the reported cases. In previous work, data from these reports were processed and placed in matrix form for all the system components and failure modes encountered, and then manipulated using matrix methods to determine similarities between the different components and failure modes. In this paper, these matrices are represented in the form of a linear combination of failures modes, mathematically formed using Principal Components Analysis (PCA) decomposition. The PCA decomposition results in a low-dimensionality representation of all failure modes and components of interest, represented in a transformed coordinate system. Such a representation opens the way for efficient pattern analysis and prediction of failure modes with highest potential risks on the final product, rather than making decisions based on the large space of component and failure mode data. The mathematics of the proposed method are explained first using a simple example problem. The method is then applied to component failure data gathered from helicopter, accident reports to demonstrate its potential.

Tumer, Irem Y.↗
DOE OSTI2022

When Do Extended Physics-Informed Neural Networks (XPINNs) Improve Generalization?

Physics-informed neural networks (PINNs) have become a popular choice for solving high-dimensional partial differential equations (PDEs) due to their excellent approximation power and generalization ability. Recently, extended PINNs (XPINNs) based on domain decomposition methods have attracted considerable attention due to their effectiveness in modeling multiscale and multiphysics problems and their parallelization. However, theoretical understanding of their convergence and generalization properties remains unexplored. In this study, we take an initial step towards understanding how and when XPINNs outperform PINNs. Specifically, for general multilayer PINNs and XPINNs, we first provide a prior generalization bound via the complexity of the target functions in the PDE problem and a posterior generalization bound via the posterior matrix norms of the networks after optimization. Moreover, based on our bounds, we analyze the conditions under which XPINNs improve generalization. Concretely, our theory shows that the key building block of XPINN, namely, the domain decomposition, introduces a tradeoff for generalization. On the one hand, XPINNs decompose the complex PDE solution into several simple parts, which decreases the complexity needed to learn each part and boosts generalization. On the other hand, decomposition leads to less training data being available in each subdomain, and hence such a model is typically prone to overfitting and may become less generalizable. Empirically, we choose five PDEs to show when XPINNs perform better than, similar to, or worse than PINNs, hence demonstrating and justifying our new theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Forced Oscillation Source Location in Power Systems Using MVMD-assisted DEF in TF Plane

Fast and accurate forced oscillation source location (FOSL) is critical for mitigating forced oscillations in power systems. Here, to overcome the shortcomings of traditional dissipating energy flow (DEF) in decomposing the forced oscillation components from the measurement responses, a multivariate variational mode decomposition (MVMD)-assisted FOSL is proposed in this paper to locate the forced oscillation sources from measurements in time-frequency (TF) plane. The multi-channel measurement matrix of each generator is formed, then the multi-channel modes are decomposed from the formed multi-channel measurement matrix using the MVMD. Further, the intrinsic mode functions (IMFs) associated with the forced oscillation mode are distinguished from the decomposed modes according to the relative energy weights. With the distinguished IMFs, the MVMD-assisted DEF calculation method is developed to locate the forced oscillation source. Finally, the performance of the proposed method is evaluated using the simulation data of the WECC 179-bus test system and IEEE-NASPI Oscillation Source Location Contest as well as the actual PMU data of ISO New England. The results validated the effectiveness and accuracy of the proposed method in the FOSL.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1974

Derivatives of eigenvalues and eigenvectors for a general matrix

Expressions are obtained for the derivatives of the eigenvalues and eigenvectors which are expressions of only one left-hand and one right-hand eigenvector. The approach described makes use of a Choleski decomposition or some other decomposition method. The method may be extended to find any order of derivative of the eigenvalue and eigenvector. The expressions obtained for finding the derivatives of eigenvalues and eigenvectors for nonself-adjoint systems may be applied to self-adjoint systems.

Rudisill, C. S.↗
DOE OSTI2024

Dynamic flux surrogate-based partitioned methods for interface problems

Loosely coupled partitioned methods for multiphysics problems treat each subproblem as a separate entity and advance them independently in time. In so doing these methods enable code reuse, increase concurrency and provide a convenient framework for plug-and-play multiphysics simulations. However, mathematically loosely coupled schemes are equivalent to a single step of an iterative solution method, which can compromise their accuracy and stability. We present a new data-driven partitioned method for coupled parametric PDEs that can improve upon the accuracy of traditional loosely coupled methods without incurring a performance penalty. To that end, we replace conventional field transfers across the interface by a surrogate for the dynamics of the interface flux exchanged between the subdomains. To develop this surrogate we apply dynamic mode decomposition to a non-standard staggered-in-time state, comprising the interface flux and small solution patches near the interface. The new approach shifts the main computational burden to an offline training phase, whereas application of the surrogate in the online phase amounts to a single matrix–vector multiplication. In conclusion, we provide stability analysis of the surrogate-based partitioned scheme and include numerical results that demonstrate its potential.

Dynamic mode decomposition (DMD)↗
NASA NTRS1999

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational reproducibility is well known in the parallel computing community. It is a requirement that the parallel code perform calculations in a fashion that will yield identical results on different configurations of processing elements on the same platform. In some cases this problem can be solved by sacrificing performance. Meeting this requirement and still achieving high performance is very difficult. Topics to be discussed include: current PSAS design and parallelization strategy; reproducibility issues; load balance vs. database memory demands, possible solutions to these problems.

Larson, J. W.↗
DOE OSTI2024

From phase decomposition to evaporation: A multi-modal evaluation of thermally degraded model lightweight high-entropy alloy

Lightweight high-entropy alloys (LHEAs) have the potential to replace conventional lightweight materials due to their superior mechanical properties and thermal stability. However, the thermal degradation pattern of LHEAs from phase decomposition to evaporation is not clear. We develop a new Al-based dual phase (FCC + HCP) LHEA—AlTi 0.45 CuZn, and further investigate its thermal degradation behavior for potential high-temperature structural applications. Using multimodal advanced characterization techniques such as differential scanning calorimetry/thermogravimetric analysis, scanning/transmission electron microscopy, and synchrotron X-ray diffraction/pair distribution function (XRD/PDF), a sequence of thermal degradation events beyond the thermal phase stability limit—between 250 and 360 °C—is observed. These include phase decomposition at ~360 °C, Zn evaporation at ~750 °C, and LHEA melting at 880 °C which results in ~25% cumulative weight loss. The formation of Al-Ti phase off the AlTi 0.45 CuZn matrix is due to the largest negative mixing enthalpy for Al-Ti than other binary pairs. Similarly, Zn evaporation from AlTi 0.45 CuZn LHEA is due to its faster evaporation rate than other constituent elements. The high-resolution synchrotron XRD and PDF results support the aforementioned observations; in addition, they reveal local atomic arrangements, local strain, and sluggish grain growth in the LHEA. Among other LHEAs of close density range (5.55 ≤ ρ ≤ 5.85 g/cc), the investigated LHEA exhibits outstanding nano-indentation hardness values due to the coupled grain size effect and HCP phase strengthening of the FCC matrix. As the search for LHEAs for lightweight applications grows, this study shows the potential use of AlTi 0.45 CuZn LHEA for structural applications even at elevated temperatures.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1986

Landsat D Thematic Mapper image dimensionality reduction and geometric correction accuracy

To characterize and quantify the performance of the Landsat thematic mapper (TM), techniques for dimensionality reduction by linear transformation have been studied and evaluated and the accuracy of the correction of geometric errors in TM images analyzed. Theoretical evaluations and comparisons for existing methods for the design of linear transformation for dimensionality reduction are presented. These methods include the discrete Karhunen Loeve (KL) expansion, Multiple Discriminant Analysis (MDA), Thematic Mapper (TM)-Tasseled Cap Linear Transformation and Singular Value Decomposition (SVD). A unified approach to these design problems is presented in which each method involves optimizing an objective function with respect to the linear transformation matrix. From these studies, four modified methods are proposed. They are referred to as the Space Variant Linear Transformation, the KL Transform-MDA hybrid method, and the First and Second Version of the Weighted MDA method. The modifications involve the assignment of weights to classes to achieve improvements in the class conditional probability of error for classes with high weights. Experimental evaluations of the existing and proposed methods have been performed using the six reflective bands of the TM data. It is shown that in terms of probability of classification error and the percentage of the cumulative eigenvalues, the six reflective bands of the TM data require only a three dimensional feature space. It is shown experimentally as well that for the proposed methods, the classes with high weights have improvements in class conditional probability of error estimates as expected.

Ford, G. E.↗
NASA NTRS1998

Microwave Imaging on Metal Objects

This final report for the project discusses the attempts to model, using different methods, microwave image reconstruction. Maximum Entropy Method was not successful. Attempts to use Singular Value Decomposition (SVD) got some good results after initial failure. SVD is based upon a theory of linear algebra, to the effect that any M X N Matrix A whose number of rows M is greater than or equal to its number of columns, N can be written as the product of an M X N column-orthogonal matrix U, an N X N diagonal Matrix, W, with m positive or zero elements (the singular values) and the transposition of an N X N orthogonal matrix V. In microwave imaging, the scattered fields can be expressed by the induced current distribution. The SVD method required more contiguous computer memory than was available. Work was also done on the Conjugate Gradient Method (CGM), which didn't work well when tried earlier. It was found that separation of the imaginary part and the real part during calculation may work. This work was considered incomplete as of the end of the grant period.

Tolliver, C. L.↗
DOE OSTI2022

Tunable quantum logic gate on photonic qubits with a ladder emitter

We describe how a ladder emitter can implement a tunable quantum logic gate on photonic qubits encoded in the frequency basis. The ground-to-first excited state of the ladder emitter interacts with the control photon, and the first-to-second excited state transition interacts with the target photon. By controlling the relative detuning between the target photon and the first-to-second excited state transition of the ladder emitter, we enable any controlled-phase operation from 0 to π. We derive analytical formulas for the performance of the gate through the S-matrix formalism as well as describe the mechanism intuitively. This gate is deterministic, does not utilize any active control, and needs only a single ladder emitter, enabling low-footprint and more efficient decomposition of quantum circuits, especially the quantum Fourier transform. We suggest multiple potential systems for physical realization of our proposal, such as lanthanide ions embedded in Purcell-enhanced cavities. We expect these results to motivate further interest in photonic quantum information processing with designer emitters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Nonperturbative random matrix model of N = 2 JT supergravity

It is shown how to nonperturbatively define a random matrix model that captures key physics of N = 2 Jackiw-Teitelboim supergravity, going well beyond the perturbative topological expansion defined recently by Turiaci and Witten. A decomposition into an infinite family of certain multicritical models is derived, leading to the definition of a nonlinear ordinary differential equation from which the physics may be computed. Bogomol’nyi-Prasad-Sommerfield (BPS) states are naturally described by the model. The nonperturbative completions of the spectral densities for non-BPS multiplets are readily extracted. Published by the American Physical Society 2024

Johnson, Clifford V. (ORCID:0000000189645830)↗