SEARCH · Engineering Papers

Results for “discretization error”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 361 records · Page 20

All sources NASA NTRS DOE OSTI

DOE OSTI2024

An Asymptotic Preserving Discontinuous Galerkin Method for a Linear Boltzmann Semiconductor Model

A key property of the linear Boltzmann semiconductor model is that as the collision frequency tends to infinity, the phase space density $f$ = $f$ ($x, v, t$) converges to an isotropic function $M (v)$$ρ$$(x, t)$, called the drift-diffusion limit, where $M$ is a Maxwellian and the physical density $ρ$ satisfies a second-order parabolic PDE known as the drift-diffusion equation. Numerical approximations that mirror this property are said to be asymptotic preserving. In this paper we build a discontinuous Galerkin method to the semiconductor model, and we show this scheme is both uniformly stable in $ε$, where 1/$ε$ is the scale of the collision frequency, and asymptotic preserving. Here in particular, we discuss what properties the discrete Maxwellian must satisfy in order for the schemes to converge in $ε$ to an accurate $h$-approximation of the drift-diffusion limit. Discrete versions of the drift-diffusion equation and error estimates in several norms with respect to $ε$ and the spacial resolution are also included.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

The virtual element method for linear elastodynamics models: Design, analysis, and implementation

We design the conforming virtual element method for the numerical simulation of two dimensional time-dependent elastodynamics problems. We investigate the performance of the method both theoretically and numerically. We prove the stability and the convergence of the semi-discrete approximation in the energy norm and derive optimal error estimates. We also show the convergence in the L 2 norm. The performance of the virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally seen in the p-refinement setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Extending Petsc's Composable Hierarchically Nested Linear Solvers

The Contributions from the RELACS group at both Rice University and the University at Buffalo in this phase of the PETSc Composable Solvers effort have centered around four main areas: scalable mesh processing, mesh adaptivity, solvers for subsurface flow, and performance modeling. The prominence of mesh processing demonstrates the tight relationship between meshing and discretization on the one hand, and optimal solvers on the other. All optimal solvers that we consider depend on some notion of hierarchy, and we express this using the DMPlex abstraction in PETSc. This relationship demands tight integration between the DM and SNES/TS components in PETSc that is the foundation of much of this work. In addition, interpretation of performance results for scalable solvers necessitates that information from the discretization and solver enter the performance model. Without this, comparing different solvers can be a fruitless exercise. Some major accomplishment of the past three years in these areas include: scalable mesh loading in PETSc on more than 10K cores, integrated mesh adaptivity using both p4est and Pragmatic, scalable multigrid for DG discretizations of subsurface flow, and predictive performance modeling incorporating error estimates.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Information transmission with continuous variable quantum erasure channels

Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different types of channels, evaluating the corresponding quantum capacity, and finding the capacity-approaching coding scheme are the major tasks in quantum communication theory. Quantum channel in discrete variables has been discussed enormously based on various error models, while error model in the continuous variable channel has been less studied due to the infinite dimensional problem. In this paper, we investigate a general continuous variable quantum erasure channel. By defining an effective subspace of the continuous variable system, we find a continuous variable random coding model. We then derive the quantum capacity of the continuous variable erasure channel in the framework of decoupling theory. The discussion in this paper fills the gap of a quantum erasure channel in continuous variable setting and sheds light on the understanding of other types of continuous variable quantum channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1970

Man-machine interactive system simplifies computer-aided circuit design

Langley interactive computerized circuit analysis capability /LICCA/ enables designer to draw electronic circuit diagrams on cathode ray tube screen. This information is submitted as input to user-selected circuit analysis program. LICCA accommodates binary logic circuits and circuits with discrete components, and monitors operator's instructions to detect errors.

Bavuso, S. J.↗

NASA NTRS1972

Input noise approximation in tracker modeling

The validity of approximating random Gaussian distributed inputs used in human response modeling by sums of discrete sine waves is studied. An ideal rectangular power density spectrum is simulated using both filtered Gaussian white noise and sums-of-discrete sine waves with three different input cutoff frequencies in the same compensatory tracking task. Resulting normalized tracking error and quality operator observations are used to investigate apparent discrepancies in human operator characteristics. Results show that discrete and continuous input tracking data compare favorable when the power in the crossover region is taken into account.

Torrey, P. F.↗

DOE OSTI2024

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2003

Finite Volume Methods: Foundation and Analysis

Finite volume methods are a class of discretization schemes that have proven highly successful in approximating the solution of a wide variety of conservation law systems. They are extensively used in fluid mechanics, porous media flow, meteorology, electromagnetics, models of biological processes, semi-conductor device simulation and many other engineering areas governed by conservative systems that can be written in integral control volume form. This article reviews elements of the foundation and analysis of modern finite volume methods. The primary advantages of these methods are numerical robustness through the obtention of discrete maximum (minimum) principles, applicability on very general unstructured meshes, and the intrinsic local conservation properties of the resulting schemes. Throughout this article, specific attention is given to scalar nonlinear hyperbolic conservation laws and the development of high order accurate schemes for discretizing them. A key tool in the design and analysis of finite volume schemes suitable for non-oscillatory discontinuity capturing is discrete maximum principle analysis. A number of building blocks used in the development of numerical schemes possessing local discrete maximum principles are reviewed in one and several space dimensions, e.g. monotone fluxes, E-fluxes, TVD discretization, non-oscillatory reconstruction, slope limiters, positive coefficient schemes, etc. When available, theoretical results concerning a priori and a posteriori error estimates are given. Further advanced topics are then considered such as high order time integration, discretization of diffusion terms and the extension to systems of nonlinear conservation laws.

Barth, Timothy↗

NASA NTRS2016

Accuracy of RT Code SORD for Realistic Atmospheric Profiles

We discuss accuracy of our recently developed RT code SORD using 2 benchmark scenarios published by the IPRT group in 2015. These scenarios define atmospheres with a complicate dependence of scattering and absorption properties over height (profile). Equal step, dh=1km, is assumed in the profiles. We developed subroutines that split such atmospheres into layers of the same optical thickness, d tau. We provide full text of the subroutines with comments in Appendix. The d tau is a step for vertical integration in the method of successive orders. Modification of the input profiles from "equal step over h" to "equal step over tau" changes input for RT simulations. This may cause errors at or above the acceptable level of the measurement uncertainty. We show errors of the RT code SORD for both intensity and polarization. In addition to that, using our discrete ordinates RT code IPOL, we discuss one more IPRT scenario, in which changes in height profile indeed cause unacceptable errors. Clear understanding of source and magnitude of these errors is important, e.g. for the AERONET retrieval algorithm. SORD is available from ftp://maiac.gsfc.nasa.gov/pub/skorkin/SORD_IP_16B/ or by email request from the first author.

polarization↗

DOE OSTI2025

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized ℤ 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative 𝑋 or 𝑍 magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized ℤ 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

quantum error correction↗

DOE OSTI2021

Success of digital adiabatic simulation with large Trotter step

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. Here we show that with additional conditions, the circuit depth can be linear in simulation time T. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Windowed least-squares model reduction for dynamical systems

Here we propose a windowed least-squares (WLS) approach for model reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space–time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov–Galerkin (LSPG), and space–time LSPG projection. In addition, the approach addresses key deficiencies in existing model reduction techniques, e.g., the dependence of LSPG and space–time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space–time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the full-order model, and one that reduces both the spatial and temporal dimensions of the full-order model. For each type of trial subspace, we consider two different solution techniques: direct (i.e., discretize then optimize) and indirect (i.e., optimize then discretize). Numerical experiments conducted using trial subspaces characterized by spatial dimension reduction demonstrate that the WLS approach can yield more accurate solutions with lower space–time residuals than Galerkin and LSPG projection.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1987

Adaptive identification and control for manipulators without using joint accelerations

The authors present a new scheme for the adaptive control of mechanical manipulators along with proof of convergence. Difficulties encountered in the input-error type adaptive controller are remedied by combining an explicit identifier with discrete time updates of the parameter values along with a computed torque type control law. The new scheme requires no matrix inversion with its consequent drain on the computational power of the controller. A discussion is presented of the dynamic model of a manipulator, a computed torque adaptive scheme, an input error identifier, and a hybrid identifier.

Hsu, Ping↗

NASA NTRS1986

Hesitation in tracking induced by a concurrent manual task

When people are required to track with one hand and perform occasional discrete responses with the other hand, there is a strong possibility that errors will be induced in tracking attributable to the simultaneous action by the other. This problem was investigated by pairing pursuit tracking (right hand) with a handle movement response (left hand) guided by an auditory stimulus. Tracking is assumed to represent flight control and the left hand response to represent other aspects of aircraft system management. The general goal of this research is to identify the types of errors induced into tracking by the requirement of a secondary response with the other hand. An attempt is reported to determine if hesitations can be reduced further by combining tracking emphasis with a higher degree of practice. It is concluded that there is a tendency to freeze the tracking response when a discrete simultaneous response is required of the other hand. By contrast, practice seems to reduce hesitations while also improving left hand reaction time. Thus there appears to be a mode of control which permits tracking and discrete simultaneous responses to occur together.

Kelly, P. A.↗

NASA NTRS2017

Digital Material Assembly by Passive Means and Modular Isotropic Lattice Extruder System

A set of machines and related systems build structures by the additive assembly of discrete parts. These digital material assemblies constrain the constituent parts to a discrete set of possible positions and orientations. In doing so, the structures exhibit many of the properties inherent in digital communication such as error correction, fault tolerance and allow the assembly of precise structures with comparatively imprecise tools. Assembly of discrete cellular lattices by a Modular Isotropic Lattice Extruder System (MILES) is implemented by pulling strings of lattice elements through a forming die that enforces geometry constraints that lock the elements into a rigid structure that can then be pushed against and extruded out of the die as an assembled, loadbearing structure.

Carney, Matthew Eli↗

NASA NTRS2018

Digital Material Assembly by Passive Means and Modular Isotropic Lattice Extruder System

Carney, Matthew Eli↗

DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

NASA NTRS1972

An error criterion for determining sampling rates in closed-loop control systems

The determination of an error criterion which will give a sampling rate for adequate performance of linear, time-invariant closed-loop, discrete-data control systems was studied. The proper modelling of the closed-loop control system for characterization of the error behavior, and the determination of an absolute error definition for performance of the two commonly used holding devices are discussed. The definition of an adequate relative error criterion as a function of the sampling rate and the parameters characterizing the system is established along with the determination of sampling rates. The validity of the expressions for the sampling interval was confirmed by computer simulations. Their application solves the problem of making a first choice in the selection of sampling rates.

Brecher, S. M.↗