Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network 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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Tensor Network Space-Time Spectral Collocation Method for Time-Dependent Convection-Diffusion-Reaction Equations

Emerging tensor network techniques for solutions of partial differential equations (PDEs), known for their ability to break the curse of dimensionality, deliver new mathematical methods for ultra-fast numerical solutions of high-dimensional problems. Here, we introduce a Tensor Train (TT) Chebyshev spectral collocation method, in both space and time, for the solution of the time-dependent convection-diffusion-reaction (CDR) equation with inhomogeneous boundary conditions, in Cartesian geometry. Previous methods for numerical solution of time-dependent PDEs often used finite difference for time, and a spectral scheme for the spatial dimensions, which led to a slow linear convergence. Spectral collocation space-time methods show exponential convergence; however, for realistic problems they need to solve large four-dimensional systems. We overcome this difficulty by using a TT approach, as its complexity only grows linearly with the number of dimensions. We show that our TT space-time Chebyshev spectral collocation method converges exponentially, when the solution of the CDR is smooth, and demonstrate that it leads to a very high compression of linear operators from terabytes to kilobytes in TT-format, and a speedup of tens of thousands of times when compared to a full-grid space-time spectral method. These advantages allow us to obtain the solutions at much higher resolutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Viability of perturbative expansion for quantum field theories on neurons

Neural Network (NN) architectures that break statistical independence of parameters have been proposed as a new approach for simulating local quantum field theories (QFTs) [1]. In the infinite neuron number limit, single-layer NNs can exactly reproduce QFT results. This paper examines the viability of this architecture for perturbative calculations of local QFTs for finite neuron number N using scalar ϕ 4 theory in d Euclidean dimensions as an example. We find that the renormalized O(1/N ) corrections to two-and four-point correlators yield perturbative series which are sensitive to the UV cut-off and therefore have a weak convergence. We propose a modification to the architecture to improve this convergence and discuss constraints on the parameters of the theory and the scaling of N which allow us to extract accurate field theory results.

Sen, Srimoyee [Iowa State University, Ames, IA (Un↗
DOE OSTI2021

Pollution inequality 50 years after the Clean Air Act: the need for hyperlocal data and action

Fifty years ago the Clean Air Act amendments of 1970 were the first major US legislation that authorized regulation of air pollutants, creating National Ambient Air Quality Standards (NAAQSs) to protect public health and the environment. While US air quality has improved, with average PM 2.5 concentrations in 2016 a third of 1981 levels, air pollution remains a major health risk in the US and globally. Moreover, air pollution impacts are still uneven, with the most polluted US communities of 50 years ago still so today. Air pollution “hot spots” result in disproportionate exposure at neighborhood scales within cities, particularly in disadvantaged communities, but an in-depth understanding at these scales is lacking. This policy perspective discusses how trends in sensor technology, spatial data collection, analytics and retrieval are converging to enable the production of hyperlocal air pollution data, and that this needs to be done in a manner that enables marginalized communities to shape decision making.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Low-Level Mesoscale and Cloud-Scale Interactions Promoting Deep Convection Initiation

Data from scanning radars, radiosondes, and vertical profilers deployed during three field campaigns are analyzed to study interactions between cloud-scale updrafts associated with initiating deep moist convection and the surrounding environment. Three cases are analyzed in which the radar networks permitted dual-Doppler wind retrievals in clear air preceding and during the onset of surface precipitation. These observations capture the evolution of (i) the mesoscale and boundary layer flow, and (ii) low-level updrafts associated with deep moist convection initiation (CI) events yielding sustained or short-lived precipitating storms. The elimination of convective inhibition did not distinguish between sustained and unsustained CI events, though the vertical distribution of convective available potential energy may have played a role. The clearest signal differentiating the initiation of sustained versus unsustained precipitating deep convection was the depth of the low-level horizontal wind convergence associated with the mesoscale flow feature triggering CI, a sharp surface wind shift boundary, or orographic upslope flow. The depth of the boundary layer relative to the height of the LFC failed to be a consistent indicator of CI potential. Widths of the earliest detectable low-level updrafts associated with sustained precipitating deep convection were ~3–5 km, larger than updrafts associated with surrounding boundary layer turbulence (~1–3 km wide). It is hypothesized that updrafts of this larger size are important for initiating cells to survive the destructive effects of buoyancy dilution via entrainment.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Learning in continuous action space for developing high dimensional potential energy models

Reinforcement learning (RL) approaches that combine a tree search with deep learning have found remarkable success in searching exorbitantly large, albeit discrete action spaces, as in chess, Shogi and Go. Many real-world materials discovery and design applications, however, involve multi-dimensional search problems and learning domains that have continuous action spaces. Exploring high-dimensional potential energy models of materials is an example. Traditionally, these searches are time consuming (often several years for a single bulk system) and driven by human intuition and/or expertise and more recently by global/local optimization searches that have issues with convergence and/or do not scale well with the search dimensionality. Here, in a departure from discrete action and other gradient-based approaches, we introduce a RL strategy based on decision trees that incorporates modified rewards for improved exploration, efficient sampling during playouts and a “window scaling scheme" for enhanced exploitation, to enable efficient and scalable search for continuous action space problems. Using high-dimensional artificial landscapes and control RL problems, we successfully benchmark our approach against popular global optimization schemes and state of the art policy gradient methods, respectively. We demonstrate its efficacy to parameterize potential models (physics based and high-dimensional neural networks) for 54 different elemental systems across the periodic table as well as alloys. We analyze error trends across different elements in the latent space and trace their origin to elemental structural diversity and the smoothness of the element energy surface. Broadly, our RL strategy will be applicable to many other physical science problems involving search over continuous action spaces.

36 MATERIALS SCIENCE↗
DOE OSTI2023

GRIDS-Net: Inverse shape design and identification of scatterers via geometric regularization and physics-embedded deep learning

This study presents a deep learning based methodology for both remote sensing and design of acoustic scatterers. The ability to determine the shape of a scatterer, either in the context of material design or sensing, plays a critical role in many practical engineering problems. This class of inverse problems is extremely challenging due to their high-dimensional, nonlinear, and ill-posed nature. To overcome these technical hurdles, we introduce a geometric regularization approach for deep neural networks (DNN) based on non-uniform rational B-splines (NURBS) and capable of predicting complex 2D scatterer geometries in a parsimonious dimensional representation. Then, this geometric regularization is combined with physics-embedded learning and integrated within a robust convolutional autoencoder (CAE) architecture to accurately predict the shape of 2D scatterers in the context of identification and inverse design problems. Further, an extensive numerical study is presented in order to showcase the remarkable ability of this approach to handle complex scatterer geometries while generating physically-consistent acoustic fields. The study also assesses and contrasts the role played by the (weakly) embedded physics in the convergence of the DNN predictions to a physically consistent inverse design.

42 ENGINEERING↗
DOE OSTI2023

The Convergence of Vehicle Electrification and Automation - Enabling Sustainable Automated Mobility Districts

The transportation industry is entering a new frontier with three major simultaneous transformations: electrification, automation, and on-demand services. All three directly affect the same spaces of vehicle technology, infrastructure, and system operational performance. Further, each area of change adds its own driving forces of complexity to the others' design challenges. This paper explores these transformations, framing the implications for vehicle technology and infrastructure and their impact on operating concepts and strategies, which in turn impact the sustainability of the transportation infrastructure in the built environment. Specifically, this paper examines battery-electric vehicles operating in a fully automated fleet within an "automated mobility district" (AMD) setting with multiple on-demand services. From this examination, the paper assesses the implications for transportation electrification, comparing and contrasting traditional fixed-route services with those of on-demand transit and automated transit networks, including the trade-offs between vehicle range (battery capacity), charging parameters, power availability, and operations predictability with respect to policy and infrastructure configurations. The paper also addresses the configuration and management of boarding and alighting zones (also called pickup and drop-off zones), and the need for complementary infrastructure intelligence at intersections and curbs. Finally, conclusions are drawn with respect to the system integration and analysis needs for AMDs regarding resilience and sustainability of mobility infrastructure.

ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Single-qubit multi-party transmission using universal symmetric quantum cloning

This study considers the hypothetical quantum network case where Alice wishes to transmit one qubit of information (specifically a pure quantum state) to M parties, where M is some large number. The remote receivers locally perform single-qubit quantum state tomography on the transmitted qubits in order to compute the quantum state within some error rate (dependent on the tomography technique and the number of transmitted qubits). We show that with the use of an intermediate optimal symmetric universal quantum cloning machine (between Alice and the remote receivers) as a repeater-type node in a hypothetical quantum network, Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the M remote receivers. This is possible due to two properties of quantum cloning. The first is that single qubit quantum clones retain the same Bloch angle as the initial quantum state. This means that if the mixed state of the quantum clone can be computed to high enough accuracy, the original pure quantum state can be inferred by extrapolating that vector to the surface of the Bloch sphere. The second property is that the state overlap of approximate quantum clones, with respect to the original pure quantum state, quickly converges (specifically for 1 → M , the limit of the fidelity as M goes to infinity is $\frac{2}{3}$). This means that Alice can prepare a constant number of qubits (which are then passed through the quantum cloning machine) in order to achieve a desired error rate if M is large enough. Combined, these two properties mean that for a large M , Alice can prepare many orders of magnitude fewer qubits in order to achieve the same single qubit transmission accuracy compared to the naive direct qubit transmission approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Average Incremental Cost Pricing for the AC Unit Commitment Problem [Rev. 1]

Unit Commitment (UC) problems that consider the Alternating Current (AC) model of the transmission network have long been considered intractable to solve at scale by the power system community. Recently, the Grid-Optimization (GO) Competition held by the Advanced Research Project Agency-Energy (ARPA-E) has facilitated the development of the first algorithms to solve large-scale ACUC problems. This new capability opens a path towards the explicit consideration of the AC transmission network model in UC problems used to clear day-ahead electricity markets. This calls for the analysis of electricity market structures that accommodate both the continuous non-linearity of the AC transmission network and the discrete non-linearity of the UC problem simultaneously. This paper serves as an initial effort to do so by proposing an Average Incremental Cost (AIC) pricing structure that is designed around the ACUC problem. In particular, an AIC one-pass pricing problem is proposed that represents a continuously constrained variant of the ACUC problem and allows for the computation of Locational Incremental Prices (LIPs) for both real and reactive power as the local optimal Lagrange multipliers of the power balance constraints. To avoid degeneracy, the pricing problem includes a small parameter ϵ > 0. Under certain assumptions market participants are shown to realize profit that converges to a non-negative value as ϵ approaches zero, practically ensuring profitability for small values of ϵ. We additionally provide many simple and important examples that provide intuition and insights into the proposed prices. Examples illustrate the basic concept of AIC pricing, the derived profitability results, the existence of multiple LIPs, the importance of including reactive power in the dispatch and pricing problems, the need for reactive power prices, and the improved incentives exhibited by LIPs as compared to traditional Locational Marginal Prices (LMPs). We additionally indicate many directions for future work including analysis of larger test cases.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

GeoLoRA: Geometric integration for parameter efficient fine-tuning

Low-Rank Adaptation (LoRA) has become a widely used method for parameter-efficient fine-tuning of large-scale, pre-trained neural networks. However, LoRA and its extensions face several challenges, including the need for rank adaptivity, robustness, and computational efficiency during the fine-tuning process. We introduce GeoLoRA, a novel approach that addresses these limitations by leveraging dynamical low-rank approximation theory. GeoLoRA requires only a single backpropagation pass over the small-rank adapters, significantly reducing computational cost as compared to similar dynamical low-rank training methods and making it faster than popular baselines such as AdaLoRA. This allows GeoLoRA to efficiently adapt the allocated parameter budget across the model, achieving smaller low-rank adapters compared to heuristic methods like AdaLoRA and LoRA, while maintaining critical convergence, descent, and error-bound theoretical guarantees. The resulting method is not only more efficient but also more robust to varying hyperparameter settings. We demonstrate the effectiveness of GeoLoRA on several state-of-the-art benchmarks, showing that it outperforms existing methods in both accuracy and computational efficiency.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2021

Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo

As an important Markov chain Monte Carlo (MCMC) method, the stochastic gradient Langevin dynamics (SGLD) algorithm has achieved great success in Bayesian learning and posterior sampling. Furthermore, SGLD typically suffers from a slow convergence rate due to its large variance caused by the stochastic gradient. In order to alleviate these drawbacks, we leverage the recently developed Laplacian smoothing technique and propose a Laplacian smoothing stochastic gradient Langevin dynamics (LS-SGLD) algorithm. We prove that for sampling from both log-concave and non-log-concave densities, LS-SGLD achieves strictly smaller discretization error in 2-Wasserstein distance, although its mixing rate can be slightly slower. Experiments on both synthetic and real datasets verify our theoretical results and demonstrate the superior performance of LS-SGLD on different machine learning tasks including posterior sampling, Bayesian logistic regression, and training Bayesian convolutional neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Distributed Inference with Sparse and Quantized Communication

Here, we consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

42 ENGINEERING↗
DOE OSTI2022

WHONDRS Surface Water Chemistry and Organic Matter Characterization along the St. Lawrence River's Inland to Coastal Gradient, Eastern North America (v2)

This dataset supports a broader study examining the inland (Lake Ontario) to coastal (North Atlantic Ocean) geochemistry gradient along the St. Lawrence River in Canada and the United States. The St. Lawrence River is unique in that it contains the convergence of multiple water masses with distinct water signatures that mix only slightly as the river flows downstream. The dataset provides dissolved organic carbon (DOC) and organic matter characterization data generated from surface water. Samples were collected by researchers on board the Lampsilis research vessel (l’Université du Québec à Trois-Rivières) and small boats (St. Lawrence River Institute of Environmental Sciences, Cornwall) at 94 locations across and along the St. Lawrence River to capture longitudinal and transverse variation. Related data were collected and will be published separately in collaboration with the MicrEAU Laboratory (François Guillemette; l’Université du Québec à Trois-Rivières) and the Exploration of Coastal Hydrobiogeochemistry Across a Network of Gradients and Experiments (EXCHANGE) program. This dataset is comprised of one main data folder containing (1) file-level metadata; (2) data dictionary; (3) field metadata; (4) dissolved organic carbon (DOC, measured as non-purgeable organic carbon, NPOC) data (5) surface water sampling protocol; (6) readme; (7) methods codes; (8) international geo-sample number (IGSN) mapping file; and (9) folder of high resolution characterization of organic matter via 12 Tesla Fourier transform ion cyclotron resonance mass spectrometry (FTICR-MS) through the Environmental Molecular Sciences Laboratory (EMSL; https://www.pnnl.gov/environmental-molecular-sciences-laboratory). The FTICR folder contains two subfolders, one containing the .xml data files and the other containing instructions for using Formularity (https://omics.pnl.gov/software/formularity) and an R script to process the data based on the user's specific needs. All files are .csv, .pdf, .R, .ref, or .xml. The data package was originally published in November 202. It was updated in April 2025 (v2; modified files). See the change history section in the readme for details.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

The many-body expansion for aqueous systems revisited: III. Hofmeister ion – water interactions

We report a Many Body Energy (MBE) analysis of aqueous ionic clusters containing anions and cations at the two opposite ends of the Hofmeister series, viz. the kosmotropes Ca2+, SO42- and chaotropes NH4+ and ClO4- with 9 water molecules to quantify the how these ions in altering the interaction between the water molecules in their immediate surrounding. The current results are contrasted to the ones reported earlier for water clusters as well as for alkali metal and halide ion aqueous clusters of the same size, which lie in the middle of the Hofmeister series. Through this analysis, noteworthy differences between the MBE of kosmotropes and chaotropes were identified. The MBE of kosmotropes is dominated by ion-water interactions that extends beyond the 4-body term, the point at which the MBE of pure water converges. The percentage contribution of the 2- B to the total cluster binding energy is noticeably larger. The disruption due to the dominant ion results in weak, unfavorable water-water interactions. The MBE for chaotropes, on the other hand, was found to converge more quickly as it more closely resembles that of pure water clusters. Chaotropes exhibit weaker overall binding energies and ion-water interactions with more favorable water-water interactions, somewhat recovering the pattern of the 2-4 body terms exemplified by pure water clusters. More importantly, both kosmotropic and chaotropic ions exhibit an anticorrelation between the 2-B ion-water (I-W) and water-water (W-W) interactions as well as between the 3-B (I-W-W) and (I-W) interactions. The consideration of two different structural arrangements (ion inside and outside of a water cluster) suggests that fully solvated (ion inside) chaotropes disrupt the hydrogen bonding network in a similar manner as partially solvated (ion outside) kosmotropes and offer useful insights into the modeling requirements of bulk vs. an interface. Finally, the 2-B contribution to the total Basis Set Superposition Error (BSSE) correction for the kosmotropic and chaotropic ions follows the previously reported erf profile vs. intermolecular distance. When scaled for the corresponding dimer energies and distances, a single profile fits the current results together with all previously reported ones for the pure water and halide water clusters.

Herman, Kristina M.↗
DOE OSTI2024

Geometry-aware training of factorized layers in tensor Tucker format

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during train and inference of large networks. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format and parameterizes it as the product of two rank-r matrices. However, this family of approaches often requires an initial full-model warm-up phase, prior knowledge of a feasible rank, and it is sensitive to parameter initialization.In this work, we introduce a novel approach to train the factors of a Tucker decomposition of the weight tensors. Our training proposal proves to be optimal in locally approximating the original unfactorized dynamics and stable for the initialization. Furthermore, the rank of each mode is dynamically updated during training.We provide a theoretical analysis of the algorithm, showing convergence, approximation and local descent guarantees. The method's performance is further illustrated through a variety of experiments, showing remarkable training compression rates and comparable or even better performance than the full baseline and alternative layer factorization strategies.

Zangrando, Emanuele [Gran Sasso Science Institute ↗
DOE OSTI2021

Convergence of micro-geochemistry and micro-geomechanics towards understanding proppant shale rock interaction: A Caney shale case study in southern Oklahoma, USA

As a direct outcome of economic development coupled with an increase in population, global energy demand will continue to rise in the coming decades. Although renewable energy sources are increasingly investigated for optimal production, the immediate needs require focus on energy sources that are currently available and reliable, with a minimal environmental impact; the efficient exploration and production of unconventional hydrocarbon resources is bridging the energy needs and energy aspirations, during the current energy transition period. The main challenges are related to the accurate quantification of the critical rock properties that influence production, their heterogeneity and the multiscale driven physico-chemical nature of rock–fluid interactions. A key feature of shale reservoirs is their low permeability due to dominating nanoporosity of the clay-rich matrix. As a means of producing these reservoirs in a cost-effective manner, a prerequisite is creation of hydraulic fracture networks capable of the highest level of continued conductivity. Fracturing fluid chemical design, formation brine geochemical composition, and rock mineralogy all contribute to swelling-induced conductivity damage. The Caney Shale is an organic-rich, often calcareous mudrock. Many studies have examined the impact that clay has on different kinds of shale productivity but there is currently no data reported on the Caney Shale in relation to horizontal drilling; all reported data on the Caney Shale is on vertical wells which are shallow, compared to an emerging play that is at double the depth. Here, in this work we develop geochemical–geomechanical integration of rock properties at micro-and nanoscales that can provide insights into the potential proppant embedment and its mitigation. The novel methodology amalgamates the following: computed X-ray tomography, scanning electron microscopy, energy dispersive spectroscopy, micro-indentation, and Raman spectroscopy techniques. Here, our results show that due to the multiscale heterogeneity in the Caney Shale, these geochemical and structural properties translate into a variation in mechanical properties that will impact interaction between the proppant and the host shale rock.

03 NATURAL GAS↗
DOE OSTI2025

Replace Human Intelligence with Fast and Smart Geometric Reasoning and Graph Neural Network to Accelerate Next Gen ModSim Workflows

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

97 MATHEMATICS AND COMPUTING↗