Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Automatic”

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 253 records · Page 14

Automatic generation of executable communication specifications from parallel applications

Portable parallel benchmarks are widely used and highly effective for (a) the evaluation, analysis and procurement of high-performance computing (HPC) systems and (b) quantifying the potential benefits of porting applications for new hardware platforms. Yet, past techniques to synthetically parameterized hand-coded HPC benchmarks prove insufficient for today's rapidly-evolving scientific codes particularly when subject to multi-scale science modeling or when utilizing domain-specific libraries. To address these problems, this work contributes novel methods to automatically generate highly portable and customizable communication benchmarks from HPC applications. We utilize ScalaTrace, a lossless, yet scalable, parallel application tracing framework to collect selected aspects of the run-time behavior of HPC applications, including communication operations and execution time, while abstracting away the details of the computation proper. We subsequently generate benchmarks with identical run-time behavior from the collected traces. A unique feature of our approach is that we generate benchmarks in CONCEPTUAL, a domain-specific language that enables the expression of sophisticated communication patterns using a rich and easily understandable grammar yet compiles to ordinary C + MPI. Experimental results demonstrate that the generated benchmarks are able to preserve the run-time behavior - including both the communication pattern and the execution time - of the original applications. Such automated benchmark generation is particularly valuable for proprietary, export-controlled, or classified application codes: when supplied to a third party. Our auto-generated benchmarks ensure performance fidelity but without the risks associated with releasing the original code. This ability to automatically generate performance-accurate benchmarks from parallel applications is novel and without any precedence, to our knowledge.

42 ENGINEERING↗

Mining Software Usage with the Automatic Library Tracking Database (ALTD)

Tracking software usage is important for HPC centers, computer vendors, code developers and funding agencies to provide more efficient and targeted software support, and to forecast needs and guide HPC software effort towards the Exascale era. However, accurately tracking software usage on HPC systems has been a challenging task. In this paper, we present a tool called Automatic Library Tracking Database (ALTD) that has been developed and put in production on several Cray systems. The ALTD infrastructure prototype automatically and transparently stores information about libraries linked into an application at compilation time and also the executables launched in a batch job. We will illustrate the usage of libraries, compilers and third party software applications on a system managed by the National Institute for Computational Sciences.

Hadri, Bilel↗

AUTOMATIC LIMIT SURFACE SEARCH FOR PWR TRANSIENTS BY RELAP5-3D/RAVEN CODES

Deterministic safety analysis of nuclear power plants can be improved by applying modern algorithms and codes exploiting machine learning and parallel computing. In this paper we show the application of some of these advanced methodologies for the determination of limit surfaces. A limit surface is an n-dimensional surface describing the plant status, e.g. identifying, as function of selected plant parameters, the boundaries between failed and safe conditions for the core fuel. Using the RELAP5-3D system thermal-hydraulic code coupled to the RAVEN statistical-analysis code, we show how to apply machine-learning algorithms (near-neighbor, support-vector machine, etc.) for determining relevant limit surfaces for PWR station-blackout and loss of offsite power. As a first step, a set of training simulations is run to sample the nuclear power plant responses. Those calculations are used to train a Reduced-Order-Model (ROM), which RAVEN then uses for determining an approximated limit surface. Verification of the guessed limit surface is then automatically performed and calculation is terminated depending by the chosen convergence criteria. The combination of High Performance Computing (HPC) and ROMs allow a remarkable reduction of the time required for the surface determination. RAVEN performs also the automatic data collection of the output of the numerous runs, thus easing the workload of the safety analyst. Finally, using RAVEN “Ensamble Forward” sampling technique, we show how to inform the limit surface calculations with some of the code and input uncertainties.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Automatic tuning of dressed multicell cavities using pressurized balloons

A method and system for automatically tuning hollow structures, can include pressurized balloons located in one or more targeted cells of a hollow structure of a device having a hollow structures and respective cells. A pressurized balloon can be inserted into a targeted cell so as to localize plastic deformation to the targeted cell using prescribed values of global force and balloon pressure. A pair of inflate/deflate rods associated with an independent air supply for the pressurized balloon can inflate or deflate the pressurized balloon without affecting other pressurized balloons. The pair of inflate/deflate rods can be automatically insertable or removable from the hollow structure by controlled motorized motions.

36 MATERIALS SCIENCE↗

Can We Fix It Automatically? Development of Fault Auto-Correction Algorithms for HVAC and Lighting Systems

A fault detection and diagnostics (FDD) tool is a type of energy management and information system designed to continuously identify the presence of faults and efficiency improvement opportunities through a one-way interface to the building automation system and application of automated analytics. Building owners and operators at the leading edge of technology adoption are using FDD tools to enable average whole-building portfolio savings of 8 percent. Although FDD tools can inform building operators of operational faults, currently a manual action is always required to correct faults and generate the associated energy savings. A subset of faults, however, such as biased sensors and manual override, can be addressed automatically, removing the need for operations and maintenance staff intervention. Automating this fault “correction” can significantly increase the savings generated by FDD tools and reduce the reliance on human intervention. Doing so is expected to advance the usability, as well as the technical and economic performance, of FDD technologies. In this paper, we present the development of 10 innovative fault auto-correction algorithms for HVAC and lighting systems. When the auto-correction routine is triggered, it will overwrite the control setpoints or other variables (via BACnet or other protocol) to implement the intended changes. These algorithms are able to automatically correct the faults or improve the operation associated with an incorrectly programmed schedule, override manual control, sensor bias, control hunting, rogue zone, and less aggressive setpoints/setpoints setback. The paper will also discuss the implementation of the auto-correction algorithms in FDD software products.

Lin, Guanjing↗

Particle-image Velocimetry Sensitivity through Automatic Differentiation

A commonly encountered difficulty in modern experimental fluid dynamics experiments is the need for full-flow visualization and measurement; traditional techniques such as hot-wire probes and laser Doppler velocimetry cannot provide such information without difficult scanning procedures. Particle-image velocimetry (PIV) is a measurement technique which can overcome this spatial limitation to provide real-time three-dimensional fluid velocity vectors for an entire plane within the flow, as opposed to a single point that is provided by other measurement techniques. To accomplish this, a PIV system seeds the fluid flow with tracer particles; these must have nearly the same density as that of the fluid and a high drag coefficient to ensure that they follow the fluid flow without deviation. A laser is sent through optics to expand its beam into a sheet which illuminates the plane of interest in the fluid. The particles reflect more light than the fluid, and their image is recorded using a high speed camera. Due to limitations in bandwidth, video cannot be taken fast enough to be useful, and instead pairs of images are captured with a known separation in time. The illuminated particles will move between the two images taken by the camera, and their relative motion can be used to compute the fluid velocity at that point. When a single camera is used, only two-dimensional velocity vectors can be computed, but with the addition of another camera this can be improved to full three-dimensional vectors. The flow's time evolution can be measured by taking series of image pairs and processing each pair to get the velocity field at the time between each image pair. Only the two-dimensional version will be considered in this work. To compute the velocity vectors of the flow, the images are broken up into interrogation regions, usually in a uniform grid. In the most basic PIV algorithm, corresponding regions in the image pairs are cross-correlated to compute the most likely displacement from one image to the next. This is used since the cross correlation will achieve a maximum value when the two interrogation regions line up the best. The location of the peak in the correlation map and scaling information for the optical setup is used to compute the particle displacement from one image to the next. This process is similar to holding two semi-transparent images and moving one until they match as well as possible. Sub-pixel displacements between images can be obtained by fitting a Gaussian function to the correlation peak. Knowing the displacement vector for each set of interrogation regions in the image pair, it is a simple matter to divide by the time gap between the two images to compute the fluid velocity at the point in time and space. Since there are many interrogation regions in each image pair, the velocity field for a sheet is sampled according to the arrangement of the interrogation regions. The sensitivity of the final computed vector to the input images is difficult to compute, and has led most considerations of uncertainty in the PIV field to apply Monte Carlo methods and correlations to quantify the systematic and random errors which result from application of various PIV algorithms. In this work, automatic differentiation (AD) has been used to trace the dependence of velocity vectors computed using the correlation-peak PIV algorithm back to the input values given to an artificial image generator. These initial results form the foundation for continued work in the application of AD to algorithms in PIV. They demonstrate that AD methods can be successfully applied to PIV algorithms without undue complexity. The derivatives of each individual vector with regard to the coefficients of the velocity field used to create the artificial images can be computed and the statistics of them considered collectively, or correlated between each other to quantify the effectiveness of a PIV algorithm. With the initial implementation complete, adding extra algorithms is relatively simple and considerable data can be generated for analysis. It is hoped that application of these methods can lead to improved PIV algorithms which demonstrate better sensitivity to small variations in particle displacement. While these methods can be used as an analysis tool for refinement of new algorithms, computation of actual resultant vector sensitivities to input images' individual pixels is the next logical step of this work. Such information will be analyzed with experimental data to produce a better understanding of how output vectors' uncertainty relates to the actual image pairs, and lead to automatic bad vector removal. (authors)

42 ENGINEERING↗

An expert-systems approach to automatically determining flaw depth within Candu pressure tubes - 221

Delayed Hydride Cracking (DHC) is a crack growth mechanism that occurs in zirconium alloys, including the pressure tubes of CANDU reactors. DHC is caused by hydrogen in solution in zirconium components being diffused to any flaws present, resulting in an increased concentration of hydrogen within these flaws. An increased hydrogen concentration can lead to brittleness, followed by cracking, in high-stress regions of a pressure tube. Regular in-service ultrasonic inspection of CANDU pressure tubes aims to locate and classify any flaws that pose a potential for DHC initiation. A common approach to inspection is the use of a bespoke tool containing multiple ultrasonic transducers to ensure that each point on the pressure tube is inspected from a minimum of three angles during a scan. All flaws from within the inspected pressure tubes must be characterized prior to restarting the reactor, thus the time-consuming analysis process lies on the critical outage path. This process is manually intensive and often requires a significant amount of expert knowledge. A modular system to automatically process outage data to provide decision support to analysts has been developed. This system saves time on the critical outage path while providing repeatable and explicable measurements. Part of the analysis process requires the depth of all flaws to be measured, which is often the most time consuming stage of the analysis process. This paper describes an approach that utilizes captured analysts knowledge to perform automatic flaw depth estimation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Spatiotemporal Automatic Calibration of Infrastructure Lidar, Radar, and Camera with a Global Navigation Satellite System: Preprint

Robust and accurate perception is important for modern intelligent transportation systems (ITS), which use sensors of various modalities for data fusion to create a digital twin of an intersection. Sensor calibration is an important process that creates a unified coordinate frame for the sensor output data so that it can be used for data fusion. Classical approaches for sensor calibration are time-consuming, require an overlapping field of view for feature matching, and are not feasible for ITS application as they cause disruptions in the flow of traffic. In this paper, we present a spatiotemporal automatic calibration approach to calibrate multiple infrastructure lidar, radar, and cameras installed at a traffic intersection. The approach uses global navigation satellite system (GNSS) positioning information shared by connected vehicles, and when the vehicle is detected by the sensor, we match the sensor detections with the GNSS coordinates. The proposed algorithm is evaluated with a real-world dataset utilizing detections from two radars, cameras, and lidars with a test vehicle instrumented with a post-processing kinematic (PPK)-corrected GNSS driving past the sensors installed at a four-way traffic intersection. The experimental results show that the proposed automatic calibration approach can achieve the transformation with a root mean squared error of less than 0.5 for radar and lidar and less than 2 for camera detections. The ability to rapidly calibrate sensors not only benefits initial installations, but can also be used for system health monitoring, while utilizing available connected vehicle data to test the real-time sensor fidelity and operational status.

ADVANCED PROPULSION SYSTEMS↗

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗

Identifying Software Usage at HPC Centers with the Automatic Library Tracking Database

A library tracking database has been developed to monitor software/library usage. This Automatic Library Tracking Database (ALTD) automatically and transparently stores, into a database, information about the libraries linked into an application at compilation time and also the executables launched in a batch job. Information gathered into the database can then be mined to provide reports. Analyzing the results from the data collected will help to identify, for example, the most frequently used and the least used libraries and codes, and those users that are using deprecated libraries or applications. We will illustrate the usage of libraries and executables on the Cray XT platforms hosted at the National Institute for Computational Sciences and the Oak Ridge Leadership Computing Facility (both located at Oak Ridge National Laboratory).

99 GENERAL AND MISCELLANEOUS↗

Global optimization of data quality checks on 2-D and 3-D networks of GPR cross-well tomographic data for automatic correction of unknown well deviations

Significant errors related to poor time zero estimation, well deviation or mislocation of the transmitter (TX) and receiver (RX) stations can render even the most sophisticated modeling and inversion routine useless. Previous examples of methods for the analysis and correction of data errors in geophysical tomography include the works of Maurer and Green (1997), Squires et al. (1992) and Peterson (2001). Here we follow the analysis and techniques of Peterson (2001) for data quality control and error correction. Through our data acquisition and quality control procedures we have very accurate control on the surface locations of wells, the travel distance of both the transmitter and receiver within the boreholes, and the change in apparent zero time. However, we often have poor control on well deviations, either because of economic constraints or the nature of the borehole itself prevented the acquisition of well deviation logs. Also, well deviation logs can sometimes have significant errors. Problems with borehole deviations can be diagnosed prior to inversion of travel-time tomography data sets by plotting the apparent velocity of a straight ray connecting a transmitter (TX) to a receiver (RX) against the take-off angle of the ray. Issues with the time-zero pick or distances between wells appear as symmetric smiles or frown in these QC plots. Well deviation or dipping-strong anisotropy will result in an asymmetric correlation between apparent velocity and take-off angle (Figure 1-B). In addition, when a network of interconnected GPR tomography data is available, one has the additional quality constraint of insuring that there is continuity in velocity between immediately adjacent tomograms. A sudden shift in the mean velocity indicates that either position deviations are present or there is a shift in the pick times. Small errors in well geometry may be effectively treated during inversion by including weighting, or relaxation, parameters into the inversion (e.g. Bautu et al., 2006). In the technique of algebraic reconstruction tomography (ART), which is used herein for the travel time inversion (Peterson et al., 1985), a small relaxation parameter will smooth imaging artifacts caused by data errors at the expense of resolution and contrast (Figure 2). However, large data errors such as unaccounted well deviations cannot be adequately suppressed through inversion weighting schemes. Previously, problems with tomograms were treated manually. However, in large data sets and/or networks of data sets, trial and error changes to well geometries become increasingly difficult and ineffective. Mislocation of the transmitter and receiver stations of GPR cross-well tomography data sets can lead to serious imaging artifacts if not accounted for prior to inversion. Previously, problems with tomograms have been treated manually prior to inversion. In large data sets and/or networks of tomographic data sets, trial and error changes to well geometries become increasingly difficult and ineffective. Our approach is to use cross-well data quality checks and a simplified model of borehole deviation with particle swarm optimization (PSO) to automatically correct for source and receiver locations prior to tomographic inversion. We present a simple model of well deviation, which is designed to minimize potential corruption of actual data trends. We also provide quantitative quality control measures based on minimizing correlations between take-off angle and apparent velocity, and a quality check on the continuity of velocity between adjacent wells. This methodology is shown to be accurate and robust for simple 2-D synthetic test cases. Plus, we demonstrate the method on actual field data where it is compared to deviation logs. This study shows the promise for automatic correction of well deviations in GPR tomographic data. Analysis of synthetic data shows that very precise estimates of well deviation can be made for small deviations, even in the presence of static data errors. However, the analysis of the synthetic data and the application of the method to a large network of field data show that the technique is sensitive to data errors varying between neighboring tomograms.

54 ENVIRONMENTAL SCIENCES↗

Automatically adaptive stabilized finite elements and continuation analysis for compaction banding in geomaterials

Under compressive creep, viscoplastic solids experiencing internal mass transfer processes can accommodate singular cnoidal wave solutions as material instabilities at the stationary wave limit. These instabilities appear when the loading rate is significantly faster than the material's capacity to diffusive internal perturbations, leading to localized failure features (e.g., cracks and compaction bands). These cnoidal waves, generally found in fluids, have strong nonlinearities that produce periodic patterns. Due to the singular nature of the solutions, the applicability of the theory is currently limited. Additionally, practical simulation tools require proper regularization to overcome the challenges that singularity induces. We focus on the numerical treatment of the governing equation using a nonlinear approach building on a recent adaptive stabilized finite element method. This automatic refinement method provides an error estimate that drives mesh adaptivity, a crucial feature for the problem at hand. We compare the performance of this adaptive strategy against analytical and standard finite element solutions. We then investigate the sensitivity of the diffusivity ratio, the parameter controlling the process, and identify multiple possible solutions with several stress peaks. We also show the evolution of the spacing between peaks for all solutions as a function of that parameter.

42 ENGINEERING↗

Calibration of elastoplastic constitutive model parameters from full-field data with automatic differentiation-based sensitivities

Here, we present a framework for calibration of parameters in elastoplastic constitutive models that is based on the use of automatic differentiation (AD). The model calibration problem is posed as a partial differential equation-constrained optimization problem where a finite element (FE) model of the coupled equilibrium equation and constitutive model evolution equations serves as the constraint. The objective function quantifies the mismatch between the displacement predicted by the FE model and full-field digital image correlation data, and the optimization problem is solved using gradient-based optimization algorithms. Forward and adjoint sensitivities are used to compute the gradient at considerably less cost than its calculation from finite difference approximations. Through the use of AD, we need only to write the constraints in terms of AD objects, where all of the derivatives required for the forward and inverse problems are obtained by appropriately seeding and evaluating these quantities. We present three numerical examples that verify the correctness of the gradient, demonstrate the AD approach's parallel computation capabilities via application to a large-scale FE model, and highlight the formulation's ease of extensibility to other classes of constitutive models.

42 ENGINEERING↗

Fitting Matérn smoothness parameters using automatic differentiation

The Mat$\acute{e}$rn covariance function is ubiquitous in the application of Gaussian processes to spatial statistics and beyond. Perhaps the most important reason for this is that the smoothness parameter $\nu$ gives complete control over the mean-square differentiability of the process, which has significant implications for the behavior of estimated quantities such as interpolants and forecasts. Unfortunately, derivatives of the Mat$\acute{e}$rn covariance function with respect to $\nu$ require derivatives of the modified second-kind Bessel function $K$ $\nu$ with respect to $\nu$. While closed form expressions of these derivatives do exist, they are prohibitively difficult and expensive to compute. For this reason, many software packages require fixing $\nu$ as opposed to estimating it, and all existing software packages that attempt to offer the functionality of estimating $\nu$ use finite difference estimates for $\partial$ $\nu$ $K$ $\nu$ . In this work, we introduce a new implementation of $K$$\nu$ that has been designed to provide derivatives via automatic differentiation (AD), and whose resulting derivatives are significantly faster and more accurate than those computed using finite differences. Here, we provide comprehensive testing for both speed and accuracy and show that our AD solution can be used to build accurate Hessian matrices for second-order maximum likelihood estimation in settings where Hessians built with finite difference approximations completely fail.

97 MATHEMATICS AND COMPUTING↗

Slow Dynamics Model of Compressed Air Energy Storage and Battery Storage Technologies for Automatic Generation Control

Increasing variable generation penetration and the consequent increase in short-term variability makes energy storage technologies look attractive, especially in the ancillary market for providing frequency regulation services. This paper presents slow dynamics model for compressed air energy storage and battery storage technologies that can be used in automatic generation control studies to assess the system frequency response and quantify the benefits from storage technologies in providing regulation service. The paper also represents the slow dynamics model of the power system integrated with storage technologies in a complete state space form. The storage technologies have been integrated to the IEEE 24 bus system with single area, and a comparative study of various solution strategies including transmission enhancement and combustion turbine have been performed in terms of generation cycling and frequency response performance metrics.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient sensitivity analysis of the thermal profile in powder bed fusion of metals using hypercomplex automatic differentiation finite element method

Rapid cyclic temperature fluctuation occurring in powder bed fusion of metals using a laser beam (PBF-LB/M) influences the formation of flaws in printed parts. Consequently, there is a pressing need to enhance the quality of printed parts by developing innovative methodologies that can predict thermal histories and help uncover the intricate relationships between process parameters and thermal profiles. Sensitivity Analysis (SA) emerges as an essential tool for this, offering the potential for process optimization and enhanced quality control. Nonetheless, conventional SA methodologies often incur in excessive computational costs and potential numerical approximation errors. Here, to address this technical challenge, we present a novel method for SA that integrates the HYPercomplex-based Automatic Differentiation (HYPAD) technique with transient thermal simulations conducted via the finite element method (FEM). Leveraging this methodology, we efficiently and accurately perform SA for PBF-LB/M processes in a post-processing step. Compared to traditional methods like Finite Differences (FD), HYPAD-FEM required 96 % less computational time for obtaining sensitivities for 22 process parameters, under a comparative study conducted within the context of the 2018–02 AM benchmark of the National Institute of Standards and Technology. In summary, HYPAD-FEM offers superior efficiency and accuracy in SA over conventional methods, delivering the best sensitivity of a model without the need for step-size selection and problem or parameter-based implementations.

36 MATERIALS SCIENCE↗

A workflow for automatic generation and efficient refinement of individual pressure-dependent networks

Manual chemical kinetic model construction often requires modelists to at least implicitly guess all possible decay pathways and their relative fluxes for all important species. We present a workflow and associated tool for automatic generation and re finement of pressure-dependent networks that should enable modelists to efficiently and comprehensively identify decay pathways and estimate respective parameters for chemical species. This tool combines the capabilities of the Reaction Mechanism Generator (RMG) software to generate possible reaction paths, determine thermochemistry, approximate rate coefficients and estimate frequencies with the capabilities of the Arkane software to use quantum chemical parameters to compute thermochemistry and pressure dependent rates. A flux-based algorithm is used to decide which isomers to add to the network. Isomers added to the network are reacted to form other channels. When enough of the flux is accounted for by the isomers and bimolecular product channels, the generation process terminates to yield a comprehensive network. Network sensitivity analysis is applied to the network to identify the most important wells and barriers that can be refined using quantum chemistry calculations. Iterative refinement can then be used to achieve accuracy. The comprehensive network can be easily reduced using energy and flux-based algorithms to the most important channels and isomers in the network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Rapid multiphase-field model development using a modular free energy based approach with automatic differentiation in MOOSE/MARMOT

In this paper, we present a novel rapid phase-field model development capability using a modular free energy based approach in the finite element based MOOSE framework. The phase-field equations are implemented in a general form as separate code form the model specific data such as the thermodynamic free energy density and mobility functions. This isolates researchers from complicated code and allows them to focus on implementing new material models. In addition, using a native symbolic differentiation algorithm, all required derivatives of the free energy density are automatically determined, removing sources for potential human error, and guaranteeing optimally preconditioned equation systems through fully populated Jacobian matrices. Free energy terms contributing to a phase-field model are abstracted into self contained objects that can be combined at will at simulation run time. Combining multiple chemical and mechanical free energy contributions allows the construction of coupled phase-field, mechanics, and multiphase models. Through just-in-time compilation, we greatly reduce the computational time required to evaluate the differentiated expressions. Lastly, we demonstrate the new capability on a variety of example simulations.

97 MATHEMATICS AND COMPUTING↗