Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Multilevel 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 181 records · Page 10

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis (V.6.16 User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Multilevel Probit Regression for 3-Alternative Forced Choice Audibility Testing

A recent psychoacoustic test at NASA Langley generated a dataset of 3-alternative forced-choice responses for 40 subjects that measured the audibility of a tone complex in a shaped broadband masker. The task was completed by 4 subjects at a time in a small theatre-like environment using predetermined stimuli levels. These data were subject to 4 forms of probit regression: a “complete pooling” analysis in which all data from the test was fit with one curve, two forms of “no pooling” analyses in which subjects’ data were treated individually (using both packaged and custom software), and a “partial pooling” analysis in which multilevel-regression software fit both individual curves as well as population-level parameters at the same time. The results of the analyses are compared in terms of both individual- and population-level parameters. Partial pooling appears to give the most consistent results at both levels, as well as provide the most robustness among the packaged approaches (albeit with added complexity over single-level regression). These results are also contained in a recent NASA technical memorandum entitled “Comparisons of Analysis Methods Applied to Alternative Forced Choice Audibility Data.”

Psychoacoustics↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user’s manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.15 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers.

97 MATHEMATICS AND COMPUTING↗

System and method for implementing a zero-sequence current filter for a three-phase power system

In a three-phase, four-wire electrical distribution system, a zig-zag transformer and at least one Cascade Multilevel Modular Inverter (CMMI) is coupled between the distribution system and the neutral. A controller modulates the states of the H-bridges in the CMMI to build an AC waveform. The voltage is chosen by the controller in order to control an equivalent impedance that draws an appropriate neutral current through the transformer. This neutral current is generally chosen to cancel the neutral current sensed in the line. The chosen neutral current may be based on a remotely sensed imbalance, rather than on a local value, determined by the power utility as a critical load point in the system. The desired injection current is then translated by the controller into a desired zero-sequence reactive impedance, based on measurement of the local terminal voltage, allowing the controller to regulate the current without generating or consuming real power.

Benavides, Nicholas↗

Multilevel Spectral Coarsening for Graph Laplacian Problems with Application to Reservoir Simulation

We extend previously developed two-level coarsening procedures for graph Laplacian problems written in a mixed saddle point form to the fully recursive multilevel case. The resulting hierarchy of discretizations gives rise to a hierarchy of upscaled models, in the sense that they provide approximation in the natural norms (in the mixed setting). This property enables us to utilize them in three applications: (i) as an accurate reduced model, (ii) as a tool in multilevel Monte Carlo simulations (in application to finite volume discretizations), and (iii) for providing a sequence of nonlinear operators in a full approximation scheme for solving nonlinear pressure equations discretized by the conservative two-point flux approximation. Finally, we illustrate the potential of the proposed multilevel technique in all three applications on a number of popular benchmark problems used in reservoir simulation.

multilevel Monte Carlo↗

Active Fault Current Limiting Control for Half-Bridge MMC in HVDC Systems

DC faults of MMC can result in a significantly large fault current due to the discharge of submodule capacitors. The fault current not only risks damaging the MMC but also demands a considerable breaking capacity from the dc circuit breaker (DCCBs). This paper introduces two novel active fault current limiting methods (AFCLs), namely virtual impedance-based and energy control-based AFCL. The first method utilizes circulating current feedforward, which introduces a virtual arm impedance to suppress the rate of rise of the fault current. Meanwhile, the second method relies on the control of the internally stored energy of the MMC to automatically minimize the number of submodules that discharge during a dc-side fault. Therefore, both the dc-side current and the MMC arm current can be effectively suppressed after the occurrence of the fault. The proposed methods do not require fault detection and their response is proportional to the rate of rise in the fault current. Simulation case studies are presented to demonstrate the proposed methods.

active current limiting control↗

Grids for DSMC computation of two and three-dimensional flows

Contemporary grid schemes for use in Direct Simulation Monte Carlo (DSMC) method of computing two- and three-dimensional flows are briefly surveyed. The grids described include: (1) simple, constant area cells defined by a rectangular grid; (2) multilevel rectangular grids; (3) adaptive rectangular cells; (4) 'point reference' scheme; (5) body-fitted 'analytical' cells; (6) 'general' schemes; (7) 'general' schemes with subcells; (8) orthogonal transformation to rectangular grid; (9) structural tetrahedral grids; (10) rectangular multilevel subcells with adaptive body-fitted cells.

Bird, G. A.↗

GRID3O: Computer program for fast generation of multilevel, three-dimensional boundary-conforming O-type computational grids

A fast algorithm was developed for accurately generating boundary-conforming, three-dimensional, consecutively refined computational grids applicable to arbitrary wing-body and axial turbomachinery geometries. The method is based on using an analytic function to generate two-dimensional grids on a number of coaxial axisymmetric surfaces positioned between the centerbody and the outer radial boundary. These grids are of the O-type and are characterized by quasi-orthogonality, geometric periodicity, and an adequate resolution throughout the flow field. Because the built-in nonorthogonal coordinate stretching and shearing cause the grid lines leaving the blade or wing trailing edge to end at downstream infinity, the numerical treatment of the three-dimensional trailing vortex sheets is simplified.

Dulikravich, D. S.↗

Optimal Control for the Quantum Simulation of Nuclear Dynamics

We propose a method for enacting the unitary time propagation of two interacting neutrons at leading order of chiral effective-field theory by efficiently encoding the nuclear dynamics into a single multilevel quantum device. The emulated output of the quantum simulation shows that, by applying a single gate that draws on the underlying characteristics of the device, it is possible to observe multiple cycles of the nuclear dynamics before the onset of decoherence. Owing to the signal's longevity, we can then extract spectroscopic properties of the simulated nuclear system. This allows us to validate the encoding of the nuclear Hamiltonian and the robustness of the simulation in the presence of quantum-hardware noise by comparing the extracted spectroscopic information to exact calculations. This work paves the way for transformative calculations of the dynamical properties of nuclei on near-term quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Instrumentation for gamma-ray astronomy

The current status of gamma-ray-telescope technology for ground, airborne, and space observations is surveyed and illustrated with drawings, diagrams, and graphs and tables of typical data. For the low- and medium-energy ranges, consideration is given to detectors and detector cooling systems, background-rejection methods, radiation damage, large-area detectors, gamma-ray imaging, data analysis, and the Compton-interaction region. Also discussed are the gamma-ray interaction process at high energies; multilevel automated spark-chamber gamma-ray telescopes; the Soviet Gamma-1 telescope; the EGRET instrument for the NASA Gamma-Ray Observatory; and Cerenkov, air-shower, and particle-detector instruments for the TeV and PeV ranges. Significant improvements in resolution and sensitivity are predicted for the near future.

Bertsch, David L.↗

On multilevel block modulation codes

The multilevel (ML) technique for combining block coding and modulation is investigated. A general formulation is presented for ML modulation codes in terms of component codes with appropriate distance measures. A specific method for constructing ML block modulation codes (MLBMCs) with interdependency among component codes is proposed. Given an MLBMC C with no interdependency among the binary component codes, the proposed method gives an MLBC C-prime that has the same rate as C, a minimum squared Euclidean distance not less than that of C, a trellis diagram with the same number of states as that of C, and a smaller number of nearest-neighbor codewords than that of C. Finally, a technique is presented for analyzing the error performance of MLBMCs for an additive white Gaussian noise channel based on soft-decision maximum-likelihood decoding.

Kasami, Tadao↗

High density circuit technology, part 2

A multilevel metal interconnection system for very large scale integration (VLSI) systems utilizing polyimides as the interlayer dielectric material is described. A complete characterization of polyimide materials is given as well as experimental methods accomplished using a double level metal test pattern. A low temperature, double exposure polyimide patterning procedure is also presented.

Wade, T. E.↗

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗

High-Efficiency Flexible Multilevel Photon Sieves by Single-Step Laser-Based Fabrication and Optical Analysis

Over the past several decades, the need for high-resolution, high-efficiency, lightweight, high contrast focusing optics has continued to increase due to their applications in fields such as astronomy, spectroscopy, free-space optical communications, defense, and remote sensing. In recent years, photon sieve planar diffractive optics have been developed on flexible, lightweight polyimide substrates. However, transmission efficiencies have continuously been very low (~1-4%), thus impeding the widespread use of photon sieves in practical applications. Here, we present a flexible, lightweight, N = 4 level phase photon sieve with over 25% transmission efficiency; nearly triple that of any other photon sieve reported thus far. In this study, the photon sieve was fabricated via a novel pulsed laser ablation method using an ultraviolet source, and the total time to fabricate a ~3 sq cm sample was tens of seconds. Theoretical analysis of the photon sieve was carried out via the FDTD method, and was in very good agreement with experimental results. We also calculated via FDTD modeling the behavior of higher step (N = 8, 16, 32) photon sieves for further enhanced efficiencies, and show a fundamental limit on photon sieve efficiency of 70% in the limit of increasing step number. This multilevel photon sieve represents a new step in high-resolution diffractive optics, moving towards efficiencies suitable for widespread applications.

Julian, Matthew N.↗

White Box Access to Quantum Testbeds for Co-Design

At Lawrence Livermore National Laboratory (LLNL), we operate and maintain the Quantum Device and Integration Testbed (QuDIT) facility, a small quantum testbed that supports about 10 active research teams (including our own) and over 50 internal and external collaborators. This testbed is designed to give remote white box access to users for research, training, and outreach. A guiding principle behind the development of our testbed infrastructure, software and user interfaces is to empower users to perform experiments at the cutting edge of quantum information science at any level of abstraction, from materials studies, device physics and control and characterization techniques to algorithm development and quantum operating system design. Our testbed targets a multilevel quantum system (qudit) to expand the accessible Hilbert space of a simple-to-manufacture quantum device and focuses on quantum simulation, typically implemented through custom gates designed with quantum optimal control methods, rather than on a universal computing framework with a fixed gate set. We leverage the Lab’s high-performance computing (HPC) program and related expertise to simulate quantum systems, develop hybrid algorithms, and generate gates optimized for given simulations. Additionally, we have adopted a co-design philosophy from the HPC community in designing new hardware, so that the systems we develop are optimized for the specific physics simulations we plan to use them for.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

Limber, Mark A.↗