Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative”

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

SU-E-I-33: Initial Evaluation of Model-Based Iterative CT Reconstruction Using Standard Image Quality Phantoms

Purpose: The purpose of this study was to compare a new model-based iterative reconstruction with existing reconstruction methods (filtered backprojection and basic iterative reconstruction) using quantitative analysis of standard image quality phantom images. Methods: An ACR accreditation phantom (Gammex 464) and a CATPHAN600 phantom were scanned using 3 routine clinical acquisition protocols (adult axial brain, adult abdomen, and pediatric abdomen) on a Philips iCT system. Each scan was acquired using default conditions and 75%, 50% and 25% dose levels. Images were reconstructed using standard filtered backprojection (FBP), conventional iterative reconstruction (iDose4) and a prototype model-based iterative reconstruction (IMR). Phantom measurements included CT number accuracy, contrast to noise ratio (CNR), modulation transfer function (MTF), low contrast detectability (LCD), and noise power spectrum (NPS). Results: The choice of reconstruction method had no effect on CT number accuracy, or MTF (p<0.01). The CNR of a 6 HU contrast target was improved by 1–67% with iDose4 relative to FBP, while IMR improved CNR by 145–367% across all protocols and dose levels. Within each scan protocol, the CNR improvement from IMR vs FBP showed a general trend of greater improvement at lower dose levels. NPS magnitude was greatest for FBP and lowest for IMR. The NPS of the IMR reconstruction showed a pronounced decrease with increasing spatial frequency, consistent with the unusual noise texture seen in IMR images. Conclusion: Iterative Model Reconstruction reduces noise and improves contrast-to-noise ratio without sacrificing spatial resolution in CT phantom images. This offers the possibility of radiation dose reduction and improved low contrast detectability compared with filtered backprojection or conventional iterative reconstruction.

60 APPLIED LIFE SCIENCES↗

Accelerated fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction

Purpose: The development of iterative image reconstruction algorithms for cone-beam computed tomography (CBCT) remains an active and important research area. Even with hardware acceleration, the overwhelming majority of the available 3D iterative algorithms that implement nonsmooth regularizers remain computationally burdensome and have not been translated for routine use in time-sensitive applications such as image-guided radiation therapy (IGRT). In this work, two variants of the fast iterative shrinkage thresholding algorithm (FISTA) are proposed and investigated for accelerated iterative image reconstruction in CBCT. Methods: Algorithm acceleration was achieved by replacing the original gradient-descent step in the FISTAs by a subproblem that is solved by use of the ordered subset simultaneous algebraic reconstruction technique (OS-SART). Due to the preconditioning matrix adopted in the OS-SART method, two new weighted proximal problems were introduced and corresponding fast gradient projection-type algorithms were developed for solving them. We also provided efficient numerical implementations of the proposed algorithms that exploit the massive data parallelism of multiple graphics processing units. Results: The improved rates of convergence of the proposed algorithms were quantified in computer-simulation studies and by use of clinical projection data corresponding to an IGRT study. The accelerated FISTAs were shown to possess dramatically improved convergence properties as compared to the standard FISTAs. For example, the number of iterations to achieve a specified reconstruction error could be reduced by an order of magnitude. Volumetric images reconstructed from clinical data were produced in under 4 min. Conclusions: The FISTA achieves a quadratic convergence rate and can therefore potentially reduce the number of iterations required to produce an image of a specified image quality as compared to first-order methods. We have proposed and investigated accelerated FISTAs for use with two nonsmooth penalty functions that will lead to further reductions in image reconstruction times while preserving image quality. Moreover, with the help of a mixed sparsity-regularization, better preservation of soft-tissue structures can be potentially obtained. The algorithms were systematically evaluated by use of computer-simulated and clinical data sets.

60 APPLIED LIFE SCIENCES↗

Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods

Currently, the dominating constraint in many high performance computing applications is data capacity and bandwidth, in both internode communications and even moreso in intranode data motion. A new approach to address this limitation is to make use of data compression in the form of a compressed data array. Storing data in a compressed data array and converting to standard IEEE-754 types as needed during a computation can reduce the pressure on bandwidth and storage. However, repeated conversions (lossy compression and decompression) introduce additional approximation errors, which need to be shown to not significantly affect the simulation results. Here, we extend recent work that analyzed the error of a single use of compression and decompression of the ZFP compressed data array representation to the case of time-stepping and iterative schemes, where an advancement operator is repeatedly applied in addition to the conversions. We show that the accumulated error for iterative methods involving fixed-point and time evolving iterations is bounded under standard constraints. An upper bound is established on the number of additional iterations required for the convergence of stationary fixed-point iterations. An additional analysis of traditional forward and backward error of stationary iterative methods using ZFP compressed arrays is also presented. The results of several 1D, 2D, and 3D test problems are provided to demonstrate the correctness of the theoretical bounds.

97 MATHEMATICS AND COMPUTING↗

Preliminary Results of a New Deterministic Iterative Image Reconstruction Algorithm - Paper 117

Iterative reconstruction techniques have become the standard for Single Photon Emission Computed Tomography (SPECT). Advances in computing have allowed these techniques to incorporate more and more detail; however, computation time must be balanced against increased detail. Monte Carlo methods are generally used for modeling the physics of a SPECT study, but can have long computation times. Advances in Monte Carlo-based scatter correction have shown reasonable results, but scatter estimation by measuring narrow energy windows remains more common. An iterative reconstruction technique using a deterministic transport code has been proposed as an alternative. This paper presents preliminary results of the new technique in which the TITAN deterministic code completes the forward projection step in a maximum likelihood expectation maximization (ML-EM) reconstruction of SPECT data. The effectiveness of the deterministic algorithm is examined for a 2-dimensional phantom. This work demonstrates the feasibility of using the TITAN code in an iterative reconstruction algorithm. The appropriate deterministic parameters were chosen by comparing sinograms produced with different mesh sizes, quadrature sets, and anisotropic scattering orders. The TITAN code was then successfully used as the forward projection step in an iterative reconstruction algorithm with a 2-dimensional homogeneous phantom. The impact of deterministic parameters on reconstruction quality is being investigated, along with the incorporation of a smoothing filter. The TITAN source code is being modified to include the ML-EM algorithm and iteration steps. This will significantly improve computation time by eliminating the repeated reading and writing of files for each iteration and allowing some steps to be completed in parallel. Further testing of the new reconstruction algorithm for more realistic phantoms is also underway. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Self-consistent simulation of transport and turbulence in tokamak edge plasma by coupling SOLPS-ITER and BOUT++

The status of coupling the fluid plasma/neutral 2D transport code SOLPS-ITER and the fluid 3D turbulence code BOUT++ is reported. Both codes simulated the same region, which is from several cm inside the magnetic separatrix to the far scrape-off layer (SOL). Compared to the profile evolution time scale, the characteristic time scale of the turbulence is quite short. For the turbulence code BOUT++, the time scale is around 10 -6 s. However, for the transport code SOLPS-ITER, the time scale is around 10 -3 –10 -2 s. An iterative scheme is used that each system is evolved on its own characteristic time scale. SOLPS-ITER can provide the background profiles of density, ion, and electron temperature to BOUT++. In turn, BOUT++ can provide the corresponding radial transport coefficients to SOLPS-ITER. The coupling has involved the ion density, ion temperature, and electron temperature. After several steps of iteration, the profiles of density, ion, and electron temperature show fluctuations, and the differences of the changes between two consecutive profiles are getting smaller and smaller. Finally, the self-consistent solutions of turbulence and transport can be obtained.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Overview of the EUROfusion Tokamak Exploitation programme in support of ITER and DEMO

Within the 9th European Framework programme, since 2021 EUROfusion is operating five tokamaks under the auspices of a single Task Force called ‘Tokamak Exploitation’. The goal is to benefit from the complementary capabilities of each machine in a coordinated way and help in developing a scientific output scalable to future largre machines. The programme of this Task Force ensures that ASDEX Upgrade, MAST-U, TCV, WEST and JET (since 2022) work together to achieve the objectives of Missions 1 and 2 of the EUROfusion Roadmap: i) demonstrate plasma scenarios that increase the success margin of ITER and satisfy the requirements of DEMO and, ii) demonstrate an integrated approach that can handle the large power leaving ITER and DEMO plasmas. The Tokamak Exploitation task force has therefore organized experiments on these two missions with the goal to strengthen the physics and operational basis for the ITER baseline scenario and for exploiting the recent plasma exhaust enhancements in all four devices (PEX: Plasma EXhaust) for exploring the solution for handling heat and particle exhaust in ITER and develop the conceptual solutions for DEMO. The ITER Baseline scenario has been developed in a similar way in ASDEX Upgrade, TCV and JET. Key risks for ITER such as disruptions and run-aways have been also investigated in TCV, ASDEX Upgrade and JET. Experiments have explored successfully different divertor configurations (standard, super-X, snowflakes) in MAST-U and TCV and studied tungsten melting in WEST and ASDEX Upgrade. The input from the smaller devices to JET has also been proven successful to set-up novel control schemes on disruption avoidance and detachment.

ASDEX upgrade↗

Prediction of performance and turbulence in ITER burning plasmas via nonlinear gyrokinetic profile prediction

Burning plasma performance, transport, and the effect of hydrogen isotope (H, D, D-T fuel mix) on confinement has been predicted for ITER baseline scenario (IBS) conditions using nonlinear gyrokinetic profile predictions. Accelerated by surrogate modeling (Rodriguez-Fernandez et al 2022 Nucl. Fusion 62 076036), high fidelity, nonlinear gyrokinetic simulations performed with the CGYRO code (Candy et al 2016 J. Comput. Phys. 324 73), were used to predict profiles of T i , T e , and n e while including the effects of alpha heating, auxiliary power (NBI + ECH), collisional energy exchange, and radiation losses inside of $r/a$ = 0.9. Predicted profiles and resulting energy confinement are found to produce fusion power and gain that are approximately consistent with mission goals ($P_\textrm{fusion} = 500$ MW at Q = 10) for the baseline scenario and exhibit energy confinement that is within 1σ of the H-mode energy confinement scaling. The power of the surrogate modeling technique is demonstrated through the prediction of alternative ITER scenarios with reduced computational cost. These scenarios include conditions with maximized fusion gain and an investigation of potential resonant magnetic perturbation (RMP) effects on performance with a minimal number of gyrokinetic profile iterations required (3–6). These predictions highlight the stiff ITG nature of the core turbulence predicted in the ITER baseline and demonstrate that $Q \gt$ 17 conditions may be accessible by reducing auxiliary input power while operating in IBS conditions. Prediction of full kinetic profiles allowed for the projection of hydrogen isotope effects around ITER baseline conditions. The gyrokinetic fuel ion species was varied from H, D, and 50/50 D-T and kinetic profiles were predicted. Results indicate that a weak or negligible isotope effect will be observed to arise from core turbulence in IBS conditions. The resulting energy confinement, turbulence, and density peaking, and the implications for ITER operations will be discussed.

gyrokinetics↗

Accelerating self-consistent field iterations in Kohn-Sham density functional theory using a low-rank approximation of the dielectric matrix

We present an efficient preconditioning technique for accelerating the fixed-point iteration in real-space Kohn-Sham density functional theory (DFT) calculations. The preconditioner uses a low-rank approximation of the dielectric matrix (LRDM) based on Gâteaux derivatives of the residual of fixed-point iteration along appropriately chosen direction functions. We develop a computationally efficient method to evaluate these Gâteaux derivatives in conjunction with the Chebyshev filtered subspace iteration procedure, an approach widely used in large-scale Kohn-Sham DFT calculations. Further, we propose a variant of LRDM preconditioner based on adaptive accumulation of low-rank approximations from previous self-consistent field iterations, and also extend the LRDM preconditioner to spin-polarized Kohn-Sham DFT calculations. We demonstrate the robustness and efficiency of the LRDM preconditioner against other widely used preconditioners on a range of benchmark systems with sizes ranging from ~100 to 1100 atoms (~500–20,000 electrons). The benchmark systems include various combinations of metal-insulating-semiconducting heterogeneous material systems, nanoparticles with localized d orbitals near the Fermi energy, nanofilm with metal dopants, and magnetic systems. In all benchmark systems, the LRDM preconditioner converges robustly within 20–30 iterations. In contrast, other widely used preconditioners show slow convergence in many cases, as well as divergence of the fixed-point iteration in some cases. Lastly, we demonstrate the computational efficiency afforded by the LRDM method, with up to 3.4-fold reduction in computational cost for the total ground-state calculation compared to other preconditioners.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗

Global Asymptotic Behavior of Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.

Yee, H. C.↗

Iterative Strain-Gage Balance Calibration Data Analysis for Extended Independent Variable Sets

A new method was developed that makes it possible to use an extended set of independent calibration variables for an iterative analysis of wind tunnel strain gage balance calibration data. The new method permits the application of the iterative analysis method whenever the total number of balance loads and other independent calibration variables is greater than the total number of measured strain gage outputs. Iteration equations used by the iterative analysis method have the limitation that the number of independent and dependent variables must match. The new method circumvents this limitation. It simply adds a missing dependent variable to the original data set by using an additional independent variable also as an additional dependent variable. Then, the desired solution of the regression analysis problem can be obtained that fits each gage output as a function of both the original and additional independent calibration variables. The final regression coefficients can be converted to data reduction matrix coefficients because the missing dependent variables were added to the data set without changing the regression analysis result for each gage output. Therefore, the new method still supports the application of the two load iteration equation choices that the iterative method traditionally uses for the prediction of balance loads during a wind tunnel test. An example is discussed in the paper that illustrates the application of the new method to a realistic simulation of temperature dependent calibration data set of a six component balance.

Ulbrich, Norbert Manfred↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Potential design problems for ITER fusion device

The international thermonuclear experimental reactor (ITER) is a worldwide project currently being built in France for the demonstration of the feasibility of thermonuclear technologies for future realization of successful commercial fusion energy. ITER is of the tokamak based design using strong magnetic fields to confine the very hot plasma needed to induce the fusion reaction. Tokamak devices are currently the front leading designs. Building a successful magnetic fusion device for energy production is of great challenge. A key obstacle to such design is the performance during abnormal events including plasma disruptions and so-called edge-localized modes (ELMs). In these events, a massive and sudden release of energy occurs quickly, due to loss of full or partial plasma confinement, leading to very high transient power loads on the reactor surface boundaries. A successful reactor design should tolerate several of these transient events without serious damages such as melting and vaporization of the structure. This paper highlights, through comprehensive state-of-the-art computer simulation of the entire ITER interior design during such transient events, e.g., ELMs occurring at normal operation and disruptions during abnormal operation, potential serious problems with current plasma facing components (PFCs) design. The HEIGHTS computer package is used in these simulations. The ITER reactor design was simulated in full and exact 3D geometry including all known relevant physical processes involved during these transient events. The current ITER divertor design may not work properly and may requires significant modifications or new innovative design to prevent serious damage and to ensure successful operation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Tungsten control in long pulse operation: feedback from WEST to ITER

The full W environment that is now foreseen for ITER puts strong emphasis on experimental results obtained in present devices in similar conditions. In this context, the WEST tokamak is well equipped to bring key contributions to the preparation of ITER operation, thanks to its capability to perform long pulses in dominant electron heating, torque-free scheme based on RF systems, and its ITER-grade actively cooled divertor. Recent results of interest cover the understanding of tungsten contamination and the evaluation of conditioning methods, the feedback on the current ramp-up phase, and the ageing of the ITER divertor components in L-mode attached condition. Further, new directions are being explored, in particular low divertor temperature operation that should be the normal operating regime of ITER. We also report on tungsten peaking physics, and the role of light impurity content.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The new ITER baseline, research plan and open R&D issues

A new baseline (NB) has been proposed by the ITER Project to ensure a robust achievement of the Projects’ goals, in view of past challenges including delays incurred due to the Covid-19 pandemic, technical challenges in completing first-of-a-kind components and in nuclear licensing. The NB includes modifications to the configuration of the ITER device and its ancillaries (e.g. change from beryllium to tungsten as first wall material, modification of the heating and current drive mix, etc.) as well as additional testing of components (e.g. toroidal field coils) or phased installation (start with inertially cooled first wall before later installation of the final actively water-cooled components) to minimise operational risks. In the NB, the ITER research plan (IRP) will be divided into three main phases: (a) start of research operation, with 40 MW of ECH and 10 MW of ICH, which will focus on the demonstration of 15 MA operation in L-mode, commissioning of all required systems, including disruption mitigation, and the demonstration of H-mode plasma operation in deuterium; (b) DT-1, with 60–67 MW of ECH, 33 MW of neutral beam injection (NBI) and 10–20 MW of ICH, which will demonstrate robust operation in high confinement H-mode plasmas in DT up to Q ⩾ 10 and for burn durations of 300–500 s within an accumulated neutron fluence of ∼1% of the ITER machine’s lifetime total, and; (c) DT-2, with up to 67 MW of ECH, up to 49.5 MW of NBI and up to 20 MW of ICH, with the ITER tokamak and ancillaries in their final configuration to demonstrate routine operation in DT plasmas at high Q and the Q ⩾ 5 long-pulse and steady-state scenarios to the final neutron fluence and to perform R&D on nuclear fusion reactor issues. The logic, physics basis, modelling and experimental evaluations carried out to support the NB and the associated IRP are described. These include the impact of the tungsten wall on plasma scenarios and associated risk mitigation measures, as well as the optimisation of the tokamak components and ancillaries to minimise Project risks. Open R&D issues related to these evaluations and mitigation measures are also described together with experimental, modelling and validation activities required to address them.

ITER↗

Well-Posedness of the Iterative Boltzmann Inversion

The iterative Boltzmann inversion is a fixed point iteration to determine an effective pair potential for an ensemble of identical particles in thermal equilibrium from the corresponding radial distribution function. Although the method is reported to work reasonably well in practice, it still lacks a rigorous convergence analysis. In this paper we provide some first steps towards such an analysis, and we show under quite general assumptions that the associated fixed point operator is Lipschitz continuous (in fact, differentiable) in a suitable neighborhood of the true pair potential, assuming that such a potential exists. In other words, the iterative Boltzmann inversion is well-defined in the sense that if the kth iterate of the scheme is sufficiently close to the true pair potential then the k+1st iterate is an admissible pair potential, which again belongs to the domain of the fixed point operator. On our way we establish important properties of the cavity distribution function and provide a proof of a statement formulated by Groeneveld concerning the rate of decay at infinity of the Ursell function associated with a Lennard-Jones type potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Erosion resistance test of SiC mirror sample for ITER divertor VUV spectrometer

A series of tests have been performed to validate the resistance of the Silicon Carbide (SiC) mirror as the first mirror material of ITER VUV spectrometers to all ITER environmental conditions. Here we focused on the erosion (and deposition) of the SiC mirror sample caused by high-energy neutral particles. The flux of neutral particles reaching the first mirror was calculated using the ZEMAX software with a simplified entrance duct model. In the calculation, the particle flux reaching the first wall is necessary and the previously reported values derived from the SOLPS calculations were used. Based on this estimated particle flux, the erosion resistance tests were performed to check the erosion effect due to the high-energy neutral particles on the first mirror of ITER divertor VUV spectrometer. In the experiment, erosion was induced by exposing the SiC mirror sample to hydrogen and deuterium plasmas (and ions). The target fluence of incident ions in experiment is based on the estimation of the flux of neutral particles in ITER. The surface shape, composition, erosion depth, and surface roughness were measured to check the damage of the mirror surface after erosion test. Based on simulations and erosion resistance tests, it was concluded that the SiC mirror can be used as the first mirror of ITER divertor VUV spectrometer.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗