Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discretization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 37 records · Page 2

An Accurate SUPG-stabilized Continuous Galerkin Discretization for Anisotropic Heat Flux in Magnetic Confinement Fusion

We present a novel spatial discretization for the anisotropic heat conduction equation, aimed at improved accuracy at the high levels of anisotropy seen in a magnetized plasma, for example, for magnetic confinement fusion. The new discretization is based on a mixed formulation, introducing a form of the directional derivative along the magnetic field as an auxiliary variable and discretizing both the temperature and auxiliary fields in a continuous Galerkin (CG) space. Both the temperature and auxiliary variable equations are stabilized using the streamline upwind Petrov–Galerkin (SUPG) method, ensuring a better representation of the directional derivatives and therefore an overall more accurate solution. This approach can be seen as the CG-based version of our previous work (Wimmer, Southworth, Gregory, Tang, 2024), where we considered a mixed discontinuous Galerkin (DG) spatial discretization including DG-upwind stabilization. We prove consistency of the novel discretization, and demonstrate its improved accuracy over existing CG-based methods in test cases relevant to magnetic confinement fusion. This includes a long-run tokamak equilibrium sustainment scenario, demonstrating a 35% and 32% spurious heat loss for existing primal and mixed CG-based formulations versus 4% for our novel SUPG-stabilized discretization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Choice of method for discretization of continuous systems

The paper discusses and compares several common methods of discretizing the transfer function of a continuous control system so that a digital computer can be used. The discretization effect on the frequency response attenuation of the simple transfer function G(s) = 1/(s + 1) is illustrated for the Tusting, Boxer-Thaler, Madwed, linear segment approximation, and stair-step with half period advanced methods. The input frequency must be significantly lower than one-half the sampling error to have negligible discretization error. Phase differences due to discretization are also plotted, and it is seen that the zero-order hold contributes much more phase shift than that due to discretization. In situations where zero-order hold must follow a computer, the method of discretization of a continuous system is not a major factor if phase shift is important.

Mcvey, E. S.↗

On discrete control of nonlinear systems with applications to robotics

Much progress has been reported in the areas of modeling and control of nonlinear dynamic systems in a continuous-time framework. From implementation point of view, however, it is essential to study these nonlinear systems directly in a discrete setting that is amenable for interfacing with digital computers. But to develop discrete models and discrete controllers for a nonlinear system such as robot is a nontrivial task. Robot is also inherently a variable-inertia dynamic system involving additional complications. Not only the computer-oriented models of these systems must satisfy the usual requirements for such models, but these must also be compatible with the inherent capabilities of computers and must preserve the fundamental physical characteristics of continuous-time systems such as the conservation of energy and/or momentum. Preliminary issues regarding discrete systems in general and discrete models of a typical industrial robot that is developed with full consideration of the principle of conservation of energy are presented. Some research on the pertinent tactile information processing is reviewed. Finally, system control methods and how to integrate these issues in order to complete the task of discrete control of a robot manipulator are also reviewed.

Eslami, Mansour↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

Interactions Between Thresholds and Spatial Discretizations of Snow: Insights From Estimates of Wolverine Denning Habitat in the Colorado Rocky Mountains

Thresholds can be used to interpret environmental data in a way that is easily communicated and useful for decision making purposes. However, thresholds are often developed for specific data products and time periods, changing findings when the same threshold is applied to datasets or periods with different characteristics. Here, we test the impact of different spatial discretizations of snow on annual estimates of wolverine denning opportunities in the Colorado Rocky Mountains, defined using a snow water equivalent (SWE) threshold (0.20 m) and threshold date (15 May) from previous habitat assessments. Annual potential wolverine denning area (PWDA) was thresholded from a 36-year (1985 – 2020) snow reanalysis model with three different spatial discretizations: 1) 480 m grid cells (D480), 2) 90 m grid cells (D90), and 3) 480 m grid cells with implicit representations of subgrid snow spatial heterogeneity (S480). Relative to the D480 and S480 discretizations, D90 resolved shallower snow deposits on slopes between 3050 and 3350 m elevation, decreasing PWDA by 10%, on average. In years with warmer and/or drier winters, S480 discretizations with subgrid representations of snow heterogeneity increased PWDA, even within grid cells where mean 15 May SWE was less than the SWE threshold. These simulations increased PWDA by upwards of 30% in low snow years, as compared to the D480 and D90 simulations without subgrid snow heterogeneity. Despite PWDA sensitivity to different snow spatial discretizations, PWDA was controlled more by annual variations in winter precipitation and temperature. However, small changes to the SWE threshold (± 0.07 m) and threshold date (± 2 weeks) also affected PWDA by as much as 82%. Across these threshold ranges, PWDA was approximately 18% more sensitive to the SWE threshold than the threshold date. However, the sensitivity to the threshold date was larger in years with late spring snowfall, when PWDA depended on whether modeled SWE was thresholded before, during, or after spring snow accumulation. Our results demonstrate that snow thresholds are useful but may not always provide a complete picture of the annual variability in snow-adapted wildlife denning opportunities. Studies thresholding spatiotemporal datasets could be improved by including 1) information about the fidelity of thresholds across multiple spatial discretizations, and 2) uncertainties related to ranges of realistic thresholds.

Justin M. Pflug↗

Demonstrating Computational Equivalence Between Continuous and Discrete Adjoint Methods by Calculating Time-Dependent Adjoint Solutions with Neutron Diffusion Models

The continuous adjoint method and the discrete adjoint method are two alternative approaches used to calculate adjoint solutions for adjoint systems. The continuous adjoint method derives adjoint equations analytically from continuous forward equations and then solves the adjoint equations either analytically or numerically in a discretized form whereas the discrete adjoint method calculates the adjoint solutions directly from the discretized forward equations. With regard to the methodology development and calculation procedure, distinct differences are well recognized between the two methods. For certain reasons, both methods are exclusively preferred and commonly used by different computational communities, but limited studies clarify the connections between the two adjoint methods from either of the communities. Herein, this paper demonstrates the computational equivalence between the continuous and discrete adjoint methods by investigating time-dependent adjoint solutions to the two-group neutron diffusion model in nuclear reactor analysis problems using both methods. Adjoint solutions can be used to estimate system parameters for reactor safety analysis. Appropriate final state conditions for the adjoint systems are specified in both of the methods, and the conditions are clarified with proper physical explanations. With the help of an event-based case study on neutron diffusion models, the accuracy of the time-dependent adjoint fluxes obtained from both methods is verified, and the pros and cons of both adjoint methods are examined. More importantly, the computational equivalence of both methods is demonstrated when they are applied to multigroup neutron diffusion systems. The advantage of calculating time-dependent adjoint fluxes by directly solving time-dependent adjoint systems rather than taking steady-state approximations as in common practice is also demonstrated.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗

Comparison between explicit and implicit discretization strategies for a dissipative thermal environment

We investigate strategies for simulating open quantum systems coupled to dissipative baths by comparing explicit wave function-based discretization [via multi-layer multi-configuration time-dependent Hartree (ML-MCTDH)] and the implicit density matrix-based master equation method [via tree tensor network hierarchical equations of motion (TTN-HEOM)]. For dissipative baths characterized by exponentially decaying bath correlation functions, the implicit discretization approach of HEOM—rooted in bath correlation function decompositions—proves significantly more efficient than explicit discretization of the bath into discrete harmonic modes. Explicit methods, like ML-MCTDH, require extensive mode discretization to approximate continuum baths, leading to computational bottlenecks. Case studies for two-level systems and a Fenna–Matthews–Olson complex model highlight TTN-HEOM’s superiority in capturing dissipative dynamics with relaxations with a minimal number of auxiliary modes, while the explicit methods are as exact as the HEOM in pure dephasing regimes. This comparison is enabled by the TENSO package, which has both ML-MCTDH and TTN-HEOM implemented using the same computational structure and propagation strategy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Code for the manuscript titled "Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces"

We would like to disclose two scripts, written in Jupyter notebook, in which we implement the "Blackout Diffusion Process" described in the manuscript "Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces" (LA-UR-23-20509), to be submitted to the International Conference of Machine Learning (ICML). The abstract of the manuscript is append below. == Typical generative diffusion models rely on a Gaussian diffusion process for training the backward transformations, which can then be used generate samples from Gaussian noise. However, real world data often takes place in discrete-state spaces, which occur in many scientific applications. Here, we develop a theoretical formulation for arbitrary discrete-state Markov processes in the forward diffusion process. We relate the theory to the existing continuous-state Gaussian diffusion and identify the corresponding reverse-time stochastic process and score function in the continuous-time setting, and the reverse-time mapping in the discrete-time setting. As an example of this framework, we introduce "Blackout Diffusion", which learns to produce samples from an empty image instead of from noise. Numerical experiments on the CIFAR-10 dataset confirm the feasibility of generative diffusion modeling in a discrete space. Generalizing from specific (Gaussian) forward processes to a more general framework also sheds light on how to interpret generative diffusion models and their mathematical structure, which we comment on.

Lin, Yen Ting↗

A 6th Order Mehrstellen Finite Volume Discretization of Poisson's Equation in Three Dimensions

We discuss the derivation of a new, sixth-order finite volume scheme for Poisson’s equation on 3D Cartesian equispaced grids. The scheme is based on a discretization of the Laplace operator with a compact (Mehrstellen) 27-point stencil. To achieve sixth order convergence the right hand side of the equation is replaced with a discrete operator that involves the discrete Laplace and Biharmonic operators and the sum of discrete fourth-order cross derivatives applied to the charge function. Numerical tests demonstrate the superiority of the proposed method compared to the well known schemes associated with the 7-point and 19-point discretizations of the Laplacian.

97 MATHEMATICS AND COMPUTING↗

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations.

97 MATHEMATICS AND COMPUTING↗

Fluid-Kinetic Coupling: Advanced Discretizations for Simulations on Emerging Heterogeneous Architectures (LDRD FY20-0643)

Plasma physics simulations are vital for a host of Sandia mission concerns, for fundamental science, and for clean energy in the form of fusion power. Sandia's most mature plasma physics simulation capabilities come in the form of particle-in-cell (PIC) models and magnetohydrodynamics (MHD) models. MHD models for a plasma work well in denser plasma regimes when there is enough material that the plasma approximates a fluid. PIC models, on the other hand, work well in lower-density regimes, in which there is not too much to simulate; error in PIC scales as the square root of the number of particles, making high-accuracy simulations expensive. Real-world applications, however, almost always involve a transition region between the high-density regimes where MHD is appropriate, and the low-density regimes for PIC. In such a transition region, a direct discretization of Vlasov is appropriate. Such discretizations come with their own computational costs, however; the phase-space mesh for Vlasov can involve up to six dimensions (seven if time is included), and to apply appropriate homogeneous boundary conditions in velocity space requires meshing a substantial padding region to ensure that the distribution remains sufficiently close to zero at the velocity boundaries. Moreover, for collisional plasmas, the right-hand side of the Vlasov equation is a collision operator, which is non-local in velocity space, and which may dominate the cost of the Vlasov solver. The present LDRD project endeavors to develop modern, foundational tools for the development of continuum-kinetic Vlasov solvers, using the discontinuous Petrov-Galerkin (DPG) methodology, for discretization of Vlasov, and machine-learning (ML) models to enable efficient evaluation of collision operators. DPG affords several key advantages. First, it has a built-in, robust error indicator, allowing us to adapt the mesh in a very natural way, enabling a coarse velocity-space mesh near the homogeneous boundaries, and a fine mesh where the solution has fine features. Second, it is an inherently high-order, high-intensity method, requiring extra local computations to determine so-called optimal test functions, which makes it particularly suited to modern hardware in which floating-point throughput is increasing at a faster rate than memory bandwidth. Finally, DPG is a residual-minimizing method, which enables high-accuracy computation: in typical cases, the method delivers something very close to the $L^2$ projection of the exact solution. Meanwhile, the ML-based collision model we adopt affords a cost structure that scales as the square root of a standard direct evaluation. Moreover, we design our model to conserve mass, momentum, and energy by construction, and our approach to training is highly flexible, in that it can incorporate not only synthetic data from direct-simulation Monte Carlo (DSMC) codes, but also experimental data. We have developed two DPG formulations for Vlasov-Poisson: a time-marching, backward-Euler discretization and a space-time discretization. We have conducted a number of numerical experiments to verify the approach in a 1D1V setting. In this report, we detail these formulations and experiments. We also summarize some new theoretical results developed as part of this project (published as papers previously): some new analysis of DPG for the convection-reaction problem (of which the Vlasov equation is an instance), a new exponential integrator for DPG, and some numerical exploration of various DPG-based time-marching approaches to the heat equation. As part of this work, we have contributed extensively to the Camellia open-source library; we also describe the new capabilities and their usage. We have also developed a well-documented methodology for single-species collision operators, which we applied to argon and demonstrated with numerical experiments. We summarize those results here, as well as describing at a high level a design extending the methodology to multi-species operators. We have released a new open-source library, MLC, under a BSD license; we include a summary of its capabilities as well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Discrete-continuous variable structural synthesis using dual methods

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Schmit, L. A.↗

Discrete modes and continuous spectra in supersonic boundary layers

The disturbance field induced due to a harmonic point source consists of discrete eigenmodes and a continuous spectrum; these are studied by using generalized Fourier transform techniques. For a supersonic boundary layer, there exist seven branches of the continuous spectrum in the complex wavenumber space, four of which (two acoustic waves, one vorticity wave and one entropy wave) contribute to the flowfield downstream of the source. The discrete eigenmodes spring off from these branches at some critical Reynolds numbers. The results for Mach 2 and 4.5 boundary layers show that the receptivity coefficients for the stable discrete modes are much larger than that for the unstable mode. Therefore, the flow very near the source is dominated by the continuous spectrum and the stable discrete modes. However, the unstable mode takes over sufficiently far away from the source. It is shown that it is only necessary to consider the first few discrete modes to construct the solution. Calculations also show that, in a supersonic boundary layer, upstream influence from a localized disturbance is minimal.

Balakumar, P.↗

Active control of turbomachine discrete tones

This paper was directed at active control of discrete frequency noise generated by subsonic blade rows through cancellation of the blade row interaction generated propagating acoustic waves. First discrete frequency noise generated by a rotor and stator in a duct was analyzed to determine the propagating acoustic pressure waves. Then a mathematical model was developed to analyze and predict the active control of discrete frequency noise generated by subsonic blade rows through cancellation of the propagating acoustic waves, accomplished by utilizing oscillating airfoil surfaces to generate additional control propagating pressure waves. These control waves interact with the propagating acoustic waves, thereby, in principle, canceling the acoustic waves and thus, the far field discrete frequency tones. This model was then applied to a fan exit guide vane to investigate active airfoil surface techniques for control of the propagating acoustic waves, and thus the far field discrete frequency tones, generated by blade row interactions.

Fleeter, Sanford↗

Discrete-Layer Piezoelectric Plate and Shell Models for Active Tip-Clearance Control

The objectives of this work were to develop computational tools for the analysis of active-sensory composite structures with added or embedded piezoelectric layers. The targeted application for this class of smart composite laminates and the analytical development is the accomplishment of active tip-clearance control in turbomachinery components. Two distinct theories and analytical models were developed and explored under this contract: (1) a discrete-layer plate theory and corresponding computational models, and (2) a three dimensional general discrete-layer element generated in curvilinear coordinates for modeling laminated composite piezoelectric shells. Both models were developed from the complete electromechanical constitutive relations of piezoelectric materials, and incorporate both displacements and potentials as state variables. This report describes the development and results of these models. The discrete-layer theories imply that the displacement field and electrostatic potential through-the-thickness of the laminate are described over an individual layer rather than as a smeared function over the thickness of the entire plate or shell thickness. This is especially crucial for composites with embedded piezoelectric layers, as the actuating and sensing elements within these layers are poorly represented by effective or smeared properties. Linear Lagrange interpolation polynomials were used to describe the through-thickness laminate behavior. Both analytic and finite element approximations were used in the plane or surface of the structure. In this context, theoretical developments are presented for the discrete-layer plate theory, the discrete-layer shell theory, and the formulation of an exact solution for simply-supported piezoelectric plates. Finally, evaluations and results from a number of separate examples are presented for the static and dynamic analysis of the plate geometry. Comparisons between the different approaches are provided when possible, and initial conclusions regarding the accuracy and limitations of these models are given.

Heyliger, P. R.↗

Distributed Relaxation for Conservative Discretizations

A multigrid method is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work that is a small (less than 10) multiple of the operation count in one target-grid residual evaluation. The way to achieve this efficiency is the distributed relaxation approach. TME solvers employing distributed relaxation have already been demonstrated for nonconservative formulations of high-Reynolds-number viscous incompressible and subsonic compressible flow regimes. The purpose of this paper is to provide foundations for applications of distributed relaxation to conservative discretizations. A direct correspondence between the primitive variable interpolations for calculating fluxes in conservative finite-volume discretizations and stencils of the discretized derivatives in the nonconservative formulation has been established. Based on this correspondence, one can arrive at a conservative discretization which is very efficiently solved with a nonconservative relaxation scheme and this is demonstrated for conservative discretization of the quasi one-dimensional Euler equations. Formulations for both staggered and collocated grid arrangements are considered and extensions of the general procedure to multiple dimensions are discussed.

Diskin, Boris↗

On the Importance of the Dynamics of Discretizations

It has been realized recently that the discrete maps resulting from numerical discretizations of differential equations can possess asymptotic dynamical behavior quite different from that of the original systems. This is the case not only for systems of Ordinary Differential Equations (ODEs) but in a more complicated manner for Partial Differential Equations (PDEs) used to model complex physics. The impact of the modified dynamics may be mild and even not observed for some numerical methods. For other classes of discretizations the impact may be pronounced, but not always obvious depending on the nonlinear model equations, the time steps, the grid spacings and the initial conditions. Non-convergence or convergence to periodic solutions might be easily recognizable but convergence to incorrect but plausible solutions may not be so obvious - even for discretized parameters within the linearized stability constraint. Based on our past four years of research, we will illustrate some of the pathology of the dynamics of discretizations, its possible impact and the usage of these schemes for model nonlinear ODEs, convection-diffusion equations and grid adaptations.

Sweby, Peter K.↗