Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convergent”

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 505 records · Page 28

On the Representativity of Electrode Microstructure Parameters and Their Electrochemical Response for Lithium Ion Batteries

Lithium-ion battery electrochemical models require an accurate description of the electrodes microstructures to be predictive that can be achieved through nanoscale imaging. Such observations are however limited by their field of view (FOV), as they provide only a subset of the whole electrode volume that does not necessarily represent the whole electrode microstructure heterogeneity, and therefore can bias the microstructure analysis. A microstructure scale electrochemical model was used to investigate lithium plating onset, material non-uniform utilization, and in-plane heterogeneities for an NMC-graphite full cell. To evaluate the representativeness, and thus relevance, of these model predictions, a coupled representativity analysis has been performed on the microstructure parameters and, in a novel way, on the full cell electrochemical response. Electrode microstructure parameters representativeness has been first quantified using the representative volume element (RVE) methodology. The RVE major flaw is that ultimately it can only conclude if a FOV contains representative subvolumes of the FOV, but not if the FOV itself is representative of the electrode volume. Analysis can conclude negatively ('FOV is not representative'), but not positively ('FOV is representative'). One major contribution of this work was to quantify the convergence of the RVE size with the FOV, to actually investigate the FOV representativeness and thus partly remedy this intrinsic limitation. The analysis determined that performing a standard RVE calculation, without exploring its FOV convergence, is likely to strongly underestimate the actual RVE size. The new RVE methodology has been automated in the NREL open-source Microstructure Analysis Toolbox (MATBOX) and is available to the battery community. Representativeness of microstructure parameters is however only an intermediate step, as the end-results of an electrochemical model are performances predictions. Indeed, what is the practical consequence of a given deviation for a microstructure parameter? The microstructure parameter deviation propagations to the 3D microstructure scale electrochemical response have been then quantified for different charge rates. This defines a threshold for the microstructure parameters FOV for a desired maximum deviation of the electrochemical response. Such deviation propagation analysis is analogous to error propagation analysis and is necessary to determine the relevance of microstructure scale model predictions for macroscale predictions. Electrochemical model shows cell representative section areas are increasing with C-rate, due to higher in-plane heterogeneities, indicating larger FOVs are required specifically for fast charge modeling. Therefore, we introduced the novel concept of electrochemical RVE (eRVE) that is a function of the operating conditions (thus defined as a dynamic RVE), with an increasing dependence with the C-rate. Representativity analysis of the investigated cell determined a FOV of 144.4 x 54.4 m2 is large enough to establish a convergence on the representative section areas for low to intermediate C-rate (=2.5C), but not large enough to conclude for higher rates. This work aims to emphasize the importance of representativity analysis for LIB electrode microstructures, as it is required to estimate the error, and thus the relevance, of microstructure parameters intended to be used in macroscale models. The methodology and results can help researchers to select the relevant imaging and associated FOV required to provide accurate enough microstructure parameters.

ADVANCED PROPULSION SYSTEMS↗

FedOSAA: Improving Federated Learning with One-Step Anderson Acceleration

Federated learning (FL) is a distributed machine learning approach that enables multiple local clients and a central server to collaboratively train a model while keeping the data on their own devices. First-order methods, particularly those incorporating variance reduction techniques, are the most widely used FL algorithms due to their simple implementation and stable performance. However, these methods tend to be slow and require a large number of communication rounds to reach the global minimizer. We propose FedOSAA, a novel approach that preserves the simplicity of first-order methods while achieving the rapid convergence typically associated with second-order methods. Our approach applies one Anderson acceleration (AA) step following classical local updates based on first-order methods with variance reduction, such as FedSVRG and SCAFFOLD, during local training. This AA step is able to leverage curvature information from the history points and gives a new update that approximates the Newton-GMRES direction, thereby significantly improving the convergence. We establish a local linear convergence rate to the global minimizer of FedOSAA for smooth and strongly convex loss functions. Numerical comparisons show that FedOSAA substantially improves the communication and computation efficiency of the original first-order methods, achieving performance comparable to second-order methods like GIANT.

Feng, Xue [University of California, Davis]↗

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗

Non-local corrections to the typical medium theory of Anderson localization

We use the recently developed finite cluster typical medium approach to study the Anderson localization transition in three dimensions. Applying our method to the box and binary alloy disorder distributions, we find a fast convergence with the cluster size. We demonstrate the importance of the typical medium environment and the non-local spatial correlations for the proper characterization of the localization transition. As the cluster size increases, our typical medium cluster method recovers the correct critical disorder strength for the transition. Our findings highlight the importance of the non-local cluster corrections for capturing the localization behavior of the mobility edge trajectories. Our results demonstrate that the typical medium cluster approach developed here provides a consistent and systematic description of the Anderson localization transition in the framework of the effective medium embedding schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗

Asymptotically compatible reproducing kernel collocation and meshfree integration for the peridynamic Navier equation

Here, we study reproducing kernel (RK) collocation method for peridynamic Navier equation. In the first part, we apply a linear RK approximation to both displacement and dilatation, and then back-substitute dilatation and solve the peridynamic Navier equation in a pure displacement form. The RK collocation scheme converges to the nonlocal limit for a fixed nonlocal interaction length and also to the local limit as nonlocal interactions vanish. The stability is shown by comparing the collocation scheme with the standard Galerkin scheme using Fourier analysis. In the second part, we apply the RK collocation to the quasi-discrete peridynamic Navier equation and show its convergence to the correct local limit when the ratio between the nonlocal length scale and the discretization parameter is fixed. The analysis is carried out on a special family of rectilinear Cartesian grids for the RK collocation method with a designated kernel with finite support. We assume the Lamé parameters satisfy λ ≥ μ to avoid extra assumptions on the nonlocal kernel. Finally, numerical experiments are conducted to validate the theoretical results.

42 ENGINEERING↗

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.

97 MATHEMATICS AND COMPUTING↗

Exponential Runge-Kutta Parareal for non-diffusive equations

Parareal is a well-known parallel-in-time algorithm that combines a coarse and fine propagator within a parallel iteration. It allows for large-scale parallelism that leads to significantly reduced computational time compared to serial time-stepping methods. However, like many parallel-in-time methods it can fail to converge when applied to non-diffusive equations such as hyperbolic systems or dispersive nonlinear wave equations. Here, this paper explores the use of exponential integrators within the Parareal iteration. Exponential integrators are particularly interesting candidates for Parareal because of their ability to resolve fast-moving waves, even at the large stepsizes used by coarse propagators. This work begins with an introduction to exponential Parareal integrators followed by several motivating numerical experiments involving the nonlinear Schrödinger equation. These experiments are then analyzed using linear analysis that approximates the stability and convergence properties of the exponential Parareal iteration on nonlinear problems. The paper concludes with two additional numerical experiments involving the dispersive Kadomtsev-Petviashvili equation and the hyperbolic Vlasov-Poisson equation. These experiments demonstrate that exponential Parareal methods offer improved time-to-solution compared to serial exponential integrators when solving certain non-diffusive equations.

97 MATHEMATICS AND COMPUTING↗

Diel dynamics of multi-omics in elkhorn fern provide new insights into weak CAM photosynthesis

Crassulacean acid metabolism (CAM) has high water-use efficiency (WUE) and is widely recognized to have evolved from C 3 photosynthesis. Different plant lineages have convergently evolved CAM, but the molecular mechanism that underlies C 3 -to-CAM evolution remains to be clarified. Platycerium bifurcatum (elkhorn fern) provides an opportunity to study the molecular changes underlying the transition from C 3 to CAM photosynthesis because both modes of photosynthesis occur in this species, with sporotrophophyll leaves (SLs) and cover leaves (CLs) performing C 3 and weak CAM photosynthesis, respectively. Here, we report that the physiological and biochemical attributes of CAM in weak CAM-performing CLs differed from those in strong CAM species. We investigated the diel dynamics of the metabolome, proteome, and transcriptome in these dimorphic leaves within the same genetic background and under identical environmental conditions. We found that multi-omic diel dynamics in P. bifurcatum exhibit both tissue and diel effects. Our analysis revealed temporal rewiring of biochemistry relevant to the energy-producing pathway (TCA cycle), CAM pathway, and stomatal movement in CLs compared with SLs. We also confirmed that PHOSPHOENOLPYRUVATE CARBOXYLASE KINASE (PPCK) exhibits convergence in gene expression among highly divergent CAM lineages. Gene regulatory network analysis identified candidate transcription factors regulating the CAM pathway and stomatal movement. Taken together, our results provide new insights into weak CAM photosynthesis and new avenues for CAM bioengineering.

59 BASIC BIOLOGICAL SCIENCES↗

A Verification Suite of Test Cases for the Barotropic Solver of Ocean Models

Abstract The development of any atmosphere or ocean model warrants a suite of test cases (TCs) to verify its spatial and temporal discretizations, order of accuracy, stability, reproducibility, portability, scalability, etc. In this paper, we present a suite of shallow water TCs designed to verify the barotropic solver of atmosphere and ocean models. These include the non‐dispersive coastal Kelvin wave; the dispersive inertia‐gravity wave; the dispersive planetary and topographic Rossby waves; the barotropic tide; and a non‐linear manufactured solution. These TCs check the implementation of the linear pressure gradient term; the linear constant or variable‐coefficient Coriolis and bathymetry terms; and the non‐linear advection terms. Simulation results are presented for a variety of time‐stepping methods as well as two spatial discretizations: a mimetic finite volume method based on the TRiSK scheme, and a high‐order discontinuous Galerkin spectral element method. The experimental procedure for conducting these numerical experiments is detailed. It underscores several key considerations that vary depending on the chosen spatial discretization method. Finally, convergence studies of every TC are conducted with refinement in both space and time, only in space, and only in time. The convergence slopes match the expected theoretical predictions.

54 ENVIRONMENTAL SCIENCES↗

Integrating Intermediate Traits in Phylogenetic Genotype-to-Phenotype Studies

A major goal of research in evolution and genetics is linking genotype to phenotype. This work could be direct, such as determining the genetic basis of a phenotype by leveraging genetic variation or divergence in a developmental, physiological, or behavioral trait. The work could also involve studying the evolutionary phenomena (e.g., reproductive isolation, adaptation, sexual dimorphism, behavior) that reveal an indirect link between genotype and a trait of interest. When the phenotype diverges across evolutionarily distinct lineages, this genotype-to-phenotype problem can be addressed using phylogenetic genotype-to-phenotype (PhyloG2P) mapping, which uses genetic signatures and convergent phenotypes on a phylogeny to infer the genetic bases of traits. The PhyloG2P approach has proven powerful in revealing key genetic changes associated with diverse traits, including the mammalian transition to marine environments and transitions between major mechanisms of photosynthesis. However, there are several intermediate traits layered in between genotype and the phenotype of interest, including but not limited to transcriptional profiles, chromatin states, protein abundances, structures, modifications, metabolites, and physiological parameters. Each intermediate trait is interesting and informative in its own right, but synthesis across data types has great promise for providing a deep, integrated, and predictive understanding of how genotypes drive phenotypic differences and convergence. We argue that an expanded PhyloG2P framework (the PhyloG2P matrix) that explicitly considers intermediate traits, and imputes those that are prohibitive to obtain, will allow a better mechanistic understanding of any trait of interest. Furthermore, this approach provides a proxy for functional validation and mechanistic understanding in organisms where laboratory manipulation is impractical.

59 BASIC BIOLOGICAL SCIENCES↗

Phylogenetically diverse wild plant species use common biochemical strategies to thrive in the Atacama Desert

The best ideotypes are under mounting pressure due to increased aridity. Understanding the conserved molecular mechanisms that evolve in wild plants adapted to harsh environments is crucial in developing new strategies for agriculture. Yet our knowledge of such mechanisms in wild species is scant. We performed metabolic pathway reconstruction using transcriptome information from 32 Atacama and phylogenetically related species that do not live in Atacama (sister species). We analyzed reaction enrichment to understand the commonalities and differences of Atacama plants. To gain insights into the mechanisms that ensure survival, we compared expressed gene isoform numbers and gene expression patterns between the annotated biochemical reactions from 32 Atacama and sister species. We found biochemical convergences characterized by reactions enriched in at least 50% of the Atacama species, pointing to potential advantages against drought and nitrogen starvation, for instance. Furthermore, these findings suggest that the adaptation in the Atacama Desert may result in part from shared genetic legacies governing the expression of key metabolic pathways to face harsh conditions. Enriched reactions corresponded to ubiquitous compounds common to extreme and agronomic species and were congruent with our previous metabolomic analyses. Convergent adaptive traits offer promising candidates for improving abiotic stress resilience in crop species.

59 BASIC BIOLOGICAL SCIENCES↗

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗

Efficient and Robust Dynamic Simulation of Power Systems With Holomorphic Embedding

Dynamic simulation is vitally important in power system analysis, but traditional approaches based on numerical integration over small time steps are time-consuming. Also, the Newton-Raphson method suffers from difficulty in convergence when solving nonlinear algebraic equations. In this paper, we propose a novel dynamic simulation approach based on holomorphic embedding. By obtaining a high-order approximation of system dynamics, it achieves a much larger time step and thus enhances the computational efficiency significantly. In addition, the new approach avoids non-convergence issues in solving algebraic equations, which improves robustness. The approach includes flexible modeling of synchronous generators and controllers, and we propose a method for modeling generator coordinate transformations. The approach is tested on the IEEE 39-bus, 10-generator system and a Polish 2383-bus, 327-generator system. The results demonstrate promising computational efficiency and satisfactory numerical robustness for the analysis of large-scale power systems.

42 ENGINEERING↗

Contingency Analysis Based on Partitioned and Parallel Holomorphic Embedding

In the steady-state contingency analysis, the traditional Newton-Raphson method suffers from non-convergence issues when solving post-outage power flow problems, which hinders the integrity and accuracy of security assessment. In this paper, we propose a novel robust contingency analysis approach based on holomorphic embedding (HE). Here, the HE-based simulator provides theoretical convergence guarantee, which is desirable because it avoids the influence of numerical issues and provides a credible security assessment conclusion. In addition, based on the multi-area characteristics of real-world power systems, a partitioned HE (PHE) method is proposed with an interfacebased partitioning of HE formulation. The PHE method does not undermine the numerical robustness of HE and significantly reduces the computation burden in large-scale contingency analysis. The PHE method is further enhanced by parallel or distributed computation to become parallel PHE (P2HE). Tests on a 458-bus system, a synthetic 419-bus system and a large-scale 21447-bus system demonstrate the advantages of the proposed methods in robustness and efficiency.

42 ENGINEERING↗

Asymptotically Compatible Reproducing Kernel Collocation and Meshfree Integration for Nonlocal Diffusion

Reproducing kernel (RK) approximations are meshfree methods that construct shape functions from sets of scattered data. We present an asymptotically compatible (AC) RK collocation method for nonlocal diffusion models with Dirichlet boundary condition. The numerical scheme is shown to be convergent to both nonlocal diffusion and its corresponding local limit as nonlocal interaction vanishes. The analysis is carried out on a special family of rectilinear Cartesian grids for a linear RK method with designed kernel support. The key idea for the stability of the RK collocation scheme is to compare the collocation scheme with the standard Galerkin scheme, which is stable. In addition, assembling the stiffness matrix of the nonlocal problem requires costly computational resources because high-order Gaussian quadrature is necessary to evaluate the integral. We thus provide a remedy to the problem by introducing a quasi-discrete nonlocal diffusion operator for which no numerical quadrature is further needed after applying the RK collocation scheme. The quasi-discrete nonlocal diffusion operator combined with RK collocation is shown to be convergent to the correct local diffusion problem by taking the limits of nonlocal interaction and spatial resolution simultaneously. The theoretical results are then validated with numerical experiments. We additionally illustrate a connection between the proposed technique and an existing optimization based approach based on generalized moving least squares.

97 MATHEMATICS AND COMPUTING↗

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗

Multirate Exponential Rosenbrock Methods

In this paper we propose a novel class of methods for high-order accurate integration of multirate systems of ordinary differential equation initial-value problems. The proposed methods construct multirate schemes by approximating the action of matrix φ functions within explicit exponential Rosenbrock (ExpRB) methods, thereby called multirate ExpRB (MERB) methods. They consist of the solution to a sequence of modified “fast” initial-value problems, which may themselves be approximated through subcycling any desired initial-value problem solver. In addition to proving how to construct MERB methods from certain classes of ExpRB methods, we provide rigorous convergence analysis of these methods and derive efficient MERB schemes of orders 2 through 6 (the highest-order infinitesimal multirate methods to date). Lastly, we then present numerical simulations to confirm these theoretical convergence rates and to compare the efficiency of MERB methods against other recently introduced high-order multirate methods.

97 MATHEMATICS AND COMPUTING↗