Engineering Papers⌕ Search

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.

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

At least 595 records · Page 33

Improved numerical methods for turbulent viscous recirculating flows

The hybrid-upwind finite difference schemes employed in generally available combustor codes possess excessive numerical diffusion errors which preclude accurate quantative calculations. The present study has as its primary objective the identification and assessment of an improved solution algorithm as well as discretization schemes applicable to analysis of turbulent viscous recirculating flows. The assessment is carried out primarily in two dimensional/axisymetric geometries with a view to identifying an appropriate technique to be incorporated in a three-dimensional code.

Turan, A.↗

Digital visual communications using a Perceptual Components Architecture

The next era of space exploration will generate extraordinary volumes of image data, and management of this image data is beyond current technical capabilities. We propose a strategy for coding visual information that exploits the known properties of early human vision. This Perceptual Components Architecture codes images and image sequences in terms of discrete samples from limited bands of color, spatial frequency, orientation, and temporal frequency. This spatiotemporal pyramid offers efficiency (low bit rate), variable resolution, device independence, error-tolerance, and extensibility.

Watson, Andrew B.↗

Visually Lossless Data Compression for Real-Time Frame/Pushbroom Space Science Imagers

A visually lossless data compression technique is currently being developed for space science applications under the requirement of high-speed push-broom scanning. The technique is also applicable to frame based imaging and is error-resilient in that error propagation is contained within a few scan lines. The algorithm is based on a block transform of a hybrid of modulated lapped transform (MLT) and discrete cosine transform (DCT), or a 2-dimensional lapped transform, followed by bit-plane encoding; this combination results in an embedded bit string with exactly the desirable compression rate as desired by the user. The approach requires no unique table to maximize its performance. The compression scheme performs well on a suite of test images typical of images from spacecraft instruments. Flight qualified hardware implementations are in development; a functional chip set is expected by the end of 2001. The chip set is being designed to compress data in excess of 20 Msamples/sec and support quantizations from 2 to 16 bits.

Yeh, Pen-Shu↗

Comparing numerical accuracy and stability for different horizontal discretizations in MPAS-Ocean

This manuscript investigates the effectiveness of two possible horizontal discretizations for the global ocean model MPAS-Ocean, both applied to Spherical Centroidal Voronoi Tessellations (SCVTs). The first discretization is TRiSK, a C-grid, finite-volume method, that possesses many desirable mimetic properties, but has a low order accuracy. The second discretization was introduced for the first time by Peixoto (2016), and consists of modifications to the TRiSK scheme designed to achieve at least first-order accuracy in the L ∞ norm, with the loss of some of the mimetic properties. Tests on shallow-water and primitive-equation models show that the scheme due to Peixoto is indeed more accurate, but presents stability issues with respect to TRiSK. Here, TRiSK is indeed found to be often more stable in time and more robust with respect to errors in the geometric properties of the grid.

97 MATHEMATICS AND COMPUTING↗

Hybrid Quantum Networks with Discrete Polarizations and Continuous Quadrature Variables

Final Scientific/Technical Report for DOE Project DE-SC0022069. Quantum communication and computation systems have evolved along two largely independent paradigms: discrete-variable (DV) systems that encode information in qubits such as photon polarizations or photon-number states, and continuous-variable (CV) systems that encode information in optical field quadratures. Each approach offers distinct advantages—DVs provide low error rates and compatibility with single-photon platforms, while CVs support deterministic operations and efficient quantum state manipulation. A fundamental challenge for building a scalable Quantum Internet lies in interfacing these two regimes into a unified hybrid architecture that can coherently distribute and process quantum information across heterogeneous quantum nodes. This project aims to develop and demonstrate a hybrid optical quantum network that seamlessly integrates DV and CV systems. Specifically, we investigate a new class of hybrid entanglement between the discrete polarizations of single photons and the continuous quadrature variables of optical cat states, overcoming incompatibilities in existing DV–CV demonstrations. Using this new entanglement resource, the team investigates a multi-node hybrid quantum local area network (Q-LAN) testbed capable of DV–CV entanglement generation, swapping, and distribution across fiber links.

74 ATOMIC AND MOLECULAR PHYSICS↗

Image Correlation Pattern Optimization for Micro-Scale In-Situ Strain Measurements

The accuracy and precision of digital image correlation (DIC) is a function of three primary ingredients: image acquisition, image analysis, and the subject of the image. Development of the first two (i.e. image acquisition techniques and image correlation algorithms) has led to widespread use of DIC; however, fewer developments have been focused on the third ingredient. Typically, subjects of DIC images are mechanical specimens with either a natural surface pattern or a pattern applied to the surface. Research in the area of DIC patterns has primarily been aimed at identifying which surface patterns are best suited for DIC, by comparing patterns to each other. Because the easiest and most widespread methods of applying patterns have a high degree of randomness associated with them (e.g., airbrush, spray paint, particle decoration, etc.), less effort has been spent on exact construction of ideal patterns. With the development of patterning techniques such as microstamping and lithography, patterns can be applied to a specimen pixel by pixel from a patterned image. In these cases, especially because the patterns are reused many times, an optimal pattern is sought such that error introduced into DIC from the pattern is minimized. DIC consists of tracking the motion of an array of nodes from a reference image to a deformed image. Every pixel in the images has an associated intensity (grayscale) value, with discretization depending on the bit depth of the image. Because individual pixel matching by intensity value yields a non-unique scale-dependent problem, subsets around each node are used for identification. A correlation criteria is used to find the best match of a particular subset of a reference image within a deformed image. The reader is referred to references for enumerations of typical correlation criteria. As illustrated by Schreier and Sutton and Lu and Cary systematic errors can be introduced by representing the underlying deformation with under-matched shape functions. An important implication, as discussed by Sutton et al., is that in the presence of highly localized deformations (e.g., crack fronts), error can be reduced by minimizing the subset size. In other words, smaller subsets allow the more accurate resolution of localized deformations. Contrarily, the choice of optimal subset size has been widely studied and a general consensus is that larger subsets with more information content are less prone to random error. Thus, an optimal subset size balances the systematic error from under matched deformations with random error from measurement noise. The alternative approach pursued in the current work is to choose a small subset size and optimize the information content within (i.e., optimizing an applied DIC pattern), rather than finding an optimal subset size. In the literature, many pattern quality metrics have been proposed, e.g., sum of square intensity gradient (SSSIG), mean subset fluctuation, gray level co-occurrence, autocorrelation-based metrics, and speckle-based metrics. The majority of these metrics were developed to quantify the quality of common pseudo-random patterns after they have been applied, and were not created with the intent of pattern generation. As such, it is found that none of the metrics examined in this study are fit to be the objective function of a pattern generation optimization. In some cases, such as with speckle-based metrics, application to pixel by pixel patterns is ill-conditioned and requires somewhat arbitrary extensions. In other cases, such as with the SSSIG, it is shown that trivial solutions exist for the optimum of the metric which are ill-suited for DIC (such as a checkerboard pattern). In the current work, a multi-metric optimization method is proposed whereby quality is viewed as a combination of individual quality metrics. Specifically, SSSIG and two auto-correlation metrics are used which have generally competitive objectives. Thus, each metric could be viewed as a constraint imposed upon the others, thereby precluding the achievement of their trivial solutions. In this way, optimization produces a pattern which balances the benefits of multiple quality metrics. The resulting pattern, along with randomly generated patterns, is subjected to numerical deformations and analyzed with DIC software. The optimal pattern is shown to outperform randomly generated patterns.

Bomarito, G. F.↗

Multilabel proportion prediction and out-of-distribution detection on gamma spectra of short-lived fission products

In the machine learning problem of multilabel classification, the objective is to determine for each test instance which classes the instance belongs to. In this work, we consider an extension of multilabel classification, called multilabel proportion prediction, in the context of radioisotope identification (RIID) using gamma spectra data. We aim to not only predict radioisotope proportions, but also identify out-of-distribution (OOD) spectra. We achieve this goal by viewing gamma spectra as discrete probability distributions, and based on this perspective, we develop a custom semi-supervised loss function that combines a traditional supervised loss with an unsupervised reconstruction error function. Our approach was motivated by its application to the analysis of short-lived fission products from spent nuclear fuel. In particular, we demonstrate that a neural network model trained with our loss function can successfully predict the relative proportions of 37 radioisotopes simultaneously. The model trained with synthetic data was then applied to measurements taken by Pacific Northwest National Laboratory (PNNL) to conduct analysis typically done by subject-matter experts. Here, we also extend our approach to successfully identify when measurements are OOD, and thus should not be trusted, whether due to the presence of a novel source or novel proportions.

Anomaly detection↗

Development of a River Dynamical Core for E3SM to simulate compound flooding on Exascale-class heterogeneous supercomputers

Flooding events pose significant risk to human life, property, and infrastructure. Physically-consistent quantification of altered flood risks in global models requires hyper-resolution (~1 km) or fine flood simulations using two-dimensional (2D) physics schemes, both of which are unavailable in the current generation Earth System Models. Here, in this work, we have developed the River Dynamical Core (RDycore), which is an open-source, 2D shallow water equation (SWE) library for the U.S. Department of Energy's Energy Exascale Earth System Model (E3SM). RDycore uses PETSc and libCEED libraries that allows it to run efficiently on CPUs and GPUs, as well as select a time-integration algorithm at runtime without requiring any code modifications. RDycore achieves spatial error convergence rates for problems with analytical and manufactured solutions similar to those reported previously in the literature, or consistent with the implemented first-order spatial discretization scheme. RDycore's accuracy in predicting flooding for a well-studied dam break problem is comparable to existing SWE models. For a problem with 471 million grid cells, RDycore achieves a speedup of 6.6x and 7.6x on GPUs compared to CPUs when using 320 compute nodes on DOE's Perlmutter and Frontier supercomputers, respectively. The one-way coupling of the RDycore library within E3SM is demonstrated by performing multiple 5-day flooding simulations during Hurricane Harvey driven by five precipitation datasets. The E3SM--RDycore simulations at 30 m spatial resolution accurately simulate maximum water height during the hurricane when benchmarked against a previously published study and achieve a speedup of 15x (Perlmutter) and 21x (Frontier) on GPUs relative to CPUs. The work presented here is the foundational step in providing hardware and algorithmic portability framework for simulating kilometer-scale river dynamics within E3SM.

Flood Simulation↗

Digital simulation of continuous error models with application to an instrument landing system error

A digital simulation of the continuous error of the localized beam of a conventional instrument landing system is discussed. The digital simulation was developed during the analysis of space shuttle navigation capabilities. A discrete mathematical model for use on a digital computer is described. The model generates an output random sequence which is equivalent, for simulation purposes, to the desired random process. The model is a system of difference equations driven by a zero-mean Gaussian random sequence.

Merrick, R. B.↗

New method for propagating the square root covariance matrix in triangular form

A method proposed by Potter of applying the Kalman-Bucy filter to the problem of estimating the state of a dynamic system is described, in which the square root of the state error covariance matrix is used to process the observations. A new technique which propagates the covariance square root matrix in lower triangular form is given for the discrete observation case. The technique is faster than previously proposed algorithms and is well-adapted for use with the Carlson square root measurement algorithm.

Choe, C. Y.↗

A separation theorem for the stochastic sampled-data LQG problem

This paper considers the control of a continuous linear plant disturbed by white plant noise when the control is constrained to be a piecewise constant function of time; i.e. a stochastic sampled-data system. The cost function is the integral of quadratic error terms in the state and control, thus penalizing errors at every instant of time while the plant noise disturbs the system continuously. The problem is solved by reducing the constrained continuous problem to an unconstrained discrete one. It is shown that the separation principle for estimation and control still holds for this problem when the plant disturbance and measurement noise are Gaussian.

Halyo, N.↗

Dynamics Questions Associated with the AERCam Sprint Free-Flyer

The International Space Station will require the development of small robotic vehicles for such tasks as external inspection, monitoring of extravehicular activities (EVA's) and station build-up, and providing additional lighting at EVA worksites. The Autonomous EVA Robotic Camera (AERCam) family of free-flyers is currently being developed at NASA Johnson Space Center to perform these functions; the first member of the family is the AERCam Sprint vehicle. Many interesting dynamical questions are associated with the Sprint free-flyer. For instance, the reaction of a vehicle which is nearly spherically symmetric (such as Sprint) to a stuck-on thruster is significantly more complicated than that obtained for an idealized, perfectly spherical, spacecraft model. In particular, the real spacecraft will experience a form of forced nutation, with convergence towards either its major or minor principal axis, depending on both the applied torque and the mass properties of the vehicle. Furthermore, the body-fixed jet force vector may have a significant component along this principal axis, so giving rise to a considerable net linear acceleration of the spacecraft. The large velocity that can result is very important, as it may lead to collision with the nearby Orbiter, and is completely overlooked in the idealized analysis. This report will firstly briefly describe the stuck-on thruster dynamics of the real vehicle, and outline how the small products of inertia of the spacecraft determine the time constants of the motion. Secondly, the dynamical effects of a failed-off jet on the Sprint free-flyer will be described in more detail, and compared with the stuck-on thruster case. This will help to show whether the two malfunctions should be dealt with differently in flight. Finally, the stuck-on thruster detection software (known as the uncommanded motion algorithm) that is proposed to be flown on the Sprint vehicle will be analyzed, and all possible perturbation sources that may tend to give rise to false stuck-on thruster alarms quantified. It will be shown that false alarms can be triggered by discrete events such as a failed-off thruster, a glancing collision with Orbiter structure, or thruster saturation. They can also be triggered by a combination of errors introduced by constantly present sources such as thrust level errors, thruster misalignment, inertial cross-coupling, angular rate sensor noise, and structural vibrations induced by thruster firings. Based on this fact, the original plan to have the spacecraft enter safe mode whenever the uncommanded motion algorithm is triggered does not appear to be advisable. A better approach seems to be to provide the Sprint pilot with a warning whenever uncommanded motion is detected, and then allow the crew to determine whether safing the vehicle is appropriate.

Williams, Trevor↗

Flight Deck Surface Trajectory-Based Operations

Surface Trajectory-Based Operations (STBO) is a future concept for surface operations where time requirements are incorporated into taxi operations to support surface planning and coordination. Pilot-in-the-loop flight deck simulations have been conducted to study flight deck displays algorithms to aid pilots in complying with the time requirements of time-based taxi operations (i.e., at discrete locations in 3 12 D operations or at all points along the route in 4DT operations). The results of these studies (conformance, time-of-arrival error, eye-tracking data, and safety ratings) are presented. Flight deck simulation work done in collaboration with DLR is described. Flight deck research issues in future auto-taxi operations are also introduced.

flight deck↗

Performance Assessment of the Eastern Range Mosquito Lagoon 915-MHz Doppler Radar Wind Profiler

Please find enclosed the performance assessment for the Mosquito Lagoon 915-MHz Doppler Radar Wind Profiler (DRWP). This assessment was conducted following the installation of the new DRWP systems at the Eastern Range. DRWP profiles were compared to Automated Meteorological Profiling System balloons launched from Cape Canaveral Space Force Station. Launching balloons from the DRWP site was discussed, but was determined to be unfeasible. Therefore, these results include errors due to the spatial separation of winds. Mean wind component deltas generally ranged between -1.4-2.0 m/s between the balloons and DRWP systems. Data availability at discrete altitudes ranged from 7% to 98% with the least amount of available profiles being in the upper altitude ranges between 4000 m and 5000 m as well as below 300 m. The effective vertical resolution was not able to be estimated in this study, likely due to the relatively small dataset. The results from this analysis were requested by the United States Space Force for use of the acceptance of the DRWP system and for internal EV44 reference.

meteorology↗

Beam combining of high-power terahertz lasers with semiconductor metasurface gratings

Spectral beam combining (SBC) of an array of single-mode lasers has the potential for realizing a chip-scale electrically tunable multispectral laser source without any moving parts and with emission at closely spaced discrete frequencies. Here, we demonstrate SBC of an array of single-mode THz quantum-cascade lasers (QCLs) with small frequency spacing. Semiconductor-based metasurface THz blazed gratings are developed for integration with QCLs in a compact cryocooler setup. Single-lobed beams of four QCLs emitting around 3.2 THz and spectrally separated by ~14 GHz are combined to achieve collinear propagation of spatially overlapped and collimated beams in the far field with ≲ 0.1° of pointing error. Peak optical power in the range 50–100 mW is detected from each of the QCLs after combining. The dense frequency spacing in our method provides a pathway to incorporate tens of QCLs on a chip to realize a high-power discretely tunable THz laser source for applications in THz spectroscopy.

Jia, Fei [Lehigh Univ., Bethlehem, PA (United Stat↗

Spectral deferred correction methods for high-order accuracy in poroelastic problems

In this work, we investigate high-order accuracy in time integration by examining two operator splitting methods for poroelastic problems: the two-pass and the spectral deferred correction (SDC) methods. To enhance the order of accuracy, the two-pass method partitions a coupled operator symmetrically, whereas the SDC method corrects truncation errors by establishing an error equation. These high-order methods are applied to underlying solution strategies, i.e., monolithic, fixed-stress sequential, and undrained sequential methods. We observe that semi-discretized systems from spatial discretization have forms similar to those of index-1 differential algebraic equations (DAEs), causing order reduction against the two-pass method when it is used in conjunction with either the monolithic or sequential method. On the other hand, the SDC in conjunction with the monolithic method exhibits the desired second-order accuracy in poroelastic problems while increasing the order of accuracy for index-1 DAEs. However, the SDC in conjunction with either of the two sequential methods does not achieve the desired order of accuracy, and maintains first order because the flow equation for poroelasticity has an additional approximation associated with the volumetric strain rate term, which does not yield exactly the same forms as those of conventional DAEs. Thus, the monolithic SDC method can achieve higher-order accuracy, but may require higher computational costs because it involves solving matrix systems larger than those for the sequential methods.

02 PETROLEUM↗

Impacts of Bulk Microphysics Scheme Structural Choices on Simulations of Rain Initiation Through Drop Coalescence

This study examines how different structural choices in bulk microphysics schemes impact the simulation of warm rain initiation. A single liquid category (SLC) approach prognosing up to four moments of a single drop size distribution (DSD) is compared to the traditional two-category, two-moment approach with separate DSDs for cloud and rain (four total prognostic variables). Different methods for calculating tendencies of the prognostic variables from drop collision-coalescence are also tested: a discretized numerical-integration approach, machine learning via neural networks, lookup tables, and traditional power law fits. Relative to simulations using a bin microphysics model, SLC gives smaller error overall than the two-category approach when numerical integration is used to calculate the collision-coalescence tendencies for both. Replacing the numerical integration with a pre-computed lookup table reduces computational cost with little loss of accuracy. However, using fitted power laws with SLC to represent the collision-coalescence tendencies substantially reduces accuracy and leads to an order of magnitude increase in error. It is also demonstrated that with SLC, reasonably accurate solutions are obtained using only three prognostic moments, while a two-moment SLC scheme leads to substantial error. Overall, both the choice of prognostic moments (e.g., SLC vs. two-category) and method to calculate the collision-coalescence tendencies are important to consider for minimizing errors in bulk schemes. SLC with a sufficiently detailed calculation of the collision-coalescence tendencies provides accurate solutions for a reasonable computational cost, providing a viable alternative to the traditional two-category, two-moment approach for bulk microphysics.

320 (cloud physics and chemistry)↗

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗