Search NASA⌕ Search

SEARCH · Search NASA

Results for “reduced set methods”

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

Kalman Filtering and RTS Smoothing for Arc-Jet Sample Edge Tracking

Accurate and temporally consistent measurements of test-article recession are required to characterize material response during arc-jet ablation experiments. However, image-based boundary measurements are often affected by segmentation noise, brightness variations, and frame-to-frame variability. This work extends arcjetCV [1] with filtering methods for tracking the evolving boundaries of hemispherical and ISO-Q test articles. Two boundary-tracking approaches based on Kalman filtering [2] were implemented. The first applies a point-wise Kalman filter followed by a Rauch–Tung–Striebel smoother [3] to individual boundary-point locations. The second applies the same filtering and smoothing framework to a reduced set of geometry-dependent shape parameters. The point-wise method reduces local frame-to-frame fluctuations while preserving spatial details along the detected boundary. The shape-parameter method provides a compact and geometrically constrained estimate of the sample contour. Figure 1 illustrates the two approaches for a hemispherical test article. Both methods improve temporal consistency and support more robust estimation of surface recession from arc-jet imagery. The two filtering approaches provide complementary representations of boundary evolution and improve the reliability of image-based recession measurements during arc-jet experiments.

recession measurement↗

A Higher Harmonic Optimal Controller to Optimise Rotorcraft Aeromechanical Behaviour

Three methods to optimize rotorcraft aeromechanical behavior for those cases where the rotorcraft plant can be adequately represented by a linear model system matrix were identified and implemented in a stand-alone code. These methods determine the optimal control vector which minimizes the vibration metric subject to constraints at discrete time points, and differ from the commonly used non-optimal constraint penalty methods such as those employed by conventional controllers in that the constraints are handled as actual constraints to an optimization problem rather than as just additional terms in the performance index. The first method is to use a Non-linear Programming algorithm to solve the problem directly. The second method is to solve the full set of non-linear equations which define the necessary conditions for optimality. The third method is to solve each of the possible reduced sets of equations defining the necessary conditions for optimality when the constraints are pre-selected to be either active or inactive, and then to simply select the best solution. The effects of maneuvers and aeroelasticity on the systems matrix are modelled by using a pseudo-random pseudo-row-dependency scheme to define the systems matrix. Cases run to date indicate that the first method of solution is reliable, robust, and easiest to use, and that it was superior to the conventional controllers which were considered.

Leyland, Jane Anne↗

Maximizing the probability of satisfying the clinical goals in radiation therapy treatment planning under setup uncertainty

Purpose: This paper introduces a method that maximizes the probability of satisfying the clinical goals in intensity-modulated radiation therapy treatments subject to setup uncertainty. Methods: The authors perform robust optimization in which the clinical goals are constrained to be satisfied whenever the setup error falls within an uncertainty set. The shape of the uncertainty set is included as a variable in the optimization. The goal of the optimization is to modify the shape of the uncertainty set in order to maximize the probability that the setup error will fall within the modified set. Because the constraints enforce the clinical goals to be satisfied under all setup errors within the uncertainty set, this is equivalent to maximizing the probability of satisfying the clinical goals. This type of robust optimization is studied with respect to photon and proton therapy applied to a prostate case and compared to robust optimization using an a priori defined uncertainty set. Results: Slight reductions of the uncertainty sets resulted in plans that satisfied a larger number of clinical goals than optimization with respect to a priori defined uncertainty sets, both within the reduced uncertainty sets and within the a priori, nonreduced, uncertainty sets. For the prostate case, the plans taking reduced uncertainty sets into account satisfied 1.4 (photons) and 1.5 (protons) times as many clinical goals over the scenarios as the method taking a priori uncertainty sets into account. Conclusions: Reducing the uncertainty sets enabled the optimization to find better solutions with respect to the errors within the reduced as well as the nonreduced uncertainty sets and thereby achieve higher probability of satisfying the clinical goals. This shows that asking for a little less in the optimization sometimes leads to better overall plan quality.

07 ISOTOPE AND RADIATION SOURCES↗

Order parameter re-mapping algorithm for 3D phase field model of grain growth using FEM

Phase field modeling (PFM) is a well-known technique for simulating microstructural evolution. To model grain growth using PFM, typically each grain is assigned a unique non-conserved order parameter and each order parameter field is evolved in time. Traditional approaches using a one-to-one mapping of grains to order parameters present a challenge when modeling large numbers of grains due to the computational expense of using many order parameters. This problem is exacerbated when using an implicit finite element method (FEM), as the global matrix size is proportional to the number of order parameters. While previous work has developed methods to reduce the number of required variables and thus computational complexity and run time, none of the existing approaches can be applied for an implicit FEM implementation of PFM. Here, we present a modular, dynamic, scalable reassignment algorithm suitable for use in such a system. Polycrystal modeling with grain growth and stress require careful tracking of each grain’s position and orientation which is lost when using a reduced order parameter set. In conclusion, the method presented in this paper maintains a unique ID for each grain even after reassignment, to allow the PFM to be tightly coupled to calculations of the stress throughout the polycrystal. Implementation details and comparative results of our approach are presented.

36 MATERIALS SCIENCE↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

The Localized Active Space Method with Unitary Selective Coupled Cluster

Here, we introduce a hybrid quantum-classical algorithm, the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. Derived from the localized active space unitary coupled cluster (LAS-UCCSD) method, LAS-USCCSD first performs a classical LASSCF calculation, then selectively identifies the most important parameters (cluster amplitudes used to build the multireference UCC ansatz) for restoring interfragment interaction energy using this reduced set of parameters with the variational quantum eigensolver method. We benchmark LAS-USCCSD against LAS-UCCSD by calculating the total energies of (H 2 ) 2 , (H 2 ) 4 , and trans-butadiene, and the magnetic coupling constant for a bimetallic compound [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ . For these systems, we find that LAS-USCCSD reduces the number of required parameters and thus the circuit depth by at least 1 order of magnitude, an aspect which is important for the practical implementation of multireference hybrid quantum-classical algorithms like LAS-UCCSD on near-term quantum computers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A strategy for compression and analysis of massive geophysical data sets

This paper describes a method for summaraizing data in a way that approximately preserves high-resolution data structure while reducing data volume and maintaining global integrity of very large, remote sensing data sets. The method is under development for one of Terra's instruments, the Multi-angle Imaging SpectroRadiometer (MISR).

geophysical data sets compression↗

An Efficient, Lossless Database for Storing and Transmitting Medical Images

This research aimed in creating new compression methods based on the central idea of Set Redundancy Compression (SRC). Set Redundancy refers to the common information that exists in a set of similar images. SRC compression methods take advantage of this common information and can achieve improved compression of similar images by reducing their Set Redundancy. The current research resulted in the development of three new lossless SRC compression methods: MARS (Median-Aided Region Sorting), MAZE (Max-Aided Zero Elimination) and MaxGBA (Max-Guided Bit Allocation).

Fenstermacher, Marc J.↗

Resilient Disaster Recovery Logistics of Distribution Systems: Co-Optimize Service Restoration With Repair Crew and Mobile Power Source Dispatch

Repair crews (RCs) and mobile power sources (MPSs) are critical resources for distribution system (DS) outage management after a natural disaster. However, their logistics have not been well investigated. We propose a resilient scheme for disaster recovery logistics to co-optimize DS restoration with the dispatch of RCs and MPSs. A novel co-optimization model is formulated to route RCs and MPSs in the transportation network, schedule them in the DS, and reconfigure the DS for microgrid formation coordinately, etc. The model incorporates different timescales of DS restoration and RC/MPS dispatch, the coupling of transportation and power networks, etc. To ensure radiality of the DS with variable physical structure and MPS allocation, we also model topology constraints based on the concept of spanning forest. The model is convexified equivalently and linearized into a mixed-integer linear programming. To reduce its computation time, preprocessing methods are proposed to preassign a minimal set of repair tasks to depots and reduce the number of candidate nodes for MPS connection. Resilient recovery strategies thus are generated to enhance service restoration, especially by dynamic formation of microgrids that are powered by MPSs and topologized by repair actions of RCs and network reconfiguration of the DS. Case studies demonstrate the proposed methodology.

Disaster recovery logistics↗

Stress Birth and Death: Disruptive Computational Mechanics and Novel Diagnostics for Fluid-to-Solid Transitions

Many materials of interest to Sandia transition from fluid to solid or have regions of both phases coexisting simultaneously. Currently there are, unfortunately, no material models that can accurately predict this material response. This is relevant to applications that "birth stress" related to geoscience, nuclear safety, manufacturing, energy production and bioscience. Accurately capturing solidification and residual stress enables fully predictive simulations of the evolving front shape or final product. Accurately resolving flow of proppants or blood could reduce environmental impact or lead to better treatments for heart attacks, thrombosis, or aneurism. We will address a science question in this proposal: When does residual stress develop during the critical transition from liquid to solid and how does it affect material deformation? Our hypothesis is that these early phases of stress development are critical to predictive simulation of material performance, net shape, and aging. In this project, we use advanced constitutive models with yield stress to represent both fluid and solid behavior simultaneously. The report provides an abbreviated description of the results from our LDRD "Stress Birth and Death: Disruptive Computational Mechanics and Novel Diagnostics for Fluid-to-Solid Transitions," since we have written four papers that document the work in detail and which we reference. We give highlights of the work and describe the gravitationally driven flow visualization experiment on a model yield stress fluid, Carbopol, at various concentrations and flow rates. We were able to collapse the data on a single master curve by showing it was self-similar. We also describe the Carbopol rheology and the constitutive equations of interest including the Bingham-Carreau-Yasuda model, the Saramito model, and the HB-Saramito model including parameter estimation for the shear and oscillatory rheology. We present several computational models including the 3D moving mesh simulations of both the Saramito models and Bingham-Carreau-Yasuda (BCY) model. We also show results from the BCY model using a 3D level set method and two different ways of handling reduced order Hele-Shaw modeling for generalized Newtonian fluids. We present some first ever two-dimensional results for the modified Jeffries Kamani-Donley-Rogers constitutive equation developed during this project. We include some recent results with a successful Saramito-level set coupling that allows us to tackle problems with complex geometries like mold filling in a thin gap with an obstacle, without the need for remeshing or remapping. We report on some experiments for curing systems where fluorescent particles are used to track material flow. These experiments were carried out in an oven on Sylgard 184 as a model polymerizing system. We conclude the report with a summary of accomplishments and some thoughts on follow-on work.

36 MATERIALS SCIENCE↗

Detecting vortices in superconductors: Extracting one-dimensional topological singularities from a discretized complex scalar field

In type II superconductors, the dynamics of superconducting vortices determine their transport properties. In the Ginzburg-Landau theory, vortices correspond to topological defects in the complex order parameter. Extracting their precise positions and motion from discretized numerical simulation data is an important, but challenging, task. In the past, vortices have mostly been detected by analyzing the magnitude of the complex scalar field representing the order parameter and visualized by corresponding contour plots and isosurfaces. However, these methods, primarily used for small-scale simulations, blur the fine details of the vortices, scale poorly to large-scale simulations, and do not easily enable isolating and tracking individual vortices. In this paper, we present a method for exactly finding the vortex core lines from a complex order parameter field. With this method, vortices can be easily described at a resolution even finer than the mesh itself. The precise determination of the vortex cores allows the interplay of the vortices inside a model superconductor to be visualized in higher resolution than has previously been possible. Finally, by representing the field as the set of vortices, this method also massively reduces the data footprint of the simulations and provides the data structures for further analysis and feature tracking.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Registration of prone and supine CT colonography scans using correlation optimized warping and canonical correlation analysis

Purpose: In computed tomographic colonography (CTC), a patient will be scanned twice--Once supine and once prone--to improve the sensitivity for polyp detection. To assist radiologists in CTC reading, in this paper we propose an automated method for colon registration from supine and prone CTC scans. Methods: We propose a new colon centerline registration method for prone and supine CTC scans using correlation optimized warping (COW) and canonical correlation analysis (CCA) based on the anatomical structure of the colon. Four anatomical salient points on the colon are first automatically distinguished. Then correlation optimized warping is applied to the segments defined by the anatomical landmarks to improve the global registration based on local correlation of segments. The COW method was modified by embedding canonical correlation analysis to allow multiple features along the colon centerline to be used in our implementation. Results: We tested the COW algorithm on a CTC data set of 39 patients with 39 polyps (19 training and 20 test cases) to verify the effectiveness of the proposed COW registration method. Experimental results on the test set show that the COW method significantly reduces the average estimation error in a polyp location between supine and prone scans by 67.6%, from 46.27{+-}52.97 to 14.98 mm{+-}11.41 mm, compared to the normalized distance along the colon centerline algorithm (p<0.01). Conclusions: The proposed COW algorithm is more accurate for the colon centerline registration compared to the normalized distance along the colon centerline method and the dynamic time warping method. Comparison results showed that the feature combination of z-coordinate and curvature achieved lowest registration error compared to the other feature combinations used by COW. The proposed method is tolerant to centerline errors because anatomical landmarks help prevent the propagation of errors across the entire colon centerline.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Exact reconstruction of gene regulatory networks using compressive sensing

We consider the problem of reconstructing a gene regulatory network structure from limited time series gene expression data, without any a priori knowledge of connectivity. We assume that the network is sparse, meaning the connectivity among genes is much less than full connectivity. We develop a method for network reconstruction based on compressive sensing, which takes advantage of the network’s sparseness. For the case in which all genes are accessible for measurement, and there is no measurement noise, we show that our method can be used to exactly reconstruct the network. For the more general problem, in which hidden genes exist and all measurements are contaminated by noise, we show that our method leads to reliable reconstruction. In both cases, coherence of the model is used to assess the ability to reconstruct the network and to design new experiments. We demonstrate that it is possible to use the coherence distribution to guide biological experiment design effectively. By collecting a more informative dataset, the proposed method helps reduce the cost of experiments. For each problem, a set of numerical examples is presented. The method provides a guarantee on how well the inferred graph structure represents the underlying system, reveals deficiencies in the data and model, and suggests experimental directions to remedy the deficiencies.

59 BASIC BIOLOGICAL SCIENCES↗

Reduced order component models for flexible multibody dynamics simulations

Many flexible multibody dynamics simulation codes require some form of component description that properly characterizes the dynamic behavior of the system. A model reduction procedure for producing low order component models for flexible multibody simulation is described. Referred to as projection and assembly, the method is a Rayleigh-Ritz approach that uses partitions of the system modal matrix as component Ritz transformation matrices. It is shown that the projection and assembly method yields a reduced system model that preserves a specified set of the full order system modes. Unlike classical component mode synthesis methods, the exactness of the method described is obtained at the expense of having to compute the full order system modes. The paper provides a comprehensive description of the method, a proof of exactness, and numerical results demonstrating the method's effectiveness.

Tsuha, Walter S.↗

Significant Improvement in PV Module Performance Prediction Accuracy Using a New Model Based on IEC-61853 Data: Preprint

This paper presents a significant improvement in accuracy for photovoltaic (PV) module performance prediction using a new approach based on IEC-61853 test data. The method is based on the concept of a single diode model and calibrates its performance across a broad set of operating conditions. The new method reduces irradiance-weighted error in maximum power point (MPP) power relative to the standard 6-parameter single diode model, on average across 20 different module types, by 88% across the entire range of measured irradiance and temperature conditions, while retaining a continuous mathematical representation of the full current-voltage characteristic that allows for accurate off-MPP module modeling.

14 SOLAR ENERGY↗

Influence of single particle orbital sets and configuration selection on multideterminant wavefunctions in quantum Monte Carlo

Multideterminant wavefunctions, while having a long history in quantum chemistry, are increasingly being used in highly accurate quantum Monte Carlo calculations. Since the accuracy of QMC is ultimately limited by the quality of the trial wavefunction, multi-Slater determinants wavefunctions offer an attractive alternative to Slater-Jastrow and more sophisticated wavefunction ansatz for several reasons. They can be efficiently calculated, straightforwardly optimized, and systematically improved by increasing the number of included determinants. In spite of their potential, however, the convergence properties of multi-Slater determinant wavefunctions with respect to orbital set choice and excited determinant selection are poorly understood, which hinders the application of these wavefunctions to large systems and solids. In this paper, by performing QMC calculations on the equilibrium and stretched carbon dimer, we find that convergence of the recovered correlation energy with respect to number of determinants can depend quite strongly on basis set and determinant selection methods, especially where there is strong correlation. We demonstrate that properly chosen orbital sets and determinant selection techniques from quantum chemistry methods can dramatically reduce the required number of determinants (and thus the computational cost) to reach a given accuracy, which we argue shows clear need for an automatic QMC-only method for selecting determinants and generating optimal orbital sets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Derivation of new 3D discrete ordinate equations

The Sn equations have been the workhorse of deterministic radiation transport calculations for many years. Here we derive two new angular discretizations of the 3D transport equation. The first set of equations, derived using Lagrange interpolation and collocation, retains the classical Sn structure, with the main difference being how the scattering source is calculated. Because of the formal similarity with the classical S n equations, it should be possible to modify existing computer codes to take advantage of the new formulation. In addition, the new S n-like equations correctly capture delta function scattering. The second set of equations, derived using a Galerkin technique, does not retain the classical Sn structure because the streaming term is not diagonal. However, these equations can be cast into a form similar to existing methods developed to reduce ray effects. Numerical investigation of both sets of equations is under way. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Opinion: Lighting Research During and After the Pandemic

For many lighting researchers, the recent restrictions related to COVID-19 have paused most in-person laboratory or field experiments. In certain countries, regulatory institutions have allowed such experiments to resume but issued safety recommendations like pre-checking participants for disease symptoms and excluding those that are especially vulnerable. To avoid potential complications and delays, researchers are likely to resort to other research designs that enable remote research — eliminating the need for the experimenter and subjects to be in the same room. While unanticipated, this shift to remote research methods is an opportunity to revisit and further develop remote experimental techniques, which can have beneficial long-lasting implications on lighting research during and after the pandemic. Perhaps the most common type of remote research is online experiments; which can greatly benefit from improved techniques to allow for greater control or characterization of experimental conditions, like those proposed by Villa and Labayrade . These techniques require validation specific to the type of response collected and context, e.g. space type and attributes. New research techniques continue to emerge and will enable remote collection of objective measures such as gaze direction and high dynamic range images (HDRIs) without specialized equipment. In fact, many of these methods and techniques are commonly used in other disciplines, like vision science and psychology, and can be adapted for lighting research. Not all lighting studies can be conducted online, but in the age of ubiquitous and connected technologies, there is a largely missed opportunity to utilize crowdsourced responses to lighting conditions in real environments where people live and go about their daily lives without the research being limited to a certain time and laboratory locations. For instance, outdoor street luminaires can be rated by passersby using ecological momentary assessments on mobile phones. While this approach does not provide laboratory-level control over experimental conditions, it can provide more contextual responses resulting from ‘normal’ dynamic gaze, behavior, and interactions. Further, it can also reduce bias related to the experimental setting. Further development of remote research methods and their use in lighting research can improve the quality of lighting research. Given that sample sizes in most lighting research are relatively small, remote research can substantially increase sample sizes, reduce research costs, and shorten study duration, all while reducing interaction between experimenter and subjects. Another benefit is reaching a wider audience and including under-represented individuals who typically are not reachable using common recruitment methods. The pandemic has set back our plans for in-lab experiments, but can it inspire us to think of new and creative ways to expand lighting research?

Abboushi, Belal K.↗