Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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 1,513 records · Page 84
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Direct implicit and explicit energy-conserving particle-in-cell methods for modeling of capacitively coupled plasma devices

Achieving large-scale kinetic modeling is a crucial task for the development and optimization of modern plasma devices. With the trend of decreasing pressure in applications, such as plasma etching, kinetic simulations are necessary to self-consistently capture the particle dynamics. The standard, explicit, electrostatic, momentum-conserving particle-in-cell method suffers from restrictive stability constraints on spatial cell size and temporal time step, requiring resolution of the electron Debye length and electron plasma period, respectively. This results in a very high computational cost, making the technique prohibitive for large volume device modeling. We investigate the direct implicit algorithm and the explicit energy conserving algorithm as alternatives to the standard approach, both of which can reduce computational cost with a minimal (or controllable) impact on results. These algorithms are implemented into the well-tested EDIPIC-2D and LTP-PIC codes, and their performance is evaluated via 2D capacitively coupled plasma discharge simulations. The investigation reveals that both approaches enable the utilization of cell sizes larger than the Debye length, resulting in a reduced runtime, while incurring only minor inaccuracies in plasma parameters. The direct implicit method also allows for time steps larger than the electron plasma period; however, care must be taken to avoid numerical heating or cooling. It is demonstrated that by appropriately adjusting the ratio of cell size to time step, it is possible to mitigate this effect to an acceptable level.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Adaptive mesh refinement in binary black holes simulations

Abstract We discuss refinement criteria for the Berger–Rigoutsos (block-based) refinement algorithm in our numerical relativity code GR-Athena++ in the context of binary black hole (BBH) merger simulations. We compare three different strategies: the ‘box-in-box’ approach, the ‘sphere-in-sphere’ approach and a local criterion for refinement based on the estimation of truncation error of the finite difference scheme. We extract and compare gravitational waveforms using the three different mesh refinement methods and compare their accuracy against a calibration waveform and demonstrate that the sphere-in-sphere approach provides the best strategy overall when considering computational cost and the waveform accuracy. Ultimately, we demonstrate the capability of each mesh refinement method in accurately simulating gravitational waves from BBH systems—a crucial aspect for their application in next-generation detectors. We quantify the mismatch achievable with the different strategies by extrapolating the gravitational wave mismatch to higher resolution.

Astronomy & Astrophysics↗
DOE OSTI2024

Building spatial symmetries into parameterized quantum circuits for faster training

Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e. the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuitstructure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

DECREASING COMPUTING TIME WITH SYMPLECTIC CORRECTORS IN ADAPTIVE TIMESTEPPING ROUTINES

It has previously been shown that varying the numerical timestep during a symplectic orbital integration leads to a random walk in energy and angular momentum, destroying the phase space-conserving property of symplectic integrators. Here we show that when altering the timestep symplectic correctors can be used to reduce this error to a negligible level. Furthermore, these correctors can also be employed to avoid a large error introduction when changing the Hamiltonian's partitioning. We have constructed a numerical integrator using this technique that is nearly as accurate as widely used fixed-step routines. In addition, our algorithm is drastically faster for integrations of highly eccentricitic, large semimajor axis orbits, such as those found in the Oort Cloud.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Muon Tracing and Image Reconstruction Algorithms for Cosmic Ray Muon Computed Tomography

Cosmic ray muon-computed tomography (μCT) is a new imaging modality with unique characteristics that could be particularly important for diverse applications including nuclear nonproliferation, spent nuclear fuel monitoring, cargo scanning, and volcano imaging. The strong scattering dependence of muons on atomic number Z in combination with high penetration range could offer a significant advantage over existing techniques when dense, shielded containers must be imaged. However, μCT reconstruction using conventional filtered back-projection is limited due to the overly simple assumptions that do not consider the curved path caused by multiple Coulomb scattering prompting the need for more sophisticated approaches to be developed. Here, we argue that the use of improved muon tracing and scattering angle projection algorithms as well as an algebraic reconstruction technique should produce muon tomographic images with improved quality–or require fewer muons to produce the same image quality–compared to the case where conventional methods are used. We report on the development and assessment of three novel muon tracing methods and two scattering angle projection methods for μCT. Simulated dry storage casks with single and partial missing fuel assemblies were used as numerical examples to assess and compare the proposed methods. The reconstructed images showed an expected improvement in image quality when compared with conventional techniques, even without muon momentum information, which should lead to improved detection capability, even for partial defects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Streaming Compression of Scientific Data via Weak-SINDy

Here, in this paper, a streaming weak-SINDy algorithm is developed specifically for compressing streaming scientific data. The production of scientific data, either via simulation or experiments, is undergoing a stage of exponential growth, which makes data compression important and often necessary for storing and utilizing large scientific data sets. As opposed to classical “offline” compression algorithms that perform compression on a readily available data set, streaming compression algorithms compress data “online” while the data generated from simulation or experiments is still flowing through the system. This feature makes streaming compression algorithms well suited for scientific data compression, where storing the full data set offline is often infeasible. This work proposes a new streaming compression algorithm, streaming weak-SINDy, which takes advantage of the underlying data characteristics during compression. The streaming weak-SINDy algorithm constructs feature matrices and target vectors in the online stage via a streaming integration method in a memory efficient manner. The feature matrices and target vectors are then used in the offline stage to build a model through a regression process that aims to recover equations that govern the evolution of the data. For compressing high-dimensional streaming data, we adopt a streaming proper orthogonal decomposition (POD) process to reduce the data dimension and then use the streaming weak-SINDy algorithm to compress the temporal data of the POD expansion. We propose modifications to the streaming weak-SINDy algorithm to accommodate the dynamically updated POD basis. By combining the built model from the streaming weak-SINDy algorithm and a small amount of data samples, the full data flow could be reconstructed accurately at a low memory cost, as shown in the numerical tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Efficient numerical method for evaluating normal and anomalous time-domain equilibrium Green's functions in inhomogeneous systems

In this work we develop EPOCH (equilibrium propagator by orthogonal polynomial chain), a computationally efficient method to calculate the time-dependent equilibrium Green's functions, including the anomalous Green's functions of superconductors, to capture the time evolution in large inhomogeneous systems. The EPOCH method generalizes the Chebyshev wave-packet propagation method from quantum chemistry and efficiently incorporates the Fermi-Dirac statistics that is needed for equilibrium quantum condensed matter systems. The computational cost of EPOCH scales only linearly in the system degrees of freedom, generating an extremely efficient algorithm also for very large systems. We demonstrate the power of the EPOCH method by calculating the time evolution of an excitation near a superconductor–normal metal interface in two and three dimensions, capturing transmission as well as normal and Andreev reflections.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2015

Modelling radionuclide transport in fractured media with a dynamic update of K d values

Radionuclide transport in fractured crystalline rocks is a process of interest in evaluating long term safety of potential disposal systems for radioactive wastes. Given their numerical efficiency and the absence of numerical dispersion, Lagrangian methods (e.g. particle tracking algorithms) are appealing approaches that are often used in safety assessment (SA) analyses. In these approaches, many complex geochemical retention processes are typically lumped into a single parameter: the distribution coefficient (Kd). Usually, the distribution coefficient is assumed to be constant over the time frame of interest. However, this assumption could be critical under long-term geochemical changes as it is demonstrated that the distribution coefficient depends on the background chemical conditions (e.g. pH, Eh, and major chemistry). In this study, we provide a computational framework that combines the efficiency of Lagrangian methods with a sound and explicit description of the geochemical changes of the site and their influence on the radionuclide retention properties.

58 GEOSCIENCES↗
DOE OSTI2023

Efficient Optimization of Energy Recovery From Geothermal Reservoirs With Recurrent Neural Network Predictive Models

Improving the long-term energy production performance of geothermal reservoirs can be accomplished by optimizing field development and management plans. Reliable prediction models, however, are needed to evaluate and optimize the performance of the underlying reservoirs under various operation and development strategies. In traditional frameworks, physics-based simulation models are used to predict the energy production performance of geothermal reservoirs. However, detailed simulation models are not trivial to construct, require a reliable description of the reservoir conditions and properties, and entail high computational complexity. Data-driven predictive models can offer an efficient alternative for use in optimization workflows. This paper presents an optimization framework for net power generation in geothermal reservoirs using a variant of the recurrent neural network (RNN) as a data-driven predictive model. The RNN architecture is developed and trained to replace the simulation model for computationally efficient prediction of the objective function and its gradients with respect to the well control variables. The net power generation performance of the field is optimized by automatically adjusting the mass flow rate of production and injection wells over 12 years, using a gradient-based local search algorithm. Two field-scale examples are presented to investigate the performance of the developed data-driven prediction and optimization framework. Furthermore, the prediction and optimization results from the RNN model are evaluated through comparison with the results obtained by using a numerical simulation model of a real geothermal reservoir.

15 GEOTHERMAL ENERGY↗
DOE OSTI2016

A Public-Private-Acadmic Partnership to Advance Solar Power Forecasting

The National Center for Atmospheric Research (NCAR) is pleased to have led a partnership to advance the state-of-the-science of solar power forecasting by designing, developing, building, deploying, testing, and assessing the SunCast™ Solar Power Forecasting System. The project has included cutting edge research, testing in several geographically- and climatologically-diverse high penetration solar utilities and Independent System Operators (ISOs), and wide dissemination of the research results to raise the bar on solar power forecasting technology. The partners include three other national laboratories, six universities, and industry partners. This public-private-academic team has worked in concert to perform use-inspired research to advance solar power forecasting through cutting-edge research to advance both the necessary forecasting technologies and the metrics for evaluating them. The project has culminated in a year-long, full-scale demonstration of provide irradiance and power forecasts to utilities and ISOs to use in their operations. The project focused on providing elements of a value chain, beginning with the weather that causes a deviation from clear sky irradiance and progresses through monitoring and observations, modeling, forecasting, dissemination and communication of the forecasts, interpretation of the forecast, and through decision-making, which produces outcomes that have an economic value. The system has been evaluated using metrics developed specifically for this project, which has provided rich information on model and system performance. Research was accomplished on the very short range (0-6 hours) Nowcasting system as well as on the longer term (6-72 hour) forecasting system. The shortest range forecasts are based on observations in the field. The shortest range system, built by Brookhaven National Laboratory (BNL) and based on Total Sky Imagers (TSIs) is TSICast, which operates on the shortest time scale with a latency of only a few minutes and forecasts that currently go out to about 15 min. This project has facilitated research in improving the hardware and software so that the new high definition cameras deployed at multiple nearby locations allow discernment of the clouds at varying levels and advection according to the winds observed at those levels. Improvements over “smart persistence” are about 29% for even these very short forecasts. StatCast is based on pyranometer data measured at the site as well as concurrent meteorological observations and forecasts. StatCast is based on regime-dependent artificial intelligence forecasting techniques and has been shown to improve on “smart persistence” forecasts by 15-50%. A second category of short-range forecasting systems employ satellite imagery and use that information to discern clouds and their motion, allowing them to project the clouds, and the resulting blockage of irradiance, in time. CIRACast (the system produced by the Cooperative Institute for Atmospheric Research [CIRA] at Colorado State University) was already one of the more advanced cloud motion systems, which is the reason that team was brought to this project. During the project timeframe, the CIRA team was able to advance cloud shadowing, parallax removal, and implementation of better advecting winds at different altitudes. CIRACast shows generally a 25-40% improvement over Smart Persistence between sunrise and approximately 1600 UTC (Coordinated Universal Time) . A second satellite-based system, MADCast (Multi-sensor Advective Diffusive foreCast system), assimilates data from multiple satellite imagers and profilers to assimilate a fully three-dimensional picture of the cloud into the dynamic core of WRF. During 2015, MADCast (provided at least 70% improvement over Smart Persistence, with most of that skill being derived during partly cloudy conditions. That allows advection of the clouds via the Weather Research and Forecasting (WRF) model dynamics directly. After WRF-Solar™ showed initial success, it was also deployed in nowcasting mode with coarser runs out to 6 hours made hourly. It provided improvements on the order of 50-60% over Smart Persistence for forecasts up to 1600 UTC. The advantages of WRF-Solar-Nowcasting and MADCast were then blended to develop the new MAD-WRF model that incorporates the most important features of each of those models, both assimilating satellite cloud fields and using WRF-So far physics to develop and dissipate clouds. MAE improvements for MAD-WRF for forecasts from 3-6 hours are improved over WRF-Solar-Now by 20%. While all the Nowcasting system components by themselves provide improvement over Smart Persistence, the largest benefit is derived when they are smartly blended together by the Nowcasting Integrator to produce an integrated forecast. The development of WRF-Solar™ under this project has provided the first numerical weather prediction (NWP) model specifically designed to meet the needs of irradiance forecasting. The first augmentation improved the solar tracking algorithm to account for deviations associated with the eccentricity of the Earth’s orbit and the obliquity of the Earth. Second, WRF-Solar™ added the direct normal irradiance (DNI) and diffuse (DIF) components from the radiation parameterization to the model output. Third, efficient parameterizations were implemented to either interpolate the irradiance in between calls to the expensive radiative transfer parameterization, or to use a fast radiative transfer code that avoids computing three-dimensional heating rates but provides the surface irradiance. Fourth, a new parameterization was developed to improve the representation of absorption and scattering of radiation by aerosols (aerosol direct effect). A fifth advance is that the aerosols now interact with the cloud microphysics, altering the cloud evolution and radiative properties, an effect that has been traditionally only implemented in atmospheric computationally costly chemistry models. A sixth development accounts for the feedbacks that sub-grid scale clouds produce in shortwave irradiance as implemented in a shallow cumulus parameterization Finally, WRF-Solar™ also allows assimilation of infrared irradiances from satellites to determine the three dimensional cloud field, allowing for an improved initialization of the cloud field that increases the performance of short-range forecasts. We find that WRF-Solar™ can improve clear sky irradiance prediction by 15-80% over a standard version of WRF, depending on location and cloud conditions. In a formal comparison to the NAM baseline, WRF-Solar™ showed improvements in the Day-Ahead forecast of 22-42%. The SunCast™ system requires substantial software engineering to blend all of the new model components as well as existing publically available NWP model runs. To do this we use an expert system for the Nowcasting blender and the Dynamic Integrated foreCast (DICast®) system for the NWP models. These two systems are then blended, we use an empirical power conversion method to convert the irradiance predictions to power, then apply an analog ensemble (AnEn) approach to further tune the forecast as well as to estimate its uncertainty. The AnEn module decreased RMSE (root mean squared error) by 17% over the blended SunCast™ power forecasts and provided skill in the probabilistic forecast with a Brier Skill Score of 0.55. In addition, we have also developed a Gridded Atmospheric Forecast System (GRAFS) in parallel, leveraging cost share funds. An economic evaluation based on Production Cost Modeling in the Public Service Company of Colorado showed that the observed 50% improvement in forecast accuracy will save their customers $819,200 with the projected MW deployment for 2024. Using econometrics, NCAR has scaled this savings to a national level and shown that an annual expected savings for this 50% forecast error reduction ranges from $11M in 2015 to $43M expected in 2040 with increased solar deployment. This amounts to a $455M discounted savings over the 26 year period of analysis.

14 SOLAR ENERGY↗
DOE OSTI2017

Self-learning Monte Carlo method: Continuous-time algorithm

The recently introduced self-learning Monte Carlo method is a general-purpose numerical method that speeds up Monte Carlo simulations by training an effective model to propose uncorrelated configurations in the Markov chain. We implement this method in the framework of a continuous-time Monte Carlo method with an auxiliary field in quantum impurity models. We introduce and train a diagram generating function (DGF) to model the probability distribution of auxiliary field configurations in continuous imaginary time, at all orders of diagrammatic expansion. Furthermore, by using DGF to propose global moves in configuration space, we show that the self-learning continuous-time Monte Carlo method can significantly reduce the computational complexity of the simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Field Dislocation Mechanics for heterogeneous elastic materials: A numerical spectral approach

Spectral methods using Fast Fourier Transform (FFT) algorithms have recently seen a surge in interest in the mechanics of materials community. The present work addresses the critical question of determining accurate local mechanical fields using FFT methods without artificial fluctuations arising from materials and defects induced discontinuities. Precisely, this work introduces a numerical approach based on intrinsic discrete Fourier transforms for the simultaneous treatment of material discontinuities arising from the presence of dislocations and from elastic stiffness heterogeneities. To this end, the elasto-static equations of the field dislocation mechanics theory for periodic heterogeneous materials are numerically solved with FFT in the case of dislocations in proximity of inclusions of varying stiffness. An optimal intrinsic discrete Fourier transform method is sought based on two distinct schemes. A centered finite difference scheme for differential rules are used for numerically solving the Poisson-type equation in the Fourier space, while centered finite differences on a rotated grid is chosen for the computation of the modified Fourier–Green’s operator associated with the Lippmann–Schwinger-type equation. By comparing different methods with analytical solutions for an edge dislocation in a composite material, it is found that the present spectral method is accurate, devoid of any numerical oscillation, and efficient even for an infinite phase elastic contrast like a hole embedded in a matrix containing a dislocation. The present FFT method is then used to simulate physical cases such as the elastic fields of dislocation dipoles located near the matrix/inclusion interface in a 2D composite material and the ones due to dislocation loop distributions surrounding cubic inclusions in 3D composite material. In these configurations, the spectral method allows investigating accurately the elastic interactions and image stresses due to dislocation fields in the presence of elastic inhomogeneities.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A weighted state redistribution algorithm for embedded boundary grids

State redistribution is an algorithm that stabilizes cut cells for embedded boundary grid methods. This work extends the earlier algorithm in several important ways. First, state redistribution is extended to three spatial dimensions. Second, we discuss several algorithmic changes and improvements motivated by the more complicated cut cell geometries that can occur in higher dimensions. In particular, we introduce a weighted version with less dissipation in an easily generalizable framework. Third, we demonstrate that state redistribution can also stabilize a solution update that includes both advective and diffusive contributions. Notably, the stabilization algorithm is shown to be effective for incompressible as well as compressible reacting flows. Finally, we discuss the implementation of the algorithm for several exascale-ready simulation codes based on AMReX, demonstrating ease of use in combination with domain decomposition, hybrid parallelism and complex physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

An adaptive Kriging surrogate method for efficient uncertainty quantification with an application to geological carbon sequestration modeling

We present that in numerical modeling of geological carbon sequestration (GCS), uncertainty quantification (UQ) is usually needed to evaluate the impact of uncertain model parameters on model predictions caused by limited measurements and incomplete knowledge of the parameters. However, UQ for GCS is computationally expensive due to the large ensemble of complex and lengthy model simulations. In this study, we propose an adaptive Kriging method to build a fast-to-evaluate surrogate of the GCS model to alleviate the heavy computational burden. The surrogate model is efficiently generated using a Taylor expansion-based adaptive experimental design algorithm that combines a distance-based exploration criterion and an exploitation criterion to adaptively search for informative training samples. In addition, we analyze the uncertainty brought by substituting the surrogate for the actual simulation model and explore its influence on UQ results. Lastly, our method is demonstrated in a synthetic GCS model and its performance is evaluated in comparison with the conventional Monte Carlo sampling. Results indicate that our method can greatly improve the computational efficiency in UQ and provide an effective and reliable UQ solution with the consideration of surrogate uncertainty.

58 GEOSCIENCES↗
DOE OSTI2022

Numerical modeling based machine learning approach for the optimization of falling - film evaporator in thermal desalination application

Scale formation that drastically increases thermal resistance and reduces freshwater production remains a critical challenge in thermal desalination. Novel designs of falling film evaporator and optimal operating condition hold great promise to mitigate scale formation, and increase heat transfer performance and fresh water production. In this work, CFD simulation based machine learning and multi-objective optimization are performed to identify optimal conditions and tube arrangement for evaporator. Non-dominated sorting genetic algorithm is adopted to determine and analyze the optimal pareto front for multiple objectives in desalination criteria. The errors of training, validation, and testing set are computed to identify an optimal hyperparameter set. For performance ratio, fouling resistance, and water production rate, the average relative error is 2.26%, 3.67%, and 3.24%. At pareto front, both performance ratio and water production rate increase at high temperature with fouling resistance (thermal resistance of the fouling layer) increasing as well. Tradeoffs between mitigating scale formation and enhancing desalination performance are evaluated in optimizations for different objectives. Finally, potential optima are identified and can be applied as guidelines to determine evaporator design and system operating conditions.

42 ENGINEERING↗
DOE OSTI2016

Fourier-spectral element approximation of the ion–electron Braginskii system with application to tokamak edge plasma in divertor configuration

Due to the extreme conditions required to produce energy by nuclear fusion in tokamaks, simulating the plasma behavior is an important but challenging task. We focus on the edge part of the plasma, where fluid approaches are probably the best suited, and our approach relies on the Braginskii ion–electron model. Assuming that the electric field is electrostatic, this yields a set of 10 strongly coupled and non-linear conservation equations that exhibit multiscale and anisotropy features. The computational domain is a torus of complex geometrical section, that corresponds to the divertor configuration, i.e. with an “X-point” in the magnetic surfaces. To capture the complex physics that is involved, high order methods are used: The time-discretization is based on a Strang splitting, that combines implicit and explicit high order Runge–Kutta schemes, and the space discretization makes use of the spectral element method in the poloidal plane together with Fourier expansions in the toroidal direction. The paper thoroughly describes the algorithms that have been developed, provides some numerical validations of the key algorithms and exhibits the results of preliminary numerical experiments. In particular, we point out that the highest frequency of the system is intermediate between the ion and electron cyclotron frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗