Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization algorithm”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Parameter Optimization Toolbox for NS-3 network optimization, NS-3 Parameter Optimization Framework [SWR-18-60]

This simulation-based parameter optimization framework is proposed to tune parameters of different types of communication networks using ns-3 to achieve the optimal network performance. It consists of three main components: an ns-3 packet reporting module; a sampler running simulations with all possible parameter sets for the input parameter variables by using a parallel executor at each generation; and a hybrid optimization algorithm for tuning configurable parameters of hybrid designs and application parameter variables. The proposed hybrid metaheuristic optimization algorithm combines an evolutionary algorithm with a gradient descent function to quickly achieve an approximate globally optimum solution. This software is designed to be used in a multi-core processing Linux environment and run over a long duration of time. The execution time varies depending mainly upon the nature of the ns-3 configuration being simulated. This software includes a custom ns-3 QoS measurement application which must be included with the ns-3 source code during installation of the software.

Hasandka, Adarsh↗
DOE OSTI2022

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗
DOE OSTI2020

Using a Genetic Algorithm to Optimize Configurations in a Data-Driven Application

Users of highly-configurable software systems often want to optimize a particular objective such as improving a functional outcome or increasing system performance. One approach is to use an evolutionary algorithm. However, many applications today are data-driven, meaning they depend on inputs or data which can be complex and varied. Hence, a search needs to be run (and re-run) for all inputs, making optimization a heavy-weight and potentially impractical process. In this paper, we explore this issue on a data-driven highly-configurable scientific application. We build an exhaustive database containing 3,000 configurations and 10,000 inputs, leading to almost 100 million records as our oracle, and then run a genetic algorithm individually on each of the 10,000 inputs. We ask if (1) a genetic algorithm can find configurations to improve functional objectives; (2) whether patterns of best configurations over all input data emerge; and (3) if we can we use sampling to approximate the results. We find that the original (default) configuration is best only 34% of the time, while clear patterns emerge of other best configurations. Out of 3,000 possible configurations, only 112 distinct configurations achieve the optimal result at least once across all 10,000 inputs, suggesting the potential for lighter weight optimization approaches. We show that sampling of the input data finds similar patterns at a lower cost.

Sinha, Urjoshi↗
DOE OSTI2022

Particle Swarm Optimisation for group structure optimization for radiotherapy shielding

Neutron transport simulations are ubiquitous in nuclear engineering because they allow one to model experimental systems and render a model platform for easy perturbation of experimental designs. In addition, simulations allow one to gain experimental insight without actually having to go through the trouble of building a physical experiment. Neutron transport simulations can be stochastic or deterministic based. Stochastic neutron transport simulations are typically simulated using the Monte Carlo method and yield very accurate solutions but are computationally expensive, while deterministic methods are typically faster but can be less accurate. Here we focus on optimizing the accuracy of deterministic neutron transport simulations for radiotherapy simulations. Deterministic neutron transport requires discretization of angle, energy, and space to appropriately analyze the system one is trying to model. Discretization of energy is challenging because of the highly variable neutron flux at certain neutron energies. Improper discretization of energy in the transport model can lead to erroneous results and therefore inaccurate interpretations of the solution. In this study, we evaluate Particle Swarm Optimization (PSO) as a mechanism for selecting optimal group structures for radiotherapy shielding. We tested the particle swarm optimization algorithm on radiotherapy shielding problems using Los Alamos National Laboratory's (LANL) main deterministic transport code PARTISN. Results show that the optimized energy group structures generated from the optimization algorithm outperformed LANL's standard energy group structures, and therefore demonstrate utility in using PSO to expedite computation times due to the increased accuracy obtained with a smaller but optimized group structure. (authors)

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Optimal band selection for target detection with a LWIR multispectral imager

Multispectral imaging can offer many benefits in cost, complexity, resolution, size, weight, and power, relative to hyperspectral imaging. When designing a multispectral system, spectral bandpasses can be selected using optimization algorithms configured to maximally separate target detection scores between target and background regions. A hyperspectral image (HSI) can serve as the source of data from which band groupings can be tested for optimality. The output of an adaptive cosine estimator target detection algorithm is used in an objective function. Three optimization algorithms are compared: particle swarm, dual annealing, and differential evolution. A global optimum is also found using a brute force approach on the Livermore Computing Syrah supercomputer. Three materials are investigated: calcite, gypsum, and limestone. This is done for 3-, 4-, and 5-band systems. The data originate from a longwave infrared HSI of a material display board. The optimization algorithms were run 30 times for every scenario. Performance statistics (maximum, minimum, mean, standard deviation, and median) based on the separation values are given. Additional characterization was performed using receiver operator characteristic (ROC) curves and the area under the ROC curve. While good performance was obtained for the three optimization algorithms, the dual annealing algorithm produced the highest and most consistent detection separation scores on average.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

A modular GUI-based program for genetic algorithm-based feedback-assisted wavefront shaping

Abstract We have developed a modular graphical user interface (GUI)-based program for use in genetic algorithm-based feedback-assisted wavefront shaping. The program uses a class-based structure to separate out the universal modules (e.g. GUI, multithreading, optimization algorithms) and hardware-specific modules (e.g. code for different SLMs and cameras). This modular design makes the program easily adaptable to a wide range of lab equipment, while providing easy access to a GUI, multithreading, and three optimization algorithms (phase-stepping, simple genetic, and microgenetic).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗
DOE OSTI2025

Extreme Longitudinal Compression of Optimized Beams for MEV Ultrafast Electron Diffraction (Final Technical Report)

We worked out the design of a high repetition rate MeV energy ultrafast electron diffraction instrument based on the existing Cornell photoinjector, which can readily be applied to the presented findings. This example is a blueprint of other similarly arranged UED setups. Using particle tracking simulations in conjunction with multiobjective genetic algorithm optimization, we explored the smallest bunch lengths, emittance, and probe spot sizes achievable. As two limits, we defined stroboscopic conditions (with single electrons per pulse) and operation with 10 5 electrons per bunch which may be suitable for single-shot diffraction images. In the stroboscopic case, the flexibility provided by the many cavity bunching and acceleration allows for longitudinal phase space linearization without a higher harmonic field, providing sub-fs bunch lengths at the sample. Given low emittance photoemission conditions, these small bunch lengths can be maintained with probe transverse sizes at the single micron (1 μm) scale and below. In the case of 10 5 electrons per pulse, we simulated state-of-the-art 5D brightness conditions: rms bunch lengths of 10 fs with 3-nm normalized emittances, while permitting repetition rates as high as 1.3 GHz. We showed that in conjunction with collimating apertures, a novel focusing scheme achieves very high-quality emittance compensation for the central core of the beam composing 40% of particles, for a resulting beam size of 5 μm (rms). Finally, to aid in the design of new SRF-based ultrafast electron diffraction machines, we simulated the trade-off between the number of cavities used and achievable bunch length and emittance. In the longitudinal dimension, we made use of the fact that MeV UED requires much lower energy than the 15-MeV maxi mum energy of Cornell’s CBETA injector, and we may therefore use several of the SRF cavities for bunch length compression. In practice, we used a genetic optimization algorithm to choose the phases and amplitudes of the cavities appropriately for optimal bunching. In the zero space charge case, we found that bunching and acceleration are distributed across the six cavities in a way that produces a linearizing effect. And we showed that the ultimate bunch length can be limited by time-of-flight differences arising from transverse size and transverse momentum spread. The space charge code developed and used for this development is now permanent part of the Bmad accelerator simulation code and has already contributed to other developments, e.g., for the EIC electron cooler design.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Leveraging prior mean models for faster Bayesian optimization of particle accelerators

Tuning particle accelerators is a challenging and time-consuming task that can be automated and carried out efficiently using suitable optimization algorithms, such as model-based Bayesian optimization techniques. One of the major advantages of Bayesian algorithms is the ability to incorporate prior information about beam physics and historical behavior into the model used to make control decisions. In this work, we examine incorporating prior accelerator physics information into Bayesian optimization algorithms by utilizing fast executing, neural network models trained on simulated or historical datasets as prior mean functions in Gaussian process models. We show that in ideal cases, this technique substantially increases convergence speed to optimal solutions in high-dimensional tuning parameter spaces. Additionally, we demonstrate that even in non-ideal cases, where prior models of beam dynamics do not exactly match experimental conditions, the use of this technique can still enhance convergence speed. Finally, we demonstrate how these methods can be used to improve optimization in practical applications, such as transferring information gained from beam dynamics simulations to online control of the LCLS injector, and transferring knowledge gained from experimental measurements across different operating modes, such as accelerating different ion species at the ATLAS heavy ion accelerator.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Assessing Historical Variability of South Asian Monsoon Lows and Depressions With an Optimized Tracking Algorithm

Abstract Cyclonic low‐pressure systems (LPS) produce abundant rainfall in South Asia, where they are traditionally categorized as monsoon lows, monsoon depressions, and more intense cyclonic storms. The India Meteorological Department (IMD) has tracked monsoon depressions for over a century, finding a large decline in their number in recent decades, but their methods have changed over time and do not include monsoon lows. This study presents a fast, objective algorithm for identifying monsoon LPS and uses it to assess interannual variability and trends in reanalyses. Variables and thresholds used in the algorithm are selected to best match a subjectively analyzed LPS data set while minimizing disagreement between four reanalyses in a training period. The stream function of 850 hPa horizontal wind is found to be optimal in this sense; it is less noisy than vorticity and represents the complete nondivergent wind, even when flow is not geostrophic. Using this algorithm, LPS statistics are computed for five reanalyses, and none show a detectable trend in monsoon depression counts since 1979. Both the Japanese 55‐year Reanalysis (JRA‐55) and the IMD data set show a step‐like reduction in depression counts when they began using geostationary satellite data, in 1979 and 1982, respectively; the 1958–2018 linear trend in JRA‐55, however, is smaller than in the IMD data set, and its error bar includes 0. There are more LPS in seasons with above‐average monsoon rainfall and in La Niña years, but few other large‐scale modes of interannual variability are found to modulate LPS counts, lifetimes, or track length consistently across reanalyses.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Towards Robustness Guarantees for Feedback-Based Optimization

Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the robustness properties have been observed both in simulation and experimental results, the theoretical analysis in the literature is mostly limited to nominal conditions. In this work, we propose a framework to systematically assess the robust stability of feedback-based online optimization algorithms. We leverage tools from monotone operator theory, variational inequalities and classical robust control to obtain tractable numerical tests that guarantee robust convergence properties of online algorithms in feedback with a physical system, even in the presence of disturbances and model uncertainty. The results are illustrated via an academic example and a case study of a power distribution system.

approximation algorithms↗
DOE OSTI2025

Xopt and Badger: a machine learning ecosystem for real-time accelerator control and optimization

Machine learning (ML)-based black-box optimization algorithms have demonstrated significant improvements in accelerator optimization speed, often by orders of magnitude. However, deploying these algorithms in real-time facility control remains challenging due to the specialized expertise and infrastructure required. To bridge this gap, we introduce the Xopt ecosystem, a versatile suite of tools designed to make advanced ML-based optimization accessible to the broader accelerator community. This ecosystem includes Xopt, a modular Python framework that facilitates the integration of ML-based optimization algorithms with arbitrary control problems, and Badger, a graphical user interface built on top of Xopt, which enables seamless deployment of ML algorithms in real-time control systems. The Xopt ecosystem has been successfully applied towards solving challenging real-time control problems at leading international accelerator facilities, including SLAC, LBNL, Argonne, Fermilab, BNL, DESY, and ESRF, demonstrating its effectiveness in real-world optimization tasks. In this presentation, we provide an overview of Xopt’s capabilities and illustrate its impact through case studies from SLAC accelerator facilities including LCLS, LCLS-II, and FACET-II.

Roussel, Ryan [SLAC]↗
DOE OSTI2021

Inference of neutrino flavor evolution through data assimilation and neural differential equations

The evolution of neutrino flavor in dense environments such as core-collapse supernovae and binary compact object mergers constitutes an important and unsolved problem. Its solution has potential implications for the dynamics and heavy-element nucleosynthesis in these environments. In this paper, we build upon recent work to explore inference-based techniques for the estimation of model parameters and neutrino flavor evolution histories. Here, we combine data assimilation, ordinary differential equation solvers, and neural networks to craft an inference approach tailored for nonlinear dynamical systems. Using this architecture, and a simple two-neutrino-beam, two-flavor model, we compare the performances of nine different optimization algorithms and expand upon previous assessments of the efficacy of inference for tackling problems in flavor evolution. We find that employing this new architecture, together with evolutionary optimization algorithms, accurately captures flavor histories in the small-scale model and allows us to quickly explore both model parameters and initial flavor content. In future work we plan to extend these inference techniques to large numbers of neutrinos.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Herbaceous Feedstock 2018 State of Technology Report

The U.S. Department of Energy (DOE) promotes the production of advanced liquid transportation fuels from lignocellulosic biomass by funding fundamental and applied research that advances the state of technology (SOT). As part of its involvement with this mission, Idaho National Laboratory (INL) completes an annual SOT report for biomass feedstock logistics. This report summarizes supply system impacts of Bioenergy Technologies Office (BETO)-funded research and development efforts at INL and elsewhere (such as the High-Tonnage Feedstock Logistics projects (Webb et al. 2013a, Webb et al. 2013b, Webb et al. 2013c, Webb and Sokhansanj 2014, Sokhansanj et al. 2014) that lead to improvements in feedstock supply systems. These include improvements to and observed performance of innovative harvest and collection methods, storage technologies, transportation and handling approaches, and advanced preprocessing technologies. Biomass quality and variability, and the interface between feedstock quality and conversion performance are key drivers in addition to delivered feedstock cost. In this report, we estimate the benefits of R&D improvements to individual supply system unit operations, and present the status of feedstock logistics technology development for converting biomass into biofuels. These analyses are supported by experimental data where possible, and help to align the SOT relative to the cost goals defined in the Multi-Year Program Plan. The 2018 Herbaceous SOT aligned feedstock logistic design with current biorefinery’s design capacity utilized by biochemical conversion platform. Currently biochemical conversion platform utilizes a 725,000 dry ton/year biorefiney design for the techno economic analysis. Hence, feedstock delivered cost in the 2018 Herbaceous SOT is calculated based on biorefinery’s 725,000 dry ton design capacity instead of 800, 000 dry ton capacity utilized in the 2017 Herbaceous SOT. Biomass availabilities in this SOT were updated to year 2018 data from the 2016 Billion-Ton Report (BT16) (DOE 2016a), with the exception of switchgrass, for which the 2018 Herbaceous SOT utilized the 2019 switchgrass availability data from BT16. The BT16 report (DOE 2016a) does not project switchgrass availability in 2018; the soonest switchgrass is available in the BT16 report is 2019. Therefore, availability of switchgrass for this analysis was that projected for 2019. The 2018 Herbaceous SOT incorporates same technologies utilized in the 2017 Herbaceous SOT. However, a sensitivity analysis is performed to understand the impact of variation of process parameters on those technologies on feedstock logistic cost. New R&D data that shows the variations of process parameters affecting process performance is incorporated in the 2018 SOT to measure the variations in delivered feedstock cost. The 2018 Herbaceous SOT has also provided projected delivered feedstock of 2022 design case based on near term technical target under BETO funded R&D project. Finally, updated biorefinery size of 725,000 dry ton/year was incorporated within least-cost formulation model to select optimal siting and depot scales during optimization of the least cost blend. This modification to the optimization algorithm allows the trade-off between the cost of increased supply radius and the savings from selecting biomass from higher producing counties to be assessed. Such optimization has also showed the economic benefit of decentralized depots in comparison to centralized preprocessing co-located with the biorefinery by decoupling the biorefinery and feedstock locations. The 2018 Herbaceous SOT report documents the current modeled cost of a herbaceous feedstock supply system (from harvest to the pretreatment reactor throat, including grower payment) for hydrocarbon fuel production via biochemical conversion, based on equipment and processes now available or potentially available in the near term. The modeled cost also considers both the required quality and the availability of the biomass resources. The 2018 Herbaceous SOT predicts a modeled delivered feedstock cost of $83.67/dry ton (2016$); this is a $0.23/dry ton (2016$) decrease from the 2017 Herbaceous SOT. The modification of biorefinery’s designed capacity and increased projected biomass availability in the same supply shed contributed to this modeled cost reduction. The least-cost formulation model to optimally site and scale local distributed preprocessing depots also contributed to the cost reduction by considering county-level grower payment and distance from the biorefinery as variables in the optimization algorithm. Sensitivity analysis on various process parameters that affect delivered feedstock cost in the 2018 Herbaceous SOT shows that the delivered cost could varies from $80.45-$88.83/dry ton. The top factors that causes such variations are: effective baling rate, bale density, hammer mill throughput, interest rate and storage dry matter loss.

09 BIOMASS FUELS↗
DOE OSTI2024

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗
DOE OSTI2023

Direct stellarator coil optimization for nested magnetic surfaces with precise quasi-symmetry

We present a robust optimization algorithm for the design of electromagnetic coils that generate vacuum magnetic fields with nested flux surfaces and precise quasi-symmetry. The method is based on a bilevel optimization problem, where the outer coil optimization is constrained by a set of inner least squares optimization problems whose solutions describe magnetic surfaces. The outer optimization objective targets coils that generate a field with nested magnetic surfaces and good quasi-symmetry. The inner optimization problems identify magnetic surfaces when they exist, and approximate surfaces in the presence of magnetic islands or chaos. We show that this formulation can be used to heal islands and chaos, thus producing coils that result in magnetic fields with precise quasi-symmetry. We show that the method can be initialized with coils from the traditional two-stage coil design process, as well as coils from a near-axis expansion optimization. We present a numerical example where island chains are healed and quasi-symmetry is optimized up to surfaces with aspect ratio 6. Another numerical example illustrates that the aspect ratio of nested flux surfaces with optimized quasi-symmetry can be decreased from 6 to approximately 4. In conclusion, the last example shows that our approach is robust and a cold-start using coils from a near-axis expansion optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

A Reinforcement Learning Approach to Parameter Selection for Distributed Optimal Power Flow

With the increasing penetration of distributed energy resources, distributed optimization algorithms have attracted significant attention for power systems applications due to their potential for superior scalability, privacy, and robustness to a single point-of-failure. The Alternating Direction Method of Multipliers (ADMM) is a popular distributed optimization algorithm; however, its convergence performance is highly dependent on the selection of penalty parameters, which are usually chosen heuristically. In this work, we use reinforcement learning (RL) to develop an adaptive penalty parameter selection policy for alternating current optimal power flow (ACOPF) problem solved via ADMM with the goal of minimizing the number of iterations until convergence. We train our RL policy using deep Q-learning and show that this policy can result in significantly accelerated convergence (up to a 59% reduction in the number of iterations compared to existing, curvatureinformed penalty parameter selection methods). Furthermore, we show that our RL policy demonstrates promise for generalizability, performing well under unseen loading schemes as well as under unseen losses of lines and generators (up to a 50% reduction in iterations). This work thus provides a proof-of-concept for using RL for parameter selection in ADMM for power systems applications.

alternating current optimal power flow↗
DOE OSTI2022

A modified model parametrization algorithm for solving a special type of heat and mass transfer systems

A new method for solving nonlinear heat and mass transfer design tasks was considered. Systems using the Number of Transfer Units (NTU) method are a special type of mathematical model of heat and mass exchangers. It was observed, that the NTU models in a form of differential-algebraic equations (DAEs) cannot be directly solved with higher values of NTU. The requirements for consistent initial conditions, as well as numerical limitations of DAEs solvers, result, that the solution to the considered design problems that cannot be obtained by a classical direct shooting procedure. To overcome the presented difficulties, the αDAE model optimization algorithm was adjusted for solving NTU-based models. The new approach consists of 3 main steps: 1) task discretization by a multiple-shooting approach, 2) design an appropriate function $f_{NTU}$(α) to effectively influence the variability of the state variables described by dynamical relations, 3) the iterative numerical optimization algorithm for the new parametrized system. Moreover, computations can be performed by a chosen numerical optimization approach, which can be communicated with an available outer procedure for solving differential-algebraic equations. The presented algorithm was implemented and applied to solve the design task with the NTU model of a counter-flow exchanger. Here, the new approach was used to modify the system dynamics to influence the difficulty of the considered problem. Finally, the presented method enabled failure-free numerical computations for the higher values of the NTU parameter.

97 MATHEMATICS AND COMPUTING↗