Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrices”

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2011

CP violation in hierarchical Yukawa models

Because 4-dimensional CP is a good symmetry of many higher-dimensional theories, this suggests the possible existence of an universal CP-violating phase originating from the process of compactification. Such a phase, if it existed, would not be easy to uncover since the phases in Yukawa matrices are not simply related to the observed Cabibbo-Kobayashi-Maskawa phase {delta}. Hierarchical Yukawa models, of the type arising in F-theory GUT models provide an interesting exception. Recently, Heckman and Vafa studied a particular F-theory GUT model with hierarchical Yukawa matrices with complex phases of O(1) and showed, by examining the Jarlskog invariant, that this model leads to sin{delta}{approx}O(1). A more detailed examination of the model, although confirming their results, is seen to be also compatible with having a phase {delta}{sub o}={pi}/3 imprinted on the Hermitian Yukawa matrices, leading to sin{delta}{approx_equal}sin{delta}{sub o}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

SU-E-T-452: Identifying Inefficiencies in Radiation Oncology Workflow and Prioritizing Solutions for Process Improvement and Patient Safety

Purpose: Successful radiation therapy requires multi-step processes susceptible to unnecessary delays that can negatively impact clinic workflow, patient satisfaction, and safety. This project applied process improvement tools to assess workflow bottlenecks and identify solutions to barriers for effective implementation. Methods: We utilized the DMAIC (define, measure, analyze, improve, control) methodology, limiting our scope to the treatment planning process. From May through December of 2014, times and dates of each step from simulation to treatment were recorded for 507 cases. A value-stream map created from this dataset directed our selection of outcome measures (Y metrics). Critical goals (X metrics) that would accomplish the Y metrics were identified. Barriers to actions were binned into control-impact matrices, in order to stratify them into four groups: in/out of control and high/low impact. Solutions to each barrier were then categorized into benefit-effort matries to identify those of high benefit and low effort. Results: For 507 cases, the mean time from simulation to treatment was 235 total hours. The mean process and wait time were 60 and 132 hours, respectively. The Y metric was to increase the ratio of all non-emergent plans completed the business day prior to treatment from 47% to 75%. Project X metrics included increasing the number of IMRT QAs completed at least 24 hours prior to treatment from 19% to 80% and the number of non-IMRT plans approved at least 24 hours prior to treatment from 33% to 80%. Intervals from simulation to target contour and from initial plan completion to plan approval were identified as periods that could benefit from intervention. Barriers to actions were binned into control-impact matrices and solutions by benefit-effort matrices. Conclusion: The DMAIC method can be successfully applied in radiation therapy clinics to identify inefficiencies and prioritize solutions for the highest impact.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2017

Deflation as a method of variance reduction for estimating the trace of a matrix inverse

Many fields require computing the trace of the inverse of a large, sparse matrix. The typical method used for such computations is the Hutchinson method which is a Monte Carlo (MC) averaging over matrix quadratures. To improve its convergence, several variance reductions techniques have been proposed. In this paper, we study the effects of deflating the near null singular value space. We make two main contributions. First, we analyze the variance of the Hutchinson method as a function of the deflated singular values and vectors. Although this provides good intuition in general, by assuming additionally that the singular vectors are random unitary matrices, we arrive at concise formulas for the deflated variance that include only the variance and mean of the singular values. We make the remarkable observation that deflation may increase variance for Hermitian matrices but not for non-Hermitian ones. This is a rare, if not unique, property where non-Hermitian matrices outperform Hermitian ones. The theory can be used as a model for predicting the benefits of deflation. Second, we use deflation in the context of a large scale application of "disconnected diagrams" in Lattice QCD. On lattices, Hierarchical Probing (HP) has previously provided an order of magnitude of variance reduction over MC by removing "error" from neighboring nodes of increasing distance in the lattice. Although deflation used directly on MC yields a limited improvement of 30% in our problem, when combined with HP they reduce variance by a factor of over 150 compared to MC. For this, we pre-computated 1000 smallest singular values of an ill-conditioned matrix of size 25 million. Furthermore, using PRIMME and a domain-specific Algebraic Multigrid preconditioner, we perform one of the largest eigenvalue computations in Lattice QCD at a fraction of the cost of our trace computation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Final Report - Summer Visit 2010

During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Numerical Methods for Large-Scale Data Factorization (Final Report (Milestone Date 9/30/11) for Subcontract No. B594099)

The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead of the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2010

Lecture Notes on Multigrid Methods

The Lecture Notes are primarily based on a sequence of lectures given by the author while been a Fulbright scholar at 'St. Kliment Ohridski' University of Sofia, Sofia, Bulgaria during the winter semester of 2009-2010 academic year. The notes are somewhat expanded version of the actual one semester class he taught there. The material covered is slightly modified and adapted version of similar topics covered in the author's monograph 'Multilevel Block-Factorization Preconditioners' published in 2008 by Springer. The author tried to keep the notes as self-contained as possible. That is why the lecture notes begin with some basic introductory matrix-vector linear algebra, numerical PDEs (finite element) facts emphasizing the relations between functions in finite dimensional spaces and their coefficient vectors and respective norms. Then, some additional facts on the implementation of finite elements based on relation tables using the popular compressed sparse row (CSR) format are given. Also, typical condition number estimates of stiffness and mass matrices, the global matrix assembly from local element matrices are given as well. Finally, some basic introductory facts about stationary iterative methods, such as Gauss-Seidel and its symmetrized version are presented. The introductory material ends up with the smoothing property of the classical iterative methods and the main definition of two-grid iterative methods. From here on, the second part of the notes begins which deals with the various aspects of the principal TG and the numerous versions of the MG cycles. At the end, in part III, we briefly introduce algebraic versions of MG referred to as AMG, focusing on classes of AMG specialized for finite element matrices.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2016

Improved Variable-Transformation Algorithm for the Hexagonal Variational Nodal Method

Hexagonal Variational Nodal Method (VNM) has been widely employed in fast reactor core calculation codes. It provides the weak form solution of the second order transport equation. It employs a direct three-dimensional expansion instead of the transverse integration technique, with the singular term caused by transverse integration over the hexagonal nodal avoided. However, as the increasing Pn expansion order in angle, the number of moments increases dramatically, which significantly increases the requirements in both memory and computational time. As a consequence, Yang proposed the Variable-Transformation Algorithm. It firstly used the reverse Cuthill-McKee (RCMK) reordering method to transform the response matrices into block-diagonal. Then, for the unreducible matrices, orthogonal transformation was applied, after which the matrices were sparse enough to be reduced by using the RCMK reordering once more. In this summary, based on a newly developed hexagonal VNM code NECP-VioletHex, the Variable Transformation Algorithm was investigated and improved by adopting more constraints to the basis functions to further take advantage of the symmetric properties of the hexagonal-z nodes. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Nanocomposite Ionogel Electrolytes for Solid‐State Rechargeable Batteries

Abstract Ionogels composed of ionic liquids and gelling solid matrices offer several advantages as solid‐state electrolytes for rechargeable batteries, including safety under diverse operating conditions, favorable electrochemical and thermal properties, and wide processing compatibility. Among gelling solid matrices, nanoscale materials have shown particular promise due to their ability to concurrently enhance ionogel mechanical properties, thermal stability, ionic conductivity, and electrochemical stability. These beneficial attributes suggest that ionogel electrolytes are not only of interest for incumbent lithium‐ion batteries but also for next‐generation rechargeable battery technologies. Herein, recent advances in nanocomposite ionogel electrolytes are discussed to highlight their advantages as solid‐state electrolytes for rechargeable batteries. By exploring a range of different nanoscale gelling solid matrices, relationships between nanoscale material structure and ionogel properties are developed. Furthermore, key research challenges are delineated to help guide and accelerate the incorporation of nanocomposite ionogel electrolytes in high‐performance solid‐state rechargeable batteries.

Hyun, Woo Jin↗
DOE OSTI2024

Flavor in SU(5)$SU(5)$ Finite Grand Unified Models

Abstract Four supersymmetric models which exhibit and/or symmetries are studied, that are finite to two or all loops, and their corresponding mass matrices. The first is an all‐loop finite model based on an flavor symmetry, which leads to phenomenologically nonviable mass matrices. The remaining models, based on cyclic symmetries, show various mass textures, some of which are phenomenologically promising. For the two‐loop finite models, the parametric solutions to the finiteness conditions determine completely some of the Yukawa couplings, and lead to a restricted range of values for other ones at the GUT scale, with a considerable reduction in the number of free parameters. One particular solution of the two‐loop models shows an enhanced symmetry, leading to an all‐loop finite model, which has a significant parameter reduction and could in principle reproduce the observed quark masses and mixing pattern. In this case the finiteness conditions determine the absolute value of all the Yukawa couplings at the unification scale. Finally, the minimum number of phases in the mass matrices and their position are determined, a task not previously done in Finite Unified Theories, which contributes towards the reduction of parameters and a better understanding of the Yukawa couplings.

Estrada Ramos, Luis Odín↗
DOE OSTI2024

e RPCA : Robust Principal Component Analysis for Exponential Family Distributions

Abstract Robust principal component analysis (RPCA) is a widely used method for recovering low‐rank structure from data matrices corrupted by significant and sparse outliers. These corruptions may arise from occlusions, malicious tampering, or other causes for anomalies, and the joint identification of such corruptions with low‐rank background is critical for process monitoring and diagnosis. However, existing RPCA methods and their extensions largely do not account for the underlying probabilistic distribution for the data matrices, which in many applications are known and can be highly non‐Gaussian. We thus propose a new method called RPCA for exponential family distributions (), which can perform the desired decomposition into low‐rank and sparse matrices when such a distribution falls within the exponential family. We present a novel alternating direction method of multiplier optimization algorithm for efficient decomposition, under either its natural or canonical parametrization. The effectiveness of is then demonstrated in two applications: the first for steel sheet defect detection and the second for crime activity monitoring in the Atlanta metropolitan area.

Zheng, Xiaojun↗
DOE OSTI2013

Power/Performance Trade-offs of Small Batched LU Based Solvers on GPUs

In this paper we propose and analyze a set of batched linear solvers for small matrices on Graphic Processing Units (GPUs), evaluating the various alternatives depending on the size of the systems to solve. We discuss three different solutions that operate with different level of parallelization and GPU features. The first, exploiting the CUBLAS library, manages matrices of size up to 32x32 and employs Warp level (one matrix, one Warp) parallelism and shared memory. The second works at Thread-block level parallelism (one matrix, one Thread-block), still exploiting shared memory but managing matrices up to 76x76. The third is Thread level parallel (one matrix, one thread) and can reach sizes up to 128x128, but it does not exploit shared memory and only relies on the high memory bandwidth of the GPU. The first and second solution only support partial pivoting, the third one easily supports partial and full pivoting, making it attractive to problems that require greater numerical stability. We analyze the trade-offs in terms of performance and power consumption as function of the size of the linear systems that are simultaneously solved. We execute the three implementations on a Tesla M2090 (Fermi) and on a Tesla K20 (Kepler).

GPGPU↗
DOE OSTI2020

The O(N) S-matrix monolith

We consider the scattering matrices of massive quantum field theories with no bound states and a global O(N) symmetry in two spacetime dimensions. In particular we explore the space of two-to-two S-matrices of particles of mass m transforming in the vector representation as restricted by the general conditions of unitarity, crossing, analyticity and O(N) symmetry. We found a rich structure in that space by using convex maximization and in particular its convex dual minimization problem. At the boundary of the allowed space special geometric points such as vertices were found to correspond to integrable models. The dual convex minimization problem provides a novel and useful approach to the problem allowing, for example, to prove that generically the S-matrices so obtained saturate unitarity and, insome cases, that they are at vertices of the allowed space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

A minimal supersymmetric E6 unified theory

We show explicitly that supersymmetric E 6 Grand Unified Theory with a Higgs sector consisting of {27+$\overline{27}$ + 351+ $\overline{351}$ + 78} fields provides a realistic scenario for symmetry breaking and fermion mass generation. While gauge symmetry breaking can be achieved without the 78 field, its presence is critical for a successful doublet-triplet mass splitting. The Yukawa sector of the model consists of only two symmetric matrices describing all of quark, lepton and neutrino masses and mixings. The fermion mass matrices are computed at low energy and a fit to the second and third generation masses and mixings is performed. Here, we find a good numerical fit to the low-energy data. Thus, this model, having 11 superpotential parameters, alongside the two symmetric Yukawa matrices, seems to be the best realistic candidate for a minimal renormalizable supersymmetric E 6 unified theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Dirac traces and the Tutte polynomial

Perturbative calculations involving fermion loops in quantum field theories require tracing over Dirac matrices. A simple way to regulate the divergences that generically appear in these calculations is dimensional regularisation, which has the consequence of replacing 4-dimensional Dirac matrices with d-dimensional counterparts for arbitrary complex values of d. In this work, a connection between traces of d-dimensional Dirac matrices and computations of the Tutte polynomial of associated graphs is proven. The time complexity of computing Dirac traces is analysed by this connection, and improvements to algorithms for computing Dirac traces are proposed.

Renormalization and Regularization↗
DOE OSTI2018

Fast Decomposition of Three-Component Spectra of Fluorescence Quenching by White and Grey Methods of Data Modeling

‘White’ and ‘grey’ methods of data modeling have been employed to resolve the heterogeneous fluorescence from a fluorophore mixture of 9-cyanoanthracene (CNA), 10-chloro-9-cyanoanthracene (ClCNA) and 9,10-dicyanoanthracene (DCNA) into component individual fluorescence spectra. The three-component spectra of fluorescence quenching in methanol were recorded for increasing amounts of lithium bromide used as a quencher. The associated intensity decay profiles of differentially quenched fluorescence of single components were modeled on the basis of a linear Stern-Volmer plot. These profiles are necessary to initiate the fitting procedure in both ‘white’ and ‘grey’ modeling of the original data matrices. ‘White’ methods of data modeling, called also ‘hard’ methods, are based on chemical/physical laws expressed in terms of some well-known or generally accepted mathematical equations. The parameters of these models are not known and they are estimated by least squares curve fitting. ‘Grey’ approaches to data modeling, also known as hard-soft modeling techniques, make use of both hard-model and soft-model parts. In practice, the difference between ‘white’ and ‘grey’ methods lies in the way in which the ‘crude’ fluorescence intensity decays of the mixture components are estimated. In the former case they are given in a functional form while in the latter as digitized curves which, in general, can only be obtained by using dedicated techniques of factor analysis. In the paper, the initial values of the Stern-Volmer constants of pure components were evaluated by both ‘point-by-point’ and ‘matrix’ versions of the method making use of the concept of wavelength dependent intensity fractions as well as by the rank annihilation factor analysis applied to the data matrices of the difference fluorescence spectra constructed in two ways: from the spectra recorded for a few excitation lines at the same concentration of a fluorescence quencher or classically from a series of the spectra measured for one selected excitation line but for increasing concentration of the quencher. The results of multiple curve resolution obtained by all types of the applied methods have been scrutinized and compared. In addition, the effect of inadequacy of sample preparation and increasing instrumental noise on the shape of the resolved spectral profiles has been studied on several datasets mimicking the measured data matrices. .

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Separation of gold from irradiated actinide material utilizing a 2- thenoyltrifluoroacetone extraction resin

Post-detonation nuclear forensics capabilities depend on the ability to rapidly isolate radionuclides to improve measurement quality. In this work an extraction chromatography resin was developed utilizing the extractants thenoyltrifluoroacetone and 1-octanol supported on Eichrom prefilter resin. Here the resin was tested in nitric and hydrochloric acid matrices. In nitric acid matrices the resin is able to extract zirconium, while in hydrochloric acid matrices it is possible to extract iron and gallium. In all acid conditions tested gold is retained but can be removed from the column with a 10% thiourea rinse.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2020

Towards the scale-up production of cellulose nanocomposites using melt processing: A critical review on structure-processing-property relationships

Cellulose nanomaterials (CNMs) naturally exist in plant biomass. The success of extraction of CNMs opened up a new era of using plant biomass for innovative industrial applications. Because CNMs are abundant, renewable, biodegradable, transparent, light weight and low in cost, they are ideal materials for large volume applications such as packaging, automotive, building and infrastructure. In many potential application areas, CNM-enable products appear in a composite form, mostly polymer composites. Additionally, the industrial-scale manufacturing of CNM/thermoplastic composites remains as a set of unsolved problems for academia and industry. A prime challenge in applications is the nanoscale dispersion of CNMs in thermoplastic matrices during melt processing. Both bench-scale and pilot-scale studies have been conducted to solve the dispersion issue of CNMs. In this article, research related to the dispersion of CNMs in thermoplastic matrices during melt processing were critically reviewed. All research papers were classified into three groups: chemically-aided dispersion, physically-aided dispersion and mechanically-aided dispersion. Numerous factors affect the CNM dispersion and the mechanical performance of its nanocomposites. There are material-related factors, including CNM types and forms, polymer matrices, surface modification, coupling agents, etc. Furthermore, extrusion processing parameters also play a significant role, covering screw rotation speed, extrusion barrel temperature settings and screw design. In addition, the material-related factors interact with the processing-related factors. Understanding all factors and their interactions are important for moving CNM nanocomposites research a step further towards industrial-relevant production, which is the final ambitious goal of this manuscript.

42 ENGINEERING↗