Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decomposition algorithm”

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 775 records · Page 43

Impact of environmental factors on biometric matching during human decomposition

Automatic recognition systems are a valuable tool for identifying unknown deceased individuals. Immediately af- ter death fingerprint and face biometric samples are easy to collect using standard sensors and cameras and can be easily matched to anti-mortem biometric samples. Even though post-mortem fingerprints and faces have been used for decades, there are no studies that track these biomet- rics through the later stages of decomposition to determine the length of time the biometrics remain viable. This paper discusses a multimodal dataset of fingerprints, faces, and irises from 14 human cadavers that decomposed outdoors under natural conditions. Results include predictive models relating time and temperature, measured as Accumulated Degree Days (ADD), and season (winter, spring, summer) to the predicted probably of automatic verification using a commercial algorithm.

Bolme, David S↗

ESPResSo++ 2.0: Advanced methods for multiscale molecular simulation

We report that molecular simulation is a scientific tool used in many fields including material science and biology. This requires constant development and enhancement of algorithms within molecular simulation software packages. Here, we present computational tools for multiscale modeling developed and implemented within the ESPResSo++ package. These include the latest applications of the adaptive resolution scheme, the hydrodynamic interactions through a lattice Boltzmann solvent coupled to particle-based molecular dynamics, the implementation of the hierarchical strategy for equilibrating long-chained polymer melts and a heterogeneous spatial domain decomposition. The software design of ESPResSo++ has kept its highly modular C++ kernel with a Python user interface. Furthermore, it has been enhanced by automatic scripts that parse configurations from other established packages, providing scientists with the ability to rapidly set up their simulations.

97 MATHEMATICS AND COMPUTING↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Adaptive matching of the iota ring linear optics for space charge compensation

Many present and future accelerators must operate with high intensity beams when distortions induced by space charge forces are among major limiting factors. Betatron tune depression of above approximately 0.1 per cell leads to significant distortions of linear optics. Many aspects of machine operation depend on proper relations between lattice functions and phase advances, and can be i proved with proper treatment of space charge effects. We implement an adaptive algorithm for linear lattice re matching with full account of space charge in the linear approximation for the case of Fermilab’s IOTA ring. The method is based on a search for initial second moments that give closed solution and, at the same predefined set of goals for emittances, beta functions, dispersions and phase advances at and between points of interest. Iterative singular value decomposition based technique is used to search for optimum by varying wide array of model parameters

43 PARTICLE ACCELERATORS↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

LayTracks3D: A new approach for meshing general solids using medial axis transform

This study presents an extension of the all-quad meshing algorithm called LayTracks to generate high quality hex-dominant meshes of general solids. LayTracks3D uses the mapping between the Medial Axis (MA) and the boundary of the 3D domain to decompose complex 3D domains into simpler domains called Tracks. Tracks in 3D have no branches and are symmetric, non-intersecting, orthogonal to the boundary, and the shortest path from the MA to the boundary. These properties of tracks result in desired meshes with near cube shape elements at the boundary, structured mesh along the boundary normal with any irregular nodes restricted to the MA, and sharp boundary feature preservation. The algorithm has been tested on a few industrial CAD models and hex-dominant meshes are shown in the Results section. Work is underway to extend LayTracks3D to generate all-hex meshes.

97 MATHEMATICS AND COMPUTING↗

Analytical gradients of complete active space self-consistent field energies using Cholesky decomposition: Geometry optimization and spin-state energetics of a ruthenium nitrosyl complex

We present a formulation of analytical energy gradients at the complete active space self-consistent field (CASSCF) level of theory employing density fitting (DF) techniques to enable efficient geometry optimizations of large systems. As an example, the ground and lowest triplet state geometries of a ruthenium nitrosyl complex are computed at the DF-CASSCF level of theory and compared with structures obtained from density functional theory (DFT) using the B3LYP, BP86, and M06L functionals. The average deviation of all bond lengths compared to the crystal structure is 0.042 Å at the DF-CASSCF level of theory, which is slightly larger but still comparable with the deviations obtained by the tested DFT functionals, e.g., 0.032 Å with M06L. Specifically, the root-mean-square deviation between the DF-CASSCF and best DFT coordinates, delivered by BP86, is only 0.08 Å for S{sub 0} and 0.11 Å for T{sub 1}, indicating that the geometries are very similar. While keeping the mean energy gradient errors below 0.25%, the DF technique results in a 13-fold speedup compared to the conventional CASSCF geometry optimization algorithm. Additionally, we assess the singlet-triplet energy vertical and adiabatic differences with multiconfigurational second-order perturbation theory (CASPT2) using the DF-CASSCF and DFT optimized geometries. It is found that the vertical CASPT2 energies are relatively similar regardless of the geometry employed whereas the adiabatic singlet-triplet gaps are more sensitive to the chosen triplet geometry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Final Report, Center for Programming Models for Scalable Parallel Computing: Co-Array Fortran, Grant Number DE-FC02-01ER25505

The major accomplishment of this project is the production of CafLib, an 'object-oriented' parallel numerical library written in Co-Array Fortran. CafLib contains distributed objects such as block vectors and block matrices along with procedures, attached to each object, that perform basic linear algebra operations such as matrix multiplication, matrix transpose and LU decomposition. It also contains constructors and destructors for each object that hide the details of data decomposition from the programmer, and it contains collective operations that allow the programmer to calculate global reductions, such as global sums, global minima and global maxima, as well as vector and matrix norms of several kinds. CafLib is designed to be extensible in such a way that programmers can define distributed grid and field objects, based on vector and matrix objects from the library, for finite difference algorithms to solve partial differential equations. A very important extra benefit that resulted from the project is the inclusion of the co-array programming model in the next Fortran standard called Fortran 2008. It is the first parallel programming model ever included as a standard part of the language. Co-arrays will be a supported feature in all Fortran compilers, and the portability provided by standardization will encourage a large number of programmers to adopt it for new parallel application development. The combination of object-oriented programming in Fortran 2003 with co-arrays in Fortran 2008 provides a very powerful programming model for high-performance scientific computing. Additional benefits from the project, beyond the original goal, include a programto provide access to the co-array model through access to the Cray compiler as a resource for teaching and research. Several academics, for the first time, included the co-array model as a topic in their courses on parallel computing. A separate collaborative project with LANL and PNNL showed how to extend the co-array model to other languages in a small experimental version of Co-array Python. Another collaborative project defined a Fortran 95 interface to ARMCI to encourage Fortran programmers to use the one-sided communication model in anticipation of their conversion to the co-array model later. A collaborative project with the Earth Sciences community at NASA Goddard and GFDL experimented with the co-array model within computational kernels related to their climate models, first using CafLib and then extending the co-array model to use design patterns. Future work will build on the design-pattern idea with a redesign of CafLib as a true object-oriented library using Fortran 2003 and as a parallel numerical library using Fortran 2008.

97 MATHEMATICS AND COMPUTING↗

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Sampling and resolution characteristics in reduced order models of shallow water equations: Intrusive vs nonintrusive

We investigate the sensitivity of reduced order models (ROMs) to training data spatial resolution as well as sampling rate. In particular, we consider proper orthogonal decomposition (POD), coupled with Galerkin projection (POD-GP), as an intrusive reduced order modeling technique. For non-intrusive ROMs, we consider two frameworks. The first is using dynamic mode decomposition (DMD), and the second is based on artificial neural networks (ANNs). For ANN, we utilized a residual deep neural network, and for DMD we have studied two versions of DMD approaches; one with hard thresholding and the other with sorted bases selection. Also, we highlight the differences between mean-subtracting the data (centering) and using the data without mean-subtraction. We tested these ROMs using a system of 2D shallow water equations for four different numerical experiments, adopting combinations of sampling rates and spatial resolutions. For these cases, we found that the DMD basis obtained with hard threshodling is sensitive to sampling rate. The sorted DMD algorithm helps to mitigate this problem and yields more stabilized and converging solution. Furthermore, we demonstrate that both DMD approaches without mean subtraction provide significantly more accurate results than DMD with mean-subtracting the data. On the other hand, POD is relatively insensitive to sampling rate and yields better representation of the flow field. Meanwhile, spatial resolution has little effect on both POD and DMD performances. Here, the numerical results reveal that an ANN on POD subspace (POD-ANN) performs remarkably better than POD-GP and DMD in capturing system dynamics, even with a small number of modes.

42 ENGINEERING↗

GLAD-M35: a joint P and S global tomographic model with uncertainty quantification

We present our third and final generation joint P and S global adjoint tomography (GLAD) model, GLAD-M35, and quantify its uncertainty based on a low-rank approximation of the inverse Hessian. Starting from our second-generation model, GLAD-M25, we added 680 new earthquakes to the database for a total of 2160 events. New P-wave categories are included to compensate for the imbalance between P- and S-wave measurements, and we enhanced the window selection algorithm to include more major-arc phases, providing better constraints on the structure of the deep mantle and more than doubling the number of measurement windows to 40 million. Two stages of a Broyden–Fletcher–Goldfarb–Shanno (BFGS) quasi-Newton inversion were performed, each comprising five iterations. With this BFGS update history, we determine the model’s standard deviation and resolution length through randomized singular value decomposition.

58 GEOSCIENCES↗

Independent calculation of dose distributions for helical tomotherapy using a conventional treatment planning system

Purpose: The dosimetric verification of treatment plans in helical tomotherapy usually is carried out via verification measurements. In this study, a method for independent dose calculation of tomotherapy treatment plans is presented, that uses a conventional treatment planning system with a pencil kernel dose calculation algorithm for generation of verification dose distributions based on patient CT data. Methods: A pencil beam algorithm that directly uses measured beam data was configured for dose calculation for a tomotherapy machine. Tomotherapy treatment plans were converted into a format readable by an in-house treatment planning system by assigning each projection to one static treatment field and shifting the calculation isocenter for each field in order to account for the couch movement. The modulation of the fluence for each projection is read out of the delivery sinogram, and with the kernel-based dose calculation, this information can directly be used for dose calculation without the need for decomposition of the sinogram. The sinogram values are only corrected for leaf output and leaf latency. Using the converted treatment plans, dose was recalculated with the independent treatment planning system. Multiple treatment plans ranging from simple static fields to real patient treatment plans were calculated using the new approach and either compared to actual measurements or the 3D dose distribution calculated by the tomotherapy treatment planning system. In addition, dose–volume histograms were calculated for the patient plans. Results: Except for minor deviations at the maximum field size, the pencil beam dose calculation for static beams agreed with measurements in a water tank within 2%/2 mm. A mean deviation to point dose measurements in the cheese phantom of 0.89% ± 0.81% was found for unmodulated helical plans. A mean voxel-based deviation of −0.67% ± 1.11% for all voxels in the respective high dose region (dose values >80%), and a mean local voxel-based deviation of −2.41% ± 0.75% for all voxels with dose values >20% were found for 11 modulated plans in the cheese phantom. Averaged over nine patient plans, the deviations amounted to −0.14% ± 1.97% (voxels >80%) and −0.95% ± 2.27% (>20%, local deviations). For a lung case, mean voxel-based deviations of more than 4% were found, while for all other patient plans, all mean voxel-based deviations were within ±2.4%. Conclusions: The presented method is suitable for independent dose calculation for helical tomotherapy within the known limitations of the pencil beam algorithm. It can serve as verification of the primary dose calculation and thereby reduce the need for time-consuming measurements. By using the patient anatomy and generating full 3D dose data, and combined with measurements of additional machine parameters, it can substantially contribute to overall patient safety.

60 APPLIED LIFE SCIENCES↗

Rosette core fungal resistance in Arabidopsis thaliana

Main conclusion: Unlike rosette leaves, the mature Arabidopsis rosette core can display full resistance to Botrytis cinerea revealing the importance for spatial and developmental aspects of plant fungal resistance. Abstract: Arabidopsis thaliana is a model host to investigate plant defense against fungi. However, many of the reports investigating Arabidopsis fungal defense against the necrotrophic fungus, Botrytis cinerea, utilize rosette leaves as host tissue. Here we report organ-dependent differences in B. cinerea resistance of Arabidopsis. Although wild-type Arabidopsis rosette leaves mount a jasmonate-dependent defense that slows fungal growth, this defense is incapable of resisting fungal devastation. In contrast, as the fungus spreads through infected leaf petioles towards the plant center, or rosette core, there is a jasmonate- and age-dependent fungal penetration blockage into the rosette core. In this paper, we report evidence for induced and preformed resistance in the rosette core, as direct rosette core inoculation can also result in resistance, but at a lower penetrance relative to infections that approach the core from infected leaf petioles. The Arabidopsis rosette core displays a distinct transcriptome relative to other plant organs, and BLADE ON PETIOLE (BOP) transcripts are abundant in the rosette core. The BOP genes, with known roles in abscission zone formation, are required for full Arabidopsis rosette core B. cinerea resistance, suggesting a possible role for BOP-dependent modifications that may help to restrict fungal susceptibility of the rosette core. Finally, we demonstrate that cabbage and cauliflower, common Brassicaceae crops, also display leaf susceptibility and rosette core resistance to B. cinerea that can involve leaf abscission. Thus, spatial and developmental aspects of plant host resistance play critical roles in resistance to necrotrophic fungal pathogens and are important to our understanding of plant defense mechanisms.

59 BASIC BIOLOGICAL SCIENCES↗

hdsullivan/ResSR

This is the official implementation of ResSR [1]. ResSR is a computationally efficient MSI-SR method that achieves high-quality reconstructions by using a closed-form spectral decomposition along with a spatial residual correction. ResSR applies singular value decomposition to identify correlations across spectral bands, uses pixel-wise computation to upsample the MSI, and then applies a residual correction process to correct the high-spatial frequency components of the upsampled bands. While ResSR is formulated as the solution to a spatially-coupled optimization problem, we use pixel-wise regularization and derive an approximate closed-form solution, resulting in a pixel-wise algorithm with a dramatic reduction in computation that achieves state-of-the-art reconstructions. [1] Duba-Sullivan, H., Reid, E. J., Voisin, S., Bouman, C. A., & Buzzard, G. T. (2024). ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images. arXiv preprint arXiv:2408.13225.

Duba-Sullivan, Haley [Oak Ridge National Laborator↗

QBTNs - Quantum Boolean Tensor Networks

We develop algorithms and software that uses the D-Wave 2000Q quantum annealer to solve several types of Boolean tensor factorization problems. Boolean tensor factorization refers to the problem of representing a high-dimensional tensor filled with Boolean values as a product of smaller Boolean core tensors and Boolean matrices. We consider different tensor factorization models, including Boolean Tensor Train, Boolean Tucker, and Boolean Hierarchical Tucker. As an exact decomposition of a given type may not exist in the general case, the objective is to minimize the difference between the input high-dimensional tensor and the product of the lower-dimensional tensors of the proposed factorization, using a specified tensor norm. In our approach, we reduce the Boolean tensor factorization problem to a sequence of quadratic unconstrained binary optimization problems suitable for the D-Wave 2000Q quantum annealer. Although current quantum technology is still fairly restricted in the problems it can tackle, we show that complex tensor factorization problems as the ones addressed by us can be solved efficiently and accurately.

Alexandrov, Boian↗

TU-F-18C-01: Breast Tissue Decomposition Using Spectral CT After Distortion Correction

Purpose: To investigate the feasibility of accurate breast tissue compositional characterization by using spectral-distortion-corrected dual energy images from a photon-counting spectral CT. Methods: Thirty eight postmortem breasts were imaged with a Cadmium-Zinc-Telluride (CZT)-based photon-counting spectral CT system at beam energy of 100 kVp. The energy-resolved detector sorted photons into low and high energy bins with a splitting energy of 42 keV. The estimated mean glandular dose (MGD) for each breast was approximately 2.0 mGy. Dual energy technique was used to decompose breast tissue into water, lipid, and protein contents. Two image-based methods were investigated to improve the accuracy of tissue compositional characterization. The first method simply limited the recorded spectra up to 90 keV. This reduced the pulse pile-up artifacts but it has some dose penalty. The second method corrected the spectral information of all measured photons by using a spectral distortion correction technique. Breasts were then chemically decomposed into their respective water, lipid, and protein contents, which was used as the reference standard. The accuracy of the tissue compositional measurement with spectral CT was evaluated by the root-mean-square (RMS) errors in percentage composition. Results: The errors in quantitative material decomposition were significantly reduced after the appropriate image processing methods. As compared to the chemical analysis as the reference standard, the averages of the RMS errors were estimated to be 15.5%, 3.3%, and 2.8% for the raw, energy-limited, and spectral-corrected images, respectively. Conclusion: Spectral CT can be used to accurately quantify the water, lipid, and protein contents in breast tissues by implementing a spectral distortion correction algorithm. The tissue compositional information can potentially improve the sensitivity and specificity for breast cancer diagnosis.

60 APPLIED LIFE SCIENCES↗

Efficient Solution Methods for Large-scale Optimization Problems Constrained by Time-dependent Partial Differential Equations (Final Report)

The objectives of this project are to devise and analyze efficient solvers for several classes of PDE- constrained optimization problems. The project was initially focused on, but not restricted to time- dependent PDE-constraints such as parabolic equations, time-dependent fluid flows (Navier-Stokes equations), hyperbolic equations (Burgers equation, shallow water equations). Other constraints considered are PDEs with stochastic coefficients. Additional elements of interest are the handling of problems with control and/or state inequality constraints or non-differentiable regularization terms, and boundary controls. A direction of work not initially listed among the goals, which was triggered by conversations with DOE scientists from the Sandia National Labs, is to develop efficient solvers for optimization- based domain-decomposition PDE-solvers. Also targeted in the project are a number of technical issues necessary for facilitating the integration of the methods resulted from this project with existing high-performance packages developed at DOE national labs; this integration is expected to further enable the scientific community to use the novel methods. An example of such a task is the need to develop algebraic multigrid (AMG) versions of the algorithms. A list of accomplishments in several areas is detailed as well as a list of publications.

97 MATHEMATICS AND COMPUTING↗