Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear implicitness”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Explicit Monotone Stable Super-Time-stepping Methods for Finite Time Singularities

We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) super-time-stepping methods were originally developed for nonlinear complex physics problems with diffusion. These are multistage single step second-order, forward-in-time methods with no implicit solves. The advantage is that the time-step size for stability scales with stage number 𝑠 as $\mathcal{O}$⁡(𝑠 2 ). Many interesting nonlinear PDEs have finite-time singularities, and the presence of diffusion often limits one to using implicit or semi-implicit time-step methods for stability constraints. Finite-time singularities are particularly challenging due to the large range of scales that one desires to resolve, often with adaptive spatial grids and adaptive time steps. Here, in this study, we show two examples of nonlinear PDEs for which the self-similar singularity structure has time and space scales that are resolvable using the RKL and RKG methods, without forcing even smaller time steps. Compared to commonly used implicit numerical methods, we achieve a significantly smaller run time while maintaining comparable accuracy. We also prove numerical monotonicity for both the RKL and RKG methods under their linear stability conditions for the constant coefficient heat equation, in the case of infinite domain and periodic boundary condition, leading to a theoretical guarantee of the superiority of the RKL and RKG methods over traditional super-time-stepping methods, such as the Runge-Kutta-Chebyshev and the orthogonal Runge-Kutta-Chebyshev methods. Code can be found at https://github.com/ZT220501/SRK-Singularity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The role of surface forces in environment-enhanced cracking of brittle solids

Fracture initiation and propagation in brittle materials is promoted in surface-reactive (sorptive) environments, a phenomenon known as subcritical crack growth (SCG). Laboratory measured crack-propagation velocity vs. stress intensity factor relationships typically exhibit highly nonlinear, multi-stage characteristics that are sensitive to environmental factors such as adsorbate concentration and temperature. For practical purposes, empirical relationships (e.g., a power law) have been used to describe this complex phenomenon. However, how the overall SCG behavior emerges from the underlying fundamental processes near the crack tip, such as the interaction of the crack surfaces separated by only a few nanometers and mass transport within the nano-confined space, is still not well understood. This paper develops a mechanistic, surface-force-based fracture theory (SFFT) which integrates surface force models, fluid transport models, and linear elastic fracture mechanics to quantitatively explain the multi-stage characteristics of SCG in brittle solids. A numerical model is developed based on SFFT and solved through an implicit partitioned scheme for efficiency and modularity. The results are validated by Wiederhorn's data on crack propagation in soda-lime glasses at a wide range of relative humidity levels. We show that, for the first time, the entire range of an SCG curve can be captured by a single physics-based model. The predicted SCG curves reveal that the development of repulsive disjoining pressure behind the crack tip can be responsible for the reduced apparent fracture toughness in a sorptive environment. In conclusion, the shape of the SCG curve, and its changes with respect to the environment, is found to critically depend on the assumed transport models.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Capturing dynamical correlations using implicit neural representations

Abstract Understanding the nature and origin of collective excitations in materials is of fundamental importance for unraveling the underlying physics of a many-body system. Excitation spectra are usually obtained by measuring the dynamical structure factor, S ( Q , ω ), using inelastic neutron or x-ray scattering techniques and are analyzed by comparing the experimental results against calculated predictions. We introduce a data-driven analysis tool which leverages ‘neural implicit representations’ that are specifically tailored for handling spectrographic measurements and are able to efficiently obtain unknown parameters from experimental data via automatic differentiation. In this work, we employ linear spin wave theory simulations to train a machine learning platform, enabling precise exchange parameter extraction from inelastic neutron scattering data on the square-lattice spin-1 antiferromagnet La 2 NiO 4 , showcasing a viable pathway towards automatic refinement of advanced models for ordered magnetic systems.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Approximate 𝑡-Designs in Generic Circuit Architectures

Unitary 𝑡-designs are distributions on the unitary group whose first 𝑡 moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate 𝑡-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of one-dimensional brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is bounded, the circuit forms an approximate 𝑡-design in at most linear depth. We give numerical evidence for a stronger bound that depends only on the number of connected blocks into which the architecture can be divided. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures.

information scrambling↗
DOE OSTI2024

STSR-INR: Spatiotemporal super-resolution for multivariate time-varying volumetric data via implicit neural representation

Implicit neural representation (INR) has surfaced as a promising direction for solving different scientific visualization tasks due to its continuous representation and flexible input and output settings. We present STSR-INR, an INR solution for generating simultaneous spatiotemporal super-resolution for multivariate time-varying volumetric data. Inheriting the benefits of the INR-based approach, STSR-INR supports unsupervised learning and permits data upscaling with arbitrary spatial and temporal scale factors. Unlike existing GAN- or INR-based super-resolution methods, STSR-INR focuses on tackling variables or ensembles and enabling joint training across datasets of various spatiotemporal resolutions. Here we achieve this capability via a variable embedding scheme that learns latent vectors for different variables. In conjunction with a modulated structure in the network design, we employ a variational auto-decoder to optimize the learnable latent vectors to enable latent-space interpolation. To combat the slow training of INR, we leverage a multi-head strategy to improve training and inference speed with significant speedup. We demonstrate the effectiveness of STSR-INR with multiple scalar field datasets and compare it with conventional tricubic+linear interpolation and state-of-the-art deep-learning-based solutions (STNet and CoordNet).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Pore Resolved Simulations of Joule Heating in Fibrous Media using an Embedded Boundary Method

Joule heating has been regarded as an energy-efficient and sustainable method for heating materials and gases at large scales. The modeling of local temperature effects at pore-resolved scales for such systems, however, has been difficult to achieve due to challenges in coupling thermo-chemical processes in complex porous media and in large representative volume elements (RVEs). To this end, we developed an electro-thermal model at the pore scale to study Joule heating effects in large heterogeneous systems with different microstructures. This was achieved using the level set method to implicitly delineate distinct regions within the domain, and an embedded boundary method to facilitate heat exchange across the fluid-solid interface. Moreover, we applied this method to investigate unsteady non-linear electro-thermal effects in non-woven fibrous graphite conductors for RVEs with characteristic lengths of 2 mm, with different fiber orientations, porosity (80% – 90%) and fiber diameters (10 – 20µm). The coupled equations were solved numerically and they produced peak temperatures greater than 2000 K resulting in heating rates as high as 80,000 K/s. Moreover, the results depended strongly on the microstructure of the fiber skeleton and current density. Geometries with large fibers (∼ 20µm) had the highest average and peak temperatures with the mean temperature increasing by 3.9 % while the peak temperature increased by 9.9 %. Anisotropic domains on the other hand had the lowest mean and peak temperatures with peak and mean temperatures of 2293 K and 1437.7K respectively representing a corresponding 12.1% and 5.1% drop in the temperatures. An increase in porosity from 80% to 90%, however, led to an increase in the peak temperature by 5.1%.

Joule heating↗
DOE OSTI2020

thornado-transport: Anderson- and GPU-accelerated nonlinear solvers for neutrino-matter coupling

Algorithms for neutrino-matter coupling in core-collapse supernovae (CCSNe) are investigated in the context of a spectral two-moment model, which is discretized in space with the discontinuous Galerkin method, integrated in time with implicit-explicit (IMEX) methods, and implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado). The model considers electron neutrinos and antineutrinos and tabulated opacities from Bruenn (1985), which includes neutrino-electron scattering and pair processes. The nonlinear system arising from implicit time discretization of the equations governing neutrino-matter coupling is iterated to convergence using Anderson-accelerated fixed-point methods, which avoid formation of Jacobians and inversion of dense linear systems. Numerical experiments show that, for a given tolerance, a nested iteration scheme which aims to reduce opacity evaluations can lower the computational cost. Our initial port to GPUs, using both OpenMP and OpenACC, shows an overall speedup of up to ~ 100× when compared to results using a single CPU core. These results indicate that the algorithms implemented in thornado are well-suited to GPU acceleration.

Laiu, Paul↗
DOE OSTI2024

Structure preserving and energy dissipative contact approaches for implicit dynamics

In this work, several structure preserving and energy dissipative contact approaches are proposed and evaluated. The time integration schemes considered are general with regard to the version of constraint type, but here the emphasis was on mortar contact. The proposed mortar contact approach conserves both linear and angular momentum for mortar contact in a novel way. The proposed time integration scheme can conserve energy or provide strict contact dissipation. In addition, the proposed scheme enforces both gap constraints and gap velocity constraints (i.e., persistency). Using a midstep time integrator often causes energy dissipation during initial impact, here this energy can be recovered in a novel way. Enforcing the gap velocity constraint mitigates the contact chatter of the contact pressure and nodes in many problems. Whereas some approaches enforce the persistency condition and gap constraints simultaneously during the solution of the equations of motion (EOM) requiring multipliers for both constraints included in the equation set, here the gap constraint is solved through the equations of motion and the persistency condition is satisfied in the time integration scheme by the velocity update after the equations of motion. It is shown that this approach is strictly dissipative in that a plastic contact condition can be achieved. Analogous to a coefficient of restitution for rigid bodies, any dissipated energy can then be returned upon release if energy conservation is desired. Structure preserving methods are good for long-time dynamics simulations and energy conserving and strictly dissipative methods can overcome stability issues associated with standard time integration algorithms such as the Newmark method.

42 ENGINEERING↗
DOE OSTI2024

Static actuator-sharing algorithm for concurrent control of multiple plasma properties

Simultaneous regulation of multiple properties in next-generation tokamaks like ITER and fusion pilot plant may require the integration of different plasma control algorithms. Such integration requires the conversion of individual controller commands into physical actuator requests while accounting for the coupling between different plasma properties. This work proposes a tokamak and scenario-agnostic actuator-sharing algorithm (ASA) to perform the above-mentioned command-request conversion and, hence, integrate multiple plasma controllers. The proposed algorithm implicitly solves a quadratic programming (QP) problem formulated to account for the saturation limits and the relation between the controller commands and physical actuator requests. Since the constraints arising in the QP program are linear, the proposed ASA is highly computationally efficient and can be implemented in the tokamak plasma control system in real time. Furthermore, the proposed algorithm is designed to handle real-time changes in the control objectives and actuators’ availability. Nonlinear simulations carried out using the Control Oriented Transport SIMulator illustrate the effectiveness of the proposed algorithm in achieving multiple control objectives simultaneously.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Semi-Implicit Computation of Fast Modes in a Scheme Integrating Slow Modes by a Leapfrog Method Based on a Selective Implicit Time Filter

Abstract A scheme for integration of atmospheric equations containing terms with differing time scales is developed. The method employs a filtered leapfrog scheme utilizing a fourth-order implicit time filter with one function evaluation per time step to compute slow-propagating phenomena such as advection and rotation. The terms involving fast-propagating modes are handled implicitly with an unconditionally stable method that permits application of larger time steps and faster computations compared to fully explicit treatment. Implementation using explicit and recurrent formulation is provided. Stability analysis demonstrates that the method is conditionally stable for any combination of frequencies involved in the slow and fast terms as they approach the origin. The implicit filter used in the method damps the computational modes without noticeably sacrificing the accuracy of the physical mode. TheO[(Δt 4 )] accuracy for amplitude errors achieved by the implicitly filtered leapfrog is preserved in applications where terms responsible for fast propagation are integrated with a semi-implicit method. Detailed formulation of the method for soundproof nonhydrostatic anelastic equations is provided. Procedures for implementation in global spectral shallow-water models are also given. Examples comparing numerical and analytical solutions for linear gravity waves demonstrate the accuracy of the scheme. The performance is also shown in more practical nonlinear applications, where numerical solutions accomplished by the method are evaluated against those computed from a scheme where the slow terms are handled by the third-order Runge–Kutta scheme. It demonstrates that the method is able to accurately resolve fine-scale dynamics of Kelvin–Helmholtz shear instabilities, the evolution of density current, and nonlinear drifts of twin tropical cyclones.

Meteorology & Atmospheric Sciences↗
DOE OSTI2022

Error quantification of the Arrhenius blending rule for viscosity of hydrocarbon mixtures

Six hundred and seventy-five measurements of dynamic viscosity and density have been used to assess the prediction error of the Arrhenius blending rule for kinematic viscosity of hydrocarbon mixtures. Major trends within the data show that mixture complexity–binary to hundreds of components—and temperature are more important determinants of prediction error than differences in molecular size or hydrogen saturation between the components of the mixtures. Over the range evaluated, no correlation between prediction error and mole fractions was observed, suggesting the log of viscosity truly is linear in mole fraction, as indicated by the Arrhenius blending rule. Mixture complexity and temperature also impact molar volume and its prediction. However, a linear regression between the two model errors explains less than 20% of the observed variation, indicating that mixture viscosity and/or molar volume are not linear with respect to temperature and/or mixture complexity. Extensive discussion of the intermolecular forces and the geometric arrangement of molecules and vacancies in liquids, which ultimately determines its viscosity, is brought into context with the implicit approximations behind the Arrhenius blending rule. The complexity of this physics is not compatible with a simple algebraic correction to the model. However, sufficient data is now available to determine confidence intervals around the prediction of fuel viscosity based on its component mole fractions and viscosities. At -40°C, when all identified components are pure molecules the modeling error is 13.2% of the predicted (nominal) viscosity times the root mean square of the component mole fractions.

10 SYNTHETIC FUELS↗
DOE OSTI2024

Uniform accuracy of implicit-explicit Runge-Kutta (IMEX-RK) schemes for hyperbolic systems with relaxation

Implicit-explicit Runge-Kutta (IMEX-RK) schemes are popular methods to treat multiscale equations that contain a stiff part and a non-stiff part, where the stiff part is characterized by a small parameter. Here, in this work, we prove rigorously the uniform stability and uniform accuracy of a class of IMEX-RK schemes for a linear hyperbolic system with stiff relaxation. The result we obtain is optimal in the sense that it holds regardless of the value of and the order of accuracy is the same as the design order of the original scheme, i.e., there is no order reduction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A fully implicit, scalable, conservative nonlinear relativistic Fokker–Planck 0D-2P solver for runaway electrons

Upon application of a sufficiently strong electric field, electrons break away from thermal equilibrium and approach relativistic speeds. These highly energetic ‘runaway’ electrons (~ MeV) play a significant role in tokamak disruption physics, and therefore their accurate understanding is essential to develop reliable mitigation strategies. As such, we have developed a fully implicit solver for the 0D-2P (i.e., including two momenta coordinates) relativistic nonlinear Fokker–Planck equation (rFP). As in earlier implicit rFP studies (NORSE, CQL3D), electron–ion interactions are modeled using the Lorentz operator, and synchrotron damping using the Abraham–Lorentz–Dirac reaction term. However, our implementation improves on these earlier studies by (1) ensuring exact conservation properties for electron collisions, (2) strictly preserving positivity, and (3) being scalable algorithmically and in parallel. Key to our proposed approach is an efficient multigrid preconditioner for the linearized rFP equation, a multigrid elliptic solver for the Braams–Karney potentials, and a novel adaptive technique to determine the associated boundary values. We verify the accuracy and efficiency of the proposed scheme with numerical results ranging from small electric-field electrical conductivity measurements to the accurate reproduction of runaway tail dynamics when strong electric fields are applied.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A fully implicit, asymptotic-preserving, semi-Lagrangian algorithm for the time dependent anisotropic heat transport equation

In this paper, we extend the operator-split asymptotic-preserving, semi-Lagrangian algorithm for time dependent anisotropic heat transport equation proposed in Chacón et al. (2014) [18] to use a fully implicit time integration with backward differentiation formulas. The proposed implicit method can deal with arbitrary heat-transport anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ $\ggg$ 1 (with $\mathcal{X}$∥, $ \mathcal{X}$⟂ the parallel and perpendicular heat diffusivities, respectively) in complicated magnetic field topologies in an accurate and efficient manner. Further, the implicit algorithm is second-order accurate temporally and demonstrates an accurate treatment at boundary layers (e.g., island separatrices), which was not ensured by the operator-split implementation. The condition number of the resulting algebraic system is independent of the anisotropy ratio, and is inverted with preconditioned GMRES. We propose a simple preconditioner that renders the finite-dimensional linear operator compact, resulting in mesh-independent convergence rates for topologically simple magnetic fields, and convergence rates scaling as ~ (NΔt) 1/4 (with N the total mesh size and Δt the timestep) in topologically complex magnetic-field configurations. We demonstrate the accuracy and performance of the approach with test problems of varying complexity, including an analytically tractable boundary-layer problem in a straight magnetic field, and a topologically complex magnetic field featuring magnetic islands with extreme anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ = 10 10 ) .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

pnnl/neural_ODE_ICLR2020

We show how to model discrete ordinary differential equations (ODE) with algebraic nonlinearities as deep neural networks with varying degrees of prior knowledge. We derive the stability guarantees of the network layers based on the implicit constraints imposed on the weight's eigenvalues. Moreover, we show how to use barrier methods to generically handle additional inequality constraints. We demonstrate the prediction accuracy of learned neural ODEs evaluated on open-loop simulations compared to ground truth dynamics with bi-linear terms.

Tuor, Aaron↗
DOE OSTI2023

An implicit barotropic mode solver for MPAS-ocean using a modern Fortran solver interface

Here, we demonstrate use of a modern Fortran solver interface to manage solver algorithms for an implicit barotropic mode solver in the Model for Predictions Across Scales-Ocean (MPAS-O). ForTrilinos, a Fortran interface to Trilinos that contains a large collection of solver capabilities written in C++, has been implemented in MPAS-O to provide access to a suite of linear solver options. By virtue of the simplified wrapper and interface generator (SWIG) automation tool that generates modern Fortran interfaces to C++ code, we were able to implement the Fortran solver interface in MPAS-O using a familiar Fortran coding style while minimizing performance degradation. The ForTrilinos solver interface is written within MPAS-O’s time stepping modules as a subroutine in conjunction with MPAS-O code. Applied to an idealized ocean and a high-resolution realistic ocean test case, parallel performance of ForTrilinos solvers is examined. It is found that parallel scalability of the ForTrilinos solvers is highly dependent on the number of global synchronization points per solver iteration in each iterative solver algorithm. ForTrilinos solvers perform best compared to the Fortran hand-crafted (FHC) solver when the amount of work per processor is large enough. However, parallel scalability is better with the FHC solver and so when the work per core is modest FHC outperforms ForTrilinos. The intercomparison between the ForTrilinos and FHC solvers reveals that this performance hit in the ForTrilinos solver mostly comes from the global synchronization process, while suggesting that the matrix-vector multiplication process in the FHC solver needs to be optimized for better performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗