Numerical stability of the predictor-corrector method in Monte Carlo burnup calculations of critical reactors

Monte Carlo burnup codes use various schemes to solve the coupled criticality and burnup equations. Previous studies have shown that the simplest methods, such as the beginning-of-step and middle-of-step constant flux approximations, are numerically unstable in fuel cycle calculations of critical reactors. Here we show that even the predictor-corrector methods that are implemented in established Monte Carlo burnup codes can be numerically unstable in cycle calculations of large systems. © 2013 Elsevier Ltd. All rights reserved.

Numerical assessment of stability of interface discontinuous finite element pressure spaces

The stability of two recently developed pressure spaces has been assessed numerically: The space proposed by Ausas et al. [R.F. Ausas, F.S. Sousa, G.C. Buscaglia, An improved finite element space for discontinuous pressures, Comput. Methods Appl. Mech. Engrg. 199 (2010) 1019-1031], which is capable of representing discontinuous pressures, and the space proposed by Coppola-Owen and Codina [A.H. Coppola-Owen, R. Codina, Improving Eulerian two-phase flow finite element approximation with discontinuous gradient pressure shape functions, Int. J. Numer. Methods Fluids, 49 (2005) 1287-1304], which can represent discontinuities in pressure gradients. We assess the stability of these spaces by numerically computing the inf-sup constants of several meshes. The inf-sup constant results as the solution of a generalized eigenvalue problems. Both spaces are in this way confirmed to be stable in their original form. An application of the same numerical assessment tool to the stabilized equal-order P-1/P-1 formulation is then reported. An interesting finding is that the stabilization coefficient can be safely set to zero in an arbitrary band of elements without compromising the formulation's stability. An analogous result is also reported for the mini-element P-1(+)/P-1 when the velocity bubbles are removed in an arbitrary band of elements. (C) 2012 Elsevier B.V. All rights reserved.

Optimal static voltage stability improvement using a numerically stable SLP algorithm, for real time applications

A numerically stable sequential Primal–Dual LP algorithm for the reactive power optimisation (RPO) is presented in this article. The algorithm minimises the voltage stability index C 2 [1] of all the load buses to improve the system static voltage stability. Real time requirements such as numerical stability, identification of the most effective subset of controllers for curtailing the number of controllers and their movement can be handled effectively by the proposed algorithm. The algorithm has a natural characteristic of selecting the most effective subset of controllers (and hence curtailing insignificant controllers) for improving the objective. Comparison with transmission loss minimisation objective indicates that the most effective subset of controllers and their solution identified by the static voltage stability improvement objective is not the same as that of the transmission loss minimisation objective. The proposed algorithm is suitable for real time application for the improvement of the system static voltage stability.

Monitoring and preventing numerical oscillations in 3D simulations with coupled Monte Carlo codes

Previous studies have reported that different schemes for coupling Monte Carlo (MC) neutron transport with burnup and thermal hydraulic feedbacks may potentially be numerically unstable. This issue can be resolved by application of implicit methods, such as the stochastic implicit mid-point (SIMP) methods. In order to assure numerical stability, the new methods do require additional computational effort. The instability issue however, is problem-dependent and does not necessarily occur in all cases. Therefore, blind application of the unconditionally stable coupling schemes, and thus incurring extra computational costs, may not always be necessary. In this paper, we attempt to develop an intelligent diagnostic mechanism, which will monitor numerical stability of the calculations and, if necessary, switch from simple and fast coupling scheme to more computationally expensive but unconditionally stable one. To illustrate this diagnostic mechanism, we performed a coupled burnup and TH analysis of a single BWR fuel assembly. The results indicate that the developed algorithm can be easily implemented in any MC based code for monitoring of numerical instabilities. The proposed monitoring method has negligible impact on the calculation time even for realistic 3D multi-region full core calculations. © 2014 Elsevier Ltd. All rights reserved.

Linear inverse problems with discrete data: II. Stability and regularization

For pt.I. see ibid. vol.1, p.301 (1985). In the first part of this work a general definition of an inverse problem with discrete data has been given and an analysis in terms of singular systems has been performed. The problem of the numerical stability of the solution, which in that paper was only briefly discussed, is the main topic of this second part. When the condition number of the problem is too large, a small error on the data can produce an extremely large error on the generalised solution, which therefore has no physical meaning. The authors review most of the methods which have been developed for overcoming this difficulty, including numerical filtering, Tikhonov regularisation, iterative methods, the Backus-Gilbert method and so on. Regularisation methods for the stable approximation of generalised solutions obtained through minimisation of suitable seminorms (C-generalised solutions), such as the method of Phillips (1962), are also considered.

A Higher order and stable method for the numerical integration of Random Differential Equations

Trabalho apresentado no Congresso Nacional de Matemática Aplicada à Indústria, 18 a 21 de novembro de 2014, Caldas Novas - Goiás

SCG postnatal remodelling - hypertrophy and neuron number stability - in Spix's Yellow-toothed Cavies (Galea spixii)

Whilst a fall in neuron numbers seems a common pattern during postnatal development, several authors have nonetheless reported an increase in neuron number, which may be associated with any one of a number of possible processes encapsulating either neurogenesis or late maturation and incomplete differentiation. Recent publications have thus added further fuel to the notion that a postnatal neurogenesis may indeed exist in sympathetic ganglia. In the light of these uncertainties surrounding the effects exerted by postnatal development on the number of superior cervical ganglion (SCG) neurons, we have used state-of-the-art design-based stereology to investigate the quantitative structure of SCG at four distinct timepoints after birth, viz., 1-3 days, 1 month, 12 months and 36 months. The main effects exerted by ageing on the SCG structure were: (i) a 77% increase in ganglion volume; (ii) stability in the total number of the whole population of SCG nerve cells (no change - either increase or decrease) during post-natal development; (iii) a higher proportion of uninucleate neurons to binucleate neurons only in newborn animals; (iv) a 130% increase in the volume of uninucleate cell bodies; and (v) the presence of BrdU positive neurons in animals at all ages. At the time of writing our results support the idea that neurogenesis takes place in the SCG of preas, albeit it warrants confirmation by further markers. We also hypothesise that a portfolio of other mechanisms: cell repair, maturation, differentiation and death may be equally intertwined and implicated in the numerical stability of SCG neurons during postnatal development. (C) 2011 ISDN. Published by Elsevier Ltd. All rights reserved.

Elastoplastic consolidation at finite strain. Part 2: finite element implementation and numerical examples

A mathematical model for finite strain elastoplastic consolidation of fully saturated soil media is implemented into a finite element program. The algorithmic treatment of finite strain elastoplasticity for the solid phase is based on multiplicative decomposition and is coupled with the algorithm for fluid flow via the Kirchhoff pore water pressure. A two-field mixed finite element formulation is employed in which the nodal solid displacements and the nodal pore water pressures are coupled via the linear momentum and mass balance equations. The constitutive model for the solid phase is represented by modified Cam—Clay theory formulated in the Kirchhoff principal stress space, and return mapping is carried out in the strain space defined by the invariants of the elastic logarithmic principal stretches. The constitutive model for fluid flow is represented by a generalized Darcy's law formulated with respect to the current configuration. The finite element model is fully amenable to exact linearization. Numerical examples with and without finite deformation effects are presented to demonstrate the impact of geometric nonlinearity on the predicted responses. The paper concludes with an assessment of the performance of the finite element consolidation model with respect to accuracy and numerical stability.

Mathematical modelling of the drying of sol gel microspheres

This thesis presents a mathematical model of the evaporation of colloidal sol droplets suspended within an atmosphere consisting of water vapour and air. The main purpose of this work is to investigate the causes of the morphologies arising within the powder collected from a spray dryer into which the precursor sol for Synroc™ is sprayed. The morphology is of significant importance for the application to storage of High Level Liquid Nuclear Waste. We begin by developing a model describing the evaporation of pure liquid droplets in order to establish a framework. This model is developed through the use of continuum mechanics and thermodynamic theory, and we focus on the specific case of pure water droplets. We establish a model considering a pure water vapour atmosphere, and then expand this model to account for the presence of an atmospheric gas such as air. We model colloidal particle-particle interactions and interactions between colloid and electrolyte using DLVO Theory and reaction kinetics, then incorporate these interactions into an expression for net interaction energy of a single particle with all other particles within the droplet. We account for the flow of material due to diffusion, advection, and interaction between species, and expand the pure liquid droplet models to account for the presence of these species. In addition, the process of colloidal agglomeration is modelled. To obtain solutions for our models, we develop a numerical algorithm based on the Control Volume method. To promote numerical stability, we formulate a new method of convergence acceleration. The results of a MATLAB™ code developed from this algorithm are compared with experimental data collected for the purposes of validation, and further analysis is done on the sensitivity of the solution to various controlling parameters.

Existence of travelling wave solutions for a model of tumour invasion

The existence of travelling wave solutions to a haptotaxis dominated model is analysed. A version of this model has been derived in Perumpanani et al. (1999) to describe tumour invasion, where diffusion is neglected as it is assumed to play only a small role in the cell migration. By instead allowing diffusion to be small, we reformulate the model as a singular perturbation problem, which can then be analysed using geometric singular perturbation theory. We prove the existence of three types of physically realistic travelling wave solutions in the case of small diffusion. These solutions reduce to the no diffusion solutions in the singular limit as diffusion as is taken to zero. A fourth travelling wave solution is also shown to exist, but that is physically unrealistic as it has a component with negative cell population. The numerical stability, in particular the wavespeed of the travelling wave solutions is also discussed.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Smooth DMS-FEM: A new approach to solving nearly incompressible nonlinear elasto-static problems

The DMS-FEM, which enables functional approximations with C(1) or still higher inter-element continuity within an FEM-based meshing of the domain, has recently been proposed by Sunilkumar and Roy [39,40]. Through numerical explorations on linear elasto-static problems, the method was found to have conspicuously superior convergence characteristics as well as higher numerical stability against locking. These observations motivate the present study, which aims at extending and exploring the DMS-FEM to (geometrically) nonlinear elasto-static problems of interest in solid mechanics and assessing its numerical performance vis-a-vis the FEM. In particular, the DMS-FEM is shown to vastly outperform the FEM (presently implemented through the commercial software ANSYS (R)) as the former requires fewer linearization and load steps to achieve convergence. In addition, in the context of nearly incompressible nonlinear systems prone to volumetric locking and with no special numerical artefacts (e.g. stabilized or mixed weak forms) employed to arrest locking, the DMS-FEM is shown to approach the incompressibility limit much more closely and with significantly fewer iterations than the FEM. The numerical findings are suggestive of the important role that higher order (uniform) continuity of the approximated field variables play in overcoming volumetric locking and the great promise that the method holds for a range of other numerically ill-conditioned problems of interest in computational structural mechanics. (C) 2011 Elsevier Ltd. All rights reserved.

A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).

光滑粒子动力学方法中粒子分布与数值稳定性分析

光滑粒子动力学(SPH)作为一种拉格朗日型无网格粒子方法,已经成功地应用于包括含多相流动界面以及移动边界的可压缩和不可压缩流体运动的研究中.通过对Poiseuille流动的深入研究,探索了SPH方法中粒子分布对计算精度的影响,揭示了一种因为粒子不规则分布而导致的数值不稳定现象.研究显示,这种数值不稳定性起源于SPH方法粒子近似过程中的不连续性.使用了一种新的粒子近似格式以确保SPH方法中粒子近似的连续性.计算结果表明,这种新的粒子近似格式对于规则和不规则的粒子分布都能得到稳定精度的结果.

Subdivision-stabilised immersed b-spline finite elements for moving boundary flows

An immersed finite element method is presented to compute flows with complex moving boundaries on a fixed Cartesian grid. The viscous, incompressible fluid flow equations are discretized with b-spline basis functions. The two-scale relation for b-splines is used to implement an elegant and efficient technique to satisfy the LBB condition. On non-grid-aligned fluid domains and at moving boundaries, the boundary conditions are enforced with a consistent penalty method as originally proposed by Nitsche. In addition, a special extrapolation technique is employed to prevent the loss of numerical stability in presence of arbitrarily small cut-cells. The versatility and accuracy of the proposed approach is demonstrated by means of convergence studies and comparisons with previous experimental and computational investigations.