Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative refinement”

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

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

At least 37 records · Page 2

Humanoid Mobile Manipulation Using Controller Refinement

An important class of mobile manipulation problems are move-to-grasp problems where a mobile robot must navigate to and pick up an object. One of the distinguishing features of this class of tasks is its coarse-to-fine structure. Near the beginning of the task, the robot can only sense the target object coarsely or indirectly and make gross motion toward the object. However, after the robot has located and approached the object, the robot must finely control its grasping contacts using precise visual and haptic feedback. In this paper, it is proposed that move-to-grasp problems are naturally solved by a sequence of controllers that iteratively refines what ultimately becomes the final solution. This paper introduces the notion of a refining sequence of controllers and characterizes this type of solution. The approach is demonstrated in a move-to-grasp task where Robonaut, the NASA/JSC dexterous humanoid, is mounted on a mobile base and navigates to and picks up a geological sample box. In a series of tests, it is shown that a refining sequence of controllers decreases variance in robot configuration relative to the sample box until a successful grasp has been achieved.

Platt, Robert↗

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark↗

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗

Real-Time Adaptive Drag Minimization Wind Tunnel Investigation of a Flexible Wing with Variable Camber Continuous Trailing Edge Flap System

This paper reports the results of a recently completed real-time adaptive drag minimization wind tunnel investigation of a highly flexible wing wind tunnel model equipped with the Variable Camber Continuous Trailing Flap (VCCTEF) technology at the University of Washington Aeronautical Laboratory (UWAL). The wind tunnel investigation is funded by NASA SBIR Phase II contract with Scientific Systems Company, Inc. (SSCI) and University of Washington (UW) as a subcontractor. The wind tunnel model is a sub-scale Common Research Model (CRM) wing constructed of foam core and fiberglass skin and is aeroelastically scaled to achieve a wing tip deflection of 10% of the wing semi-span which represents a typical wing tip deflection for a modern transport such as Boeing 787. The jig-shape twist of the CRM wing is optimized using a CART3D aero-structural model to achieve the minimum induced drag for the design cruise lift coefficient of 0.5. The wing is equipped with two chord wise cambered segments for each of the six span wise flap sections for a total of 12 individual flap segments that comprise the VCCTEF system. Each of the 12 flap segments is actively controlled by an electric servo-actuator. The real-time adaptive drag optimization strategy includes an on-board aerodynamic model identification, a model excitation, and a real-time drag optimization. The on-board aerodynamic model is constructed parametrically as a function of the angle of attack and flap positions to model the lift and drag coefficients of the wing. The lift coefficient models include a linear model and a second-order model. The drag coefficient models include a quadratic model and a higher-order up to 6th-order model to accurately model the drag coefficient at high angles of attack. The onboard aerodynamic model identification includes a recursive least-squares (RLS) algorithm and a batch least-squares (BLS) algorithm designed to estimate the model parameters. The model excitation method is designed to sample the input set that comprises the angle of attack and the flap positions. Three model excitation methods are developed: random excitation method, sweep method, and iterative angle-of-attack seeking method. The real-time drag optimization includes a generic algorithm developed by SSCI and several optimization methods developed by NASA which include a second-order gradient Newton-Raphson optimization method, an iterative gradient optimization method, a pseudo-inverse optimization method, an analytical optimization method, and an iterative refinement optimization method. The first wind tunnel test entry took place in September 2017. This test revealed major hardware issues and required further redesign of the flap servo mechanisms. The second test entry took place in April 2018. However, the test was not successful due to the issues with the onboard aerodynamic model identification RLS algorithm which incorrectly identified model parameters. This test also provides an experimental comparison study between the VCCTEF and a variable camber discrete trailing edge flap (VCDTEF) without the elastomer transition mechanisms. The experimental result confirms the benefit of the VCCTEF which produces lower drag by 5% than the VCDTEF. The third and final test entry took place in June 2018 after the issues with the RLS algorithm have been identified and corrected. Additional improvements were implemented. These include the BLS algorithm, the iterative angle-of-attack seeking method, the iterative gradient optimization method, and the pseudo-inverse optimization method. The test objectives were successfully demonstrated as the real-time drag optimization identifies several optimal solutions at off-design lift coefficients. The iterative gradient optimization method is found to achieve up to 4.7% drag reduction for the off-design lift coefficient of 0.7. The pseudo-inverse optimization method which does not require the drag coefficient model is found to be quite effective in reducing drag. Up to 9.4% drag reduction for the off-design lift coefficient of 0.7 is achieved with the pseudo-inverse optimization method. The wind tunnel investigation demonstrates the potential of real-time drag optimization technology. Several new capabilities are developed that could enable future adaptive wing technologies for flexible wings equipped with drag control devices such as the VCCTEF.

Drag Optimization↗

Multi–Modular Design of Stable Pore–Space–Partitioned Metal–Organic Frameworks for Gas Separation Applications

Pore space partition (PSP) is an effective materials design method for developing high-performance small-pore materials for storage and separation of gas molecules. The continued success of PSP depends on broad availability and judicious choice of pore-partition ligands and better understanding of each structural module on stability and sorption properties. Here, by using substructural bioisosteric strategy (sub-BIS), a dramatic expansion of pore-partitioned materials is targeted by using ditopic dipyridyl ligands with non-aromatic cores or extenders, as well as by expanding heterometallic clusters to uncommon nickel–vanadium and nickel–indium clusters rarely known before in porous materials. The dual-module iterative refinement of pore-partition ligands and trimers leads to remarkable enhancement of chemical stability and porosity. Here a family of 23 pore-partitioned materials synthesized from five pore-partition ligands and seven types of trimeric clusters is reported. New materials with such compositionally and structurally diverse framework modules reveal key factors that dictate stability, porosity, and gas separation properties. Among these, materials based on heterometallic vanadium–nickel trimeric clusters give rise to the highest long-term hydrolytic stability and remarkable uptake capacity for CO 2 , C 2 H 2 /C 2 H 4 /C 2 H 6 , and C 3 H 6 /C 3 H 8 hydrocarbon gases. Here, the breakthrough experiment shows the potential application of new materials for separating gas mixtures such as C 2 H 2 /CO 2 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mixed-precision numerics in scientific applications: survey and perspectives

The explosive demand for artificial intelligence (AI) workloads has led to a significant increase in silicon area dedicated to lower-precision computations on recent high-performance computing hardware designs. However, mixed-precision capabilities, which can achieve performance improvements of up to 8x compared to double-precision in extreme compute-intensive workloads, remain largely untapped in most scientific applications. A growing number of efforts have shown that mixed-precision algorithmic innovations can deliver superior performance without sacrificing accuracy. These developments should prompt computational scientists to seriously consider whether their scientific modeling and simulation applications could benefit from the acceleration offered by new hardware and mixed-precision algorithms. In this survey, we (1) review progress across diverse scientific domains—fluid dynamics, weather and climate, quantum chemistry, and computational genomics—that have begun adopting mixed-precision strategies; (2) examine state-of-the-art algorithmic techniques such as iterative refinement, splitting and emulation schemes, and adaptive precision solvers; (3) assess their implications for accuracy, performance, and resource utilization; and (4) survey the emerging software ecosystem that enables mixed-precision methods at scale. We conclude with perspectives and recommendations on cross-cutting opportunities, domain-specific challenges, and the role of co-design between application scientists, numerical analysts, and computer scientists. Collectively, this survey underscores that mixed-precision numerics can reshape computational science by aligning algorithms with the evolving landscape of hardware capabilities.

Graphics processing units↗

Building a DFT+U machine learning interatomic potential for uranium dioxide

Despite uranium dioxide (UO 2 ) being a widely used nuclear fuel, fuel performance models rely extensively on empirical correlations of material behavior, leveraging the historical operating experience of UO 2 . Mechanistic models that consider an atomistic understanding of the processes governing fuel performance (such as fission gas release and creep) will enable a better description of fuel behavior under non-prototypical conditions such as in new reactor concepts or for modified UO 2 fuel compositions. To this end, molecular dynamics simulation is a powerful tool for rapidly predicting physical properties of proposed fuel candidates. However, the reliability of these simulations depends largely on the accuracy of the atomic forces. Traditionally, these forces are computed using either a classical force field (FF) or density functional theory (DFT). While DFT is relatively accurate, the computational cost is burdensome, especially for f-electron elements, such as actinides. By contrast, classical FFs are computationally efficient but are less accurate. For these reasons, we report a new accurate machine learning interatomic potential (MLIP) for UO 2 that provides high-fidelity reproduction of DFT forces at a similar low cost to classical FFs. We employ an active learning approach that autonomously augments the DFT training data set to iteratively refine the MLIP. To further improve the quality of our predictions, we utilize transfer learning to retrain our MLIP to higher-accuracy DFT+U data. We validate our MLIPs by comparing predicted physical properties (e.g., thermal expansion and elastic properties) with those from existing classical FFs and DFT/DFT+U calculations, as well as with experimental data when available.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Agentic traffic intelligence: Augmented human-in-the-loop scenario generation for microscopic traffic simulation

Traditional microscopic traffic simulation generation often relies on static datasets and manual design, limiting its ability to simulate complex conditions easily. This paper presents a novel framework, Agentic Traffic Intelligence, which combines human approval large language models (LLMs), the Real-Twin tool, and multi-agent systems to perform realistic microscopic traffic simulation scenario generation. The proposed framework incorporates human-in-the-loop (HIL) control, retrieval-augmented generation (RAG), and multi-agent control mechanisms. HIL mechanisms are used to guide multiple LLMs focused on attributes for microscopic simulation generation and to improve the interpretability and transparency of LLM execution for users. RAG enhances context extraction by dynamically integrating external knowledge sources for traffic scenario generation foundations. A multi-agent architecture with supervisory control coordinates the interaction of simulation components, including traffic simulators, control logic, and calibration tools. This enables the synthesis of simulation-ready scenarios that reflect dynamic demand profiles and behavior controls. Furthermore, the framework fuses multisource traffic data with unstructured context and supports iterative refinement through interactive user feedback. Validated through microscopic simulation using Simulation of Urban Mobility, the generated scenarios demonstrate high-fidelity network generation with inflow and turn movement and behavioral calibration, offering a robust and efficient tool for stress-testing and optimizing urban mobility systems.

Hierarchical multi-agent control↗

Agentic framework for programmatic crystal structure generation using a fine-tuned worker–supervisor large language model

Platinum group metals (PGMs) underpin many catalytic technologies but face severe supply constraints, motivating the search for alternative materials and computational methods to accelerate discovery. While atomistic simulation tools such as Pymatgen and ASE have streamlined structure manipulation, they require detailed inputs, limiting accessibility for experimentalists and slowing early-stage exploration. Here, in this study, we present an AI-driven agentic framework that orchestrates worker–supervisor large language models (LLMs). The worker translates natural-language prompts of varying abstraction into valid crystallographic structures using a compact LLM fine-tuned with low-rank adaptation on a curated text–code–CIF dataset, emphasizing energy-efficient training. Benchmarking against the baseline CodeGen-350M-mono model shows that fine-tuning reduces hallucination rates from 100% to as low as 5% and improves structural match accuracy to up to 82% for fully specified inputs. Accuracy declines with decreasing prompt detail but remains nontrivial even when only stoichiometry and space group are provided, underscoring the LLM’s capacity for crystallographic inference. The supervisor Claude LLM evaluates the outputs and triggers iterative refinement through the worker’s built-in structure manipulation capabilities (e.g., supercell scaling, strain, vacancy, and substitution operations). We further demonstrate use cases for technologically relevant catalysts, including IrO 2 , pyrochlore Pb 2 Ir 2 O 7 , Ni 2 FeO 4 , and Ni 3 Mo, where the framework generates physically consistent structures that can be refined via geometry optimization. This work introduces a low-energy, language-driven pathway for integrating human and machine intelligence in materials design, paving the way for AI-assisted synthesis planning and high-throughput screening of complex oxides.

AI agent↗

A score-based diffusion model approach for adaptive learning of stochastic partial differential equation solutions

In this paper, we propose a novel framework for adaptively learning the time-evolving solutions of stochastic partial differential equations (SPDEs) using score-based diffusion models within a recursive Bayesian inference setting. SPDEs play a central role in modeling complex physical systems under uncertainty, but their numerical solutions often suffer from model errors and reduced accuracy due to incomplete physical knowledge and environmental variability. To address these challenges, we encode the governing physics into the score function of a diffusion model using simulation data and incorporate observational information via a likelihood-based correction in a reverse-time stochastic differential equation. This enables adaptive learning through iterative refinement of the solution as new data becomes available. To improve computational efficiency in high-dimensional settings, we introduce the ensemble score filter, a training-free approximation of the score function designed for real-time inference. Numerical experiments on benchmark SPDEs demonstrate the accuracy and robustness of the proposed method under sparse and noisy observations.

97 MATHEMATICS AND COMPUTING↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

Resolving the Coverage Dependence of Surface Reaction Kinetics with Machine Learning and Automated Quantum Chemistry Workflows

Microkinetic models for catalytic systems require estimation of many thermodynamic and kinetic parameters that can be calculated for isolated species and transition states using ab initio methods. However, the presence of nearby coadsorbates on the surface can dramatically alter these thermodynamic and kinetic parameters causing them to be dependent on species coverage fractions. As there are combinatorially many coadsorbed configurations on the surface, computing the coverage dependence of these parameters is far less straightforward. We present a framework for generating and applying machine learning models to predict coverage-dependent parameters for microkinetic models. Our toolkit enables automatic calculation and evaluation of coadsorbed configurations allowing us to sample 2,000 coadsorbed adsorbates and transition states (TSs) for a diverse set of 9 reactions on Cu(111), a challenging surface, with four possible coadsorbates. This dataset was then used to train subgraph isomorphic decision trees (SIDTs) to predict the stability and association energy of configurations. We were able to achieve mean absolute errors (MAEs) of 0.106 eV on adsorbates, 0.172 eV on TSs, and due to natural error cancellation in SIDTs for relative properties, 0.130 eV on reaction energies and 0.180 eV on activation barriers. In conclusion, we describe how to use these models to predict coverage-dependent corrections for adsorbates and TSs and demonstrate on H*, HO*, and O* comparing the generated SIDT model with an iteratively refined version.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Molecular View of Methane Activation on Ni(111) through Enhanced Sampling and Machine Learning

A combination of machine learned interatomic potentials (MLIPs) and enhanced sampling simulations is used to investigate the activation of methane on a Ni(111) surface. The work entails the development and iterative refinement of MLIPs, initially trained on a dataset constructed via ab initio molecular dynamics (AIMD) simulations, supplemented by adaptive biasing forces, to enrich the sampling of catalytically relevant configurations. Our results reveal that by incorporating collective variables that capture the behavior of the reactant molecule, as well as additional frames that describe the dynamic response of the catalytic surface, it is possible to enhance considerably the accuracy of predicted energies and forces. By employing enhanced sampling schemes in the refinement of the MLIP, we systematically explore the potential energy surface, leading to a refined MLIP capable of predicting DFT-level energies and forces and replicating key geometric characteristics of the catalytic system. The resulting free energy landscapes at several temperatures provide a detailed view of the thermodynamics and dynamics of methane activation. Specifically, as methane approaches and dissociates on the catalytic surface, the process involves the dynamic interplay of CH 4 and the Ni catalyst that includes both enthalpic and entropic contributions. The progression towards the transition state involves an CH 4 moiety that is increasingly restrained in its ability to rotate or translate, while the stage following the transition state is characterized by a notable rise of the Ni atom that interacts with the cleaved C–H bond. Furthermore, this leads to an increase in the mobility of the adsorbed species, a feature that becomes more pronounced at higher temperatures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ToPolyAgent: AI agents for coarse-grained bead-spring topological polymer simulations

We introduce ToPolyAgent, a multi-agent AI framework for performing coarse-grained molecular dynamics (MD) simulations of topological polymers through natural language instructions. By integrating large language models (LLMs) with domain-specific computational tools, ToPolyAgent supports both interactive and autonomous simulation workflows across diverse polymer architectures, including linear, ring, brush, and star polymers, as well as dendrimers. The system consists of four LLM-powered agents: a Config Agent for generating initial polymer–solvent configurations, a Simulation Agent for executing LAMMPS-based MD simulations and conformational analyses, a Report Agent for compiling markdown reports, and a Workflow Agent for streamlined autonomous operations. Interactive mode incorporates user feedback loops for iterative refinements, while autonomous mode enables end-to-end task execution from detailed prompts. We demonstrate ToPolyAgent's versatility through case studies involving diverse polymer architectures under varying solvent conditions, thermostats, and simulation lengths. Furthermore, we highlight its potential as a research assistant by directing it to investigate the effect of interaction parameters on the linear polymer conformation, and the influence of grafting density on the persistence length of the brush polymer. By coupling natural language interfaces with rigorous simulation tools, ToPolyAgent lowers barriers to complex computational workflows and advances AI-driven materials discovery in polymer science. It lays the foundation for autonomous and extensible multi-agent scientific research ecosystems.

Ding, Lijie [Oak Ridge National Laboratory (ORNL),↗

Discovery of hydrogen storage molecules using large language models and machine learning

Accelerating the discovery of new molecules with targeted properties is a central challenge in molecular design. In this contribution, we present an AI-driven molecular discovery framework that integrates Large Language Models (LLMs) for generative molecular design with Machine Learning (ML)-based screening to identify novel Liquid Organic Hydrogen Carrier (LOHC) candidates. Using the developed framework, LOHC molecules were systematically generated, evaluated, and refined iteratively, combining LLM-guided molecular generation and ML-predicted hydrogenation enthalpies (Δ H ), under physicochemical property constraints such as optimal melting points (MP), desired hydrogen storage capacity (wt% H 2 ), and synthetic accessibility (SA) scores. This approach enabled the discovery of 42 new LOHC candidates in two distinct campaigns, one seeded with experimentally known and another with previously computationally identified LOHCs, respectively. Although we began with different numbers of starting molecules (31 vs . 7 seed molecules), both runs yielded a comparable number of viable candidates, suggesting an influence of chemically intuitive seed molecule selection for success. Selected LOHC molecules, such as 3-methyl pyridine, 1-ethylnapthalene, 1,1-diphenylethane, and benzofuran, were experimentally tested and compared with benchmark LOHCs (toluene and 9-ethylcarbazole) for hydrogenation using a series of commercial supported metal catalysts. The order of conversion into fully hydrogenated products at 200 °C was 3-methyl pyridine (100%) > 9-ethyl carbazole (86.4%) > 2,3-benzofuran (74%) > 1,1-diphenylethane (66.9%) > 1-ethylnapthalene (66.7%) > toluene (57%), further validating the AI-guided molecular design. This study demonstrates promise of LLM-driven molecular design in conjunction with ML-based screening for accelerated discovery and design of molecules.

Harb, Hassan [Argonne National Laboratory (ANL), A↗

Automated segmentation of soft X-ray tomography: Native cellular structure with submicron resolution at high-throughput for whole-cell quantitative imaging in yeast

Soft X-ray tomography (SXT) is an invaluable tool for quantitatively analyzing cellular structures at suboptical isotropic resolution. However, it has traditionally depended on manual segmentation, limiting its scalability for large datasets. Here, we leverage a deep learning-based autosegmentation pipeline to segment and label cellular structures in hundreds of cells across three Saccharomyces cerevisiae strains. This task-based pipeline uses manual iterative refinement to improve segmentation accuracy for key structures, including the cell body, nucleus, vacuole, and lipid droplets, enabling high-throughput and precise phenotypic analysis. Using this approach, we quantitatively compared the three-dimensional (3D) whole-cell morphometric characteristics of wild-type, VPH1-GFP, and vac14 strains, uncovering detailed strain-specific cell and organelle size and shape variations. We show the utility of SXT data for precise 3D curvature analysis of entire organelles and cells and detection of fine morphological features using surface meshes. Our approach facilitates comparative analyses with high spatial precision and statistical throughput, uncovering subtle morphological features at the single-cell and population level. This workflow significantly enhances our ability to characterize cell anatomy and supports scalable studies on the mesoscale, with applications in investigating cellular architecture, organelle biology, and genetic research across diverse biological contexts.

Chen, Jianhua [Lawrence Berkeley National Laborato↗

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗