Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence”

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 1,639 records · Page 91

Numerical Behaviour of a Smooth Local Correlation-based Transition Model in a Newton-Krylov Flow Solver

The numerical behaviour of transport-equation-based transition models, including both iterative and grid convergence, is influenced by the source terms. Transition models contain source terms that are large and highly nonlinear, and can be destabilizing in a strong implicit solver. Linearization strategies with varying levels of coupling are evaluated in conjunction with a source-term time step restriction to determine best-practices for solving the SA-sLM2015smooth local correlation-based transition model in an implicit Newton-Krylov flow solver. Achieving deep iterative convergence facilitates a detailed investigation of the grid convergence of these free-transition simulations, which are evaluated relative to fully-turbulent simulations performed using the Spalart-Allmaras turbulence model. Simulations of the NLF0416 general aviation airfoil, VA-2 supercritical airfoil, and NASA CRM-NLF wing-body geometry are performed over a range of grid levels. The results demonstrate that both a fully-coupled linearization strategy and a source-term time step restriction improve nonlinear convergence as the complexity of the free-transition simulations increases. In general, additional grid resolution is required for free-transition simulations relative to fully-turbulent simulations in order to achieve a similar level of accuracy, with the grid convergence of free-transition simulations sensitive to the streamwise grid spacings in the transition regions.

AATT↗

Grid Refinement Techniques for the 𝜸-Re𝜽𝒕 Transition Model in FUN3D

There has been an increased focus on the overall accuracy and grid convergence of Reynolds-averaged Navier-Stokes (RANS)-based transition models from the recent AIAA and NATO-AVT workshops. Even though satisfactory grid convergence could be achieved for simple two-dimensional flow configurations, it required mesh counts that are substantially larger than those used in typical applications. In this paper, we focus our efforts on understanding how the grid resolution and topology influences the accuracy and convergence of results by studying the Schubauer and Skramstad flat-plate configuration and the NLF-0416 airfoil at an angle of attack equal to five degrees using FUN3D, a second-order finite-volume code. By focusing on these cases, we can analyze both natural and separation-induced transition scenarios. Multiple grid refinement strategies are investigated. First, we determine the relative effectiveness of zonal streamwise refinement in the transition region within structured grids as an alternative to the costly option of globally uniform refinement of a baseline grid. We also complement this zonal technique by globally varying the wall-normal resolution keeping the streamwise resolution fixed. The zonal streamwise refinement can accurately model natural transition in a flat-plate boundary layer and separation-induced transition, but struggles to accurately model natural transition in airfoil flows. A series of unstructured prismatic grids that have similar node counts and viscous wall spacings as the structured hexahedral grids are also tested, and they do not achieve grid convergence until an extremely fine resolution. Last, we employ adjoint-based unstructured grid adaptation in FUN3D to natural and separation-induced transition on the NLF-0416 airfoil. The adjoint-based refinement process converges to the same solution as the baseline family of structured grids, but leads to smaller errors on coarser grids.

Grid Adaptation↗

Study of a Plug Nozzle for Supersonic Aircraft Concepts

Nozzles with external plugs are candidates for the exhaust system of supersonic aircraft concepts in an ongoing research effort at NASA. As part of that effort a fundamental study is being conducted at NASA Glenn Research Center (GRC). Experimental and limited numerical simulation results from this study, for a plug nozzle with a convergent nozzle (cowl),have been reported in recent publications[1,2]. Conventional method-of-characteristics (MoC) design for the plug requires that the flow is choked at the nozzle exit. This is why a sharp convergence of the cowl is invoked in such a design in most previous studies [3-5], leading to the earlier choice of the convergent cowl. Such a nozzle, however, is not suitable for supersonic flights because of large boat tail drag suffered by its outer surface. The boat tail drag consideration dictates that the cowl be more or less cylindrical in shape. While various other shapes have been studied in the past [6], essentially a cylindrical shape is adopted in the larger research program at NASA. The cylindrical shape has certain advantages. With the plug crown located somewhat inside the nozzle, the flow experiences convergence and divergence as with a C-D nozzle. By translating the plug, different throat-to-exit area ratio could be achieved to obtain fully expanded condition at different values of NPR. This offers a relatively easy active control strategy for the nozzle geometry throughout the flight regime from landing and takeoff (LTO) to cruise conditions. A plug nozzle model mimicking the geometry being considered in the NASA program, i.e., having a cylindrical exit, have been fabricated recently for continued fundamental studies. Some of the plugs used with the earlier convergent cowl [1] are readily adopted to this model. In addition, a few other plugs have been obtained following a numerical optimization study [7]. The various configurations are to be investigated for thrust, noise and flow fields, with complementing numerical simulations. Thrust data for a variety of configurations as well as limited noise data are in hand. Further explorations including schlieren visualization are to be conducted in the near future. The proposed paper is to summarize all these results. In the following, a few key results obtained so far are described.

jets↗

Grid Refinement Techniques for the 𝜸-Re 𝜽 𝒕 Transition Model in FUN3D

There has been an increased focus on the overall accuracy and grid convergence of Reynolds-averaged Navier-Stokes (RANS)-based transition models from the recent AIAA and NATO-AVT workshops. Even though satisfactory grid convergence could be achieved for simple two-dimensional flow configurations, it required mesh counts that are substantially larger than those used in typical applications. In this paper, we focus our efforts on understanding how the grid resolution and topology influences the accuracy and convergence of results by studying the Schubauer and Skramstad flat-plate configuration and the NLF-0416 airfoil at an angle of attack equal to five degrees using FUN3D, a second-order finite-volume code. By focusing on these cases, we can analyze both natural and separation-induced transition scenarios. Multiple grid refinement strategies are investigated. First, we determine the relative effectiveness of zonal streamwise refinement in the transition region within structured grids as an alternative to the costly option of globally uniform refinement of a baseline grid. We also complement this zonal technique by globally varying the wall-normal resolution keeping the streamwise resolution fixed. The zonal streamwise refinement can accurately model natural transition in a flat-plate boundary layer and separation-induced transition, but struggles to accurately model natural transition in airfoil flows. A series of unstructured prismatic grids that have similar node counts and viscous wall spacings as the structured hexahedral grids are also tested, and they do not achieve grid convergence until an extremely fine resolution. Last, we employ adjoint-based unstructured grid adaptation in FUN3D to natural and separation-induced transition on the NLF-0416 airfoil. The adjoint-based refinement process converges to the same solution as the baseline family of structured grids, but leads to smaller errors on coarser grids.

Grid Adaptation↗

USM3D-ME Contributions to the 5th AIAA High Lift Prediction Workshop

This paper presents the results of Reynolds-averaged Navier-Stokes (RANS) simulations conducted by NASA’s flow solver, mixed-element USM3D (USM3D-ME), for the 5th AIAA High-Lift Prediction Workshop. As part of the Fixed-Grid RANS Technology Focus Group (TFG), these simulations were performed to assess the accuracy and efficiency of the USM3D-ME solutions in predicting high-lift flows. The High-Lift Common Research Model (CRM-HL) served as the primary geometry. Several CRM-HL configurations were used for three case studies: a verification study (Case 1), a configuration buildup study (Case 2), and a Reynolds-number variation study (Case 3). Overall, USM3D-ME RANS results aligned with the solutions selected by the Fixed-Grid RANS TFG and available wind tunnel data Simulations for Cases 1 and Configuration 2.1 achieved machine-zero residual convergence, with aerodynamic coefficients converging to steady-state values. However, Configurations 2.2-2.4 and Case 3 encountered iterative- and grid-convergence challenges, particularly at high angles of attack. Compared with the experimental data available for Configurations 2.2-2.4, close agreement was demonstrated at low angles of attack. However, for angles of attack approaching the maximum lift conditions, the predicted lift coefficient and pitching moment deviated from experimental values. The drag-coefficient predictions were in a relatively good agreement, however, slight overpredictions were observed at the highest angle of attack corresponding to the maximum-lift condition. Although iterative convergence for Configurations 2.2-2.4 at high angles of attack remains a persistent challenge, averaging aerodynamic coefficients over the last 5000 iterations yielded satisfactory agreement with the available wind tunnel experimental data. During the workshop, the lack of iterative convergence was attributed to the vortex structures emanating from the slat brackets. To investigate this issue further, post-workshop simulations were conducted on Configuration 2.2. In one study, RANS simulations were performed on a simplified geometry with the slat brackets removed. The second study focused on performing URANS simulations on the original Configuration 2.2 geometry. Preliminary results from both studies are presented and compared with wind tunnel data for Configuration 2.2. Consistent with the findings of other participants in the Fixed-Grid RANS TFG, this study emphasizes the necessity for further exploration and advancement in RANS technology for predicting high-lift flows.

CFD↗

USM3D-ME Contributions to the 5th AIAA High Lift Prediction Workshop

This paper presents the results of Reynolds-averaged Navier-Stokes (RANS) simulations conducted by the NASA flow solver, mixed-element USM3D (USM3D-ME), for the 5th AIAA High-Lift Prediction Workshop. As part of the Fixed-Grid RANS Technology Focus Group (TFG), these simulations were performed to assess the accuracy and efficiency of the USM3D-ME solutions in predicting high-lift flows. The High-Lift Common Research Model (CRM-HL) served as the primary geometry. Several CRM-HL configurations were used for three case studies: a verification study (Case 1), a configuration buildup study (Case 2), and a Reynolds-number variation study (Case 3). Overall, USM3D-ME RANS results aligned with the solutions selected by the Fixed-Grid RANS TFG and available wind tunnel data. Simulations for Case 1 and Configuration 2.1 achieved machine-zero residual convergence, with aerodynamic coefficients converging to steady-state values. However, Configurations 2.2-2.4 and Case 3 encountered iterative- and grid-convergence challenges, particularly at high angles of attack. Compared with the experimental data available for Configurations 2.2-2.4, close agreement was demonstrated at low angles of attack. However, for angles of attack approaching the maximum lift conditions, the predicted lift coefficient and pitching moment deviated from experimental values. The drag-coefficient predictions were in relatively good agreement, however, slight overpredictions were observed at the highest angle of attack corresponding to the maximum-lift condition. Although iterative convergence for Configurations 2.2-2.4 at high angles of attack remains a persistent challenge, averaging aerodynamic coefficients over the last 5000 iterations yielded satisfactory agreement with the available wind tunnel experimental data. During the workshop, the lack of iterative convergence was attributed to the vortex structures emanating from the slat brackets. To investigate this issue further, post-workshop simulations were conducted on Configuration 2.2. In one study, RANS simulations were performed on a simplified geometry with the slat brackets removed. The second study focused on performing unsteady RANS (URANS) simulations on the original Configuration 2.2 geometry. Preliminary results from both studies are presented and compared with wind tunnel data for Configuration 2.2. Consistent with the findings of other participants in the Fixed-Grid RANS TFG, this study emphasizes the necessity for further exploration and advancement in RANS technology for predicting high-lift flows.

Aerodynamics↗

FINITE ELEMENT MODEL MESH REFINEMENT EFFECTS ON QUALIFICATION OF NUCLEAR GRADE GRAPHITE COMPONENTS

The American Society of Mechanical Engineers (ASME) provides the full and simplified design-by-analysis probabilistic assessments for determining acceptance of nuclear grade graphite core components. The assessments can be characterized by three parts: (1) a component stress distribution, often determined by a finite element (FE) model; (2) a Weibull probability density function (pdf) that characterizes the experimental tensile strength distribution; and (3) the post-processor, which combines the FE model and the Weibull strength distribution in accordance with the full and simplified assessments to determine component acceptance. It is known that the level of mesh refinement in FE models can affect the modeled component’s calculated stress distribution. Depending on the component geometry, the stress distribution may converge with sufficient refinement. It was previously unknown whether the acceptance decision resulting from the full and simplified assessments might change even with sufficient mesh refinement. This study explores that question using experimental strength results for a dog-bone geometry for two graphite grades, IG-110 and PCEA. The simplified assessment has two criteria that must be met, the first limits the combined membrane stress by the allowable stress and the second limits the peak equivalent stress by the allowable stress scaled by the ratio of flexural to tensile strength. In the application of the simplified assessment, convergence of the peak equivalent stress required extreme mesh refinement, however, the acceptance decision was not affected. It is hypothesized that more complex geometries with stress concentrations may present mesh refinement effects on the simplified assessment acceptance decision. Mesh refinement did affect the acceptance decision in the full assessment for the applied pressure loadings in this study. This work suggests component stress distribution convergence is not a sufficient criteria for POF convergence in the full assessment and that mesh refinement should continue until the POF has converged, especially where the resulting POF is bordering the SRC acceptable POF limit.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting

MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)

97 MATHEMATICS AND COMPUTING↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Fully Second Order Implicit/Explicit Time Integration Technique for Hydrodynamics Plus Nonlinear Heat Conduction Problems

We present a second order non-linearly consistent implicit/explicit time integration tech¬nique for solving hydrodynamics coupled with nonlinear heat conduction problems. The idea is to hybridize an implicit and an explicit discretization in a nonlinearly consistent way in order to achieve second order time convergent calculations. In this scope, the hydrody¬namics equations are discretized explicitly making use of the capability of well-understood explicit schemes. On the other hand , the nonlinear heat conduction is solved implicitly. Such methods are often referred to as IMEX methods [2,1,3]. The Jacobian-Free Newton Krylov (JFNK) method (e.g, [10,9]) is applied to the problem in such a way as to render a nonlinearly iterated IMEX method. We solve three test problems in order to validate the nu-merical order of the scheme. For each test, we established second order time convergence. We support these numerical results with a Modi?ed Equation Analysis (MEA) [23,22]. The set of equations studied here constitute a base model for radiation hydrodynamics.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Series expansions of the density of states in SU(2) lattice gauge theory

We calculate numerically the density of states n(S) for SU(2) lattice gauge theory on L{sup 4} lattices [S is the Wilson's action and n(S) measures the relative number of ways S can be obtained]. Small volume dependences are resolved for small values of S. We compare ln(n(S)) with weak and strong coupling expansions. Intermediate order expansions show a good overlap for values of S corresponding to the crossover. We relate the convergence of these expansions to those of the average plaquette. We show that, when known logarithmic singularities are subtracted from ln(n(S)), expansions in Legendre polynomials appear to converge and could be suitable to determine the Fisher's zeros of the partition function.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Global Monte Carlo Simulation with High Order Polynomial Expansions

The functional expansion technique (FET) was recently developed for Monte Carlo simulation. The basic idea of the FET is to expand a Monte Carlo tally in terms of a high order expansion, the coefficients of which can be estimated via the usual random walk process in a conventional Monte Carlo code. If the expansion basis is chosen carefully, the lowest order coefficient is simply the conventional histogram tally, corresponding to a flat mode. This research project studied the applicability of using the FET to estimate the fission source, from which fission sites can be sampled for the next generation. The idea is that individual fission sites contribute to expansion modes that may span the geometry being considered, possibly increasing the communication across a loosely coupled system and thereby improving convergence over the conventional fission bank approach used in most production Monte Carlo codes. The project examined a number of basis functions, including global Legendre polynomials as well as “local” piecewise polynomials such as finite element hat functions and higher order versions. The global FET showed an improvement in convergence over the conventional fission bank approach. The local FET methods showed some advantages versus global polynomials in handling geometries with discontinuous material properties. The conventional finite element hat functions had the disadvantage that the expansion coefficients could not be estimated directly but had to be obtained by solving a linear system whose matrix elements were estimated. An alternative fission matrix-based response matrix algorithm was formulated. Studies were made of two alternative applications of the FET, one based on the kernel density estimator and one based on Arnoldi’s method of minimized iterations. Preliminary results for both methods indicate improvements in fission source convergence. These developments indicate that the FET has promise for speeding up Monte Carlo fission source convergence.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Decay Rates to Equilibrium for Nonlinear Plate Equations with Degenerate, Geometrically-Constrained Damping

We analyze the convergence to equilibrium of solutions to the nonlinear Berger plate evolution equation in the presence of localized interior damping (also referred to as geometrically constrained damping). Utilizing the results in (Geredeli et al. in J. Differ. Equ. 254:1193–1229, 2013), we have that any trajectory converges to the set of stationary points <##> } } }N $ /mathcal{N} $ N </##>. Employing standard assumptions from the theory of nonlinear unstable dynamics on the set <##> } } }N $ /mathcal{N} $ N </##>, we obtain the rate of convergence to an equilibrium. The critical issue in the proof of convergence to equilibria is a unique continuation property (which we prove for the Berger evolution) that provides a gradient structure for the dynamics. We also consider the more involved von Karman evolution, and show that the same results hold assuming a unique continuation property for solutions, which is presently a challenging open problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sensitivity of Optimal Solutions to Control Problems for Second Order Evolution Subdifferential Inclusions

In this paper the sensitivity of optimal solutions to control problems described by second order evolution subdifferential inclusions under perturbations of state relations and of cost functionals is investigated. First we establish a new existence result for a class of such inclusions. Then, based on the theory of sequential Γ-convergence we recall the abstract scheme concerning convergence of minimal values and minimizers. The abstract scheme works provided we can establish two properties: the Kuratowski convergence of solution sets for the state relations and some complementary Γ-convergence of the cost functionals. Then these two properties are implemented in the considered case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gibbs Measures Over Locally Tree-Like Graphs and Percolative Entropy Over Infinite Regular Trees

Consider a statistical physical model on the d-regular infinite tree T{sub d} described by a set of interactions Φ. Let {G_n} be a sequence of finite graphs with vertex sets V{sub n} that locally converge to T{sub d}. From Φ one can construct a sequence of corresponding models on the graphs G{sub n}. Let {μ_n} be the resulting Gibbs measures. Here we assume that {μ_n} converges to some limiting Gibbs measure μ on T{sub d} in the local weak{sup ∗} sense, and study the consequences of this convergence for the specific entropies |V{sub n}|{sup −1}H(μ{sub n}). We show that the limit supremum of |V{sub n}|{sup −1}H(μ{sub n}) is bounded above by the percolative entropyH{sub perc}(μ), a function of μ itself, and that |V{sub n}|{sup −1}H(μ{sub n}) actually converges to H{sub perc}(μ) in case Φ exhibits strong spatial mixing on T{sub d}. When it is known to exist, the limit of |V{sub n}|{sup −1}H(μ{sub n}) is most commonly shown to be given by the Bethe ansatz. Percolative entropy gives a different formula, and we do not know how to connect it to the Bethe ansatz directly. We discuss a few examples of well-known models for which the latter result holds in the high temperature regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fractional dynamics of an erbium-doped fiber laser model

In this paper we investigate the model of the time-fractional dynamics of an erbium-doped fiber laser model (TFDEFL) with Liouville–Caputo (LC), Caputo–Fabrizio–Caputo (CFC) and Atangana–Baleanu–Caputo (ABC) time-fractional derivatives. We employ the homotopy analysis transform method (HATM) to calculate approximate solutions for the TFDEFL model. This method gives the solution in the form of a rapidly convergent series that can ensure the convergence in solving the resultant series. We study the convergence analysis of HATM by computing the interval of convergence through the h-curves, the residual error function and the average residual error, respectively. We also show the effectiveness and accuracy of this method by comparing the approximate solutions based upon the LC, CFC and ABC time-fractional derivatives.

36 MATERIALS SCIENCE↗

On nonlinear inexact Uzawa algorithms for stabilized saddle point problems

In this paper, the nonlinear inexact Uzawa (NIU) methods for saddle point problems are studied. A further improved convergence result of the NIU algorithm for stabilized saddle point problems is presented, which results in much smaller convergence factor. This result can also be viewed as a generalization of some previous work for classical saddle point problems. Based on this result, we generalize some adaptive versions of the NIU algorithm with variable iteration parameters for classical saddle point problems to solve stabilized saddle point problems. Convergence analyses of these algorithms are presented. It shows that they converge under similar conditions as those in classical cases, which are more practical and without estimates on the extreme eigenvalues of the involved preconditioned systems. Numerical experiments are given to demonstrate the effectiveness of these algorithms over some original NIU algorithms.

97 MATHEMATICS AND COMPUTING↗

Phenomena-based graph representations and applications to chemical process simulation

Rapid and robust simulation of chemical processes is critical to conduct process design, optimization, techno-economic analysis, and sustainability analysis. Yet, efficiently solving simulation models remains a challenge due to the highly coupled and nonlinear nature of the underlying algebraic equations that capture the physical phenomena taking place in the process (e.g., material and energy conservation, phase equilibrium, reactions). In this work, we show that graph-theoretic representations of the physical phenomena within unit operations can help navigate and decompose equations to systematically identify alternative approaches for fast and robust numerical solutions. Specifically, we present a graph-theoretic abstraction that captures the connectivity between the model variables/equations and use this abstraction to group variables/equations into fundamental phenomena. We show that phenomena-based decomposition of the underlying equations can help decouple nonlinearities and enforce material/energy conservation at the process level to accelerate convergence. The proposed decomposition approach differs from the more traditional sequential modular simulation approach, in which equations are grouped and decomposed by unit operations. We implemented the phenomena-based decomposition in BioSTEAM—an open-source process simulation platform in Python—and demonstrated that this approach can converge a variety of separation process models. Compared to sequential modular simulation, the phenomena-based approach can converge idealized systems faster, but it can be slower for (or even fail to converge) highly coupled and nonideal process systems.

Convergence↗