Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “alternating minimization”

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 19 records

Matrix Completion Using Alternating Minimization for Distribution System State Estimation

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation: Preprint

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Short-Term Aging of NeFeB Magnets for Stirling Linear Alternator Applications

NeFeB type magnets have been proposed for use in free piston Stirling engine driven, linear alternators to generate electric power during long duration space missions. These type of materials provide the highest energy product commercial magnets, thus minimizing alternator size or mass, but do not provide the high temperature stability of magnetic properties found in the SmCo type magnets. Therefore, to apply the NeFeB type magnets at elevated temperatures to multiyear space missions, their long-term aging characteristics must be determined. This report presents 200 hr aging data for six types of NeFeB magnets selected from three manufacturers. Aging was performed under vacuum at 150 C, with a steady demagnetizing field of 5 kOe applied. From the data produced by this short-term aging run, candidate magnet types were selected for a planned 12,000 hr long-term run. Depending on the manufacturer's magnet type, remanence losses observed ranged from 0 to 7%, when measured at 120 C on an established recoil line. Also, intrinsic coercivity losses up to about 4% were observed for the M-H curve at 120 C. In some cases, these coercivity losses were not recoverable by recharge of the magnet, indicating a structural change of the material.

Niedra, Janis M.↗

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

A realistic theory of E6 unification through novel intermediate symmetries

Abstract We propose a non-supersymmetric E 6 GUT with the scalar sector consisting of650⨁351′ ⨁27. Making use of the first representation for the initial symmetry breaking to an intermediate stage, and the latter two representations for second-stage breaking to the Standard Model and a realistic Yukawa sector, this theory represents the minimal E 6 GUT that proceeds through one of the intermediate stages that are novel compared to SU(5) or SO(10) GUT: trinification SU(3) C × SU(3) L × SU(3) R , SU(6) × SU(2) and flipped SO(10) × U(1). We analyze these possibilities under the choice of vacuum that preserves a ℤ 2 “spinorial parity”, which disentangles the chiral and vector-like fermions of E 6 and provides a dark matter candidate in the form of a (scalar) inert doublet. Three cases are shown to consistently unify under the extended survival hypothesis (with minimal fine-tuning): trinification symmetry SU(3) C × SU(3) L × SU(3) R with eitherLRorCRparity, and SU(6) CR × SU(2) L . Although the successful cases give a large range for proton lifetime estimates, all of them include regions consistent with current experimental bounds and within reach of forthcoming experiments. The scenario investigated in this paper essentially represents the unique (potentially) viable choice in the class of E 6 GUTs proceeding through a novel-symmetry intermediate stage, since non-minimal alternatives seem to be intrinsically non-perturbative.

Physics↗

Iterative-Transform Phase Retrieval Using Adaptive Diversity

A phase-diverse iterative-transform phase-retrieval algorithm enables high spatial-frequency, high-dynamic-range, image-based wavefront sensing. [The terms phase-diverse, phase retrieval, image-based, and wavefront sensing are defined in the first of the two immediately preceding articles, Broadband Phase Retrieval for Image-Based Wavefront Sensing (GSC-14899-1).] As described below, no prior phase-retrieval algorithm has offered both high dynamic range and the capability to recover high spatial-frequency components. Each of the previously developed image-based phase-retrieval techniques can be classified into one of two categories: iterative transform or parametric. Among the modifications of the original iterative-transform approach has been the introduction of a defocus diversity function (also defined in the cited companion article). Modifications of the original parametric approach have included minimizing alternative objective functions as well as implementing a variety of nonlinear optimization methods. The iterative-transform approach offers the advantage of ability to recover low, middle, and high spatial frequencies, but has disadvantage of having a limited dynamic range to one wavelength or less. In contrast, parametric phase retrieval offers the advantage of high dynamic range, but is poorly suited for recovering higher spatial frequency aberrations. The present phase-diverse iterative transform phase-retrieval algorithm offers both the high-spatial-frequency capability of the iterative-transform approach and the high dynamic range of parametric phase-recovery techniques. In implementation, this is a focus-diverse iterative-transform phaseretrieval algorithm that incorporates an adaptive diversity function, which makes it possible to avoid phase unwrapping while preserving high-spatial-frequency recovery. The algorithm includes an inner and an outer loop (see figure). An initial estimate of phase is used to start the algorithm on the inner loop, wherein multiple intensity images are processed, each using a different defocus value. The processing is done by an iterative-transform method, yielding individual phase estimates corresponding to each image of the defocus-diversity data set. These individual phase estimates are combined in a weighted average to form a new phase estimate, which serves as the initial phase estimate for either the next iteration of the iterative-transform method or, if the maximum number of iterations has been reached, for the next several steps, which constitute the outerloop portion of the algorithm. The details of the next several steps must be omitted here for the sake of brevity. The overall effect of these steps is to adaptively update the diversity defocus values according to recovery of global defocus in the phase estimate. Aberration recovery varies with differing amounts as the amount of diversity defocus is updated in each image; thus, feedback is incorporated into the recovery process. This process is iterated until the global defocus error is driven to zero during the recovery process. The amplitude of aberration may far exceed one wavelength after completion of the inner-loop portion of the algorithm, and the classical iterative transform method does not, by itself, enable recovery of multi-wavelength aberrations. Hence, in the absence of a means of off-loading the multi-wavelength portion of the aberration, the algorithm would produce a wrapped phase map. However, a special aberration-fitting procedure can be applied to the wrapped phase data to transfer at least some portion of the multi-wavelength aberration to the diversity function, wherein the data are treated as known phase values. In this way, a multiwavelength aberration can be recovered incrementally by successively applying the aberration-fitting procedure to intermediate wrapped phase maps. During recovery, as more of the aberration is transferred to the diversity function following successive iterations around the ter loop, the estimated phase ceases to wrap in places where the aberration values become incorporated as part of the diversity function. As a result, as the aberration content is transferred to the diversity function, the phase estimate resembles that of a reference flat.

Dean, Bruce H.↗

Integrated Surface Power Strategy for Mars

A National Aeronautics and Space Administration (NASA) study team evaluated surface power needs for a conceptual crewed 500-day Mars mission. This study had four goals: 1. Determine estimated surface power needed to support the reference mission; 2. Explore alternatives to minimize landed power system mass; 3. Explore alternatives to minimize Mars Lander power self-sufficiency burden; and 4. Explore alternatives to minimize power system handling and surface transportation mass. The study team concluded that Mars Ascent Vehicle (MAV) oxygen propellant production drives the overall surface power needed for the reference mission. Switching to multiple, small Kilopower fission systems can potentially save four to eight metric tons of landed mass, as compared to a single, large Fission Surface Power (FSP) concept. Breaking the power system up into modular packages creates new operational opportunities, with benefits ranging from reduced lander self-sufficiency for power, to extending the exploration distance from a single landing site. Although a large FSP trades well for operational complexity, a modular approach potentially allows Program Managers more flexibility to absorb late mission changes with less schedule or mass risk, better supports small precursor missions, and allows a program to slowly build up mission capability over time. A number of Kilopower disadvantages-and mitigation strategies-were also explored.

Rucker, Michelle↗

Software for Analyzing Laminar-to-Turbulent Flow Transitions

Software assurance is the planned and systematic set of activities that ensures that software processes and products conform to requirements, standards, and procedures. Examples of such activities are the following: code inspections, unit tests, design reviews, performance analyses, construction of traceability matrices, etc. In practice, software development projects have only limited resources (e.g., schedule, budget, and availability of personnel) to cover the entire development effort, of which assurance is but a part. Projects must therefore select judiciously from among the possible assurance activities. At its heart, this can be viewed as an optimization problem; namely, to determine the allocation of limited resources (time, money, and personnel) to minimize risk or, alternatively, to minimize the resources needed to reduce risk to an acceptable level. The end result of the work reported here is a means to optimize quality-assurance processes used in developing software. This is achieved by combining two prior programs in an innovative manner

Chang, Chau-Lyan↗

Software for Optimizing Quality Assurance of Other Software

Software assurance is the planned and systematic set of activities that ensures that software processes and products conform to requirements, standards, and procedures. Examples of such activities are the following: code inspections, unit tests, design reviews, performance analyses, construction of traceability matrices, etc. In practice, software development projects have only limited resources (e.g., schedule, budget, and availability of personnel) to cover the entire development effort, of which assurance is but a part. Projects must therefore select judiciously from among the possible assurance activities. At its heart, this can be viewed as an optimization problem; namely, to determine the allocation of limited resources (time, money, and personnel) to minimize risk or, alternatively, to minimize the resources needed to reduce risk to an acceptable level. The end result of the work reported here is a means to optimize quality-assurance processes used in developing software.

Feather, Martin↗

On the computation of the generalized inverse by classical minimization.

An alternative method for deriving the generalized inverse of an arbitrary rectangular matrix with real or complex coefficients is described. The method applies a classical minimization procedure without iteration processes and is readily applicable in digital computer programming.

Voith, R. P.↗

Plug-and-Play Methods for Integrating Physical and Learned Models in Computational Imaging: Theory, algorithms, and applications

Plug-and-play (PnP) priors constitute one of the most widely used frameworks for solving computational imaging problems through the integration of physical models and learned models. PnP leverages high-fidelity physical sensor models and powerful machine learning methods for prior modeling of data to provide state-of-the-art reconstruction algorithms. PnP algorithms alternate between minimizing a data fidelity term to promote data consistency and imposing a learned regularizer in the form of an image denoiser. Recent highly successful applications of PnP algorithms include biomicroscopy, computerized tomography (CT), magnetic resonance imaging (MRI), and joint ptychotomography. This article presents a unified and principled review of PnP by tracing its roots, describing its major variations, summarizing main results, and discussing applications in computational imaging. Additionally, we also point the way toward further developments by discussing recent results on equilibrium equations that formulate the problem associated with PnP algorithms.

97 MATHEMATICS AND COMPUTING↗

A note on minimizing time assurance tests for repairable systems

We consider assurance testing for repairable systems when supplementary information is available in addition to the data collected in the assurance test. Here, the supplementary information is incorporated using a Bayesian inferential framework. Here we consider assurance testing for a homogeneous Poisson process. In this note we consider an alternative criterion that minimizes the test time while ensuring that the requirements on the producer's and consumer's risks are met. We illustrate the use of this alternative criterion with an example.

42 ENGINEERING↗

The Oak Ridge Refrigerant Management Program

For many years, chlorofluorocarbons (CFC's) have been used by the Department of Energy's (DOE) Oak Ridge Y-12 Plant in air conditioning and process refrigeration systems. However, Title 6 of the Clean Air Act Amendments (CAAA) and Executive Order 12843 (Procurement Requirements and Policies for Federal Agencies for Ozone Depleting Substances) signed by President Clinton require, as policy, that all federal agencies maximize their use of safe, alternate refrigerants and minimize, where economically practical, the use of Class 1 refrigerants. Unfortunately, many government facilities and industrial plants have no plan or strategy in place to make this changeover, even though their air conditioning and process refrigeration equipment may not be sustainable after CFC production ends December 31, 1995. The Y-12 Plant in Oak Ridge, Tennessee, has taken an aggressive approach to complying with the CAAA and is working with private industry and other government agencies to solve tough manufacturing and application problems associated with CFC and hydrochlorofluorocarbon (HCFC) alternatives. Y-12 was the first DOE Defense Program (DP) facility to develop a long-range Stratospheric Ozone Protection Plan for refrigerant management for compliance with the CAAA. It was also the first DOE DP facility to complete detailed engineering studies on retrofitting and replacing all air conditioning and process refrigeration equipment to enable operation with alternate refrigerants. The management plan and engineering studies are models for use by other government agencies, manufacturing plants, and private industry. This presentation identifies some of the hidden pitfalls to be encountered in the accelerated phaseout schedule of CFC's and explains how to overcome and prevent these problems. In addition, it outlines the general issues that must be considered when addressing the phase-out of ozone depleting substances and gives some 'lessons learned' by Y-12 from its Refrigerant Management Program. Discussion topics include requirements for developing a refrigerant management plan and establishing priorities for cost-effective compliance with the CAAA, as well as ways in which employees can be empowered to develop a comprehensive refrigerant management plan. The result of this employee empowerment was a cooperative labor-management effort that is beneficial for Y-12, DOE, and the environment.

Kevil, Thomas H.↗

The Kinetic Consequences of Water on Catalytic Methane Pyrolysis

Hydrogen production from biomass and natural gas has emerged as a prominent research area in response to the growing demand for energy from alternative sources that minimize CO 2 emissions. In this study, we investigate the impact of water, which is present in and generated from biomass-derived streams, on carbon nanotube (CNT) growth and hydrogen production during methane decomposition using Ni–Mo/MgO as a catalyst. We reveal here that the role of water on CNT growth is highly complex; its effect depends on the stage of growth at which the water is incorporated. When water is introduced at the beginning of methane decomposition ( t = 0 h), methane conversion rates are negatively impacted. We hypothesize that water inhibits the significant phase changes the Ni–Mo/MgO catalyst undergoes during catalyst carburization. In contrast, the incorporation of a small percentage of water after a stabilization period ( t = 3 h) results in methane conversion rate enhancements that scale with the introduced water partial pressure as water selectively reacts with amorphous carbon deposits that lead to catalyst deactivation, thus prolonging the lifetime of some of the most active sites. Moreover, water incorporation after stabilization significantly reduces the apparent activation energy. Density Functional Theory (DFT) calculations reveal that water preferentially interacts with carbon fragments on the catalyst surface to remove carbon deposits with a barrier lower than that required for methane activation, further supporting its role in cleaning active sites on the catalyst surface. Characterization of the resulting carbon nanotubes reveals the formation of more graphitic materials produced in the presence of water, highlighting the impact of water on nanotube properties. These results provide clarity toward the many ways in which water, or cofeeding of biomass-derived materials, may impact catalytic methane pyrolysis rates.

carbon nanotubes↗

Technoeconomic and Life Cycle Analysis of an Integrated Fermentation and Microbial Electrochemical Process for Volatile Fatty Acid Production from Food Waste

Techno-economic analysis (TEA) and life cycle assessment (LCA) were conducted for an integrated system designed for the production of volatile fatty acid (VFA) from food waste. The TEA estimated a production cost of $\$$3.12/kg VFA, and the LCA predicted negative greenhouse gas (GHG) emissions of -0.4 kg CO 2 e/kg VFA, driven primarily by diverting organic waste from landfills and avoiding methane emissions while producing valuable chemical products. Hotspot analysis showed arrested methanogenesis (AM) fermentation as the largest contributor to costs (37%) and environmental burden (47%), driven by high sodium hydroxide (NaOH) consumption. Distillation and microbial electrosynthesis (MES) units were the next-largest environmental contributors (28% and 18%). Major cost drivers also included residuals management (biosolids and wastewater) and the equipment and operating costs for AM, MES, and sonication pretreatment units. Although the new integrated system is environmentally benign, its costs and environmental impacts can be further reduced by integrating alternative energy sources, minimizing chemical and energy inputs through process optimization, and improving efficiency. In conclusion, this work highlighted the viability of waste-derived VFA production and provided a clear, data-driven strategy to accelerate the commercialization of waste valorization technology.

Carboxylic Acid Production↗