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

Climate change drives convergent evolution of root traits on Sky Island climate relicts

Roots are essential to the strategies plants use to survive in variable environments, yet we know little of how they vary within species. Experimental conditions demonstrate that intraspecific plant root traits respond strongly to variation in the environment; however, it is unclear when these responses can be characterized as evolution in response to selective pressures of climate change over many generations. Sky Islands are model, natural climate relict ecosystems to examine climate-change driven evolution. Utilizing a common garden with replicate genotypes of Populus angustifolia (Narrowleaf cottonwood) from six Sky Island (SI) populations and nine adjacent Mountain Chain (MC) populations across three genetic provenances, we hypothesized that SI root traits have diverged due to historical isolation in warmer, drier climates. When grown in common conditions, populations originating on SI’s showed convergent evolution across three distinct genetic provenances, which was characterized by 44.16% decreased total root length, 42.64% decreased average root volume, 43.31% decreased root surface area, and significantly less root trait variation, relative to adjacent mountain chains. Convergent evolution of root traits from trees originating on SI’s is correlated with changes in mean annual precipitation and potential evapotranspiration in the field over the past ~ 125 years. These results demonstrate a consistent pattern in root trait evolution at the landscape scale and the role of climate on the evolution of root traits in a genetic and geographic context relevant to climate change.

Convergent evolution↗
DOE OSTI2025

Convergent evolution of NFP -facilitated root nodule symbiosis

The origin and phylogenetic distribution of symbiotic associations between nodulating angiosperms and nitrogen-fixing bacteria have long intrigued biologists. Recent comparative evolutionary analyses have yielded alternative hypotheses: a multistep pathway of independent gains and losses of root nodule symbiosis vs. a single gain followed by numerous losses. A detailed reconstruction of the history of genes involved in signaling between nitrogen-fixing bacteria and potential hosts, particularly lipo-chitooligosaccharide (LCO) signaling, is needed to distinguish between these hypotheses. LCO recognition by plants involves the Nod Factor Perception ( NFP ) gene family; in the legume model Medicago truncatula (Fabales), MtNFP is essential for establishing rhizobial symbiosis. Here, we document convergent evolution of NFP , indicating multiple origins of LCO-driven symbiosis. In contrast to previous models that explain the recruitment of NFP via a single duplication in the ancestor of the nitrogen-fixing clade, our phylogenomic and synteny results suggest this duplication does not span the entire clade. Tandem duplication in a common ancestor of Cucurbitales and Rosales resulted in the NFP1 and NFP2 groups. In contrast, the phylogenetically closest paralog of MtNFP is MtLYR1 , located on a different chromosome within a large syntenic block. All available data indicate that a large-scale duplication resulted in MtNFP and MtLYR1 , likely corresponding to a whole-genome duplication in an ancestor of subfamily Papilionoideae of Fabaceae. We show that MtNFP and the NFP2 -like group are not orthologous, indicating multiple independent gains of NFP -based LCO signaling. This molecular convergence provides a possible mechanism for multiple gains of root nodule symbiosis across the nitrogen-fixing clade.

LCO signaling↗
DOE OSTI2020

The arbitrary‐order virtual element method for linear elastodynamics models: convergence, stability and dispersion‐dissipation analysis

Abstract We design the conforming virtual element method for the numerical approximation of the two‐dimensional elastodynamics problem. We prove stability and convergence of the semidiscrete approximation and derive optimal error estimates under h ‐ and p ‐refinement in both the energy and the L 2 norms. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including nonconvex cells up to order four in the h ‐refinement setting. Exponential convergence is also experimentally observed under p ‐refinement. Finally, we present a dispersion‐dissipation analysis for both the semidiscrete and fully discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion‐dissipation properties.

Antonietti, Paola F.↗
DOE OSTI2021

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗
DOE OSTI2025

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗
DOE OSTI2023

On the convergence of statistics in simulations of stationary incompressible turbulent flows

When reporting statistics from simulations of statistically stationary chaotic phenomenon, it is important to verify that the simulations are time-converged. This condition is connected with the statistical error or number of digits with which statistics can be reliably reported. In this work we consider numerical experiments of low Reynolds number incompressible homogeneous and isotropic turbulence as a model problem to investigate statistical convergence over finite simulation times. Specifically, we investigate the time integration requirements that allow meaningful reporting of the statistical error associated with finiteness of the temporal domain. We address two key questions: (1) How long should a simulation be performed in terms of large eddy time, and (2) How should the simulation time be divided among temporal windows over which a quantity of interest is estimated so that its statistical error could be reliably reported? We find that reliable reporting of statistical errors requires simulations on the order of 10 4 large eddy times, which is orders of magnitude longer than typically performed. Additionally, data post-processing should employ windows of at least ten times the large eddy time scale, with the most robust computation of statistical error of the mean requiring window sizes of an additional factor of ten. For practical simulations, we demonstrate that it is possible to estimate the statistical error within a factor of two under a less stringent condition in which a minimum of four windows with size at least ten large eddy times are used. In conclusion, our observations for homogeneous isotropic turbulence are also shown to hold in turbulent channel flow.

42 ENGINEERING↗
DOE OSTI2024

Convergence of variational Monte Carlo simulation and scale-invariant pre-training

We provide theoretical convergence bounds for the variational Monte Carlo (VMC) method as applied to optimize neural network wave functions for the electronic structure problem. Here, we study both the energy minimization phase and the supervised pre-training phase that is commonly used prior to energy minimization. For the energy minimization phase, the standard algorithm is scale-invariant by design, and we provide a proof of convergence for this algorithm without modifications. The pre-training stage typically does not feature such scale-invariance. We propose using a scale-invariant loss for the pretraining phase and demonstrate empirically that it leads to faster pre-training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Convergence study of wakefield simulations with GdfidL and ECHO3D

The interaction of charged particle beams with vacuum chamber components gives rise to electromagnetic wakefields, whose frequency-domain representation is known as beam coupling impedance. Geometric impedance arising from discontinuities and transitions in the vacuum chamber is the focus of this study. Minimizing this impedance is essential to mitigate adverse collective effects in modern storage rings operating with high-intensity particle beams. Accurate and reliable impedance simulations is a key factor of the vacuum chamber design. This paper presents the results of a convergence study of two widely used electromagnetic solvers, GdfidL and ECHO3D, applied to key vacuum-chamber components of the National Synchrotron Light Source II (NSLS-II) storage ring. Detailed comparisons are performed for several geometries, including flange absorbers, RF bellows, button-type beam position monitors, and an in-vacuum undulator (IVU). The results show notable differences in convergence and computational efficiency between the two codes. While GdfidL provides highly resolved results and serves as a common benchmark tool, ECHO3D yields consistent results with coarser meshes, significantly reducing simulation time and memory demands. Simulations with a full-geometry IVU model demonstrate that simplified taper-transition models can miss important impedance contributions. In conclusion, these findings provide practical guidelines for efficient and accurate impedance modeling to optimize design of vacuum chamber components for accelerators.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Universality driven analytic structure of QCD crossover: radius of convergence and QCD critical point

Recent lattice QCD calculations show strong indications that the crossover of QCD at zero baryon chemical potential (µB) is a remnant of the second order chiral phase transition. The non-universal parameters needed to map temperature T and µ B to the universal properties of the second order chiral phase transition were determined by lattice QCD calculations. Motivated by these advances, first, we discuss the analytic structure of the partition function - the so-called Yang-Lee edge singularity - in the QCD crossover regime, solely based on universal properties. Then, utilizing the lattice calculated non-universal parameters, we map this singularity to the real T and complex µ B plane, in order to find the radius of convergence for a Taylor series expansion of QCD partition function around µ B = 0 in the QCD crossover regime. Our most important findings are: (i) An universality-based estimate of the radius of convergence around µ B = 0; (ii) Universality and lattice QCD based constraints on the location of the QCD critical point in the T - µ B plane.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Acceleration of Solvation Free Energy Calculation via Thermodynamic Integration Coupled with Gaussian Process Regression and Improved Gelman–Rubin Convergence Diagnostics

The determination of the solvation free energy of ions and molecules holds profound importance across a spectrum of applications spanning chemistry, biology, energy storage, and the environment. Molecular dynamics simulations are powerful tools for computing this critical parameter. Nevertheless, the accurate and efficient calculation of the solvation free energy becomes a formidable endeavor when dealing with complex systems characterized by potent Coulombic interactions and sluggish ion dynamics and, consequently, slow transition across various metastable states. Here, in the present study, we expose limitations stemming from the conventional calculation of the statistical inefficiency g in the thermodynamic integration method, a factor that can hinder the determination of convergence of the solvation free energy and its associated uncertainty. Instead, we propose a robust scheme based on Gelman–Rubin convergence diagnostics. We leverage this improved estimation of uncertainties to introduce an innovative accelerated thermodynamic integration method based on the Gaussian Process regression. This methodology is applied to the calculation of the solvation free energy of trivalent rare-earth elements immersed in ionic liquids, a scenario in which the aforementioned challenges render standard approaches ineffective. The proposed method proves to be effective in computing solvation free energy in situations where traditional thermodynamic integration methods fall short.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Convergent Protocols for Computing Protein–Ligand Interaction Energies Using Fragment-Based Quantum Chemistry

Fragment-based quantum chemistry methods offer a way to sidestep the steep nonlinear scaling of electronic structure calculations so that large molecular systems can be investigated using high-level methods. Here, we use fragmentation to compute protein–ligand interaction energies in systems with several thousand atoms, using a new software platform for managing fragment-based calculations that implements a screened many-body expansion. Convergence tests using a minimal-basis semiempirical method (HF-3c) indicate that two-body calculations, with single-residue fragments and simple hydrogen caps, are sufficient to reproduce interaction energies obtained using conventional supramolecular electronic structure calculations, to within 1 kcal/mol at about 1% of the computational cost. We also demonstrate that the HF-3c results are illustrative of trends obtained with density functional theory in basis sets up to augmented quadruple-ζ quality. Strategic deployment of fragmentation facilitates the use of converged biomolecular model systems alongside high-quality electronic structure methods and basis sets, bringing ab initio quantum chemistry to systems of hitherto unimaginable size. This will be useful for generation of high-quality training data for machine learning applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Definitive Assessment of the Accuracy, Variationality, and Convergence of Relativistic Coupled Cluster and Density Matrix Renormalization Group in 100-Orbital Space

Accuracy, variationality, and convergence underpin the reliability of modern electronic structure methods, yet definitive benchmarks in the relativistic regime remain elusive due to the absence of numerically exact full configuration interaction (CI) references. Recent algorithmic advances in the CI framework, enabled by the small-tensor-product (STP) decomposition approach, have dramatically extended the tractable size of the configuration space, making numerically exact CI calculations feasible in large active spaces previously beyond reach. In this paper, we employ the recently developed STP-CI framework to perform large-scale numerically exact CI calculations and directly benchmark relativistic coupled cluster and density matrix renormalization group methods. Definitive benchmarking of approximate relativistic electronic structure methods is ensured through the application of the gap theorem, which provides rigorous error bounds on the CI reference and establishes a controlled standard for assessing accuracy, variationality, and convergence.

Chemical calculations↗
DOE OSTI2022

Chemolithoautotroph distributions across the subsurface of a convergent margin

Subducting oceanic crusts release fluids rich in biologically relevant compounds into the overriding plate, fueling subsurface chemolithoautotrophic ecosystems. To understand the impact of subsurface geochemistry on microbial communities, we collected fluid and sediments from 14 natural springs across a ~200 km transect across the Costa Rican convergent margin and performed shotgun metagenomics. The resulting 404 metagenome-assembled genomes (MAGs) cluster into geologically distinct regions based on MAG abundance patterns: outer forearc-only (25% of total relative abundance), forearc/arc-only (38% of total relative abundance), and delocalized (37% of total relative abundance) clusters. In the outer forearc, Thermodesulfovibrionia, Candidatus Bipolaricaulia, and Firmicutes have hydrogenotrophic sulfate reduction and Wood-Ljungdahl (WL) carbon fixation pathways. In the forearc/arc, Anaerolineae, Ca. Bipolaricaulia, and Thermodesulfovibrionia have sulfur oxidation, nitrogen cycling, microaerophilic respiration, and WL, while Aquificae have aerobic sulfur oxidation and reverse tricarboxylic acid carbon fixation pathway. Transformation-based canonical correspondence analysis shows that MAG distribution corresponds to concentrations of aluminum, iron, nickel, dissolved inorganic carbon, and phosphate. While delocalized MAGs appear surface-derived, the subsurface chemolithoautotrophic, metabolic, and taxonomic landscape varies by the availability of minerals/metals and volcanically derived inorganic carbon. Furthermore, the WL pathway persists across all samples, suggesting that this versatile, energy-efficient carbon fixation pathway helps shape convergent margin subsurface ecosystems.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Automated calculation and convergence of defect transport tensors

Defect diffusion is a key process in materials science and catalysis, but as migration mechanisms are often too complex to enumerate a priori, calculation of transport tensors typically have no measure of convergence and require significant end-user intervention. These two bottlenecks prevent high-throughput implementations essential to propagate model-form uncertainty from interatomic interactions to predictive simulations. In order to address these issues, we extend a massively parallel accelerated sampling scheme, autonomously controlled by Bayesian estimators of statewide sampling completeness, to build atomistic kinetic Monte Carlo models on a state-space irreducible under exchange and space group symmetries. Focusing on isolated defects, we derive analytic expressions for drift and diffusion coefficients, providing a convergence metric by calculating the Kullback–Leibler divergence across the ensemble of diffusion processes consistent with the sampling uncertainty. The autonomy and efficacy of the method is demonstrated on surface trimers in tungsten and Hexa-interstitials in magnesium oxide, both of which exhibit complex, correlated migration mechanisms.

36 MATERIALS SCIENCE↗
DOE OSTI2020

A putative chordate luciferase from a cosmopolitan tunicate indicates convergent bioluminescence evolution across phyla

Abstract Pyrosomes are tunicates in the phylum Chordata, which also contains vertebrates. Their gigantic blooms play important ecological and biogeochemical roles in oceans. Pyrosoma , meaning “fire-body”, derives from their brilliant bioluminescence. The biochemistry of this light production is unknown, but has been hypothesized to be bacterial in origin. We found that mixing coelenterazine—a eukaryote-specific luciferin—with Pyrosoma atlanticum homogenate produced light. To identify the bioluminescent machinery, we sequenced P. atlanticum transcriptomes and found a sequence match to a cnidarian luciferase (RLuc). We expressed this novel luciferase (PyroLuc) and, combined with coelenterazine, it produced light. A similar gene was recently predicted from a bioluminescent brittle star, indicating that RLuc-like luciferases may have evolved convergently from homologous dehalogenases across phyla (Cnidaria, Echinodermata, and Chordata). This report indicates that a widespread gene may be able to functionally converge, resulting in bioluminescence across animal phyla, and describes and characterizes the first putative chordate luciferase.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Convergent evolution of aerobic fermentation through divergent mechanisms acting on key shared glycolytic genes

As the tree of life becomes increasingly accessible to molecular investigations, describing mechanisms underlying evolutionary convergence and constraint will be crucial to understanding diversification. The lineage including the model yeast Saccharomyces cerevisiae evolved aerobic fermentation in part through an ancient whole genome duplication and retention of glycolytic genes. To evaluate glycolytic rates across diverse yeasts, we developed and deployed an extracellular acidification rates (ECAR) assay on 299 species that span more than 400 million years of evolution and identified a clade in the genus Saturnispora that convergently evolved aerobic fermentation. Through comparative genomics and transcriptomics, we found that several glycolytic genes had higher expression and novel cis-regulatory elements in aerobically fermenting Saturnispora species. When the transcription factor required for their activation was deleted in Saturnispora dispora, the mutants had reduced glycolytic rates and increased respiration. Intriguingly, many of the upregulated genes are orthologous to duplicated glycolytic genes in S. cerevisiae. These divergent genetic mechanisms affecting the same set of genes suggest that there are strong evolutionary constraints on how aerobic fermentation can arise.

Horianopoulos, Linda C. [Great Lakes Bioenergy Res↗
DOE OSTI2024

Rapidly convergent quantum Monte Carlo using a Chebyshev projector

The multireference coupled-cluster Monte Carlo (MR-CCMC) algorithm is a determinant-based quantum Monte Carlo (QMC) algorithm that is conceptually similar to Full Configuration Interaction QMC (FCIQMC). It has been shown to offer a balanced treatment of both static and dynamic correlation while retaining polynomial scaling, although application to large systems with significant strong correlation remained impractical. In this paper, we document recent algorithmic advances that enable rapid convergence and a more black-box approach to the multireference problem. These include a logarithmically scaling metric-tree-based excitation acceptance algorithm to search for determinants connected to the reference space at the desired excitation level and a symmetry-screening procedure for the reference space. We show that, for moderately sized reference spaces, the new search algorithm brings about an approximately 8-fold acceleration of one MR-CCMC iteration, while the symmetry screening procedure reduces the number of active reference space determinants with essentially no loss of accuracy. We also introduce a stochastic implementation of an approximate wall projector, which is the infinite imaginary time limit of the exponential projector, using a truncated expansion of the wall function in Chebyshev polynomials. Notably, this wall-Chebyshev projector can be used to accelerate any projector-based QMC algorithm. We show that it requires significantly fewer applications of the Hamiltonian to achieve the same statistical convergence. We benchmark these acceleration methods on the beryllium and carbon dimers, using initiator FCIQMC and MR-CCMC with basis sets up to cc-pVQZ quality.

Zhao, Zijun↗