Shestakov, A I
2007-01-01
We present a scheme to solve the nonlinear multigroup radiation diffusion (MGD) equations. The method is incorporated into a massively parallel, multidimensional, Eulerian radiation-hydrodynamic code with adaptive mesh refinement (AMR). The patch-based AMR algorithm refines in both space and time creating a hierarchy of levels, coarsest to finest. The physics modules are time-advanced using operator splitting. On each level, separate level-solve packages advance the modules. Our multigroup level-solve adapts an implicit procedure which leads to a two-step iterative scheme that alternates between elliptic solves for each group with intra-cell group coupling. For robustness, we introduce pseudo transient continuation (PTC). We analyze the magnitude of the PTC parameter to ensure positivity of the resulting linear system, diagonal dominance and convergence of the two-step scheme. For AMR, a level defines a subdomain for refinement. For diffusive processes such as MGD, the refined level uses Dirichet boundary dat...
Energy Technology Data Exchange (ETDEWEB)
Shestakov, A I; Offner, S R
2006-09-21
We present a scheme to solve the nonlinear multigroup radiation diffusion (MGD) equations. The method is incorporated into a massively parallel, multidimensional, Eulerian radiation-hydrodynamic code with adaptive mesh refinement (AMR). The patch-based AMR algorithm refines in both space and time creating a hierarchy of levels, coarsest to finest. The physics modules are time-advanced using operator splitting. On each level, separate 'level-solve' packages advance the modules. Our multigroup level-solve adapts an implicit procedure which leads to a two-step iterative scheme that alternates between elliptic solves for each group with intra-cell group coupling. For robustness, we introduce pseudo transient continuation ({Psi}tc). We analyze the magnitude of the {Psi}tc parameter to ensure positivity of the resulting linear system, diagonal dominance and convergence of the two-step scheme. For AMR, a level defines a subdomain for refinement. For diffusive processes such as MGD, the refined level uses Dirichet boundary data at the coarse-fine interface and the data is derived from the coarse level solution. After advancing on the fine level, an additional procedure, the sync-solve (SS), is required in order to enforce conservation. The MGD SS reduces to an elliptic solve on a combined grid for a system of G equations, where G is the number of groups. We adapt the 'partial temperature' scheme for the SS; hence, we reuse the infrastructure developed for scalar equations. Results are presented. We consider a multigroup test problem with a known analytic solution. We demonstrate utility of {Psi}tc by running with increasingly larger timesteps. Lastly, we simulate the sudden release of energy Y inside an Al sphere (r = 15 cm) suspended in air at STP. For Y = 11 kT, we find that gray radiation diffusion and MGD produce similar results. However, if Y = 1 MT, the two packages yield different results. Our large Y simulation contradicts a long-standing theory
Energy Technology Data Exchange (ETDEWEB)
Shestakov, A I; Offner, S R
2007-03-02
We present a scheme to solve the nonlinear multigroup radiation diffusion (MGD) equations. The method is incorporated into a massively parallel, multidimensional, Eulerian radiation-hydrodynamic code with adaptive mesh refinement (AMR). The patch-based AMR algorithm refines in both space and time creating a hierarchy of levels, coarsest to finest. The physics modules are time-advanced using operator splitting. On each level, separate 'level-solve' packages advance the modules. Our multigroup level-solve adapts an implicit procedure which leads to a two-step iterative scheme that alternates between elliptic solves for each group with intra-cell group coupling. For robustness, we introduce pseudo transient continuation ({Psi}tc). We analyze the magnitude of the {Psi}tc parameter to ensure positivity of the resulting linear system, diagonal dominance and convergence of the two-step scheme. For AMR, a level defines a subdomain for refinement. For diffusive processes such as MGD, the refined level uses Dirichet boundary data at the coarse-fine interface and the data is derived from the coarse level solution. After advancing on the fine level, an additional procedure, the sync-solve (SS), is required in order to enforce conservation. The MGD SS reduces to an elliptic solve on a combined grid for a system of G equations, where G is the number of groups. We adapt the 'partial temperature' scheme for the SS; hence, we reuse the infrastructure developed for scalar equations. Results are presented. We consider a multigroup test problem with a known analytic solution. We demonstrate utility of {Psi}tc by running with increasingly larger timesteps. Lastly, we simulate the sudden release of energy Y inside an Al sphere (r = 15 cm) suspended in air at STP. For Y = 11 kT, we find that gray radiation diffusion and MGD produce similar results. However, if Y = 1 MT, the two packages yield different results. Our large Y simulation contradicts a long-standing theory
Multigroup radiation hydrodynamics with flux-limited diffusion and adaptive mesh refinement
González, Matthias; Commerçon, Benoît; Masson, Jacques
2015-01-01
Radiative transfer plays a key role in the star formation process. Due to a high computational cost, radiation-hydrodynamics simulations performed up to now have mainly been carried out in the grey approximation. In recent years, multi-frequency radiation-hydrodynamics models have started to emerge, in an attempt to better account for the large variations of opacities as a function of frequency. We wish to develop an efficient multigroup algorithm for the adaptive mesh refinement code RAMSES which is suited to heavy proto-stellar collapse calculations. Due to prohibitive timestep constraints of an explicit radiative transfer method, we constructed a time-implicit solver based on a stabilised bi-conjugate gradient algorithm, and implemented it in RAMSES under the flux-limited diffusion approximation. We present a series of tests which demonstrate the high performance of our scheme in dealing with frequency-dependent radiation-hydrodynamic flows. We also present a preliminary simulation of a three-dimensional p...
A multigroup radiation diffusion test problem: Comparison of code results with analytic solution
Energy Technology Data Exchange (ETDEWEB)
Shestakov, A I; Harte, J A; Bolstad, J H; Offner, S R
2006-12-21
We consider a 1D, slab-symmetric test problem for the multigroup radiation diffusion and matter energy balance equations. The test simulates diffusion of energy from a hot central region. Opacities vary with the cube of the frequency and radiation emission is given by a Wien spectrum. We compare results from two LLNL codes, Raptor and Lasnex, with tabular data that define the analytic solution.
Unstructured Grids and the Multigroup Neutron Diffusion Equation
Directory of Open Access Journals (Sweden)
German Theler
2013-01-01
Full Text Available The neutron diffusion equation is often used to perform core-level neutronic calculations. It consists of a set of second-order partial differential equations over the spatial coordinates that are, both in the academia and in the industry, usually solved by discretizing the neutron leakage term using a structured grid. This work introduces the alternatives that unstructured grids can provide to aid the engineers to solve the neutron diffusion problem and gives a brief overview of the variety of possibilities they offer. It is by understanding the basic mathematics that lie beneath the equations that model real physical systems; better technical decisions can be made. It is in this spirit that this paper is written, giving a first introduction to the basic concepts which can be incorporated into core-level neutron flux computations. A simple two-dimensional homogeneous circular reactor is solved using a coarse unstructured grid in order to illustrate some basic differences between the finite volumes and the finite elements method. Also, the classic 2D IAEA PWR benchmark problem is solved for eighty combinations of symmetries, meshing algorithms, basic geometric entities, discretization schemes, and characteristic grid lengths, giving even more insight into the peculiarities that arise when solving the neutron diffusion equation using unstructured grids.
Energy Technology Data Exchange (ETDEWEB)
Fisher, A. C. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Bailey, D. S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Kaiser, T. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Eder, D. C. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Gunney, B. T. N. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Masters, N. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Koniges, A. E. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Anderson, R. W. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-02-01
Here, we present a novel method for the solution of the diffusion equation on a composite AMR mesh. This approach is suitable for including diffusion based physics modules to hydrocodes that support ALE and AMR capabilities. To illustrate, we proffer our implementations of diffusion based radiation transport and heat conduction in a hydrocode called ALE-AMR. Numerical experiments conducted with the diffusion solver and associated physics packages yield 2nd order convergence in the L_{2} norm.
Simulate-HEX - The multi-group diffusion equation in hexagonal-z geometry
Energy Technology Data Exchange (ETDEWEB)
Lindahl, S. O. [Studsvik Scandpower, Stensborgsg. 4, SE-72132 Vaesteraes (Sweden)
2013-07-01
The multigroup diffusion equation is solved for the hexagonal-z geometry by dividing each hexagon into 6 triangles. In each triangle, the Fourier solution of the wave equation is approximated by 8 plane waves to describe the intra-nodal flux accurately. In the end an efficient Finite Difference like equation is obtained. The coefficients of this equation depend on the flux solution itself and they are updated once per power/void iteration. A numerical example demonstrates the high accuracy of the method. (authors)
Energy Technology Data Exchange (ETDEWEB)
Zanette, Rodrigo; Petersen, Caudio Zen [Univ. Federal de Pelotas, Capao do Leao (Brazil). Programa de Pos Graduacao em Modelagem Matematica; Schramm, Marcello [Univ. Federal de Pelotas (Brazil). Centro de Engenharias; Zabadal, Jorge Rodolfo [Univ. Federal do Rio Grande do Sul, Tramandai (Brazil)
2017-05-15
In this paper a solution for the one-dimensional steady state Multilayer Multigroup Neutron Diffusion Equation in cartesian geometry by Fictitious Borders Power Method and a perturbative analysis of this solution is presented. For each new iteration of the power method, the neutron flux is reconstructed by polynomial interpolation, so that it always remains in a standard form. However when the domain is long, an almost singular matrix arises in the interpolation process. To eliminate this singularity the domain segmented in R regions, called fictitious regions. The last step is to solve the neutron diffusion equation for each fictitious region in analytical form locally. The results are compared with results present in the literature. In order to analyze the sensitivity of the solution, a perturbation in the nuclear parameters is inserted to determine how a perturbation interferes in numerical results of the solution.
SIRIUS - A one-dimensional multigroup analytic nodal diffusion theory code
Energy Technology Data Exchange (ETDEWEB)
Forslund, P. [Westinghouse Atom AB, Vaesteraas (Sweden)
2000-09-01
In order to evaluate relative merits of some proposed intranodal cross sections models, a computer code called Sirius has been developed. Sirius is a one-dimensional, multigroup analytic nodal diffusion theory code with microscopic depletion capability. Sirius provides the possibility of performing a spatial homogenization and energy collapsing of cross sections. In addition a so called pin power reconstruction method is available for the purpose of reconstructing 'heterogeneous' pin qualities. consequently, Sirius has the capability of performing all the calculations (incl. depletion calculations) which are an integral part of the nodal calculation procedure. In this way, an unambiguous numerical analysis of intranodal cross section models is made possible. In this report, the theory of the nodal models implemented in sirius as well as the verification of the most important features of these models are addressed.
Three-dimensional h-adaptivity for the multigroup neutron diffusion equations
Wang, Yaqi
2009-04-01
Adaptive mesh refinement (AMR) has been shown to allow solving partial differential equations to significantly higher accuracy at reduced numerical cost. This paper presents a state-of-the-art AMR algorithm applied to the multigroup neutron diffusion equation for reactor applications. In order to follow the physics closely, energy group-dependent meshes are employed. We present a novel algorithm for assembling the terms coupling shape functions from different meshes and show how it can be made efficient by deriving all meshes from a common coarse mesh by hierarchic refinement. Our methods are formulated using conforming finite elements of any order, for any number of energy groups. The spatial error distribution is assessed with a generalization of an error estimator originally derived for the Poisson equation. Our implementation of this algorithm is based on the widely used Open Source adaptive finite element library deal.II and is made available as part of this library\\'s extensively documented tutorial. We illustrate our methods with results for 2-D and 3-D reactor simulations using 2 and 7 energy groups, and using conforming finite elements of polynomial degree up to 6. © 2008 Elsevier Ltd. All rights reserved.
VENTURE/PC manual: A multidimensional multigroup neutron diffusion code system
Energy Technology Data Exchange (ETDEWEB)
Shapiro, A.; Huria, H.C.; Cho, K.W. (Cincinnati Univ., OH (United States))
1991-12-01
VENTURE/PC is a recompilation of part of the Oak Ridge BOLD VENTURE code system, which will operate on an IBM PC or compatible computer. Neutron diffusion theory solutions are obtained for multidimensional, multigroup problems. This manual contains information associated with operating the code system. The purpose of the various modules used in the code system, and the input for these modules are discussed. The PC code structure is also given. Version 2 included several enhancements not given in the original version of the code. In particular, flux iterations can be done in core rather than by reading and writing to disk, for problems which allow sufficient memory for such in-core iterations. This speeds up the iteration process. Version 3 does not include any of the special processors used in the previous versions. These special processors utilized formatted input for various elements of the code system. All such input data is now entered through the Input Processor, which produces standard interface files for the various modules in the code system. In addition, a Standard Interface File Handbook is included in the documentation which is distributed with the code, to assist in developing the input for the Input Processor.
VENTURE/PC manual: A multidimensional multigroup neutron diffusion code system. Version 3
Energy Technology Data Exchange (ETDEWEB)
Shapiro, A.; Huria, H.C.; Cho, K.W. [Cincinnati Univ., OH (United States)
1991-12-01
VENTURE/PC is a recompilation of part of the Oak Ridge BOLD VENTURE code system, which will operate on an IBM PC or compatible computer. Neutron diffusion theory solutions are obtained for multidimensional, multigroup problems. This manual contains information associated with operating the code system. The purpose of the various modules used in the code system, and the input for these modules are discussed. The PC code structure is also given. Version 2 included several enhancements not given in the original version of the code. In particular, flux iterations can be done in core rather than by reading and writing to disk, for problems which allow sufficient memory for such in-core iterations. This speeds up the iteration process. Version 3 does not include any of the special processors used in the previous versions. These special processors utilized formatted input for various elements of the code system. All such input data is now entered through the Input Processor, which produces standard interface files for the various modules in the code system. In addition, a Standard Interface File Handbook is included in the documentation which is distributed with the code, to assist in developing the input for the Input Processor.
CHARTB multigroup transport package
Energy Technology Data Exchange (ETDEWEB)
Baker, L.
1979-03-01
The physics and numerical implementation of the radiation transport routine used in the CHARTB MHD code are discussed. It is a one-dimensional (Cartesian, cylindrical, and spherical symmetry), multigroup,, diffusion approximation. Tests and applications will be discussed as well.
An algorithm for multi-group two-dimensional neutron diffusion kinetics in nuclear reactor cores
Marcelo Schramm
2016-01-01
The objective of this thesis is to introduce a new methodology for two{dimensional multi{ group neutron diffusion kinetics in a reactor core. The presented methodology uses a polyno- mial approximation in a rectangular homogeneous domain with non{homogeneous boundary conditions. As it consists on a truncated Taylor series, its error estimates varies with the size of the rectangle. The coefficients are obtained mainly by their relations with the independent term, which is determined by the dif...
An Extension of Implicit Monte Carlo Diffusion: Multigroup and The Difference Formulation
Energy Technology Data Exchange (ETDEWEB)
Cleveland, M A; Gentile, N; Palmer, T S
2010-04-19
Implicit Monte Carlo (IMC) and Implicit Monte Carlo Diffusion (IMD) are approaches to the numerical solution of the equations of radiative transfer. IMD was previously derived and numerically tested on grey, or frequency-integrated problems. In this research, we extend Implicit Monte Carlo Diffusion (IMD) to account for frequency dependence, and we implement the difference formulation as a source manipulation variance reduction technique. We derive the relevant probability distributions and present the frequency dependent IMD algorithm, with and without the difference formulation. The IMD code with and without the difference formulation was tested using both grey and frequency dependent benchmark problems. The Su and Olson semi-analytic Marshak wave benchmark was used to demonstrate the validity of the code for grey problems. The Su and Olson semi-analytic picket fence benchmark was used for the frequency dependent problems. The frequency dependent IMD algorithm reproduces the results of both Su and Olson benchmark problems. Frequency group refinement studies indicate that the computational cost of refining the group structure is likely less than that of group refinement in deterministic solutions of the radiation diffusion methods. Our results show that applying the difference formulation to the IMD algorithm can result in an overall increase in the figure of merit for frequency dependent problems. However, the creation of negatively weighted particles from the difference formulation can cause significant numerical instabilities in regions of the problem with sharp spatial gradients in the solution. An adaptive implementation of the difference formulation may be necessary to focus its use in regions that are at or near thermal equilibrium.
The numerical analysis of eigenvalue problem solutions in the multigroup neutron diffusion theory
Energy Technology Data Exchange (ETDEWEB)
Woznicki, Z.I. [Institute of Atomic Energy, Otwock-Swierk (Poland)
1994-12-31
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iteration within global iterations. Particular interactive strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 32 figs, 15 tabs.
The numerical analysis of eigenvalue problem solutions in multigroup neutron diffusion theory
Energy Technology Data Exchange (ETDEWEB)
Woznicki, Z.I. [Institute of Atomic Energy, Otwock-Swierk (Poland)
1995-12-31
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iterations within global iterations. Particular iterative strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 35 figs, 16 tabs.
Parareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model
Baudron, Anne-Marie A -M; Maday, Yvon; Riahi, Mohamed Kamel; Salomon, Julien
2014-01-01
We present a parareal in time algorithm for the simulation of neutron diffusion transient model. The method is made efficient by means of a coarse solver defined with large time steps and steady control rods model. Using finite element for the space discretization, our implementation provides a good scalability of the algorithm. Numerical results show the efficiency of the parareal method on large light water reactor transient model corresponding to the Langenbuch-Maurer-Werner (LMW) benchmark [1].
Diffusion-Based Coarse Graining in Hybrid Continuum--Discrete Solvers: Applications in CFD--DEM
Sun, Rui
2014-01-01
In this work, a coarse graining method previously proposed by the authors based on solving diffusion equations is applied to CFD--DEM simulations, where coarse graining is used to obtain solid volume fraction, particle phase velocity, and fluid--particle interaction forces. By examining the conservation requirements, the variables to solve diffusion equations for in CFD--DEM simulations are identified. The algorithm is then implemented to a CFD--DEM solver based on OpenFOAM and LAMMPS, the former being a general-purpose, three-dimensional CFD solver based on unstructured meshes. Numerical simulations are performed for a fluidized bed by using the CFD--DEM solver with the diffusion-based coarse graining algorithm. Converged results are obtained on successively refined meshes, even for meshes with cell sizes comparable to or smaller than the particle diameter. This is a critical advantage of the proposed method over many existing coarse graining methods, and would be particularly valuable when small cells are r...
Placati, Silvio; Guermandi, Marco; Samore, Andrea; Franchi Scarselli, Eleonora; Guerrieri, Roberto
2015-11-26
Diffuse Optical Tomography is an imaging technique based on evaluating how light propagates within the human head to obtain functional information about the brain. Precision in reconstructing such an optical properties map is highly affected by the accuracy of the light propagation model implemented, which needs to take into account the presence of clear and scattering tissues. We present a numerical solver based on the radiosity-diffusion model integrating the anatomical information provided by a structural MRI. The solver is designed to run on parallel heterogeneous platforms based on multiple GPUs and CPUs. We demonstrate how the solver provides a 7x speed-up over an isotropic-scattered parallel Monte Carlo engine based on a Radiative Transport Equation for a domain composed of 2 millions voxels, along with a significant improvement in accuracy. The speed-up greatly increases for larger domains, allowing us to compute the light distribution of a full human head ( 3 million voxels) in 116 seconds for the platform used.
Energy Technology Data Exchange (ETDEWEB)
Ceolin, C.; Schramm, M.; Vilhena, M.T.; Bodmann, B.E.J., E-mail: celina.ceolin@gmail.com, E-mail: marceloschramm@hotmail.com, E-mail: vilhena@pq.cnpq.br, E-mail: bardo.bodmann@ufrgs.br [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica
2013-07-01
In this work the authors solved the steady state neutron diffusion equation for a multi-layer slab assuming the multi-group energy model. The method to solve the equation system is based on a expansion in Taylor Series, which was proven to be useful in [1] [2] [3]. The results obtained can be used as initial condition for neutron space kinetics problems. The neutron scalar flux was expanded in a power series, and the coefficients were found by using the ordinary differential equation and the boundary and interface conditions. The effective multiplication factor k was evaluated using the power method [4]. We divided the domain into several slabs to guarantee the convergence with a low truncation order. We present the formalism together with some numerical simulations. (author)
Energy Technology Data Exchange (ETDEWEB)
Ceolin, Celina; Schramm, Marcelo; Bodmann, Bardo Ernst Josef; Vilhena, Marco Tullio Mena Barreto de [Universidade Federal do Rio Grande do Sul, Porto Alegre (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica; Bogado Leite, Sergio de Queiroz [Comissao Nacional de Energia Nuclear, Rio de Janeiro (Brazil)
2014-11-15
In this work the authors solved the steady state neutron diffusion equation for a multi-layer slab assuming the multi-group energy model. The method to solve the equation system is based on an expansion in Taylor Series resulting in an analytical expression. The results obtained can be used as initial condition for neutron space kinetics problems. The neutron scalar flux was expanded in a power series, and the coefficients were found by using the ordinary differential equation and the boundary and interface conditions. The effective multiplication factor k was evaluated using the power method. We divided the domain into several slabs to guarantee the convergence with a low truncation order. We present the formalism together with some numerical simulations.
Institute of Scientific and Technical Information of China (English)
Shen Chun; Sun Fengxian; Xia Xinlin
2013-01-01
Open source field operation and manipulation (OpenFOAM) is one of the most preva-lent open source computational fluid dynamics (CFD) software. It is very convenient for researchers to develop their own codes based on the class library toolbox within OpenFOAM. In recent years, several density-based solvers within OpenFOAM for supersonic/hypersonic compressible flow are coming up. Although the capabilities of these solvers to capture shock wave have already been ver-ified by some researchers, these solvers still need to be validated comprehensively as commercial CFD software. In boundary layer where diffusion is the dominant transportation manner, the con-vective discrete schemes’ capability to capture aerothermal variables, such as temperature and heat flux, is different from each other due to their own numerical dissipative characteristics and from viewpoint of this capability, these compressible solvers within OpenFOAM can be validated further. In this paper, firstly, the organizational architecture of density-based solvers within OpenFOAM is analyzed. Then, from the viewpoint of the capability to capture aerothermal vari-ables, the numerical results of several typical geometrical fields predicted by these solvers are com-pared with both the outcome obtained from the commercial software Fastran and the experimental data. During the computing process, the Roe, AUSM+(Advection Upstream Splitting Method), and HLLC(Harten-Lax-van Leer-Contact) convective discrete schemes of which the spatial accu-racy is 1st and 2nd order are utilized, respectively. The compared results show that the aerothermal variables are in agreement with results generated by Fastran and the experimental data even if the 1st order spatial precision is implemented. Overall, the accuracy of these density-based solvers can meet the requirement of engineering and scientific problems to capture aerothermal variables in diffusion boundary layer.
Directory of Open Access Journals (Sweden)
Seyed Abolfazl Hosseini
2016-02-01
Full Text Available In the present paper, development of the three-dimensional (3D computational code based on Galerkin finite element method (GFEM for solving the multigroup forward/adjoint diffusion equation in both rectangular and hexagonal geometries is reported. Linear approximation of shape functions in the GFEM with unstructured tetrahedron elements is used in the calculation. Both criticality and fixed source calculations may be performed using the developed GFEM-3D computational code. An acceptable level of accuracy at a low computational cost is the main advantage of applying the unstructured tetrahedron elements. The unstructured tetrahedron elements generated with Gambit software are used in the GFEM-3D computational code through a developed interface. The forward/adjoint multiplication factor, forward/adjoint flux distribution, and power distribution in the reactor core are calculated using the power iteration method. Criticality calculations are benchmarked against the valid solution of the neutron diffusion equation for International Atomic Energy Agency (IAEA-3D and Water-Water Energetic Reactor (VVER-1000 reactor cores. In addition, validation of the calculations against the P1 approximation of the transport theory is investigated in relation to the liquid metal fast breeder reactor benchmark problem. The neutron fixed source calculations are benchmarked through a comparison with the results obtained from similar computational codes. Finally, an analysis of the sensitivity of calculations to the number of elements is performed.
Jacquemet, Vincent
2012-11-01
Electrical propagation of the cardiac impulse in the myocardium can be described by the eikonal-diffusion equation. This equation governs the field of activation times in a domain where conduction properties are specified. This approach has been applied to knowledge-based interpolation of sparse measurements of activation times and to the creation of initial conditions for detailed ionic models of cardiac propagation. This paper presents the mathematical basis, matrix formulation, and compact Matlab implementation of an iterative finite-element solver (triangular meshes) for the eikonal-diffusion equation extended to reentrant activations, which automatically identifies the period of reentry and computes the resulting isochrones. An iterative algorithm is designed to perform Laplacian interpolation of reentrant activation maps to be used as initial estimate for the eikonal-diffusion solver. The performance of the algorithm is analyzed in test-case geometries (ventricular slice and simplified atrial surface model).
Directional Diffusion Regulator (DDR) for some numerical solvers of hyperbolic conservation laws
Jaisankar, S.; Sheshadri, T. S.
2013-01-01
A computational tool called "Directional Diffusion Regulator (DDR)" is proposed to bring forth real multidimensional physics into the upwind discretization in some numerical schemes of hyperbolic conservation laws. The direction based regulator when used with dimension splitting solvers, is set to moderate the excess multidimensional diffusion and hence cause genuine multidimensional upwinding like effect. The basic idea of this regulator driven method is to retain a full upwind scheme across local discontinuities, with the upwind bias decreasing smoothly to a minimum in the farthest direction. The discontinuous solutions are quantified as gradients and the regulator parameter across a typical finite volume interface or a finite difference interpolation point is formulated based on fractional local maximum gradient in any of the weak solution flow variables (say density, pressure, temperature, Mach number or even wave velocity etc.). DDR is applied to both the non-convective as well as whole unsplit dissipative flux terms of some numerical schemes, mainly of Local Lax-Friedrichs, to solve some benchmark problems describing inviscid compressible flow, shallow water dynamics and magneto-hydrodynamics. The first order solutions consistently improved depending on the extent of grid non-alignment to discontinuities, with the major influence due to regulation of non-convective diffusion. The application is also experimented on schemes such as Roe, Jameson-Schmidt-Turkel and some second order accurate methods. The consistent improvement in accuracy either at moderate or marked levels, for a variety of problems and with increasing grid size, reasonably indicate a scope for DDR as a regular tool to impart genuine multidimensional upwinding effect in a simpler framework.
Parareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model
Energy Technology Data Exchange (ETDEWEB)
Baudron, Anne-Marie, E-mail: anne-marie.baudron@cea.fr [Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); CEA-DRN/DMT/SERMA, CEN-Saclay, 91191 Gif sur Yvette Cedex (France); Lautard, Jean-Jacques, E-mail: jean-jacques.lautard@cea.fr [Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); CEA-DRN/DMT/SERMA, CEN-Saclay, 91191 Gif sur Yvette Cedex (France); Maday, Yvon, E-mail: maday@ann.jussieu.fr [Sorbonne Universités, UPMC Univ Paris 06, UMR 7598, Laboratoire Jacques-Louis Lions and Institut Universitaire de France, F-75005, Paris (France); Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); Brown Univ, Division of Applied Maths, Providence, RI (United States); Riahi, Mohamed Kamel, E-mail: riahi@cmap.polytechnique.fr [Laboratoire de Recherche Conventionné MANON, CEA/DEN/DANS/DM2S and UPMC-CNRS/LJLL (France); CMAP, Inria-Saclay and X-Ecole Polytechnique, Route de Saclay, 91128 Palaiseau Cedex (France); Salomon, Julien, E-mail: salomon@ceremade.dauphine.fr [CEREMADE, Univ Paris-Dauphine, Pl. du Mal. de Lattre de Tassigny, F-75016, Paris (France)
2014-12-15
In this paper we present a time-parallel algorithm for the 3D neutrons calculation of a transient model in a nuclear reactor core. The neutrons calculation consists in numerically solving the time dependent diffusion approximation equation, which is a simplified transport equation. The numerical resolution is done with finite elements method based on a tetrahedral meshing of the computational domain, representing the reactor core, and time discretization is achieved using a θ-scheme. The transient model presents moving control rods during the time of the reaction. Therefore, cross-sections (piecewise constants) are taken into account by interpolations with respect to the velocity of the control rods. The parallelism across the time is achieved by an adequate use of the parareal in time algorithm to the handled problem. This parallel method is a predictor corrector scheme that iteratively combines the use of two kinds of numerical propagators, one coarse and one fine. Our method is made efficient by means of a coarse solver defined with large time step and fixed position control rods model, while the fine propagator is assumed to be a high order numerical approximation of the full model. The parallel implementation of our method provides a good scalability of the algorithm. Numerical results show the efficiency of the parareal method on large light water reactor transient model corresponding to the Langenbuch–Maurer–Werner benchmark.
Ferizi, Uran; Schneider, Torben; Alipoor, Mohammad; Eufracio, Odin; Fick, Rutger H J; Deriche, Rachid; Nilsson, Markus; Loya-Olivas, Ana K; Rivera, Mariano; Poot, Dirk H J; Ramirez-Manzanares, Alonso; Marroquin, Jose L; Rokem, Ariel; Pötter, Christian; Dougherty, Robert F; Sakaie, Ken; Wheeler-Kingshott, Claudia; Warfield, Simon K; Witzel, Thomas; Wald, Lawrence L; Raya, José G; Alexander, Daniel C
2016-01-01
A large number of mathematical models have been proposed to describe the measured signal in diffusion-weighted (DW) magnetic resonance imaging (MRI) and infer properties about the white matter microstructure. However, a head-to-head comparison of DW-MRI models is critically missing in the field. To address this deficiency, we organized the "White Matter Modeling Challenge" during the International Symposium on Biomedical Imaging (ISBI) 2015 conference. This competition aimed at identifying the DW-MRI models that best predict unseen DW data. in vivo DW-MRI data was acquired on the Connectom scanner at the A.A.Martinos Center (Massachusetts General Hospital) using gradients strength of up to 300 mT/m and a broad set of diffusion times. We focused on assessing the DW signal prediction in two regions: the genu in the corpus callosum, where the fibres are relatively straight and parallel, and the fornix, where the configuration of fibres is more complex. The challenge participants had access to three-quarters of t...
Energy Technology Data Exchange (ETDEWEB)
Hosseini, Seyed Abolfaz [Dept. of Energy Engineering, Sharif University of Technology, Tehran (Iran, Islamic Republic of)
2017-02-15
The purpose of the present study is the presentation of the appropriate element and shape function in the solution of the neutron diffusion equation in two-dimensional (2D) geometries. To this end, the multigroup neutron diffusion equation is solved using the Galerkin finite element method in both rectangular and hexagonal reactor cores. The spatial discretization of the equation is performed using unstructured triangular and quadrilateral finite elements. Calculations are performed using both linear and quadratic approximations of shape function in the Galerkin finite element method, based on which results are compared. Using the power iteration method, the neutron flux distributions with the corresponding eigenvalue are obtained. The results are then validated against the valid results for IAEA-2D and BIBLIS-2D benchmark problems. To investigate the dependency of the results to the type and number of the elements, and shape function order, a sensitivity analysis of the calculations to the mentioned parameters is performed. It is shown that the triangular elements and second order of the shape function in each element give the best results in comparison to the other states.
Mena, Andres; Ferrero, Jose M.; Rodriguez Matas, Jose F.
2015-11-01
Solving the electric activity of the heart possess a big challenge, not only because of the structural complexities inherent to the heart tissue, but also because of the complex electric behaviour of the cardiac cells. The multi-scale nature of the electrophysiology problem makes difficult its numerical solution, requiring temporal and spatial resolutions of 0.1 ms and 0.2 mm respectively for accurate simulations, leading to models with millions degrees of freedom that need to be solved for thousand time steps. Solution of this problem requires the use of algorithms with higher level of parallelism in multi-core platforms. In this regard the newer programmable graphic processing units (GPU) has become a valid alternative due to their tremendous computational horsepower. This paper presents results obtained with a novel electrophysiology simulation software entirely developed in Compute Unified Device Architecture (CUDA). The software implements fully explicit and semi-implicit solvers for the monodomain model, using operator splitting. Performance is compared with classical multi-core MPI based solvers operating on dedicated high-performance computer clusters. Results obtained with the GPU based solver show enormous potential for this technology with accelerations over 50 × for three-dimensional problems.
MCNP: Multigroup/adjoint capabilities
Energy Technology Data Exchange (ETDEWEB)
Wagner, J.C.; Redmond, E.L. II; Palmtag, S.P.; Hendricks, J.S.
1994-04-01
This report discusses various aspects related to the use and validity of the general purpose Monte Carlo code MCNP for multigroup/adjoint calculations. The increased desire to perform comparisons between Monte Carlo and deterministic codes, along with the ever-present desire to increase the efficiency of large MCNP calculations has produced a greater user demand for the multigroup/adjoint capabilities. To more fully utilize these capabilities, we review the applications of the Monte Carlo multigroup/adjoint method, describe how to generate multigroup cross sections for MCNP with the auxiliary CRSRD code, describe how to use the multigroup/adjoint capability in MCNP, and provide examples and results indicating the effectiveness and validity of the MCNP multigroup/adjoint treatment. This information should assist users in taking advantage of the MCNP multigroup/adjoint capabilities.
Energy Technology Data Exchange (ETDEWEB)
Moraes, Pedro Gabriel B.; Leite, Michel C.A.; Barros, Ricardo C., E-mail: pgbmoraes@gmail.com, E-mail: chell_leite@hotmail.com, E-mail: rcbarros@pq.cnpq.br [Universidade do Estado do Rio de Janeiro (UERJ), Nova Friburgo, RJ (Brazil). Instituto Politecnico. Departamento de Modelagem Computacional
2013-07-01
In this work we developed a software to model and generate results in tables and graphs of one-dimensional neutron transport problems in multi-group formulation of energy. The numerical method we use to solve the problem of neutron diffusion is analytic, thus eliminating the truncation errors that appear in classical numerical methods, e.g., the method of finite differences. This numerical analytical method increases the computational efficiency, since they are not refined spatial discretization necessary because for any spatial discretization grids used, the numerical result generated for the same point of the domain remains unchanged unless the rounding errors of computational finite arithmetic. We chose to develop a computational application in MatLab platform for numerical computation and program interface is simple and easy with knobs. We consider important to model this neutron transport problem with a fixed source in the context of shielding calculations of radiation that protects the biosphere, and could be sensitive to ionizing radiation.
The Suppression of Energy Discretization Errors in Multigroup Transport Calculations
Energy Technology Data Exchange (ETDEWEB)
Larsen, Edward [Univ. of Michigan, Ann Arbor, MI (United States). Dept. of Nuclear Engineering and Radiological Sciences
2013-06-17
The Objective of this project is to develop, implement, and test new deterministric methods to solve, as efficiently as possible, multigroup neutron transport problems having an extremely large number of groups. Our approach was to (i) use the standard CMFD method to "coarsen" the space-angle grid, yielding a multigroup diffusion equation, and (ii) use a new multigrid-in-space-and-energy technique to efficiently solve the multigroup diffusion problem. The overall strategy of (i) how to coarsen the spatial an energy grids, and (ii) how to navigate through the various grids, has the goal of minimizing the overall computational effort. This approach yields not only the fine-grid solution, but also coarse-group flux-weighted cross sections that can be used for other related problems.
Energy Technology Data Exchange (ETDEWEB)
Ceolin, Celina
2010-07-01
The objective of this work is to obtain an analytical solution of the neutron diffusion kinetic equation in one-dimensional cartesian geometry, to monoenergetic and multigroup problems. These equations are of the type stiff, due to large differences in the orders of magnitude of the time scales of the physical phenomena involved, which make them difficult to solve. The basic idea of the proposed method is applying the spectral expansion in the scalar flux and in the precursor concentration, taking moments and solving the resulting matrix problem by the Laplace transform technique. Bearing in mind that the equation for the precursor concentration is a first order linear differential equation in the time variable, to enable the application of the spectral method we introduce a fictitious diffusion term multiplied by a positive value which tends to zero. This procedure opened the possibility to find an analytical solution to the problem studied. We report numerical simulations and analysis of the results obtained with the precision controlled by the truncation order of the series. (author)
Energy Technology Data Exchange (ETDEWEB)
Petersen, Claudio Z. [Universidade Federal de Pelotas, Capao do Leao (Brazil). Programa de Pos Graduacao em Modelagem Matematica; Bodmann, Bardo E.J.; Vilhena, Marco T. [Universidade Federal do Rio Grande do Sul, Porto Alegre, RS (Brazil). Programa de Pos-graduacao em Engenharia Mecanica; Barros, Ricardo C. [Universidade do Estado do Rio de Janeiro, Nova Friburgo, RJ (Brazil). Inst. Politecnico
2014-12-15
In the present work we solve in analytical representation the three dimensional neutron kinetic diffusion problem in rectangular Cartesian geometry for homogeneous and bounded domains for any number of energy groups and precursor concentrations. The solution in analytical representation is constructed using a hierarchical procedure, i.e. the original problem is reduced to a problem previously solved by the authors making use of a combination of the spectral method and a recursive decomposition approach. Time dependent absorption cross sections of the thermal energy group are considered with step, ramp and Chebyshev polynomial variations. For these three cases, we present numerical results and discuss convergence properties and compare our results to those available in the literature.
Application de la methode des sous-groupes au calcul Monte-Carlo multigroupe
Martin, Nicolas
This thesis is dedicated to the development of a Monte Carlo neutron transport solver based on the subgroup (or multiband) method. In this formalism, cross sections for resonant isotopes are represented in the form of probability tables on the whole energy spectrum. This study is intended in order to test and validate this approach in lattice physics and criticality-safety applications. The probability table method seems promising since it introduces an alternative computational way between the legacy continuous-energy representation and the multigroup method. In the first case, the amount of data invoked in continuous-energy Monte Carlo calculations can be very important and tend to slow down the overall computational time. In addition, this model preserves the quality of the physical laws present in the ENDF format. Due to its cheap computational cost, the multigroup Monte Carlo way is usually at the basis of production codes in criticality-safety studies. However, the use of a multigroup representation of the cross sections implies a preliminary calculation to take into account self-shielding effects for resonant isotopes. This is generally performed by deterministic lattice codes relying on the collision probability method. Using cross-section probability tables on the whole energy range permits to directly take into account self-shielding effects and can be employed in both lattice physics and criticality-safety calculations. Several aspects have been thoroughly studied: (1) The consistent computation of probability tables with a energy grid comprising only 295 or 361 groups. The CALENDF moment approach conducted to probability tables suitable for a Monte Carlo code. (2) The combination of the probability table sampling for the energy variable with the delta-tracking rejection technique for the space variable, and its impact on the overall efficiency of the proposed Monte Carlo algorithm. (3) The derivation of a model for taking into account anisotropic
A hybrid Eulerian-Lagrangian flow solver
Palha, Artur; Ferreira, Carlos Simao; van Bussel, Gerard
2015-01-01
Currently, Eulerian flow solvers are very efficient in accurately resolving flow structures near solid boundaries. On the other hand, they tend to be diffusive and to dampen high-intensity vortical structures after a short distance away from solid boundaries. The use of high order methods and fine grids, although alleviating this problem, gives rise to large systems of equations that are expensive to solve. Lagrangian solvers, as the regularized vortex particle method, have shown to eliminate (in practice) the diffusion in the wake. As a drawback, the modelling of solid boundaries is less accurate, more complex and costly than with Eulerian solvers (due to the isotropy of its computational elements). Given the drawbacks and advantages of both Eulerian and Lagrangian solvers the combination of both methods, giving rise to a hybrid solver, is advantageous. The main idea behind the hybrid solver presented is the following. In a region close to solid boundaries the flow is solved with an Eulerian solver, where th...
SIMULATE-4 multigroup nodal code with microscopic depletion model
Energy Technology Data Exchange (ETDEWEB)
Bahadir, T. [Studsvik Scandpower, Inc., Newton, MA (United States); Lindahl, St.O. [Studsvik Scandpower AB, Vasteras (Sweden); Palmtag, S.P. [Studsvik Scandpower, Inc., Idaho Falls, ID (United States)
2005-07-01
SIMULATE-4 is a three-dimensional multigroup analytical nodal code with microscopic depletion capability. It has been developed employing 'first principal models' thus avoiding ad hoc approximations. The multigroup diffusion equations or, optionally, the simplified P{sub 3} equations are solved. Cross sections are described by a hybrid microscopic-macroscopic model that includes approximately 50 heavy nuclides and fission products. Heterogeneities in the axial direction of an assembly are treated systematically. Radially, the assembly is divided into heterogeneous sub-meshes, thereby overcoming the shortcomings of spatially-averaged assembly cross sections and discontinuity factors generated with zero net-current boundary conditions. Numerical tests against higher order transport methods and critical experiments show substantial improvements compared to results of existing nodal models. (authors)
Procedure to Generate the MPACT Multigroup Library
Energy Technology Data Exchange (ETDEWEB)
Kim, Kang Seog [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2015-12-17
The CASL neutronics simulator MPACT is under development for the neutronics and T-H coupled simulation for the light water reactor. The objective of this document is focused on reviewing the current procedure to generate the MPACT multigroup library. Detailed methodologies and procedures are included in this document for further discussion to improve the MPACT multigroup library.
Energy Technology Data Exchange (ETDEWEB)
Druskin, V.; Knizhnerman, L.
1994-12-31
The authors solve the Cauchy problem for an ODE system Au + {partial_derivative}u/{partial_derivative}t = 0, u{vert_bar}{sub t=0} = {var_phi}, where A is a square real nonnegative definite symmetric matrix of the order N, {var_phi} is a vector from R{sup N}. The stiffness matrix A is obtained due to semi-discretization of a parabolic equation or system with time-independent coefficients. The authors are particularly interested in large stiff 3-D problems for the scalar diffusion and vectorial Maxwell`s equations. First they consider an explicit method in which the solution on a whole time interval is projected on a Krylov subspace originated by A. Then they suggest another Krylov subspace with better approximating properties using powers of an implicit transition operator. These Krylov subspace methods generate optimal in a spectral sense polynomial approximations for the solution of the ODE, similar to CG for SLE.
Zoeteweij, P.
2005-01-01
Composing constraint solvers based on tree search and constraint propagation through generic iteration leads to efficient and flexible constraint solvers. This was demonstrated using OpenSolver, an abstract branch-and-propagate tree search engine that supports a wide range of relevant solver configu
Energy Technology Data Exchange (ETDEWEB)
Mosca, P.
2009-12-15
The deterministic transport codes solve the stationary Boltzmann equation in a discretized energy formalism called multigroup. The transformation of continuous data in a multigroup form is obtained by averaging the highly variable cross sections of the resonant isotopes with the solution of the self-shielding models and the remaining ones with the coarse energy spectrum of the reactor type. So far the error of such an approach could only be evaluated retrospectively. To remedy this, we studied in this thesis a set of methods to control a priori the accuracy and the cost of the multigroup transport computation. The energy mesh optimisation is achieved using a two step process: the creation of a reference mesh and its optimized condensation. In the first stage, by refining locally and globally the energy mesh, we seek, on a fine energy mesh with subgroup self-shielding, a solution equivalent to a reference solver (Monte Carlo or pointwise deterministic solver). In the second step, once fixed the number of groups, depending on the acceptable computational cost, and chosen the most appropriate self-shielding models to the reactor type, we look for the best bounds of the reference mesh minimizing reaction rate errors by the particle swarm optimization algorithm. This new approach allows us to define new meshes for fast reactors as accurate as the currently used ones, but with fewer groups. (author)
EXTENSION OF THE 1D FOUR-GROUP ANALYTIC NODAL METHOD TO FULL MULTIGROUP
Energy Technology Data Exchange (ETDEWEB)
B. D. Ganapol; D. W. Nigg
2008-09-01
In the mid 80’s, a four-group/two-region, entirely analytical 1D nodal benchmark appeared. It was readily acknowledged that this special case was as far as one could go in terms of group number and still achieve an analytical solution. In this work, we show that by decomposing the solution to the multigroup diffusion equation into homogeneous and particular solutions, extension to any number of groups is a relatively straightforward exercise using the mathematics of linear algebra.
Differential equations problem solver
Arterburn, David R
2012-01-01
REA's Problem Solvers is a series of useful, practical, and informative study guides. Each title in the series is complete step-by-step solution guide. The Differential Equations Problem Solver enables students to solve difficult problems by showing them step-by-step solutions to Differential Equations problems. The Problem Solvers cover material ranging from the elementary to the advanced and make excellent review books and textbook companions. They're perfect for undergraduate and graduate studies.The Differential Equations Problem Solver is the perfect resource for any class, any exam, and
Multigroup Free-atom Doppler-broadening Approximation. Theory
Energy Technology Data Exchange (ETDEWEB)
Gray, Mark Girard [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-11-06
Multigroup cross sections at a one target temperature can be Doppler-broadened to multigroup cross sections at a higher target temperature by matrix multiplication if the group structure suf- ficiently resolves the original temperature continuous energy cross section. Matrix elements are the higher temperature group weighted averages of the integral over the lower temperature group boundaries of the free-atom Doppler-broadening kernel. The results match theory for constant and 1/v multigroup cross sections at 618 lanl group structure resolution.
Modelling and simulations of macroscopic multi-group pedestrian flow
Mahato, Naveen K; Tiwari, Sudarshan
2016-01-01
We consider a multi-group microscopic model for pedestrian flow describing the behaviour of large groups. It is based on an interacting particle system coupled to an eikonal equation. Hydrodynamic multi-group models are derived from the underlying particle system as well as scalar multi-group models. The eikonal equation is used to compute optimal paths for the pedestrians. Particle methods are used to solve the macroscopic equations. Numerical test cases are investigated and the models and, in particular, the resulting evacuation times are compared for a wide range of different parameters.
Non linear prompt neutron kinetics in multigroup diffusion theory
Energy Technology Data Exchange (ETDEWEB)
Ghatak, Ajoy Kumar
1963-06-15
It is shown that in the usual point kinetics formulation of the Fuch's model the assumption that the basic quantity is the ratio of prompt negative temperature coefficient to prompt neutron lifetime is correct in the limit that the higher mode effects can be neglected. The criticality calculation needed to calculate this coefficient is defined. The effect on the Fuch's model when the heat capacity and temperature coefficient vary linearly with temperature and delayed neutrons are taken into account is considered. The higher mode contributions in the presence of temperature feed-back effects are estimated. A method for calculating the space-dependent effects in non-linear kinetics is outlined. An analysis of the transient behavior of the TREAT reactor is also given. (C.E.S.)
Experiments with Succinct Solvers
DEFF Research Database (Denmark)
Buchholtz, Mikael; Nielson, Hanne Riis; Nielson, Flemming
2002-01-01
time of the solver and the aim of this note is to provide some insight into which formulations are better than others. The experiments addresses three general issues: (i) the order of the parameters of relations, (ii) the order of conjuncts in preconditions and (iii) the use of memoisation....... The experiments are performed for Control Flow Analyses for Discretionary Ambients....
Consistent Multigroup Theory Enabling Accurate Course-Group Simulation of Gen IV Reactors
Energy Technology Data Exchange (ETDEWEB)
Rahnema, Farzad; Haghighat, Alireza; Ougouag, Abderrafi
2013-11-29
The objective of this proposal is the development of a consistent multi-group theory that accurately accounts for the energy-angle coupling associated with collapsed-group cross sections. This will allow for coarse-group transport and diffusion theory calculations that exhibit continuous energy accuracy and implicitly treat cross- section resonances. This is of particular importance when considering the highly heterogeneous and optically thin reactor designs within the Next Generation Nuclear Plant (NGNP) framework. In such reactors, ignoring the influence of anisotropy in the angular flux on the collapsed cross section, especially at the interface between core and reflector near which control rods are located, results in inaccurate estimates of the rod worth, a serious safety concern. The scope of this project will include the development and verification of a new multi-group theory enabling high-fidelity transport and diffusion calculations in coarse groups, as well as a methodology for the implementation of this method in existing codes. This will allow for a higher accuracy solution of reactor problems while using fewer groups and will reduce the computational expense. The proposed research represents a fundamental advancement in the understanding and improvement of multi- group theory for reactor analysis.
Multigroup Moderation Test in Generalized Structured Component Analysis
Directory of Open Access Journals (Sweden)
Angga Dwi Mulyanto
2016-05-01
Full Text Available Generalized Structured Component Analysis (GSCA is an alternative method in structural modeling using alternating least squares. GSCA can be used for the complex analysis including multigroup. GSCA can be run with a free software called GeSCA, but in GeSCA there is no multigroup moderation test to compare the effect between groups. In this research we propose to use the T test in PLS for testing moderation Multigroup on GSCA. T test only requires sample size, estimate path coefficient, and standard error of each group that are already available on the output of GeSCA and the formula is simple so the user does not need a long time for analysis.
Radiation Transport for Explosive Outflows: A Multigroup Hybrid Monte Carlo Method
Wollaeger, Ryan T; Graziani, Carlo; Couch, Sean M; Jordan, George C; Lamb, Donald Q; Moses, Gregory A
2013-01-01
We explore the application of Implicit Monte Carlo (IMC) and Discrete Diffusion Monte Carlo (DDMC) to radiation transport in strong fluid outflows with structured opacity. The IMC method of Fleck & Cummings is a stochastic computational technique for nonlinear radiation transport. IMC is partially implicit in time and may suffer in efficiency when tracking Monte Carlo particles through optically thick materials. The DDMC method of Densmore accelerates an IMC computation where the domain is diffusive. Recently, Abdikamalov extended IMC and DDMC to multigroup, velocity-dependent neutrino transport with the intent of modeling neutrino dynamics in core-collapse supernovae. Densmore has also formulated a multifrequency extension to the originally grey DDMC method. In this article we rigorously formulate IMC and DDMC over a high-velocity Lagrangian grid for possible application to photon transport in the post-explosion phase of Type Ia supernovae. The method described is suitable for a large variety of non-mono...
Review of multigroup nuclear cross-section processing
Energy Technology Data Exchange (ETDEWEB)
Trubey, D.K.; Hendrickson, H.R. (comps.)
1978-10-01
These proceedings consist of 18 papers given at a seminar--workshop on ''Multigroup Nuclear Cross-Section Processing'' held at Oak Ridge, Tennessee, March 14--16, 1978. The papers describe various computer code systems and computing algorithms for producing multigroup neutron and gamma-ray cross sections from evaluated data, and experience with several reference data libraries. Separate abstracts were prepared for 13 of the papers. The remaining five have already been cited in ERA, and may be located by referring to the entry CONF-780334-- in the Report Number Index. (RWR)
Electric circuits problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of electric circuits currently av
Advanced calculus problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of advanced calculus currently av
Multigroup Confirmatory Factor Analysis: Locating the Invariant Referent Sets
French, Brian F.; Finch, W. Holmes
2008-01-01
Multigroup confirmatory factor analysis (MCFA) is a popular method for the examination of measurement invariance and specifically, factor invariance. Recent research has begun to focus on using MCFA to detect invariance for test items. MCFA requires certain parameters (e.g., factor loadings) to be constrained for model identification, which are…
Energy Technology Data Exchange (ETDEWEB)
Smith, L.A.; Gallmeier, F.X. [Oak Ridge Institute for Science and Energy, TN (United States); Gehin, J.C. [Oak Ridge National Lab., TN (United States)] [and others
1995-05-01
The FOEHN critical experiment was analyzed to validate the use of multigroup cross sections and Oak Ridge National Laboratory neutronics computer codes in the design of the Advanced Neutron Source. The ANSL-V 99-group master cross section library was used for all the calculations. Three different critical configurations were evaluated using the multigroup KENO Monte Carlo transport code, the multigroup DORT discrete ordinates transport code, and the multigroup diffusion theory code VENTURE. The simple configuration consists of only the fuel and control elements with the heavy water reflector. The intermediate configuration includes boron endplates at the upper and lower edges of the fuel element. The complex configuration includes both the boron endplates and components in the reflector. Cross sections were processed using modules from the AMPX system. Both 99-group and 20-group cross sections were created and used in two-dimensional models of the FOEHN experiment. KENO calculations were performed using both 99-group and 20-group cross sections. The DORT and VENTURE calculations were performed using 20-group cross sections. Because the simple and intermediate configurations are azimuthally symmetric, these configurations can be explicitly modeled in R-Z geometry. Since the reflector components cannot be modeled explicitly using the current versions of these codes, three reflector component homogenization schemes were developed and evaluated for the complex configuration. Power density distributions were calculated with KENO using 99-group cross sections and with DORT and VENTURE using 20-group cross sections. The average differences between the measured values and the values calculated with the different computer codes range from 2.45 to 5.74%. The maximum differences between the measured and calculated thermal flux values for the simple and intermediate configurations are {approx} 13%, while the average differences are < 8%.
Quantum Electrodynamics vacuum polarization solver
Carneiro, Pedro; Fonseca, Ricardo; Silva, Luís
2016-01-01
The self-consistent modeling of vacuum polarization due to virtual electron-positron fluctuations is of relevance for many near term experiments associated with high intensity radiation sources and represents a milestone in describing scenarios of extreme energy density. We present a generalized finite-difference time-domain solver that can incorporate the modifications to Maxwells equations due to virtual vacuum polarization. Our multidimensional solver reproduced in one dimensional configurations the results for which an analytic treatment is possible, yielding vacuum harmonic generation and birefringence. The solver has also been tested for two-dimensional scenarios where finite laser beam spot sizes must be taken into account. We employ this solver to explore different types of counter-propagating configurations that can be relevant for future planned experiments aiming to detect quantum vacuum dynamics at ultra-high electromagnetic field intensities.
Sherlock Holmes, Master Problem Solver.
Ballew, Hunter
1994-01-01
Shows the connections between Sherlock Holmes's investigative methods and mathematical problem solving, including observations, characteristics of the problem solver, importance of data, questioning the obvious, learning from experience, learning from errors, and indirect proof. (MKR)
Sherlock Holmes, Master Problem Solver.
Ballew, Hunter
1994-01-01
Shows the connections between Sherlock Holmes's investigative methods and mathematical problem solving, including observations, characteristics of the problem solver, importance of data, questioning the obvious, learning from experience, learning from errors, and indirect proof. (MKR)
Modern solvers for Helmholtz problems
Tang, Jok; Vuik, Kees
2017-01-01
This edited volume offers a state of the art overview of fast and robust solvers for the Helmholtz equation. The book consists of three parts: new developments and analysis in Helmholtz solvers, practical methods and implementations of Helmholtz solvers, and industrial applications. The Helmholtz equation appears in a wide range of science and engineering disciplines in which wave propagation is modeled. Examples are: seismic inversion, ultrasone medical imaging, sonar detection of submarines, waves in harbours and many more. The partial differential equation looks simple but is hard to solve. In order to approximate the solution of the problem numerical methods are needed. First a discretization is done. Various methods can be used: (high order) Finite Difference Method, Finite Element Method, Discontinuous Galerkin Method and Boundary Element Method. The resulting linear system is large, where the size of the problem increases with increasing frequency. Due to higher frequencies the seismic images need to b...
Scalable Parallel Algebraic Multigrid Solvers
Energy Technology Data Exchange (ETDEWEB)
Bank, R; Lu, S; Tong, C; Vassilevski, P
2005-03-23
The authors propose a parallel algebraic multilevel algorithm (AMG), which has the novel feature that the subproblem residing in each processor is defined over the entire partition domain, although the vast majority of unknowns for each subproblem are associated with the partition owned by the corresponding processor. This feature ensures that a global coarse description of the problem is contained within each of the subproblems. The advantages of this approach are that interprocessor communication is minimized in the solution process while an optimal order of convergence rate is preserved; and the speed of local subproblem solvers can be maximized using the best existing sequential algebraic solvers.
Self-correcting Multigrid Solver
Energy Technology Data Exchange (ETDEWEB)
Jerome L.V. Lewandowski
2004-06-29
A new multigrid algorithm based on the method of self-correction for the solution of elliptic problems is described. The method exploits information contained in the residual to dynamically modify the source term (right-hand side) of the elliptic problem. It is shown that the self-correcting solver is more efficient at damping the short wavelength modes of the algebraic error than its standard equivalent. When used in conjunction with a multigrid method, the resulting solver displays an improved convergence rate with no additional computational work.
MUXS: a code to generate multigroup cross sections for sputtering calculations
Energy Technology Data Exchange (ETDEWEB)
Hoffman, T.J.; Robinson, M.T.; Dodds, H.L. Jr.
1982-10-01
This report documents MUXS, a computer code to generate multigroup cross sections for charged particle transport problems. Cross sections generated by MUXS can be used in many multigroup transport codes, with minor modifications to these codes, to calculate sputtering yields, reflection coefficients, penetration distances, etc.
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
Plemmons G. Golub and A. Sameh. High-speed computing : scientific appli- cations and algorithm design. University of Illinois Press, Champaign, Illinois , 1988...16. SECURITY CLASSIFICATION OF: Sparse symmetric eigenvalue problems arise in many computational science and engineering applications such as...Eigenvalue Problem Solvers Report Title Sparse symmetric eigenvalue problems arise in many computational science and engineering applications such as
Multigroup Equivalence Analysis for High-Dimensional Expression Data
Yang, Celeste; Bartolucci, Alfred A.; Cui, Xiangqin
2015-01-01
Hypothesis tests of equivalence are typically known for their application in bioequivalence studies and acceptance sampling. Their application to gene expression data, in particular high-dimensional gene expression data, has only recently been studied. In this paper, we examine how two multigroup equivalence tests, the F-test and the range test, perform when applied to microarray expression data. We adapted these tests to a well-known equivalence criterion, the difference ratio. Our simulation results showed that both tests can achieve moderate power while controlling the type I error at nominal level for typical expression microarray studies with the benefit of easy-to-interpret equivalence limits. For the range of parameters simulated in this paper, the F-test is more powerful than the range test. However, for comparing three groups, their powers are similar. Finally, the two multigroup tests were applied to a prostate cancer microarray dataset to identify genes whose expression follows a prespecified trajectory across five prostate cancer stages. PMID:26628859
Multigroup Equivalence Analysis for High-Dimensional Expression Data.
Yang, Celeste; Bartolucci, Alfred A; Cui, Xiangqin
2015-01-01
Hypothesis tests of equivalence are typically known for their application in bioequivalence studies and acceptance sampling. Their application to gene expression data, in particular high-dimensional gene expression data, has only recently been studied. In this paper, we examine how two multigroup equivalence tests, the F-test and the range test, perform when applied to microarray expression data. We adapted these tests to a well-known equivalence criterion, the difference ratio. Our simulation results showed that both tests can achieve moderate power while controlling the type I error at nominal level for typical expression microarray studies with the benefit of easy-to-interpret equivalence limits. For the range of parameters simulated in this paper, the F-test is more powerful than the range test. However, for comparing three groups, their powers are similar. Finally, the two multigroup tests were applied to a prostate cancer microarray dataset to identify genes whose expression follows a prespecified trajectory across five prostate cancer stages.
Ott, Christian D; Dessart, Luc; Livne, Eli
2008-01-01
We perform axisymmetric (2D) multi-angle, multi-group neutrino radiation-hydrodynamics calculations of the postbounce phase of core-collapse supernovae using a genuinely 2D discrete-ordinate (S_n) method. We follow the long-term postbounce evolution of the cores of one nonrotating and one rapidly-rotating 20-solar-mass stellar model for ~400 milliseconds from 160 ms to ~550 ms after bounce. We present a multi-D analysis of the multi-angle neutrino radiation fields and compare in detail with counterpart simulations carried out in the 2D multi-group flux-limited diffusion (MGFLD) approximation to neutrino transport. We find that 2D multi-angle transport is superior in capturing the global and local radiation-field variations associated with rotation-induced and SASI-induced aspherical hydrodynamic configurations. In the rotating model, multi-angle transport predicts much larger asymptotic neutrino flux asymmetries with pole to equator ratios of up to ~2.5, while MGFLD tends to sphericize the radiation fields al...
Validation of a multi-block solver on aerospace test cases
Energy Technology Data Exchange (ETDEWEB)
Gogoi, A.; Rao, K.V.L. [Aeronautical Development Agency, Bangalore (India)]. E-mail: agogoi@yahoo.com
2003-07-01
The paper presents validation of a multi block solver on test cases of the aerospace industry like the RAE S duct, ONERA M6 wing and a delta wing. The flow features like curvature effects, cross flow vortices, overall diffusion of the S duct, {lambda} shock on the ONERA wing and leading edge vortex on the delta wing are well captured. These results demonstrate the robustness and versatility of the multi block solver. (author)
A generalized gyrokinetic Poisson solver
Energy Technology Data Exchange (ETDEWEB)
Lin, Z.; Lee, W.W.
1995-03-01
A generalized gyrokinetic Poisson solver has been developed, which employs local operations in the configuration space to compute the polarization density response. The new technique is based on the actual physical process of gyrophase-averaging. It is useful for nonlocal simulations using general geometry equilibrium. Since it utilizes local operations rather than the global ones such as FFT, the new method is most amenable to massively parallel algorithms.
Multigroup covariance matrices for fast-reactor studies
Energy Technology Data Exchange (ETDEWEB)
Smith, J.D. III; Broadhead, B.L.
1981-04-01
This report presents the multigroup covariance matrices based on the ENDF/B-V nuclear data evaluations. The materials and reactions have been chosen according to the specifications of ORNL-5517. Several cross section covariances, other than those specified by that report, are included due to the derived nature of the uncertainty files in ENDF/B-V. The materials represented are Ni, Cr, /sup 16/O, /sup 12/C, Fe, Na, /sup 235/U, /sup 238/U, /sup 239/Pu, /sup 240/Pu, /sup 241/Pu, and /sup 10/B (present due to its correlation to /sup 238/U). The data have been originally processed into a 52-group energy structure by PUFF-II and subsequently collapsed to smaller subgroup strutures. The results are illustrated in 52-group correlation matrix plots and tabulated into thirteen groups for convenience.
A multi-group firefly algorithm for numerical optimization
Tong, Nan; Fu, Qiang; Zhong, Caiming; Wang, Pengjun
2017-08-01
To solve the problem of premature convergence of firefly algorithm (FA), this paper analyzes the evolution mechanism of the algorithm, and proposes an improved Firefly algorithm based on modified evolution model and multi-group learning mechanism (IMGFA). A Firefly colony is divided into several subgroups with different model parameters. Within each subgroup, the optimal firefly is responsible for leading the others fireflies to implement the early global evolution, and establish the information mutual system among the fireflies. And then, each firefly achieves local search by following the brighter firefly in its neighbors. At the same time, learning mechanism among the best fireflies in various subgroups to exchange information can help the population to obtain global optimization goals more effectively. Experimental results verify the effectiveness of the proposed algorithm.
Multi-group dynamic quantum secret sharing with single photons
Energy Technology Data Exchange (ETDEWEB)
Liu, Hongwei [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Ma, Haiqiang, E-mail: hqma@bupt.edu.cn [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Wei, Kejin [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Yang, Xiuqing [School of Science, Beijing Jiaotong University, Beijing 100044 (China); Qu, Wenxiu; Dou, Tianqi; Chen, Yitian; Li, Ruixue; Zhu, Wu [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China)
2016-07-15
In this letter, we propose a novel scheme for the realization of single-photon dynamic quantum secret sharing between a boss and three dynamic agent groups. In our system, the boss can not only choose one of these three groups to share the secret with, but also can share two sets of independent keys with two groups without redistribution. Furthermore, the security of communication is enhanced by using a control mode. Compared with previous schemes, our scheme is more flexible and will contribute to a practical application. - Highlights: • A multi-group dynamic quantum secret sharing with single photons scheme is proposed. • Any one of the groups can be chosen to share secret through controlling the polarization of photons. • Two sets of keys can be shared simultaneously without redistribution.
Energy Technology Data Exchange (ETDEWEB)
Coste-Delclaux, M
2006-03-15
This document describes the improvements carried out for modelling the self-shielding phenomenon in the multigroup transport code APOLLO2. They concern the space and energy treatment of the slowing-down equation, the setting up of quadrature formulas to calculate reaction rates, the setting-up of a method that treats directly a resonant mixture and the development of a sub-group method. We validate these improvements either in an elementary or in a global way. Now, we obtain, more accurate multigroup reaction rates and we are able to carry out a reference self-shielding calculation on a very fine multigroup mesh. To end, we draw a conclusion and give some prospects on the remaining work. (author)
Gong, Weiwei; Zhou, Xu
2017-06-01
In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design. This paper reviews the main algorithms of the SAT solver in recent years, including serial SAT algorithms, parallel SAT algorithms, SAT algorithms based on GPU, and SAT algorithms based on FPGA. The development of SAT is analyzed comprehensively in this paper. Finally, several possible directions for the development of the SAT problem are proposed.
An Energy Conserving Parallel Hybrid Plasma Solver
Holmstrom, M
2010-01-01
We investigate the performance of a hybrid plasma solver on the test problem of an ion beam. The parallel solver is based on cell centered finite differences in space, and a predictor-corrector leapfrog scheme in time. The implementation is done in the FLASH software framework. It is shown that the solver conserves energy well over time, and that the parallelization is efficient (it exhibits weak scaling).
An HLLC Solver for Relativistic Flows
Mignone, A
2005-01-01
We present an extension of the HLLC approximate Riemann solver by Toro, Spruce and Speares to the relativistic equations of fluid dynamics. The solver retains the simplicity of the original two-wave formulation proposed by Harten, Lax and van Leer (HLL) but it restores the missing contact wave in the solution of the Riemann problem. The resulting numerical scheme is computationally efficient, robust and positively conservative. The performance of the new solver is evaluated through numerical testing in one and two dimensions.
Predicting SMT Solver Performance for Software Verification
Directory of Open Access Journals (Sweden)
Andrew Healy
2017-01-01
Full Text Available The Why3 IDE and verification system facilitates the use of a wide range of Satisfiability Modulo Theories (SMT solvers through a driver-based architecture. We present Where4: a portfolio-based approach to discharge Why3 proof obligations. We use data analysis and machine learning techniques on static metrics derived from program source code. Our approach benefits software engineers by providing a single utility to delegate proof obligations to the solvers most likely to return a useful result. It does this in a time-efficient way using existing Why3 and solver installations - without requiring low-level knowledge about SMT solver operation from the user.
An immersed interface vortex particle-mesh solver
Marichal, Yves; Chatelain, Philippe; Winckelmans, Gregoire
2014-11-01
An immersed interface-enabled vortex particle-mesh (VPM) solver is presented for the simulation of 2-D incompressible viscous flows, in the framework of external aerodynamics. Considering the simulation of free vortical flows, such as wakes and jets, vortex particle-mesh methods already provide a valuable alternative to standard CFD methods, thanks to the interesting numerical properties arising from its Lagrangian nature. Yet, accounting for solid bodies remains challenging, despite the extensive research efforts that have been made for several decades. The present immersed interface approach aims at improving the consistency and the accuracy of one very common technique (based on Lighthill's model) for the enforcement of the no-slip condition at the wall in vortex methods. Targeting a sharp treatment of the wall calls for substantial modifications at all computational levels of the VPM solver. More specifically, the solution of the underlying Poisson equation, the computation of the diffusion term and the particle-mesh interpolation are adapted accordingly and the spatial accuracy is assessed. The immersed interface VPM solver is subsequently validated on the simulation of some challenging impulsively started flows, such as the flow past a cylinder and that past an airfoil. Research Fellow (PhD student) of the F.R.S.-FNRS of Belgium.
Energy Technology Data Exchange (ETDEWEB)
GARDNER, P.R.
2006-04-01
Sudoku, also known as Number Place, is a logic-based placement puzzle. The aim of the puzzle is to enter a numerical digit from 1 through 9 in each cell of a 9 x 9 grid made up of 3 x 3 subgrids (called ''regions''), starting with various digits given in some cells (the ''givens''). Each row, column, and region must contain only one instance of each numeral. Completing the puzzle requires patience and logical ability. Although first published in a U.S. puzzle magazine in 1979, Sudoku initially caught on in Japan in 1986 and attained international popularity in 2005. Last fall, after noticing Sudoku puzzles in some newspapers and magazines, I attempted a few just to see how hard they were. Of course, the difficulties varied considerably. ''Obviously'' one could use Trial and Error but all the advice was to ''Use Logic''. Thinking to flex, and strengthen, those powers, I began to tackle the puzzles systematically. That is, when I discovered a new tactical rule, I would write it down, eventually generating a list of ten or so, with some having overlap. They served pretty well except for the more difficult puzzles, but even then I managed to develop an additional three rules that covered all of them until I hit the Oregonian puzzle shown. With all of my rules, I could not seem to solve that puzzle. Initially putting my failure down to rapid mental fatigue (being unable to hold a sufficient quantity of information in my mind at one time), I decided to write a program to implement my rules and see what I had failed to notice earlier. The solver, too, failed. That is, my rules were insufficient to solve that particular puzzle. I happened across a book written by a fellow who constructs such puzzles and who claimed that, sometimes, the only tactic left was trial and error. With a trial and error routine implemented, my solver successfully completed the Oregonian puzzle, and has successfully
SIERRA framework version 4 : solver services.
Energy Technology Data Exchange (ETDEWEB)
Williams, Alan B.
2005-02-01
Several SIERRA applications make use of third-party libraries to solve systems of linear and nonlinear equations, and to solve eigenproblems. The classes and interfaces in the SIERRA framework that provide linear system assembly services and access to solver libraries are collectively referred to as solver services. This paper provides an overview of SIERRA's solver services including the design goals that drove the development, and relationships and interactions among the various classes. The process of assembling and manipulating linear systems will be described, as well as access to solution methods and other operations.
Simulations of protostellar collapse using multigroup radiation hydrodynamics. I. The first collapse
Vaytet, Neil; Chabrier, Gilles; Commercon, Benoit; Masson, Jacques
2012-01-01
Radiative transfer plays a major role in the process of star formation. Many simulations of gravitational collapse of a cold gas cloud followed by the formation of a protostellar core use a grey treatment of radiative transfer coupled to the hydrodynamics. However, dust opacities which dominate extinction show large variations as a function of frequency. In this paper, we used frequency-dependent radiative transfer to investigate the influence of the opacity variations on the properties of Larson's first core. We used a multigroup M1 moment model in a 1D radiation hydrodynamics code to simulate the spherically symmetric collapse of a 1 solar mass cloud core. Monochromatic dust opacities for five different temperature ranges were used to compute Planck and Rosseland means inside each frequency group. The results are very consistent with previous studies and only small differences were observed between the grey and multigroup simulations. For a same central density, the multigroup simulations tend to produce fi...
Development of a Multi-Group Neutron Cross Section Library Generation System for PWR
Energy Technology Data Exchange (ETDEWEB)
Kim, Kang Seog; Hong, Ser Gi; Song, Jae Seung; Lee, Kyung Hoon; Cho, Jin Young; Kim, Ha Yong; Koo, Bon Seung; Shim, Hyung Jin; Park, Sang Yoon
2008-10-15
This report describes a generation system of multi-group cross section library which is used in the KARMA lattice calculation code. In particular, the theoretical methodologies, program structures, and input preparations for the constituent programs of the system are described in detail. The library generation system consists of the following five programs : ANJOY, GREDIT, MERIT, SUBDATA, and LIBGEN. ANJOY generates automatically the NJOY input files and two batch files for automatic NJOY run for all the nuclides considered. The automatic NJOY run gives TAPE 23 (PENDF output file of BROADR module of NJOY) and TAPE24 (GENDF output file of GROUPR module of NJOY) files for each nuclide. GREDIT prepares a formatted multi-group cross section file in which the cross sections are tabulated versus temperature and background cross section after reading the TAPE24 file. MERIT generates the hydrogen equivalence factors and the resonance integral tables by solving the slowing down equation with ultra-fine group cross sections which are prepared with the TAPE 23 file. SUBDATA generates the subgroup data including subgroup levels and weights after reading the MERIT output file. Finally, LIBGEN generates the final multi-group library file by assembling the data prepared in the previous steps and by reading the other data such as fission product yield data and decay data.The multi-group cross section library includes general multi-group cross sections, resonance data, subgroup data, fission product yield data, kappa-values (energy release per fission), and all the data which are required in the depletion calculation. The addition or elimination of the cross sections for some nuclides can be easily done by changing the LIBGEN input file if the general multi-group cross section and the subgroup data files are prepared.
DANTSYS: A diffusion accelerated neutral particle transport code system
Energy Technology Data Exchange (ETDEWEB)
Alcouffe, R.E.; Baker, R.S.; Brinkley, F.W.; Marr, D.R.; O`Dell, R.D.; Walters, W.F.
1995-06-01
The DANTSYS code package includes the following transport codes: ONEDANT, TWODANT, TWODANT/GQ, TWOHEX, and THREEDANT. The DANTSYS code package is a modular computer program package designed to solve the time-independent, multigroup discrete ordinates form of the boltzmann transport equation in several different geometries. The modular construction of the package separates the input processing, the transport equation solving, and the post processing (or edit) functions into distinct code modules: the Input Module, one or more Solver Modules, and the Edit Module, respectively. The Input and Edit Modules are very general in nature and are common to all the Solver Modules. The ONEDANT Solver Module contains a one-dimensional (slab, cylinder, and sphere), time-independent transport equation solver using the standard diamond-differencing method for space/angle discretization. Also included in the package are solver Modules named TWODANT, TWODANT/GQ, THREEDANT, and TWOHEX. The TWODANT Solver Module solves the time-independent two-dimensional transport equation using the diamond-differencing method for space/angle discretization. The authors have also introduced an adaptive weighted diamond differencing (AWDD) method for the spatial and angular discretization into TWODANT as an option. The TWOHEX Solver Module solves the time-independent two-dimensional transport equation on an equilateral triangle spatial mesh. The THREEDANT Solver Module solves the time independent, three-dimensional transport equation for XYZ and RZ{Theta} symmetries using both diamond differencing with set-to-zero fixup and the AWDD method. The TWODANT/GQ Solver Module solves the 2-D transport equation in XY and RZ symmetries using a spatial mesh of arbitrary quadrilaterals. The spatial differencing method is based upon the diamond differencing method with set-to-zero fixup with changes to accommodate the generalized spatial meshing.
An advanced implicit solver for MHD
Udrea, Bogdan
A new implicit algorithm has been developed for the solution of the time-dependent, viscous and resistive single fluid magnetohydrodynamic (MHD) equations. The algorithm is based on an approximate Riemann solver for the hyperbolic fluxes and central differencing applied on a staggered grid for the parabolic fluxes. The algorithm employs a locally aligned coordinate system that allows the solution to the Riemann problems to be solved in a natural direction, normal to cell interfaces. The result is an original scheme that is robust and reduces the complexity of the flux formulas. The evaluation of the parabolic fluxes is also implemented using a locally aligned coordinate system, this time on the staggered grid. The implicit formulation employed by WARP3 is a two level scheme that was applied for the first time to the single fluid MHD model. The flux Jacobians that appear in the implicit scheme are evaluated numerically. The linear system that results from the implicit discretization is solved using a robust symmetric Gauss-Seidel method. The code has an explicit mode capability so that implementation and test of new algorithms or new physics can be performed in this simpler mode. Last but not least the code was designed and written to run on parallel computers so that complex, high resolution runs can be per formed in hours rather than days. The code has been benchmarked against analytical and experimental gas dynamics and MHD results. The benchmarks consisted of one-dimensional Riemann problems and diffusion dominated problems, two-dimensional supersonic flow over a wedge, axisymmetric magnetoplasmadynamic (MPD) thruster simulation and three-dimensional supersonic flow over intersecting wedges and spheromak stability simulation. The code has been proven to be robust and the results of the simulations showed excellent agreement with analytical and experimental results. Parallel performance studies showed that the code performs as expected when run on parallel
Benchmarking optimization solvers for structural topology optimization
DEFF Research Database (Denmark)
Rojas Labanda, Susana; Stolpe, Mathias
2015-01-01
The purpose of this article is to benchmark different optimization solvers when applied to various finite element based structural topology optimization problems. An extensive and representative library of minimum compliance, minimum volume, and mechanism design problem instances for different...... sizes is developed for this benchmarking. The problems are based on a material interpolation scheme combined with a density filter. Different optimization solvers including Optimality Criteria (OC), the Method of Moving Asymptotes (MMA) and its globally convergent version GCMMA, the interior point...... profiles conclude that general solvers are as efficient and reliable as classical structural topology optimization solvers. Moreover, the use of the exact Hessians in SAND formulations, generally produce designs with better objective function values. However, with the benchmarked implementations solving...
A parallel PCG solver for MODFLOW.
Dong, Yanhui; Li, Guomin
2009-01-01
In order to simulate large-scale ground water flow problems more efficiently with MODFLOW, the OpenMP programming paradigm was used to parallelize the preconditioned conjugate-gradient (PCG) solver with in this study. Incremental parallelization, the significant advantage supported by OpenMP on a shared-memory computer, made the solver transit to a parallel program smoothly one block of code at a time. The parallel PCG solver, suitable for both MODFLOW-2000 and MODFLOW-2005, is verified using an 8-processor computer. Both the impact of compilers and different model domain sizes were considered in the numerical experiments. Based on the timing results, execution times using the parallel PCG solver are typically about 1.40 to 5.31 times faster than those using the serial one. In addition, the simulation results are the exact same as the original PCG solver, because the majority of serial codes were not changed. It is worth noting that this parallelizing approach reduces cost in terms of software maintenance because only a single source PCG solver code needs to be maintained in the MODFLOW source tree.
Phase Selection Heuristics for Satisfiability Solvers
Chen, Jingchao
2011-01-01
In general, a SAT Solver based on conflict-driven DPLL consists of variable selection, phase selection, Boolean Constraint Propagation, conflict analysis, clause learning and its database maintenance. Optimizing any part of these components can enhance the performance of a solver. This paper focuses on optimizing phase selection. Although the ACE (Approximation of the Combined lookahead Evaluation) weight is applied to a lookahead SAT solver such as March, so far, no conflict-driven SAT solver applies successfully the ACE weight, since computing the ACE weight is time-consuming. Here we apply the ACE weight to partial phase selection of conflict-driven SAT solvers. This can be seen as an improvement of the heuristic proposed by Jeroslow-Wang (1990). We incorporate the ACE heuristic and the existing phase selection heuristics in the new solver MPhaseSAT, and select a phase heuristic in a way similar to portfolio methods. Experimental results show that adding the ACE heuristic can improve the conflict-driven so...
Improved Stiff ODE Solvers for Combustion CFD
Imren, A.; Haworth, D. C.
2016-11-01
Increasingly large chemical mechanisms are needed to predict autoignition, heat release and pollutant emissions in computational fluid dynamics (CFD) simulations of in-cylinder processes in compression-ignition engines and other applications. Calculation of chemical source terms usually dominates the computational effort, and several strategies have been proposed to reduce the high computational cost associated with realistic chemistry in CFD. Central to most strategies is a stiff ordinary differential equation (ODE) solver to compute the change in composition due to chemical reactions over a computational time step. Most work to date on stiff ODE solvers for computational combustion has focused on backward differential formula (BDF) methods, and has not explicitly considered the implications of how the stiff ODE solver couples with the CFD algorithm. In this work, a fresh look at stiff ODE solvers is taken that includes how the solver is integrated into a turbulent combustion CFD code, and the advantages of extrapolation-based solvers in this regard are demonstrated. Benefits in CPU time and accuracy are demonstrated for homogeneous systems and compression-ignition engines, for chemical mechanisms that range in size from fewer than 50 to more than 7,000 species.
Computational Methods for Multi-dimensional Neutron Diffusion Problems
Energy Technology Data Exchange (ETDEWEB)
Song Han
2009-10-15
Lead-cooled fast reactor (LFR) has potential for becoming one of the advanced reactor types in the future. Innovative computational tools for system design and safety analysis on such NPP systems are needed. One of the most popular trends is coupling multi-dimensional neutron kinetics (NK) with thermal-hydraulic (T-H) to enhance the capability of simulation of the NPP systems under abnormal conditions or during rare severe accidents. Therefore, various numerical methods applied in the NK module should be reevaluated to adapt the scheme of coupled code system. In the author's present work a neutronic module for the solution of two dimensional steady-state multigroup diffusion problems in nuclear reactor cores is developed. The module can produce both direct fluxes as well as adjoints, i.e. neutron importances. Different numerical schemes are employed. A standard finite-difference (FD) approach is firstly implemented, mainly to serve as a reference for less computationally challenging schemes, such as transverse-integrated nodal methods (TINM) and boundary element methods (BEM), which are considered in the second part of the work. The validation of the methods proposed is carried out by comparisons of the results for some reference structures. In particular a critical problem for a homogeneous reactor for which an analytical solution exists is considered as a benchmark. The computational module is then applied to a fast spectrum system, having physical characteristics similar to the proposed European Lead-cooled System (ELSY) project. The results show the effectiveness of the numerical techniques presented. The flexibility and the possibility to obtain neutron importances allow the use of the module for parametric studies, design assessments and integral parameter evaluations, as well as for future sensitivity and perturbation analyses and as a shape solver for time-dependent procedures
Walder, R; Ott, C D; Livne, E; Jarrah, M
2004-01-01
Using the 2D multi-group, flux-limited diffusion version of the code VULCAN/2D, that also incorporates rotation, we have calculated the collapse, bounce, shock formation, and early post-bounce evolutionary phases of a core-collapse supernova for a variety of initial rotation rates. This is the first series of such multi-group calculations undertaken in supernova theory with fully multi-D tools. We find that though rotation generates pole-to-equator angular anisotropies in the neutrino radiation fields, the magnitude of the asymmetries is not as large as previously estimated. Moreover, we find that the radiation field is always more spherically symmetric than the matter distribution, with its plumes and convective eddies. We present the dependence of the angular anisotropy of the neutrino fields on neutrino species, neutrino energy, and initial rotation rate. Only for our most rapidly rotating model do we start to see qualitatively different hydrodynamics, but for the lower rates consistent with the pre-collap...
Energy Technology Data Exchange (ETDEWEB)
Chiang, Min-Han; Wang, Jui-Yu [Institute of Nuclear Engineering and Science, National Tsing Hua University, 101, Section 2, Kung-Fu Road, Hsinchu 30013, Taiwan (China); Sheu, Rong-Jiun, E-mail: rjsheu@mx.nthu.edu.tw [Institute of Nuclear Engineering and Science, National Tsing Hua University, 101, Section 2, Kung-Fu Road, Hsinchu 30013, Taiwan (China); Department of Engineering System and Science, National Tsing Hua University, 101, Section 2, Kung-Fu Road, Hsinchu 30013, Taiwan (China); Liu, Yen-Wan Hsueh [Institute of Nuclear Engineering and Science, National Tsing Hua University, 101, Section 2, Kung-Fu Road, Hsinchu 30013, Taiwan (China); Department of Engineering System and Science, National Tsing Hua University, 101, Section 2, Kung-Fu Road, Hsinchu 30013, Taiwan (China)
2014-05-01
The High Temperature Engineering Test Reactor (HTTR) in Japan is a helium-cooled graphite-moderated reactor designed and operated for the future development of high-temperature gas-cooled reactors. Two detailed full-core models of HTTR have been established by using SCALE6 and MCNP5/X, respectively, to study its neutronic properties. Several benchmark problems were repeated first to validate the calculation models. Careful code-to-code comparisons were made to ensure that two calculation models are both correct and equivalent. Compared with experimental data, the two models show a consistent bias of approximately 20–30 mk overestimation in effective multiplication factor for a wide range of core states. Most of the bias could be related to the ENDF/B-VII.0 cross-section library or incomplete modeling of impurities in graphite. After that, a series of systematic analyses was performed to investigate the effects of cross sections on the HTTR criticality and burnup calculations, with special interest in the comparison between continuous-energy and multigroup results. Multigroup calculations in this study were carried out in 238-group structure and adopted the SCALE double-heterogeneity treatment for resonance self-shielding. The results show that multigroup calculations tend to underestimate the system eigenvalue by a constant amount of ∼5 mk compared to their continuous-energy counterparts. Further sensitivity studies suggest the differences between multigroup and continuous-energy results appear to be temperature independent and also insensitive to burnup effects.
Sarstedt, Marko; Henseler, Jörg; Ringle, Christian M.
2011-01-01
Purpose – Partial least squares (PLS) path modeling has become a pivotal empirical research method in international marketing. Owing to group comparisons' important role in research on international marketing, we provide researchers with recommendations on how to conduct multigroup analyses in PLS p
A Hybrid Riemann Solver for Large Hyperbolic Systems of Conservation Laws
Schmidtmann, Birte
2016-01-01
We are interested in the numerical solution of large systems of hyperbolic conservation laws or systems in which the characteristic decomposition is expensive to compute. Solving such equations using finite volumes or Discontinuous Galerkin requires a numerical flux function which solves local Riemann problems at cell interfaces. There are various methods to express the numerical flux function. On the one end, there is the robust but very diffusive Lax-Friedrichs solver; on the other end the upwind Godunov solver which respects all resulting waves. The drawback of the latter method is the costly computation of the eigensystem. This work presents a family of simple first order Riemann solvers, named HLLX$\\omega$, which avoid solving the eigensystem. The new method reproduces all waves of the system with less dissipation than other solvers with similar input and effort, such as HLL and FORCE. The family of Riemann solvers can be seen as an extension or generalization of the methods introduced by Degond et al. \\...
Code Verification of the HIGRAD Computational Fluid Dynamics Solver
Energy Technology Data Exchange (ETDEWEB)
Van Buren, Kendra L. [Los Alamos National Laboratory; Canfield, Jesse M. [Los Alamos National Laboratory; Hemez, Francois M. [Los Alamos National Laboratory; Sauer, Jeremy A. [Los Alamos National Laboratory
2012-05-04
The purpose of this report is to outline code and solution verification activities applied to HIGRAD, a Computational Fluid Dynamics (CFD) solver of the compressible Navier-Stokes equations developed at the Los Alamos National Laboratory, and used to simulate various phenomena such as the propagation of wildfires and atmospheric hydrodynamics. Code verification efforts, as described in this report, are an important first step to establish the credibility of numerical simulations. They provide evidence that the mathematical formulation is properly implemented without significant mistakes that would adversely impact the application of interest. Highly accurate analytical solutions are derived for four code verification test problems that exercise different aspects of the code. These test problems are referred to as: (i) the quiet start, (ii) the passive advection, (iii) the passive diffusion, and (iv) the piston-like problem. These problems are simulated using HIGRAD with different levels of mesh discretization and the numerical solutions are compared to their analytical counterparts. In addition, the rates of convergence are estimated to verify the numerical performance of the solver. The first three test problems produce numerical approximations as expected. The fourth test problem (piston-like) indicates the extent to which the code is able to simulate a 'mild' discontinuity, which is a condition that would typically be better handled by a Lagrangian formulation. The current investigation concludes that the numerical implementation of the solver performs as expected. The quality of solutions is sufficient to provide credible simulations of fluid flows around wind turbines. The main caveat associated to these findings is the low coverage provided by these four problems, and somewhat limited verification activities. A more comprehensive evaluation of HIGRAD may be beneficial for future studies.
Adoption as a Social Marker: The Diffusion of Products in a Multigroup Environment
Smaldino, Paul E; Hillis, Vicken; Bednar, Jenna
2015-01-01
Social identities are among the key factors driving social behavior in complex societies. Recent attention to social identity in consumer behavior indicates that individuals avoid products that might signal membership in an outgroup. Yet the population-level consequences of adoption as identity signaling are largely unknown. Whereas previous work has focused on asymmetric attraction and repulsion among groups with different social identities, here we consider the spread of innovations in a structured population in which there are multiple groups who don't want to be mistaken for one another, using both analytical and agent-based modeling. This formal analysis, the first to take the spatial structure of a population into account, allows us to consider empirically important factors, including demographic skew and communication scale, that likely influence overall patterns of adoption. We find that as products become emergent social markers, aversion to outgroup-associated products can decrease overall patterns ...
Inductive ionospheric solver for magnetospheric MHD simulations
Directory of Open Access Journals (Sweden)
H. Vanhamäki
2011-01-01
Full Text Available We present a new scheme for solving the ionospheric boundary conditions required in magnetospheric MHD simulations. In contrast to the electrostatic ionospheric solvers currently in use, the new solver takes ionospheric induction into account by solving Faraday's law simultaneously with Ohm's law and current continuity. From the viewpoint of an MHD simulation, the new inductive solver is similar to the electrostatic solvers, as the same input data is used (field-aligned current [FAC] and ionospheric conductances and similar output is produced (ionospheric electric field. The inductive solver is tested using realistic, databased models of an omega-band and westward traveling surge. Although the tests were performed with local models and MHD simulations require a global ionospheric solution, we may nevertheless conclude that the new solution scheme is feasible also in practice. In the test cases the difference between static and electrodynamic solutions is up to ~10 V km^{−1} in certain locations, or up to 20-40% of the total electric field. This is in agreement with previous estimates. It should also be noted that if FAC is replaced by the ground magnetic field (or ionospheric equivalent current in the input data set, exactly the same formalism can be used to construct an inductive version of the KRM method originally developed by Kamide et al. (1981.
Inductive ionospheric solver for magnetospheric MHD simulations
Vanhamäki, H.
2011-01-01
We present a new scheme for solving the ionospheric boundary conditions required in magnetospheric MHD simulations. In contrast to the electrostatic ionospheric solvers currently in use, the new solver takes ionospheric induction into account by solving Faraday's law simultaneously with Ohm's law and current continuity. From the viewpoint of an MHD simulation, the new inductive solver is similar to the electrostatic solvers, as the same input data is used (field-aligned current [FAC] and ionospheric conductances) and similar output is produced (ionospheric electric field). The inductive solver is tested using realistic, databased models of an omega-band and westward traveling surge. Although the tests were performed with local models and MHD simulations require a global ionospheric solution, we may nevertheless conclude that the new solution scheme is feasible also in practice. In the test cases the difference between static and electrodynamic solutions is up to ~10 V km-1 in certain locations, or up to 20-40% of the total electric field. This is in agreement with previous estimates. It should also be noted that if FAC is replaced by the ground magnetic field (or ionospheric equivalent current) in the input data set, exactly the same formalism can be used to construct an inductive version of the KRM method originally developed by Kamide et al. (1981).
Energy Technology Data Exchange (ETDEWEB)
Bordner, J.; Saied, F. [Univ. of Illinois, Urbana, IL (United States)
1996-12-31
GLab3D is an enhancement of an interactive environment (MGLab) for experimenting with iterative solvers and multigrid algorithms. It is implemented in MATLAB. The new version has built-in 3D elliptic pde`s and several iterative methods and preconditioners that were not available in the original version. A sparse direct solver option has also been included. The multigrid solvers have also been extended to 3D. The discretization and pde domains are restricted to standard finite differences on the unit square/cube. The power of this software studies in the fact that no programming is needed to solve, for example, the convection-diffusion equation in 3D with TFQMR and a customized V-cycle preconditioner, for a variety of problem sizes and mesh Reynolds, numbers. In addition to the graphical user interface, some sample drivers are included to show how experiments can be composed using the underlying suite of problems and solvers.
A Novel Preconditioner for Electromagnetic Solvers
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
A novel preconditioning scheme for electromagnetic scattering solver is presented to improve the convergence of the iterative solver for the linear system resulted by the integral quations. Its kernel idea is the selection of the main contribution of the matrix elements, which affect the matrix condition number the most. We employ the important part similar to the near-field to build the preconditioning matrix. A parameter delta is given to control the balance between the computational expense to get the preconditioner and the effectiveness of the preconditioner. A practical selection of the control parameter delta of the preconditioner is discussed, which indicates the preconditioner is effective in conjunction with a BiCGstab(l) solver.
New iterative solvers for the NAG Libraries
Energy Technology Data Exchange (ETDEWEB)
Salvini, S.; Shaw, G. [Numerical Algorithms Group Ltd., Oxford (United Kingdom)
1996-12-31
The purpose of this paper is to introduce the work which has been carried out at NAG Ltd to update the iterative solvers for sparse systems of linear equations, both symmetric and unsymmetric, in the NAG Fortran 77 Library. Our current plans to extend this work and include it in our other numerical libraries in our range are also briefly mentioned. We have added to the Library the new Chapter F11, entirely dedicated to sparse linear algebra. At Mark 17, the F11 Chapter includes sparse iterative solvers, preconditioners, utilities and black-box routines for sparse symmetric (both positive-definite and indefinite) linear systems. Mark 18 will add solvers, preconditioners, utilities and black-boxes for sparse unsymmetric systems: the development of these has already been completed.
Mezzacappa, A; Bruenn, S W; Blondin, J M; Guidry, M W; Strayer, M R; Umar, A S
1996-01-01
We investigate neutrino-driven convection in core collapse supernovae and its ramifications for the explosion mechanism. We begin with an ``optimistic'' 15 solar mass precollapse model, which is representative of the class of stars with compact iron cores. This model is evolved through core collapse and bounce in one dimension using multigroup (neutrino-energy--dependent) flux-limited diffusion (MGFLD) neutrino transport and Lagrangian hydrodynamics, providing realistic initial conditions for the postbounce convection and evolution. Our two-dimensional simulation begins at 106 ms after bounce at a time when there is a well-developed gain region, and proceeds for 400 ms. We couple two-dimensional (PPM) hydrodynamics to one-dimensional MGFLD neutrino transport. At 225 ms after bounce we see large-scale convection behind the shock, characterized by high-entropy, mushroom-like, expanding upflows and dense, low-entropy, finger-like downflows. The upflows reach the shock and distort it from sphericity. The radial c...
Modification of Ordinary Differential Equations MATLAB Solver
Directory of Open Access Journals (Sweden)
E. Cocherova
2003-12-01
Full Text Available Various linear or nonlinear electronic circuits can be described bythe set of ordinary differential equations (ODEs. The ordinarydifferential equations can be solved in the MATLAB environment inanalytical (symbolic toolbox or numerical way. The set of nonlinearODEs with high complexity can be usually solved only by use ofnumerical integrator (solver. The modification of ode23 MATLABnumerical solver has been suggested in this article for the applicationin solution of some special cases of ODEs. The main feature of thismodification is that the solution is found at every prescribed point,in which the special behavior of system is anticipated. Theextrapolation of solution is not allowed in those points.
Novel Scalable 3-D MT Inverse Solver
Kuvshinov, A. V.; Kruglyakov, M.; Geraskin, A.
2016-12-01
We present a new, robust and fast, three-dimensional (3-D) magnetotelluric (MT) inverse solver. As a forward modelling engine a highly-scalable solver extrEMe [1] is used. The (regularized) inversion is based on an iterative gradient-type optimization (quasi-Newton method) and exploits adjoint sources approach for fast calculation of the gradient of the misfit. The inverse solver is able to deal with highly detailed and contrasting models, allows for working (separately or jointly) with any type of MT (single-site and/or inter-site) responses, and supports massive parallelization. Different parallelization strategies implemented in the code allow for optimal usage of available computational resources for a given problem set up. To parameterize an inverse domain a mask approach is implemented, which means that one can merge any subset of forward modelling cells in order to account for (usually) irregular distribution of observation sites. We report results of 3-D numerical experiments aimed at analysing the robustness, performance and scalability of the code. In particular, our computational experiments carried out at different platforms ranging from modern laptops to high-performance clusters demonstrate practically linear scalability of the code up to thousands of nodes. 1. Kruglyakov, M., A. Geraskin, A. Kuvshinov, 2016. Novel accurate and scalable 3-D MT forward solver based on a contracting integral equation method, Computers and Geosciences, in press.
DEFF Research Database (Denmark)
Bjørner, Nikolaj; Dung, Phan Anh; Fleckenstein, Lars
2015-01-01
vZ is a part of the SMT solver Z3. It allows users to pose and solve optimization problems modulo theories. Many SMT applications use models to provide satisfying assignments, and a growing number of these build on top of Z3 to get optimal assignments with respect to objective functions. vZ provi...
Verification of a binary fluid solidification model in the finite-volume flow solver
Waclawczyk, Tomasz
2015-01-01
The aim of this paper is to verify the new numerical implementation of a binary fluid, heat conduction dominated solidification model. First, we extend a semi-analytical solution to the heat diffusion equation, next, the range of its applicability is investigated. It was found that the linearization introduced to the heat diffusion equation negatively affects the ability to predict solidus and liquidus lines positions whenever the magnitude of latent heat of fusion exceeds a certain value. Next, a binary fluid solidification model is coupled with a flow solver, and is used in a numerical study of Al-4.1%Cu alloy solidification in a two-dimensional rectangular cavity. An accurate coupling between the solidification model and the flow solver is crucial for the correct forecast of solidification front positions and macrosegregation patterns.
PHISICS multi-group transport neutronic capabilities for RELAP5
Energy Technology Data Exchange (ETDEWEB)
Epiney, A.; Rabiti, C.; Alfonsi, A.; Wang, Y.; Cogliati, J.; Strydom, G. [Idaho National Laboratory (INL), 2525 N. Fremont Ave., Idaho Falls, ID 83402 (United States)
2012-07-01
PHISICS is a neutronic code system currently under development at INL. Its goal is to provide state of the art simulation capability to reactor designers. This paper reports on the effort of coupling this package to the thermal hydraulic system code RELAP5. This will enable full prismatic core and system modeling and the possibility to model coupled (thermal-hydraulics and neutronics) problems with more options for 3D neutron kinetics, compared to the existing diffusion theory neutron kinetics module in RELAP5 (NESTLE). The paper describes the capabilities of the coupling and illustrates them with a set of sample problems. (authors)
Olson, Gordon L.
2017-03-01
Gray and multigroup radiation is transported through 3D media consisting of spheres randomly placed in a uniform background. Comparisons are made between using constant radii spheres and three different distributions of sphere radii. Because of the computational cost of 3D calculations, only the lowest angle order, n=1, is tested. If the mean chord length is held constant, using different radii distributions makes little difference. This is true for both gray and multigroup solutions. 3D transport solutions are compared to 2D and 1D solutions with the same mean chord lengths. 2D disk and 3D sphere media give solutions that are nearly identical while 1D slab solutions are fundamentally different.
Energy Technology Data Exchange (ETDEWEB)
Ford, W.E. III; Roussin, R.W.; Petrie, L.M.; Diggs, B.R.; Comolander, H.E.
1979-01-01
Contents of the IBM version of the APMX system distributed by the Radiation Shielding Information Center (APMX-II) are described. Sample problems which demonstrate the procedure for implementing AMPX-II modules to generate point cross sections; generate multigroup neutron, photon production, and photon interaction cross sections for various transport codes; collapse multigroup cross sections; check, edit, and punch multigroup cross sections; and execute a one-dimensional discrete ordinates transport calculation are detailed. 25 figures, 9 tables.
Unsteady Non-Newtonian Solver on Unstructured Grid for the Simulation of Blood Flow
Directory of Open Access Journals (Sweden)
Guojie Li
2013-01-01
Full Text Available Blood is in fact a suspension of different cells with yield stress, shear thinning, and viscoelastic properties, which can be represented by different non-Newtonian models. Taking Casson fluid as an example, an unsteady solver on unstructured grid for non-Newtonian fluid is developed to simulate transient blood flow in complex flow region. In this paper, a steady solver for Newtonian fluid is firstly developed with the discretization of convective flux, diffusion flux, and source term on unstructured grid. For the non-Newtonian characteristics of blood, the Casson fluid is approximated by the Papanastasiou's model and treated as Newtonian fluid with variable viscosity. Then considering the transient property of blood flow, an unsteady non-Newtonian solver based on unstructured grid is developed by introducing the temporal term by first-order upwind difference scheme. Using the proposed solver, the blood flows in carotid bifurcation of hypertensive patients and healthy people are simulated. The result shows that the possibility of the genesis and development of atherosclerosis is increased, because of the increase in incoming flow shock and backflow areas of the hypertensive patients, whose WSS was 20~87.1% lower in outer vascular wall near the bifurcation than that of the normal persons and 3.7~5.5% lower in inner vascular wall downstream the bifurcation.
VDJSeq-Solver: in silico V(DJ recombination detection tool.
Directory of Open Access Journals (Sweden)
Giulia Paciello
Full Text Available In this paper we present VDJSeq-Solver, a methodology and tool to identify clonal lymphocyte populations from paired-end RNA Sequencing reads derived from the sequencing of mRNA neoplastic cells. The tool detects the main clone that characterises the tissue of interest by recognizing the most abundant V(DJ rearrangement among the existing ones in the sample under study. The exact sequence of the clone identified is capable of accounting for the modifications introduced by the enzymatic processes. The proposed tool overcomes limitations of currently available lymphocyte rearrangements recognition methods, working on a single sequence at a time, that are not applicable to high-throughput sequencing data. In this work, VDJSeq-Solver has been applied to correctly detect the main clone and identify its sequence on five Mantle Cell Lymphoma samples; then the tool has been tested on twelve Diffuse Large B-Cell Lymphoma samples. In order to comply with the privacy, ethics and intellectual property policies of the University Hospital and the University of Verona, data is available upon request to supporto.utenti@ateneo.univr.it after signing a mandatory Materials Transfer Agreement. VDJSeq-Solver JAVA/Perl/Bash software implementation is free and available at http://eda.polito.it/VDJSeq-Solver/.
Mathematical programming solver based on local search
Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain
2014-01-01
This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...
Aleph Field Solver Challenge Problem Results Summary
Energy Technology Data Exchange (ETDEWEB)
Hooper, Russell [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Moore, Stan Gerald [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2015-01-01
Aleph models continuum electrostatic and steady and transient thermal fields using a finite-element method. Much work has gone into expanding the core solver capability to support enriched modeling consisting of multiple interacting fields, special boundary conditions and two-way interfacial coupling with particles modeled using Aleph's complementary particle-in-cell capability. This report provides quantitative evidence for correct implementation of Aleph's field solver via order- of-convergence assessments on a collection of problems of increasing complexity. It is intended to provide Aleph with a pedigree and to establish a basis for confidence in results for more challenging problems important to Sandia's mission that Aleph was specifically designed to address.
Integrating Standard Dependency Schemes in QCSP Solvers
Institute of Scientific and Technical Information of China (English)
Ji-Wei Jin; Fei-Fei Ma; Jian Zhang
2012-01-01
Quantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers.In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers.The technique can help to decide the next variable to be assigned in QCSP solving.We also introduce a new factor into the variable ordering heuristics:a variable's dep is the number of variables depending on it.This factor represents the probability of getting more candidates for the next variable to be assigned.Experimental results show that variable ordering heuristics with standard dependency schemes and the new factor dep can improve the performance of QCSP solvers.
Implicit compressible flow solvers on unstructured meshes
Nagaoka, Makoto; Horinouchi, Nariaki
1993-09-01
An implicit solver for compressible flows using Bi-CGSTAB method is proposed. The Euler equations are discretized with the delta-form by the finite volume method on the cell-centered triangular unstructured meshes. The numerical flux is calculated by Roe's upwind scheme. The linearized simultaneous equations with the irregular nonsymmetric sparse matrix are solved by the Bi-CGSTAB method with the preconditioner of incomplete LU factorization. This method is also vectorized by the multi-colored ordering. Although the solver requires more computational memory, it shows faster and more robust convergence than the other conventional methods: three-stage Runge-Kutta method, point Gauss-Seidel method, and Jacobi method for two-dimensional inviscid steady flows.
Chemical Mechanism Solvers in Air Quality Models
Directory of Open Access Journals (Sweden)
John C. Linford
2011-09-01
Full Text Available The solution of chemical kinetics is one of the most computationally intensivetasks in atmospheric chemical transport simulations. Due to the stiff nature of the system,implicit time stepping algorithms which repeatedly solve linear systems of equations arenecessary. This paper reviews the issues and challenges associated with the construction ofefficient chemical solvers, discusses several families of algorithms, presents strategies forincreasing computational efficiency, and gives insight into implementing chemical solverson accelerated computer architectures.
A multigrid solver for the semiconductor equations
Bachmann, Bernhard
1993-01-01
We present a multigrid solver for the exponential fitting method. The solver is applied to the current continuity equations of semiconductor device simulation in two dimensions. The exponential fitting method is based on a mixed finite element discretization using the lowest-order Raviart-Thomas triangular element. This discretization method yields a good approximation of front layers and guarantees current conservation. The corresponding stiffness matrix is an M-matrix. 'Standard' multigrid solvers, however, cannot be applied to the resulting system, as this is dominated by an unsymmetric part, which is due to the presence of strong convection in part of the domain. To overcome this difficulty, we explore the connection between Raviart-Thomas mixed methods and the nonconforming Crouzeix-Raviart finite element discretization. In this way we can construct nonstandard prolongation and restriction operators using easily computable weighted L(exp 2)-projections based on suitable quadrature rules and the upwind effects of the discretization. The resulting multigrid algorithm shows very good results, even for real-world problems and for locally refined grids.
Measurement invariance via multigroup SEM: Issues and solutions with chi-square-difference tests.
Yuan, Ke-Hai; Chan, Wai
2016-09-01
Multigroup structural equation modeling (SEM) plays a key role in studying measurement invariance and in group comparison. When population covariance matrices are deemed not equal across groups, the next step to substantiate measurement invariance is to see whether the sample covariance matrices in all the groups can be adequately fitted by the same factor model, called configural invariance. After configural invariance is established, cross-group equalities of factor loadings, error variances, and factor variances-covariances are then examined in sequence. With mean structures, cross-group equalities of intercepts and factor means are also examined. The established rule is that if the statistic at the current model is not significant at the level of .05, one then moves on to testing the next more restricted model using a chi-square-difference statistic. This article argues that such an established rule is unable to control either Type I or Type II errors. Analysis, an example, and Monte Carlo results show why and how chi-square-difference tests are easily misused. The fundamental issue is that chi-square-difference tests are developed under the assumption that the base model is sufficiently close to the population, and a nonsignificant chi-square statistic tells little about how good the model is. To overcome this issue, this article further proposes that null hypothesis testing in multigroup SEM be replaced by equivalence testing, which allows researchers to effectively control the size of misspecification before moving on to testing a more restricted model. R code is also provided to facilitate the applications of equivalence testing for multigroup SEM. (PsycINFO Database Record
Asymptotic behavior of stochastic multi-group epidemic models with distributed delays
Liu, Qun; Jiang, Daqing; Shi, Ningzhong; Hayat, Tasawar; Alsaedi, Ahmed
2017-02-01
In this paper, we introduce stochasticity into multi-group epidemic models with distributed delays and general kernel functions. The stochasticity in the model is a standard technique in stochastic population modeling. When the perturbations are small, by using the method of stochastic Lyapunov functions, we carry out a detailed analysis on the asymptotic behavior of the stochastic model regarding of the basic reproduction number R0. If R0 ≤ 1, the solution of the stochastic system oscillates around the disease-free equilibrium E0, while if R0 > 1, the solution of the stochastic model fluctuates around the endemic equilibrium E∗. Moreover, we also establish sufficient conditions of these results.
Multigroup radiation transport in one-dimensional Lagrangian radiation-hydrodynamics codes
Energy Technology Data Exchange (ETDEWEB)
Rottler, J.S.
1987-01-01
A new treatment of radiation transport has been added to the Lagrangian radiation-hydrodynamics code CHARTD. The new energy flow model was derived based on the assumption that the directional dependence of the radiation energy density can be represented by the first two terms of a spherical harmonic expansion, and that the photon energy spectrum can be partitioned into energy groups. The time derivative in the second moment equation, which is usually neglected, is retained in this implementation of the multigroup P-1 approximation. An accelerated iterative scheme is used to solve the difference equations. The new energy flow model and the iterative scheme will be described.
Geospatial Data Fusion and Multigroup Decision Support for Surface Water Quality Management
Sun, A. Y.; Osidele, O.; Green, R. T.; Xie, H.
2010-12-01
Social networking and social media have gained significant popularity and brought fundamental changes to many facets of our everyday life. With the ever-increasing adoption of GPS-enabled gadgets and technology, location-based content is likely to play a central role in social networking sites. While location-based content is not new to the geoscience community, where geographic information systems (GIS) are extensively used, the delivery of useful geospatial data to targeted user groups for decision support is new. Decision makers and modelers ought to make more effective use of the new web-based tools to expand the scope of environmental awareness education, public outreach, and stakeholder interaction. Environmental decision processes are often rife with uncertainty and controversy, requiring integration of multiple sources of information and compromises between diverse interests. Fusing of multisource, multiscale environmental data for multigroup decision support is a challenging task. Toward this goal, a multigroup decision support platform should strive to achieve transparency, impartiality, and timely synthesis of information. The latter criterion often constitutes a major technical bottleneck to traditional GIS-based media, featuring large file or image sizes and requiring special processing before web deployment. Many tools and design patterns have appeared in recent years to ease the situation somewhat. In this project, we explore the use of Web 2.0 technologies for “pushing” location-based content to multigroups involved in surface water quality management and decision making. In particular, our granular bottom-up approach facilitates effective delivery of information to most relevant user groups. Our location-based content includes in-situ and remotely sensed data disseminated by NASA and other national and local agencies. Our project is demonstrated for managing the total maximum daily load (TMDL) program in the Arroyo Colorado coastal river basin
Multi-group pin power reconstruction method based on colorset form functions
Institute of Scientific and Technical Information of China (English)
HUANG Hao
2009-01-01
A multi-group pin power reconstruction method that fully exploits nodal information obtained from global coarse mesh solution has been developed.It expands the intra-nodal flux distributions into nonseparable semi-analytic basis functions,and a colorset based form function generating method is proposed,which can accurately model the spectral interaction occurring at assembly interface.To demonstrate its accuracy and applicability to realistic problems,the new method is tested against two benchmark problems,including a mixed-oxide fuel problem.The results show that the new method is comparable in accuracy to fine-mesh methods.
Directory of Open Access Journals (Sweden)
Xiaoming Fan
2014-01-01
Full Text Available We discuss multigroup SIRS (susceptible, infectious, and recovered epidemic models with random perturbations. We carry out a detailed analysis on the asymptotic behavior of the stochastic model; when reproduction number ℛ0>1, we deduce the globally asymptotic stability of the endemic equilibrium by measuring the difference between the solution and the endemic equilibrium of the deterministic model in time average. Numerical methods are employed to illustrate the dynamic behavior of the model and simulate the system of equations developed. The effect of the rate of immunity loss on susceptible and recovered individuals is also analyzed in the deterministic model.
On the verification of polynomial system solvers
Institute of Scientific and Technical Information of China (English)
Changbo CHEN; Marc MORENO MAZA; Wei PAN; Yuzhen XI
2008-01-01
We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are highly resource consuming and apply only to polynomial systems which are easy to solve. We exhibit a new approach which manipulates constructible sets represented by regular systems. We provide comparative benchmarks of different verification procedures applied to four solvers on a large set of well-known polynomial systems. Our experimental results illustrate the high effi-ciency of our new approach. In particular, we are able to verify triangular decompositions of polynomial systems which are not easy to solve.
Some topics of Navier-Stokes solvers
Honma, H.; Nishikawa, N.
1990-03-01
The process of numerical simulation consists of selection of some items: a mathematical model, a numerical scheme, the level of the computer, and post processing. From this point of view, recent numerical studies of viscous flows are described especially for the fluid engineering laboratories in the Chiba University. The examples of simulations are Mach reflection on a wedge using a kinetic model equation and a cylinder-plate juncture flow using incompressible Navier Stokes equation. Some attempts at graphic monitoring of fluid mechanical calculations are also shown for some combinations of computers with Computational Fluid Dynamics (CFD) solvers.
Input-output-controlled nonlinear equation solvers
Padovan, Joseph
1988-01-01
To upgrade the efficiency and stability of the successive substitution (SS) and Newton-Raphson (NR) schemes, the concept of input-output-controlled solvers (IOCS) is introduced. By employing the formal properties of the constrained version of the SS and NR schemes, the IOCS algorithm can handle indefiniteness of the system Jacobian, can maintain iterate monotonicity, and provide for separate control of load incrementation and iterate excursions, as well as having other features. To illustrate the algorithmic properties, the results for several benchmark examples are presented. These define the associated numerical efficiency and stability of the IOCS.
Preconditioners for Incompressible Navier-Stokes Solvers
Institute of Scientific and Technical Information of China (English)
A.Segal; M.ur Rehman; C.Vuik
2010-01-01
In this paper we give an overview of the present state of fast solvers for the solution of the incompressible Navier-Stokes equations discretized by the finite element method and linearized by Newton or Picard's method. It is shown that block precon- ditioners form an excellent approach for the solution, however if the grids are not to fine preconditioning with a Saddle point ILU matrix (SILU) may be an attractive al- ternative. The applicability of all methods to stabilized elements is investigated. In case of the stand-alone Stokes equations special preconditioners increase the efficiency considerably.
DPS--a computerised diagnostic problem solver.
Bartos, P; Gyárfas, F; Popper, M
1982-01-01
The paper contains a short description of the DPS system which is a computerized diagnostic problem solver. The system is under development of the Research Institute of Medical Bionics in Bratislava, Czechoslovakia. Its underlying philosophy yields from viewing the diagnostic process as process of cognitive problem solving. The implementation of the system is based on the methods of Artificial Intelligence and utilisation of production systems and frame theory should be noted in this context. Finally a list of program modules and their characterisation is presented.
Metaheuristics progress as real problem solvers
Nonobe, Koji; Yagiura, Mutsunori
2005-01-01
Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.
Energy Technology Data Exchange (ETDEWEB)
McEwan, C.; Ball, M.; Novog, D., E-mail: mcewac2@mcmaster.ca [McMaster Univ., Hamilton, Ontario (Canada)
2013-07-01
Simulation results are of little use if nothing is known about the uncertainty in the results. In order to assess the uncertainty in a set of output parameters due to uncertainty in a set of input parameters, knowledge of the covariance between input parameters is required. Current practice is to apply the covariance between multigroup cross sections at infinite dilution to all cross sections including those at non-infinite dilutions. In this work, the effect of dilution on multigroup cross section covariance is investigated as well as the effect on the covariance between the few group homogenized cross sections produced by lattice code DRAGON. (author)
Unstructured Polyhedral Mesh Thermal Radiation Diffusion
Energy Technology Data Exchange (ETDEWEB)
Palmer, T.S.; Zika, M.R.; Madsen, N.K.
2000-07-27
Unstructured mesh particle transport and diffusion methods are gaining wider acceptance as mesh generation, scientific visualization and linear solvers improve. This paper describes an algorithm that is currently being used in the KULL code at Lawrence Livermore National Laboratory to solve the radiative transfer equations. The algorithm employs a point-centered diffusion discretization on arbitrary polyhedral meshes in 3D. We present the results of a few test problems to illustrate the capabilities of the radiation diffusion module.
The group-level consequences of sexual conflict in multigroup populations.
Directory of Open Access Journals (Sweden)
Omar Tonsi Eldakar
Full Text Available In typical sexual conflict scenarios, males best equipped to exploit females are favored locally over more prudent males, despite reducing female fitness. However, local advantage is not the only relevant form of selection. In multigroup populations, groups with less sexual conflict will contribute more offspring to the next generation than higher conflict groups, countering the local advantage of harmful males. Here, we varied male aggression within- and between-groups in a laboratory population of water striders and measured resulting differences in local population growth over a period of three weeks. The overall pool fitness (i.e., adults produced of less aggressive pools exceeded that of high aggression pools by a factor of three, with the high aggression pools essentially experiencing no population growth over the course of the study. When comparing the fitness of individuals across groups, aggression appeared to be under stabilizing selection in the multigroup population. The use of contextual analysis revealed that overall stabilizing selection was a product of selection favoring aggression within groups, but selected against it at the group-level. Therefore, this report provides further evidence to show that what evolves in the total population is not merely an extension of within-group dynamics.
Schnettler, Berta; Miranda, Horacio; Miranda-Zapata, Edgardo; Salinas-Oñate, Natalia; Grunert, Klaus G; Lobos, Germán; Sepúlveda, José; Orellana, Ligia; Hueche, Clementina; Bonilla, Héctor
2017-06-01
This study examined longitudinal measurement invariance in the Satisfaction with Food-related Life (SWFL) scale using follow-up data from university students. We examined this measure of the SWFL in different groups of students, separated by various characteristics. Through non-probabilistic longitudinal sampling, 114 university students (65.8% female, mean age: 22.5) completed the SWFL questionnaire three times, over intervals of approximately one year. Confirmatory factor analysis was used to examine longitudinal measurement invariance. Two types of analysis were conducted: first, a longitudinal invariance by time, and second, a multigroup longitudinal invariance by sex, age, socio-economic status and place of residence during the study period. Results showed that the 3-item version of the SWFL exhibited strong longitudinal invariance (equal factor loadings and equal indicator intercepts). Longitudinal multigroup invariance analysis also showed that the 3-item version of the SWFL displays strong invariance by socio-economic status and place of residence during the study period over time. Nevertheless, it was only possible to demonstrate equivalence of the longitudinal factor structure among students of both sexes, and among those older and younger than 22 years. Generally, these findings suggest that the SWFL scale has satisfactory psychometric properties for longitudinal measurement invariance in university students with similar characteristics as the students that participated in this research. It is also possible to suggest that satisfaction with food-related life is associated with sex and age.
A Novel Interactive MINLP Solver for CAPE Applications
DEFF Research Database (Denmark)
Henriksen, Jens Peter; Støy, S.; Russel, Boris Mariboe;
2000-01-01
This paper presents an interactive MINLP solver that is particularly suitable for solution of process synthesis, design and analysis problems. The interactive MINLP solver is based on the decomposition based MINLP algorithms, where a NLP sub-problem is solved in the innerloop and a MILP master...
Efficient use of iterative solvers in nested topology optimization
DEFF Research Database (Denmark)
Amir, Oded; Stolpe, Mathias; Sigmund, Ole
2009-01-01
by a Krylov subspace iterative solver. By choosing convergence criteria for the iterative solver that are strongly related to the optimization objective and to the design sensitivities, it is possible to terminate the iterative solution of the nested equations earlier compared to traditional convergence...
Experiences with linear solvers for oil reservoir simulation problems
Energy Technology Data Exchange (ETDEWEB)
Joubert, W.; Janardhan, R. [Los Alamos National Lab., NM (United States); Biswas, D.; Carey, G.
1996-12-31
This talk will focus on practical experiences with iterative linear solver algorithms used in conjunction with Amoco Production Company`s Falcon oil reservoir simulation code. The goal of this study is to determine the best linear solver algorithms for these types of problems. The results of numerical experiments will be presented.
Cosmic-ray propagation with DRAGON2: I. numerical solver and astrophysical ingredients
Evoli, Carmelo; Vittino, Andrea; Di Bernardo, Giuseppe; Di Mauro, Mattia; Ligorini, Arianna; Ullio, Piero; Grasso, Dario
2016-01-01
We present version 2 of the DRAGON code designed for computing realistic predictions of the CR densities in the Galaxy. The code numerically solves the interstellar CR transport equation (including inhomogeneous and anisotropic diffusion, either in space and momentum, advective transport and energy losses), under realistic conditions. The new version includes an updated numerical solver and several models for the astrophysical ingredients involved in the transport equation. Improvements in the accuracy of the numerical solution are proved against analytical solutions and in reference diffusion scenarios. The novel features implemented in the code allow to simulate the diverse scenarios proposed to reproduce the most recent measurements of local and diffuse CR fluxes, going beyond the limitations of the homogeneous galactic transport paradigm. To this end, several applications using DRAGON2 are presented as well. The new version facilitates the users to include their own physical models by means of a modular C...
Cosmic-ray propagation with DRAGON2: I. numerical solver and astrophysical ingredients
Evoli, Carmelo; Gaggero, Daniele; Vittino, Andrea; Di Bernardo, Giuseppe; Di Mauro, Mattia; Ligorini, Arianna; Ullio, Piero; Grasso, Dario
2017-02-01
We present version 2 of the DRAGON code designed for computing realistic predictions of the CR densities in the Galaxy. The code numerically solves the interstellar CR transport equation (including inhomogeneous and anisotropic diffusion, either in space and momentum, advective transport and energy losses), under realistic conditions. The new version includes an updated numerical solver and several models for the astrophysical ingredients involved in the transport equation. Improvements in the accuracy of the numerical solution are proved against analytical solutions and in reference diffusion scenarios. The novel features implemented in the code allow to simulate the diverse scenarios proposed to reproduce the most recent measurements of local and diffuse CR fluxes, going beyond the limitations of the homogeneous galactic transport paradigm. To this end, several applications using DRAGON2 are presented as well. This new version facilitates the users to include their own physical models by means of a modular C++ structure.
Institute of Scientific and Technical Information of China (English)
Yoshiaki MUROYA; Yoichi ENATSU; Toshikazu KUNIYA
2013-01-01
In this article,we establish the global stability of an endemic equilibrium of multi-group SIR epidemic models,which have not only an exchange of individuals between patches through migration but also cross patch infection between different groups.As a result,we partially generalize the recent result in the article [16].
Parallel sparse direct solver for integrated circuit simulation
Chen, Xiaoming; Yang, Huazhong
2017-01-01
This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...
Scalable Adaptive Multilevel Solvers for Multiphysics Problems
Energy Technology Data Exchange (ETDEWEB)
Xu, Jinchao
2014-12-01
In this project, we investigated adaptive, parallel, and multilevel methods for numerical modeling of various real-world applications, including Magnetohydrodynamics (MHD), complex fluids, Electromagnetism, Navier-Stokes equations, and reservoir simulation. First, we have designed improved mathematical models and numerical discretizaitons for viscoelastic fluids and MHD. Second, we have derived new a posteriori error estimators and extended the applicability of adaptivity to various problems. Third, we have developed multilevel solvers for solving scalar partial differential equations (PDEs) as well as coupled systems of PDEs, especially on unstructured grids. Moreover, we have integrated the study between adaptive method and multilevel methods, and made significant efforts and advances in adaptive multilevel methods of the multi-physics problems.
Integrating advanced reasoning into a SAT solver
Institute of Scientific and Technical Information of China (English)
DING Min; TANG Pushan; ZHOU Dian
2005-01-01
In this paper, we present a SAT solver based on the combination of DPLL (Davis Putnam Logemann and Loveland) algorithm and Failed Literal Detection (FLD), one of the advanced reasoning techniques. We propose a Dynamic Filtering method that consists of two restriction rules for FLD: internal and external filtering. The method reduces the number of tested literals in FLD and its computational time while maintaining the ability to find most of the failed literals in each decision level. Unlike the pre-defined criteria, literals are removed dynamically in our approach. In this way, our FLD can adapt itself to different real-life benchmarks. Many useless tests are therefore avoided and as a consequence it makes FLD fast. Some other static restrictions are also added to further improve the efficiency of FLD. Experiments show that our optimized FLD is much more efficient than other advanced reasoning techniques.
Optimising a parallel conjugate gradient solver
Energy Technology Data Exchange (ETDEWEB)
Field, M.R. [O`Reilly Institute, Dublin (Ireland)
1996-12-31
This work arises from the introduction of a parallel iterative solver to a large structural analysis finite element code. The code is called FEX and it was developed at Hitachi`s Mechanical Engineering Laboratory. The FEX package can deal with a large range of structural analysis problems using a large number of finite element techniques. FEX can solve either stress or thermal analysis problems of a range of different types from plane stress to a full three-dimensional model. These problems can consist of a number of different materials which can be modelled by a range of material models. The structure being modelled can have the load applied at either a point or a surface, or by a pressure, a centrifugal force or just gravity. Alternatively a thermal load can be applied with a given initial temperature. The displacement of the structure can be constrained by having a fixed boundary or by prescribing the displacement at a boundary.
Asynchronous Parallelization of a CFD Solver
Directory of Open Access Journals (Sweden)
Daniel S. Abdi
2015-01-01
Full Text Available A Navier-Stokes equations solver is parallelized to run on a cluster of computers using the domain decomposition method. Two approaches of communication and computation are investigated, namely, synchronous and asynchronous methods. Asynchronous communication between subdomains is not commonly used in CFD codes; however, it has a potential to alleviate scaling bottlenecks incurred due to processors having to wait for each other at designated synchronization points. A common way to avoid this idle time is to overlap asynchronous communication with computation. For this to work, however, there must be something useful and independent a processor can do while waiting for messages to arrive. We investigate an alternative approach of computation, namely, conducting asynchronous iterations to improve local subdomain solution while communication is in progress. An in-house CFD code is parallelized using message passing interface (MPI, and scalability tests are conducted that suggest asynchronous iterations are a viable way of parallelizing CFD code.
Two-Dimensional Riemann Solver for Euler Equations of Gas Dynamics
Brio, M.; Zakharian, A. R.; Webb, G. M.
2001-02-01
We construct a Riemann solver based on two-dimensional linear wave contributions to the numerical flux that generalizes the one-dimensional method due to Roe (1981, J. Comput. Phys.43, 157). The solver is based on a multistate Riemann problem and is suitable for arbitrary triangular grids or any other finite volume tessellations of the plane. We present numerical examples illustrating the performance of the method using both first- and second-order-accurate numerical solutions. The numerical flux contributions are due to one-dimensional waves and multidimensional waves originating from the corners of the computational cell. Under appropriate CFL restrictions, the contributions of one-dimensional waves dominate the flux, which explains good performance of dimensionally split solvers in practice. The multidimensional flux corrections increase the accuracy and stability, allowing a larger time step. The improvements are more pronounced on a coarse mesh and for large CFL numbers. For the second-order method, the improvements can be comparable to the improvements resulting from a less diffusive limiter.
Lattice Boltzmann solver of Rossler equation
Institute of Scientific and Technical Information of China (English)
GuangwuYAN; LiRUAN
2000-01-01
We proposed a lattice Boltzmann model for the Rossler equation. Using a method of multiscales in the lattice Boltzmann model, we get the diffusion reaction as a special case. If the diffusion effect disappeared, we can obtain the lattice Boltzmann solution of the Rossler equation on the mesescopic scale. The numerical results show the method can be used to simulate Rossler equation.
Jones, Kelvyn; Johnston, Ron; Manley, David; Owen, Dewi; Charlton, Chris
2015-12-01
We develop and apply a multilevel modeling approach that is simultaneously capable of assessing multigroup and multiscale segregation in the presence of substantial stochastic variation that accompanies ethnicity rates based on small absolute counts. Bayesian MCMC estimation of a log-normal Poisson model allows the calculation of the variance estimates of the degree of segregation in a single overall model, and credible intervals are obtained to provide a measure of uncertainty around those estimates. The procedure partitions the variance at different levels and implicitly models the dependency (or autocorrelation) at each spatial scale below the topmost one. Substantively, we apply the model to 2011 census data for London, one of the world's most ethnically diverse cities. We find that the degree of segregation depends both on scale and group.
Global dynamics of a novel multi-group model for computer worms
Institute of Scientific and Technical Information of China (English)
Gong Yong-Wang; Song Yu-Rong; Jiang Guo-Ping
2013-01-01
In this paper,we study worm dynamics in computer networks composed of many autonomous systems.A novel multigroup SIQR (susceptible-infected-quarantined-removed) model is proposed for computer worms by explicitly considering anti-virus measures and the network infrastructure.Then,the basic reproduction number of worm R0 is derived and the global dynamics of the model are established.It is shown that if R0 is less than or equal to 1,the disease-free equilibrium is globally asymptotically stable and the worm dies out eventually,whereas,if R0 is greater than 1,one unique endemic equilibrium exists and it is globally asymptotically stable,thus the worm persists in the network.Finally,numerical simulations are given to illustrate the theoretical results.
Validation of the Resilience Scale for Adolescents (READ) in Ireland: a multi-group analysis.
Kelly, Yvonne; Fitzgerald, Amanda; Dooley, Barbara
2016-04-29
Resilience is a process reflecting positive adaptation in the face of adversity. The Resilience Scale for Adolescence (READ) incorporates intrapersonal and interpersonal protective factors mapping onto the three salient domains of resilience, including individual, family and external environment. This study investigated the validity and reliability of the READ by means of factor analysis, multi-group analysis, inter-correlations and internal consistency measures. Participants were 6085 young people in Ireland aged 12-18 years. Participants completed the My World Survey - Second Level (MWS-SL), assessing risk and protective factors of mental health. Confirmatory factor analysis validated the original five-factor structure of the READ including Personal Competence, Social Competence, Structured Style, Family Cohesion, and Social Resources, χ(2) (340) = 6146.02, p resilience factors among adolescents in Ireland, demonstrating its applicability in a different cultural context and with a wider age range of adolescents. Copyright © 2016 John Wiley & Sons, Ltd.
MINX: a multigroup interpretation of nuclear X-sections from ENDF/B
Energy Technology Data Exchange (ETDEWEB)
Weisbin, C.R.; Soran, P.D.; MacFarlane, R.E.; Harris, D.R.; LaBauve, R.J.; Hendricks, J.S.; White, J.E.; Kidman, R.B.
1976-09-01
MINX calculates fine-group averaged infinitely dilute cross sections, self-shielding factors, and group-to-group transfer matrices from ENDF/B-IV data. Its primary purpose is to generate pseudo-composition independent multigroup libraries in the standard CCCC-III interface formats for use in the design and analysis of nuclear systems. MINX incorporates and improves upon the resonance capabilities of existing codes such as ETOX and ENDRUN and the high-Legendre-order transfer matrices of ETOG and SUPERTOG. Group structure, Legendre order, weight function, temperature, dilutions, and processing tolerances are all under user control. Paging and variable dimensioning allow very large problems to be run. Both CDC and IBM versions of MINX are available.
Global dynamics of a novel multi-group model for computer worms
Gong, Yong-Wang; Song, Yu-Rong; Jiang, Guo-Ping
2013-04-01
In this paper, we study worm dynamics in computer networks composed of many autonomous systems. A novel multi-group SIQR (susceptible-infected-quarantined-removed) model is proposed for computer worms by explicitly considering anti-virus measures and the network infrastructure. Then, the basic reproduction number of worm R0 is derived and the global dynamics of the model are established. It is shown that if R0 is less than or equal to 1, the disease-free equilibrium is globally asymptotically stable and the worm dies out eventually, whereas, if R0 is greater than 1, one unique endemic equilibrium exists and it is globally asymptotically stable, thus the worm persists in the network. Finally, numerical simulations are given to illustrate the theoretical results.
Compilation of multigroup cross-section covariance matrices for several important reactor materials
Energy Technology Data Exchange (ETDEWEB)
Drischler, J.D.; Weisbin, C.R.
1977-10-01
Multigroup cross-section covariance matrices are presented for fission in /sup 235/U, /sup 238/U, /sup 239/Pu, and /sup 241/Pu; capture in /sup 235/U, /sup 238/U, /sup 239/Pu, /sup 240/Pu, and /sup 241/Pu; fission neutron yield (anti nu) for /sup 235/U, /sup 238/U, /sup 239/Pu, and /sup 240/Pu; elastic scattering for Na and Fe; non-elastic reactions for Na and Fe; first-level inelastic scattering for /sup 238/U; and all reactions provided in the ENDF/B-IV covariance description of N, O, and C. Other data files generated are included for reference but have not yet been tested. The report presents the nultigroup data in six, ten, and fifteen energy group forms corresponding to weighting of the covariance data with fission (GODIVA), LMFBR (ZPR-6/7) and 1/E spectra, respectively.
Testing a new multigroup inference approach to reconstructing past environmental conditions
Directory of Open Access Journals (Sweden)
Maria RIERADEVALL
2008-08-01
Full Text Available A new, quantitative, inference model for environmental reconstruction (transfer function, based for the first time on the simultaneous analysis of multigroup species, has been developed. Quantitative reconstructions based on palaeoecological transfer functions provide a powerful tool for addressing questions of environmental change in a wide range of environments, from oceans to mountain lakes, and over a range of timescales, from decades to millions of years. Much progress has been made in the development of inferences based on multiple proxies but usually these have been considered separately, and the different numeric reconstructions compared and reconciled post-hoc. This paper presents a new method to combine information from multiple biological groups at the reconstruction stage. The aim of the multigroup work was to test the potential of the new approach to making improved inferences of past environmental change by improving upon current reconstruction methodologies. The taxonomic groups analysed include diatoms, chironomids and chrysophyte cysts. We test the new methodology using two cold-environment training-sets, namely mountain lakes from the Pyrenees and the Alps. The use of multiple groups, as opposed to single groupings, was only found to increase the reconstruction skill slightly, as measured by the root mean square error of prediction (leave-one-out cross-validation, in the case of alkalinity, dissolved inorganic carbon and altitude (a surrogate for air-temperature, but not for pH or dissolved CO2. Reasons why the improvement was less than might have been anticipated are discussed. These can include the different life-forms, environmental responses and reaction times of the groups under study.
A new multigroup method for cross-sections that vary rapidly in energy
Haut, T. S.; Ahrens, C.; Jonko, A.; Lowrie, R.; Till, A.
2017-01-01
We present a numerical method for solving the time-independent thermal radiative transfer (TRT) equation or the neutron transport (NT) equation when the opacity (cross-section) varies rapidly in frequency (energy) on the microscale ε; ε corresponds to the characteristic spacing between absorption lines or resonances, and is much smaller than the macroscopic frequency (energy) variation of interest. The approach is based on a rigorous homogenization of the TRT/NT equation in the frequency (energy) variable. Discretization of the homogenized TRT/NT equation results in a multigroup-type system, and can therefore be solved by standard methods. We demonstrate the accuracy and efficiency of the approach on three model problems. First we consider the Elsasser band model with constant temperature and a line spacing ε =10-4 . Second, we consider a neutron transport application for fast neutrons incident on iron, where the characteristic resonance spacing ε necessitates ≈ 16 , 000 energy discretization parameters if Planck-weighted cross sections are used. Third, we consider an atmospheric TRT problem for an opacity corresponding to water vapor over a frequency range 1000-2000 cm-1, where we take 12 homogeneous layers between 1-15 km, and temperature/pressure values in each layer from the standard US atmosphere. For all three problems, we demonstrate that we can achieve between 0.1 and 1 percent relative error in the solution, and with several orders of magnitude fewer parameters than a standard multigroup formulation using Planck-weighted (source-weighted) opacities for a comparable accuracy.
High-Performance Solvers for Dense Hermitian Eigenproblems
Petschow, Matthias; Bientinesi, Paolo
2012-01-01
We introduce a new collection of solvers - subsequently called EleMRRR - for large-scale dense Hermitian eigenproblems. EleMRRR solves various types of problems: generalized, standard, and tridiagonal eigenproblems. Among these, the last is of particular importance as it is a solver on its own right, as well as the computational kernel for the first two; we present a fast and scalable tridiagonal solver based on the Algorithm of Multiple Relatively Robust Representations - referred to as PMRRR. Like the other EleMRRR solvers, PMRRR is part of the freely available Elemental library, and is designed to fully support both message-passing (MPI) and multithreading parallelism (SMP). As a result, the solvers can equally be used in pure MPI or in hybrid MPI-SMP fashion. We conducted a thorough performance study of EleMRRR and ScaLAPACK's solvers on two supercomputers. Such a study, performed with up to 8,192 cores, provides precise guidelines to assemble the fastest solver within the ScaLAPACK framework; it also ind...
Comparison of open-source linear programming solvers.
Energy Technology Data Exchange (ETDEWEB)
Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin David.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph
2013-10-01
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.
An iterative solver for the 3D Helmholtz equation
Belonosov, Mikhail; Dmitriev, Maxim; Kostin, Victor; Neklyudov, Dmitry; Tcheverda, Vladimir
2017-09-01
We develop a frequency-domain iterative solver for numerical simulation of acoustic waves in 3D heterogeneous media. It is based on the application of a unique preconditioner to the Helmholtz equation that ensures convergence for Krylov subspace iteration methods. Effective inversion of the preconditioner involves the Fast Fourier Transform (FFT) and numerical solution of a series of boundary value problems for ordinary differential equations. Matrix-by-vector multiplication for iterative inversion of the preconditioned matrix involves inversion of the preconditioner and pointwise multiplication of grid functions. Our solver has been verified by benchmarking against exact solutions and a time-domain solver.
Wind-US Unstructured Flow Solutions for a Transonic Diffuser
Mohler, Stanley R., Jr.
2005-01-01
The Wind-US Computational Fluid Dynamics flow solver computed flow solutions for a transonic diffusing duct. The calculations used an unstructured (hexahedral) grid. The Spalart-Allmaras turbulence model was used. Static pressures along the upper and lower wall agreed well with experiment, as did velocity profiles. The effect of the smoothing input parameters on convergence and solution accuracy was investigated. The meaning and proper use of these parameters are discussed for the benefit of Wind-US users. Finally, the unstructured solver is compared to the structured solver in terms of run times and solution accuracy.
Energy Technology Data Exchange (ETDEWEB)
Greene, N.M.; Ford, W.E. III; Petrie, L.M.; Arwood, J.W.
1992-10-01
AMPX-77 is a modular system of computer programs that pertain to nuclear analyses, with a primary emphasis on tasks associated with the production and use of multigroup cross sections. AH basic cross-section data are to be input in the formats used by the Evaluated Nuclear Data Files (ENDF/B), and output can be obtained in a variety of formats, including its own internal and very general formats, along with a variety of other useful formats used by major transport, diffusion theory, and Monte Carlo codes. Processing is provided for both neutron and gamma-my data. The present release contains codes all written in the FORTRAN-77 dialect of FORTRAN and wig process ENDF/B-V and earlier evaluations, though major modules are being upgraded in order to process ENDF/B-VI and will be released when a complete collection of usable routines is available.
Elliptic Solvers for Adaptive Mesh Refinement Grids
Energy Technology Data Exchange (ETDEWEB)
Quinlan, D.J.; Dendy, J.E., Jr.; Shapira, Y.
1999-06-03
We are developing multigrid methods that will efficiently solve elliptic problems with anisotropic and discontinuous coefficients on adaptive grids. The final product will be a library that provides for the simplified solution of such problems. This library will directly benefit the efforts of other Laboratory groups. The focus of this work is research on serial and parallel elliptic algorithms and the inclusion of our black-box multigrid techniques into this new setting. The approach applies the Los Alamos object-oriented class libraries that greatly simplify the development of serial and parallel adaptive mesh refinement applications. In the final year of this LDRD, we focused on putting the software together; in particular we completed the final AMR++ library, we wrote tutorials and manuals, and we built example applications. We implemented the Fast Adaptive Composite Grid method as the principal elliptic solver. We presented results at the Overset Grid Conference and other more AMR specific conferences. We worked on optimization of serial and parallel performance and published several papers on the details of this work. Performance remains an important issue and is the subject of continuing research work.
Multiscale Universal Interface: A Concurrent Framework for Coupling Heterogeneous Solvers
Tang, Yu-Hang; Bian, Xin; Li, Zhen; Karniadakis, George E
2014-01-01
Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and c...
Uncertainty Quantification for Production Navier-Stokes Solvers Project
National Aeronautics and Space Administration — The uncertainty quantification methods developed under this program are designed for use with current state-of-the-art flow solvers developed by and in use at NASA....
Integrating Problem Solvers from Analogous Markets in New Product Ideation
DEFF Research Database (Denmark)
Franke, Nikolaus; Poetz, Marion; Schreier, Martin
2014-01-01
Who provides better inputs to new product ideation tasks, problem solvers with expertise in the area for which new products are to be developed or problem solvers from “analogous” markets that are distant but share an analogous problem or need? Conventional wisdom appears to suggest that target...... that including problem solvers from analogous markets versus the target market accounts for almost two-thirds of the well-known effect of involving lead users instead of average problem solvers. This effect is further amplified when the analogous distance between the markets increases, i.e., when searching...... market expertise is indispensable, which is why most managers searching for new ideas tend to stay within their own market context even when they do search outside their firms' boundaries. However, in a unique symmetric experiment that isolates the effect of market origin, we find evidence...
Adaptive Kinetic-Fluid Solvers for Heterogeneous Computing Architectures
Zabelok, Sergey; Kolobov, Vladimir
2015-01-01
This paper describes recent progress towards porting a Unified Flow Solver (UFS) to heterogeneous parallel computing. UFS is an adaptive kinetic-fluid simulation tool, which combines Adaptive Mesh Refinement (AMR) with automatic cell-by-cell selection of kinetic or fluid solvers based on continuum breakdown criteria. The main challenge of porting UFS to graphics processing units (GPUs) comes from the dynamically adapted mesh, which causes irregular data access. We describe the implementation of CUDA kernels for three modules in UFS: the direct Boltzmann solver using discrete velocity method (DVM), the Direct Simulation Monte Carlo (DSMC) module, and the Lattice Boltzmann Method (LBM) solver, all using octree Cartesian mesh with AMR. Double digit speedups on single GPU and good scaling for multi-GPU have been demonstrated.
Hybrid Riemann Solvers for Large Systems of Conservation Laws
Schmidtmann, Birte; Torrilhon, Manuel
2016-01-01
In this paper we present a new family of approximate Riemann solvers for the numerical approximation of solutions of hyperbolic conservation laws. They are approximate, also referred to as incomplete, in the sense that the solvers avoid computing the characteristic decomposition of the flux Jacobian. Instead, they require only an estimate of the globally fastest wave speeds in both directions. Thus, this family of solvers is particularly efficient for large systems of conservation laws, i.e. with many different propagation speeds, and when no explicit expression for the eigensystem is available. Even though only fastest wave speeds are needed as input values, the new family of Riemann solvers reproduces all waves with less dissipation than HLL, which has the same prerequisites, requiring only one additional flux evaluation.
Parallel iterative solvers and preconditioners using approximate hierarchical methods
Energy Technology Data Exchange (ETDEWEB)
Grama, A.; Kumar, V.; Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)
1996-12-31
In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.
A Python interface to Diffpack-based classes and solvers
Munthe-Kaas, Heidi Vikki
2013-01-01
Python is a programming language that has gained a lot of popularity during the last 15 years, and as a very easy-to-learn and flexible scripting language it is very well suited for computa- tional science, both in mathematics and in physics. Diffpack is a PDE library written in C++, made for easier implementation of both smaller PDE solvers and for larger libraries of simu- lators. It contains large class hierarchies for different solvers, grids, arrays, parallel computing and almost everyth...
An Interactive Chemical Equilibrium Solver for the Personal Computer
Negus, Charles H.
1997-01-01
AN INTERACTIVE CHEMICAL EQUILIBRIUM SOLVER FOR THE PERSONAL COMPUTER Charles Hugh Negus Felix J. Pierce, Chairman Mechanical Engineering The Virginia Tech Equilibrium Chemistry (VTEC) code is a keyboard interactive, user friendly, chemical equilibrium solver for use on a personal computer. The code is particularly suitable for a teaching / learning environment. For a set of reactants at a defined thermodynamic state given by a user, the program will select all species...
Energy Technology Data Exchange (ETDEWEB)
Tomaschewski, Fernanda K.; Segatto, Cynthia F., E-mail: fernandasls_89@hotmail.com, E-mail: cynthia.segatto@ufrgs.br [Universidade Federal do Rio Grande do Sul (UFRS), Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Matematica Aplicada; Barros, Ricardo C., E-mail: rcbarros@pq.cnpq.br [Universidade do Estado do Rio de Janeiro (UERJ), Nova Friburgo, RJ (Brazil). Departamento de Modelagem Computacional
2015-07-01
Presented here is a decomposition method based on series representation of the group angular fluxes and delayed neutron precursors in smoothly continuous functions for energy multigroups, slab-geometry discrete ordinates kinetics equations supplemented with a prescribed number of delayed neutron precursors. Numerical results to a non-reflected sub-critical slab stabilized by steady-state sources are given to illustrate the accuracy and efficiency of the o offered method. (author)
A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing
Takaki, Mitsuo; Cavalcanti, Diego; Gheyi, Rohit; Iyoda, Juliano; dAmorim, Marcelo; Prudencio, Ricardo
2009-01-01
The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.
Energy Technology Data Exchange (ETDEWEB)
Sloan, D.P.
1983-05-01
Morel (1981) has developed multigroup Legendre cross sections suitable for input to standard discrete ordinates transport codes for performing charged-particle Fokker-Planck calculations in one-dimensional slab and spherical geometries. Since the Monte Carlo neutron transport code, MORSE, uses the same multigroup cross section data that discrete ordinates codes use, it was natural to consider whether Fokker-Planck calculations could be performed with MORSE. In order to extend the unique three-dimensional forward or adjoint capability of MORSE to Fokker-Planck calculations, the MORSE code was modified to correctly treat the delta-function scattering of the energy operator, and a new set of physically acceptable cross sections was derived to model the angular operator. Morel (1979) has also developed multigroup Legendre cross sections suitable for input to standard discrete ordinates codes for performing electron Boltzmann calculations. These electron cross sections may be treated in MORSE with the same methods developed to treat the Fokker-Planck cross sections. The large magnitude of the elastic scattering cross section, however, severely increases the computation or run time. It is well-known that approximate elastic cross sections are easily obtained by applying the extended transport (or delta function) correction to the Legendre coefficients of the exact cross section. An exact method for performing the extended transport cross section correction produces cross sections which are physically acceptable. Sample calculations using electron cross sections have demonstrated this new technique to be very effective in decreasing the large magnitude of the cross sections.
A Comparison of Stiff ODE Solvers for Astrochemical Kinetics Problems
Nejad, Lida A. M.
2005-09-01
The time dependent chemical rate equations arising from astrochemical kinetics problems are described by a system of stiff ordinary differential equations (ODEs). In this paper, using three astrochemical models of varying physical and computational complexity, and hence different degrees of stiffness, we present a comprehensive performance survey of a set of well-established ODE solver packages from the ODEPACK collection, namely LSODE, LSODES, VODE and VODPK. For completeness, we include results from the GEAR package in one of the test models. The results demonstrate that significant performance improvements can be obtained over GEAR which is still being used by many astrochemists by default. We show that a simple appropriate ordering of the species set results in a substantial improvement in the performance of the tested ODE solvers. The sparsity of the associated Jacobian matrix can be exploited and results using the sparse direct solver routine LSODES show an extensive reduction in CPU time without any loss in accuracy. We compare the performance and the computed abundances of one model with a 175 species set and a reduced set of 88 species, keeping all physical and chemical parameters identical with both sets.We found that the calculated abundances using two different size models agree quite well. However, with no extra computational effort and more reliable results, it is possible for the computation to be many times faster with the larger species set than the reduced set, depending on the use of solvers, the ordering and the chosen options. It is also shown that though a particular solver with certain chosen parameters may have severe difficulty or even fail to complete a run over the required integration time, another solver can easily complete the run with a wider range of control parameters and options. As a result of the superior performance of LSODES for the solution of astrochemical kinetics systems, we have tailor-made a sparse version of the VODE
Euler/Navier-Stokes Solvers Applied to Ducted Fan Configurations
Keith, Theo G., Jr.; Srivastava, Rakesh
1997-01-01
Due to noise considerations, ultra high bypass ducted fans have become a more viable design. These ducted fans typically consist of a rotor stage containing a wide chord fan and a stator stage. One of the concerns for this design is the classical flutter that keeps occurring in various unducted fan blade designs. These flutter are catastrophic and are to be avoided in the flight envelope of the engine. Some numerical investigations by Williams, Cho and Dalton, have suggested that a duct around a propeller makes it more unstable. This needs to be further investigated. In order to design an engine to safely perform a set of desired tasks, accurate information of the stresses on the blade during the entire cycle of blade motion is required. This requirement in turn demands that accurate knowledge of steady and unsteady blade loading be available. Aerodynamic solvers based on unsteady three-dimensional analysis will provide accurate and fast solutions and are best suited for aeroelastic analysis. The Euler solvers capture significant physics of the flowfield and are reasonably fast. An aerodynamic solver Ref. based on Euler equations had been developed under a separate grant from NASA Lewis in the past. Under the current grant, this solver has been modified to calculate the aeroelastic characteristics of unducted and ducted rotors. Even though, the aeroelastic solver based on three-dimensional Euler equations is computationally efficient, it is still very expensive to investigate the effects of multiple stages on the aeroelastic characteristics. In order to investigate the effects of multiple stages, a two-dimensional multi stage aeroelastic solver was also developed under this task, in collaboration with Dr. T. S. R. Reddy of the University of Toledo. Both of these solvers were applied to several test cases and validated against experimental data, where available.
Multi-Group Reductions of LTE Air Plasma Radiative Transfer in Cylindrical Geometries
Scoggins, James; Magin, Thierry Edouard Bertran; Wray, Alan; Mansour, Nagi N.
2013-01-01
Air plasma radiation in Local Thermodynamic Equilibrium (LTE) within cylindrical geometries is studied with an application towards modeling the radiative transfer inside arc-constrictors, a central component of constricted-arc arc jets. A detailed database of spectral absorption coefficients for LTE air is formulated using the NEQAIR code developed at NASA Ames Research Center. The database stores calculated absorption coefficients for 1,051,755 wavelengths between 0.04 µm and 200 µm over a wide temperature (500K to 15 000K) and pressure (0.1 atm to 10.0 atm) range. The multi-group method for spectral reduction is studied by generating a range of reductions including pure binning and banding reductions from the detailed absorption coefficient database. The accuracy of each reduction is compared to line-by-line calculations for cylindrical temperature profiles resembling typical profiles found in arc-constrictors. It is found that a reduction of only 1000 groups is sufficient to accurately model the LTE air radiation over a large temperature and pressure range. In addition to the reduction comparison, the cylindrical-slab formulation is compared with the finite-volume method for the numerical integration of the radiative flux inside cylinders with varying length. It is determined that cylindrical-slabs can be used to accurately model most arc-constrictors due to their high length to radius ratios.
Białowolski, Piotr
In this paper, we investigate the link between the formal definition of confidence in tendency surveys and its measurement. We advocate for the use of reflective measures in an assessment of the confidence level in both consumer and industrial indicators. Based on the data from Poland's tendency survey research, we use a multi-group confirmatory factor analytical approach to demonstrate that the set of indicators proposed by the European Commission methodology that is currently used might be not appropriate to measure the concept of confidence consistently, both within and between periods. The conclusion is true for the confidence indicator in the area of consumer tendency surveys and for the tendency survey in the manufacturing industry. We search for possible amendments that help either to find the sources of instability for the indicators proposed by the guidelines of the European Commission or to select a different set of indicators for the concept of confidence. However, we determine that the differences between the newly proposed indicator that describe industrial confidence and the indicators based on the European Commission methodology are small in terms of correlations and predictive validity.
Sample-size calculations for multi-group comparison in population pharmacokinetic experiments.
Ogungbenro, Kayode; Aarons, Leon
2010-01-01
This paper describes an approach for calculating sample size for population pharmacokinetic experiments that involve hypothesis testing based on multi-group comparison detecting the difference in parameters between groups under mixed-effects modelling. This approach extends what has been described for generalized linear models and nonlinear population pharmacokinetic models that involve only binary covariates to more complex nonlinear population pharmacokinetic models. The structural nonlinear model is linearized around the random effects to obtain the marginal model and the hypothesis testing involving model parameters is based on Wald's test. This approach provides an efficient and fast method for calculating sample size for hypothesis testing in population pharmacokinetic models. The approach can also handle different design problems such as unequal allocation of subjects to groups and unbalanced sampling times between and within groups. The results obtained following application to a one compartment intravenous bolus dose model that involved three different hypotheses under different scenarios showed good agreement between the power obtained from NONMEM simulations and nominal power.
Modelling diseases with relapse and nonlinear incidence of infection: a multi-group epidemic model
Wang, Jinliang; Pang, Jingmei; Liu, Xianning
2014-01-01
In this paper, we introduce a basic reproduction number for a multi-group SIR model with general relapse distribution and nonlinear incidence rate. We find that basic reproduction number plays the role of a key threshold in establishing the global dynamics of the model. By means of appropriate Lyapunov functionals, a subtle grouping technique in estimating the derivatives of Lyapunov functionals guided by graph-theoretical approach and LaSalle invariance principle, it is proven that if it is less than or equal to one, the disease-free equilibrium is globally stable and the disease dies out; whereas if it is larger than one, some sufficient condition is obtained in ensuring that there is a unique endemic equilibrium which is globally stable and thus the disease persists in the population. Furthermore, our results suggest that general relapse distribution are not the reason of sustained oscillations. Biologically, our model might be realistic for sexually transmitted diseases, such as Herpes, Condyloma acuminatum, etc. PMID:24963980
Modelling diseases with relapse and nonlinear incidence of infection: a multi-group epidemic model.
Wang, Jinliang; Pang, Jingmei; Liu, Xianning
2014-01-01
In this paper, we introduce a basic reproduction number for a multi-group SIR model with general relapse distribution and nonlinear incidence rate. We find that basic reproduction number plays the role of a key threshold in establishing the global dynamics of the model. By means of appropriate Lyapunov functionals, a subtle grouping technique in estimating the derivatives of Lyapunov functionals guided by graph-theoretical approach and LaSalle invariance principle, it is proven that if it is less than or equal to one, the disease-free equilibrium is globally stable and the disease dies out; whereas if it is larger than one, some sufficient condition is obtained in ensuring that there is a unique endemic equilibrium which is globally stable and thus the disease persists in the population. Furthermore, our results suggest that general relapse distribution are not the reason of sustained oscillations. Biologically, our model might be realistic for sexually transmitted diseases, such as Herpes, Condyloma acuminatum, etc.
Young Adults’ Attitude Towards Advertising: a multi-group analysis by ethnicity
Directory of Open Access Journals (Sweden)
Hiram Ting
2015-08-01
Full Text Available Objective – This study aims to investigate the attitude of Malaysian young adults towards advertising. How this segment responds to advertising, and how ethnic/cultural differences moderate are assessed. Design/methodology/approach – A quantitative questionnaire is used to collect data at two universities. Purposive sampling technique is adopted to ensure the sample represents the actual population. Structural equation modelling (SEM and multi-group analysis (MGA are utilized in analysis. Findings - The findings show that product information, hedonism, and good for economy are significant predictors of attitude towards advertising among young adults. Additionally, falsity is found to be significant among the Chinese, while social role and materialism among the Dayaks. No difference is observed in the effect of attitude on intention towards advertising by ethnicity. While homogeneity in advertising beliefs is assumed across ethnic groups, the Chinese and Dayak young adults are different in some of their advertising beliefs. Practical implications – Despite cultural effect being well-documented, young adults today seem to have similar beliefs and attitude towards advertising. Knowing what is shared and what is not for this segment is essential. Hence, it is imperative to keep track of their values in diversified communities to ensure effective communication process in advertising. Originality/value – In addition to the theory of reasoned action, MGA is utilized to assess the moderating effect of ethnic/culture on the whole model. This affords a more comprehensive understanding on the subject matter in multi-ethnic and cultural countries.
Non-Regenerative Multi-Antenna Multi-Group Multi-Way Relaying
Directory of Open Access Journals (Sweden)
Klein Anja
2011-01-01
Full Text Available Abstract We consider non-regenerative multi-group multi-way (MGMW relaying. A half-duplex non-regenerative multi-antenna relay station (RS assists multiple communication groups. In each group, multiple half-duplex nodes exchange messages. In our proposal, the required number of communication phases is equal to the maximum number of nodes among the groups. In the first phase, all nodes transmit simultaneously to the RS. Assuming perfect channel state information is available at the RS, in the following broadcast (BC phases the RS applies transceive beamforming to its received signal and transmits simultaneously to all nodes. We propose three BC strategies for the BC phases: unicasting, multicasting and hybrid uni/multicasting. For the multicasting strategy, network coding is applied to maintain the same number of communication phases as for the other strategies. We address transceive beamforming maximising the sum rate of non-regenerative MGMW relaying. Due to the high complexity of finding the optimum transceive beamforming maximising the sum rate, we design generalised low complexity transceive beamforming algorithms for all BC strategies: matched filter, zero forcing, minimisation of mean square error and BC-strategy-aware transceive beamforming. It is shown that the sum rate performance of non-regenerative MGMW relaying depends both on the chosen BC strategies and the applied transceive beamforming at the RS.
Vaytet, N; Audit, E; Commercon, B; Masson, J; Ferguson, J; Delahaye, F
2013-01-01
Star formation begins with the gravitational collapse of a dense core inside a molecular cloud. As the collapse progresses, the centre of the core begins to heat up as it becomes optically thick. The temperature and density in the centre eventually reach high enough values where fusion reactions can ignite; the protostar is born. This sequence of events entail many physical processes, of which radiative transfer is of paramount importance. Many simulations of protostellar collapse make use of a grey treatment of radiative transfer coupled to the hydrodynamics. However, interstellar gas and dust opacities present large variations as a function of frequency. In this paper, we follow-up on a previous paper on the collapse and formation of Larson's first core using multigroup radiation hydrodynamics (Paper I) by extending the calculations to the second phase of the collapse and the formation of Larson's second core. We have made the use of a non-ideal gas equation of state as well as an extensive set of spectral ...
MENDF71x. Multigroup Neutron Cross Section Data Tables Based upon ENDF/B-VII.1
Energy Technology Data Exchange (ETDEWEB)
Conlin, Jeremy Lloyd [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Parsons, Donald Kent [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Gardiner, Steven J. [Univ. of California, Davis, CA (United States); Gray, Mark Girard [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Lee, Mary Beth [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); White, Morgan Curtis [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-12-17
A new multi-group neutron cross section library has been released along with the release of NDI version 2.0.20. The library is named MENDF71x and is based upon the evaluations released in ENDF/B-VII.1 which was made publicly available in December 2011. ENDF/B-VII.1 consists of 423 evaluations of which ten are excited states evaluations and 413 are ground state evaluations. MENDF71x was created by processing the 423 evaluations into 618-group, downscatter only NDI data tables. The ENDF/B evaluation files were processed using NJOY version 99.393 with the exception of ^{35}Cl and ^{233}U. Those two isotopes had unique properties that required that we process the evaluation using NJOY version 2012. The MENDF71x library was only processed to room temperature, i.e., 293.6 K. In the future, we plan on producing a multi-temperature library based on ENDF/B-VII.1 and compatible with MENDF71x.
Offensive Strategy in the 2D Soccer Simulation League Using Multi-Group Ant Colony Optimization
Directory of Open Access Journals (Sweden)
Shengbing Chen
2016-02-01
Full Text Available The 2D soccer simulation league is one of the best test beds for the research of artificial intelligence (AI. It has achieved great successes in the domain of multi-agent cooperation and machine learning. However, the problem of integral offensive strategy has not been solved because of the dynamic and unpredictable nature of the environment. In this paper, we present a novel offensive strategy based on multi-group ant colony optimization (MACO-OS. The strategy uses the pheromone evaporation mechanism to count the preference value of each attack action in different environments, and saves the values of success rate and preference in an attack information tree in the background. The decision module of the attacker then selects the best attack action according to the preference value. The MACO-OS approach has been successfully implemented in our 2D soccer simulation team in RoboCup competitions. The experimental results have indicated that the agents developed with this strategy, along with related techniques, delivered outstanding performances.
DEFF Research Database (Denmark)
Schnettler, Berta; Miranda, Horacio; Miranda-Zapata, Edgardo
2017-01-01
This study examined longitudinal measurement invariance in the Satisfaction with Food-related Life (SWFL) scale using follow-up data from university students. We examined this measure of the SWFL in different groups of students, separated by various characteristics. Through non-probabilistic long......This study examined longitudinal measurement invariance in the Satisfaction with Food-related Life (SWFL) scale using follow-up data from university students. We examined this measure of the SWFL in different groups of students, separated by various characteristics. Through non......-probabilistic longitudinal sampling, 114 university students (65.8% female, mean age: 22.5) completed the SWFL questionnaire three times, over intervals of approximately one year. Confirmatory factor analysis was used to examine longitudinal measurement invariance. Two types of analysis were conducted: first, a longitudinal...... invariance by time, and second, a multigroup longitudinal invariance by sex, age, socio-economic status and place of residence during the study period. Results showed that the 3-item version of the SWFL exhibited strong longitudinal invariance (equal factor loadings and equal indicator intercepts...
Testing the Nursing Worklife Model in Canada and Australia: a multi-group comparison study.
Roche, Michael A; Spence Laschinger, Heather K; Duffield, Christine
2015-02-01
To test a model derived from the Nursing Worklife Model linking elements of supportive practice environments to nurses' turnover intentions and behaviours in Canada and Australia. With the worldwide shortage of nurses, retaining nurses within fiscally challenged health care systems is critical to sustaining the future of the nursing workforce and ultimately safe patient care. The Nursing Worklife Model describes a pattern of relationships amongst environmental factors that support nursing practice and link to nurse turnover. This model has been tested in north American settings but not in other countries. A secondary analysis of data collected in two cross-sectional studies in Canadian and Australian hospitals (N=4816) was conducted to test our theoretical model. Multigroup structural equation modelling techniques were used to determine the validity of our model in both countries and to identify differences between countries. The hypothesized model relationships were supported in both countries with few differences between groups. Components of supportive professional practice work environments, particularly resources, were significantly linked to nurses' turnover intentions and active search for new jobs. Leadership played a critical role in shaping the pattern of relationships to other components of supportive practice environments and ultimately turnover behaviours. The Nursing Worklife Model was shown to be valid in both countries, suggesting that management efforts to ensure that features of supportive practice environments are in place to promote the retention of valuable nursing resources. Copyright © 2014 Elsevier Ltd. All rights reserved.
Testing of the ABBN-RF multigroup data library in photon transport calculations
Directory of Open Access Journals (Sweden)
Koscheev Vladimir
2017-01-01
Full Text Available Gamma radiation is produced via both of nuclear fuel and shield materials. Photon interaction is known with appropriate accuracy, but secondary gamma ray production known much less. The purpose of this work is studying secondary gamma ray production data from neutron induced reactions in iron and lead by using MCNP code and modern nuclear data as ROSFOND, ENDF/B-7.1, JEFF-3.2 and JENDL-4.0. Results of calculations show that all of these nuclear data have different photon production data from neutron induced reactions and have poor agreement with evaluated benchmark experiment. The ABBN-RF multigroup cross-section library is based on the ROSFOND data. It presented in two forms of micro cross sections: ABBN and MATXS formats. Comparison of group-wise calculations using both ABBN and MATXS data to point-wise calculations with the ROSFOND library shows a good agreement. The discrepancies between calculation and experimental C/E results in neutron spectra are in the limit of experimental errors. For the photon spectrum they are out of experimental errors. Results of calculations using group-wise and point-wise representation of cross sections show a good agreement both for photon and neutron spectra.
Testing of the ABBN-RF multigroup data library in photon transport calculations
Koscheev, Vladimir; Lomakov, Gleb; Manturov, Gennady; Tsiboulia, Anatoly
2017-09-01
Gamma radiation is produced via both of nuclear fuel and shield materials. Photon interaction is known with appropriate accuracy, but secondary gamma ray production known much less. The purpose of this work is studying secondary gamma ray production data from neutron induced reactions in iron and lead by using MCNP code and modern nuclear data as ROSFOND, ENDF/B-7.1, JEFF-3.2 and JENDL-4.0. Results of calculations show that all of these nuclear data have different photon production data from neutron induced reactions and have poor agreement with evaluated benchmark experiment. The ABBN-RF multigroup cross-section library is based on the ROSFOND data. It presented in two forms of micro cross sections: ABBN and MATXS formats. Comparison of group-wise calculations using both ABBN and MATXS data to point-wise calculations with the ROSFOND library shows a good agreement. The discrepancies between calculation and experimental C/E results in neutron spectra are in the limit of experimental errors. For the photon spectrum they are out of experimental errors. Results of calculations using group-wise and point-wise representation of cross sections show a good agreement both for photon and neutron spectra.
Stability analysis of multi-group deterministic and stochastic epidemic models with vaccination rate
Wang, Zhi-Gang; Gao, Rui-Mei; Fan, Xiao-Ming; Han, Qi-Xing
2014-09-01
We discuss in this paper a deterministic multi-group MSIR epidemic model with a vaccination rate, the basic reproduction number ℛ0, a key parameter in epidemiology, is a threshold which determines the persistence or extinction of the disease. By using Lyapunov function techniques, we show if ℛ0 is greater than 1 and the deterministic model obeys some conditions, then the disease will prevail, the infective persists and the endemic state is asymptotically stable in a feasible region. If ℛ0 is less than or equal to 1, then the infective disappear so the disease dies out. In addition, stochastic noises around the endemic equilibrium will be added to the deterministic MSIR model in order that the deterministic model is extended to a system of stochastic ordinary differential equations. In the stochastic version, we carry out a detailed analysis on the asymptotic behavior of the stochastic model. In addition, regarding the value of ℛ0, when the stochastic system obeys some conditions and ℛ0 is greater than 1, we deduce the stochastic system is stochastically asymptotically stable. Finally, the deterministic and stochastic model dynamics are illustrated through computer simulations.
The novel high-performance 3-D MT inverse solver
Kruglyakov, Mikhail; Geraskin, Alexey; Kuvshinov, Alexey
2016-04-01
We present novel, robust, scalable, and fast 3-D magnetotelluric (MT) inverse solver. The solver is written in multi-language paradigm to make it as efficient, readable and maintainable as possible. Separation of concerns and single responsibility concepts go through implementation of the solver. As a forward modelling engine a modern scalable solver extrEMe, based on contracting integral equation approach, is used. Iterative gradient-type (quasi-Newton) optimization scheme is invoked to search for (regularized) inverse problem solution, and adjoint source approach is used to calculate efficiently the gradient of the misfit. The inverse solver is able to deal with highly detailed and contrasting models, allows for working (separately or jointly) with any type of MT responses, and supports massive parallelization. Moreover, different parallelization strategies implemented in the code allow optimal usage of available computational resources for a given problem statement. To parameterize an inverse domain the so-called mask parameterization is implemented, which means that one can merge any subset of forward modelling cells in order to account for (usually) irregular distribution of observation sites. We report results of 3-D numerical experiments aimed at analysing the robustness, performance and scalability of the code. In particular, our computational experiments carried out at different platforms ranging from modern laptops to HPC Piz Daint (6th supercomputer in the world) demonstrate practically linear scalability of the code up to thousands of nodes.
A robust HLLC-type Riemann solver for strong shock
Shen, Zhijun; Yan, Wei; Yuan, Guangwei
2016-03-01
It is well known that for the Eulerian equations the numerical schemes that can accurately capture contact discontinuity usually suffer from some disastrous carbuncle phenomenon, while some more dissipative schemes, such as the HLL scheme, are free from this kind of shock instability. Hybrid schemes to combine a dissipative flux with a less dissipative flux can cure the shock instability, but also may lead to other problems, such as certain arbitrariness of choosing switching parameters or contact interface becoming smeared. In order to overcome these drawbacks, this paper proposes a simple and robust HLLC-type Riemann solver for inviscid, compressible gas flows, which is capable of preserving sharp contact surface and is free from instability. The main work is to construct a HLL-type Riemann solver and a HLLC-type Riemann solver by modifying the shear viscosity of the original HLL and HLLC methods. Both of the two new schemes are positively conservative under some typical wavespeed estimations. Moreover, a linear matrix stability analysis for the proposed schemes is accomplished, which illustrates the HLLC-type solver with shear viscosity is stable whereas the HLL-type solver with vorticity wave is unstable. Our arguments and numerical experiments demonstrate that the inadequate dissipation associated to the shear wave may be a unique reason to cause the instability.
Numerical comparison of Riemann solvers for astrophysical hydrodynamics
Klingenberg, Christian; Waagan, Knut
2007-01-01
The idea of this work is to compare a new positive and entropy stable approximate Riemann solver by Francois Bouchut with a state-of the-art algorithm for astrophysical fluid dynamics. We implemented the new Riemann solver into an astrophysical PPM-code, the Prometheus code, and also made a version with a different, more theoretically grounded higher order algorithm than PPM. We present shock tube tests, two-dimensional instability tests and forced turbulence simulations in three dimensions. We find subtle differences between the codes in the shock tube tests, and in the statistics of the turbulence simulations. The new Riemann solver increases the computational speed without significant loss of accuracy.
Advanced Algebraic Multigrid Solvers for Subsurface Flow Simulation
Chen, Meng-Huo
2015-09-13
In this research we are particularly interested in extending the robustness of multigrid solvers to encounter complex systems related to subsurface reservoir applications for flow problems in porous media. In many cases, the step for solving the pressure filed in subsurface flow simulation becomes a bottleneck for the performance of the simulator. For solving large sparse linear system arising from MPFA discretization, we choose multigrid methods as the linear solver. The possible difficulties and issues will be addressed and the corresponding remedies will be studied. As the multigrid methods are used as the linear solver, the simulator can be parallelized (although not trivial) and the high-resolution simulation become feasible, the ultimately goal which we desire to achieve.
Gpu Implementation of a Viscous Flow Solver on Unstructured Grids
Xu, Tianhao; Chen, Long
2016-06-01
Graphics processing units have gained popularities in scientific computing over past several years due to their outstanding parallel computing capability. Computational fluid dynamics applications involve large amounts of calculations, therefore a latest GPU card is preferable of which the peak computing performance and memory bandwidth are much better than a contemporary high-end CPU. We herein focus on the detailed implementation of our GPU targeting Reynolds-averaged Navier-Stokes equations solver based on finite-volume method. The solver employs a vertex-centered scheme on unstructured grids for the sake of being capable of handling complex topologies. Multiple optimizations are carried out to improve the memory accessing performance and kernel utilization. Both steady and unsteady flow simulation cases are carried out using explicit Runge-Kutta scheme. The solver with GPU acceleration in this paper is demonstrated to have competitive advantages over the CPU targeting one.
Constraint solvers: An empirical evaluation of design decisions
Kotthoff, Lars
2010-01-01
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To assess the impact of design decisions, instances of the five problem classes n-Queens, Golomb Ruler, Magic Square, Social Golfers, and Balanced Incomplete Block Design are modelled and solved with each solver. The results of the experiments are not meant to give an indication of the performance of a solver, but rather investigate what influence the choice of algorithms and data structures has. The analysis of the impact of the design decisions focuses on the different ways of memory management, behaviour with increasing problem size, and specialised algorithms for specific types of variables. It also briefly considers other, less significant decisions.
An adaptive fast multipole accelerated Poisson solver for complex geometries
Askham, T.; Cerfon, A. J.
2017-09-01
We present a fast, direct and adaptive Poisson solver for complex two-dimensional geometries based on potential theory and fast multipole acceleration. More precisely, the solver relies on the standard decomposition of the solution as the sum of a volume integral to account for the source distribution and a layer potential to enforce the desired boundary condition. The volume integral is computed by applying the FMM on a square box that encloses the domain of interest. For the sake of efficiency and convergence acceleration, we first extend the source distribution (the right-hand side in the Poisson equation) to the enclosing box as a C0 function using a fast, boundary integral-based method. We demonstrate on multiply connected domains with irregular boundaries that this continuous extension leads to high accuracy without excessive adaptive refinement near the boundary and, as a result, to an extremely efficient ;black box; fast solver.
Dry deposition model for a microscale aerosol dispersion solver based on the moment method
Šíp, Viktor
2016-01-01
A dry deposition model suitable for use in the moment method has been developed. Contributions from five main processes driving the deposition - Brownian diffusion, interception, impaction, turbulent impaction, and sedimentation - are included in the model. The deposition model was employed in the moment method solver implemented in the OpenFOAM framework. Applicability of the developed expression and the moment method solver was tested on two example problems of particle dispersion in the presence of a vegetation on small scales: a flow through a tree patch in 2D and a flow through a hedgerow in 3D. Comparison with the sectional method showed that the moment method using the developed deposition model is able to reproduce the shape of the particle size distribution well. The relative difference in terms of the third moment of the distribution was below 10\\% in both tested cases, and decreased away from the vegetation. Main source of this difference is a known overprediction of the impaction efficiency. When ...
Decomposition During Search for Propagation-Based Constraint Solvers
Mann, Martin; Will, Sebastian
2007-01-01
We describe decomposition during search (DDS), an integration of and/or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem into independent partial problems, avoiding redundant work. The paper discusses how DDS interacts with key features that make propagation-based solvers successful: constraint propagation, especially for global constraints, and dynamic search heuristics. We have implemented DDS for the Gecode constraint programming library. Two applications, solution counting in graph coloring and protein structure prediction, exemplify the benefits of DDS in practice.
LAPACKrc: Fast linear algebra kernels/solvers for FPGA accelerators
Energy Technology Data Exchange (ETDEWEB)
Gonzalez, Juan; Nunez, Rafael C, E-mail: juan.gonzalez@accelogic.co [Accelogic, 1830 Main Street, Suite 204, Weston, FL (United States)
2009-07-01
We present LAPACKrc, a family of FPGA-based linear algebra solvers able to achieve more than 100x speedup per commodity processor on certain problems. LAPACKrc subsumes some of the LAPACK and ScaLAPACK functionalities, and it also incorporates sparse direct and iterative matrix solvers. Current LAPACKrc prototypes demonstrate between 40x-150x speedup compared against top-of-the-line hardware/software systems. A technology roadmap is in place to validate current performance of LAPACKrc in HPC applications, and to increase the computational throughput by factors of hundreds within the next few years.
Efficient use of iterative solvers in nested topology optimization
DEFF Research Database (Denmark)
Amir, Oded; Stolpe, Mathias; Sigmund, Ole
2010-01-01
In the nested approach to structural optimization, most of the computational effort is invested in the solution of the analysis equations. In this study, it is suggested to reduce this computational cost by using an approximation to the solution of the analysis problem, generated by a Krylov...... subspace iterative solver. By choosing convergence criteria for the iterative solver that are strongly related to the optimization objective and to the design sensitivities, it is possible to terminate the iterative solution of the nested equations earlier compared to traditional convergence measures...
An Easy Method To Accelerate An Iterative Algebraic Equation Solver
Energy Technology Data Exchange (ETDEWEB)
Yao, Jin [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2014-01-06
This article proposes to add a simple term to an iterative algebraic equation solver with an order n convergence rate, and to raise the order of convergence to (2n - 1). In particular, a simple algebraic equation solver with the 5th order convergence but uses only 4 function values in each iteration, is described in details. When this scheme is applied to a Newton-Raphson method of the quadratic convergence for a system of algebraic equations, a cubic convergence can be achieved with an low overhead cost of function evaluation that can be ignored as the size of the system increases.
Numerical System Solver Developed for the National Cycle Program
Binder, Michael P.
1999-01-01
As part of the National Cycle Program (NCP), a powerful new numerical solver has been developed to support the simulation of aeropropulsion systems. This software uses a hierarchical object-oriented design. It can provide steady-state and time-dependent solutions to nonlinear and even discontinuous problems typically encountered when aircraft and spacecraft propulsion systems are simulated. It also can handle constrained solutions, in which one or more factors may limit the behavior of the engine system. Timedependent simulation capabilities include adaptive time-stepping and synchronization with digital control elements. The NCP solver is playing an important role in making the NCP a flexible, powerful, and reliable simulation package.
Symmetry breaking in the opinion dynamics of a multi-group project organization
Zhu, Zhen-Tao; Zhou, Jing; Li, Ping; Chen, Xing-Guang
2012-10-01
A bounded confidence model of opinion dynamics in multi-group projects is presented in which each group's opinion evolution is driven by two types of forces: (i) the group's cohesive force which tends to restore the opinion back towards the initial status because of its company culture; and (ii) nonlinear coupling forces with other groups which attempt to bring opinions closer due to collaboration willingness. Bifurcation analysis for the case of a two-group project shows a cusp catastrophe phenomenon and three distinctive evolutionary regimes, i.e., a deadlock regime, a convergence regime, and a bifurcation regime in opinion dynamics. The critical value of initial discord between the two groups is derived to discriminate which regime the opinion evolution belongs to. In the case of a three-group project with a symmetric social network, both bifurcation analysis and simulation results demonstrate that if each pair has a high initial discord, instead of symmetrically converging to consensus with the increase of coupling scale as expected by Gabbay's result (Physica A 378 (2007) p. 125 Fig. 5), project organization (PO) may be split into two distinct clusters because of the symmetry breaking phenomenon caused by pitchfork bifurcations, which urges that apart from divergence in participants' interests, nonlinear interaction can also make conflict inevitable in the PO. The effects of two asymmetric level parameters are tested in order to explore the ways of inducing dominant opinion in the whole PO. It is found that the strong influence imposed by a leader group with firm faith on the flexible and open minded follower groups can promote the formation of a positive dominant opinion in the PO.
Symmetry breaking in the opinion dynamics of a multi-group project organization
Institute of Scientific and Technical Information of China (English)
Zhu Zhen-Tao; Zhou Jing; Li Ping; Chen Xing-Guang
2012-01-01
A bounded confidence model of opinion dynamics in multi-group projects is presented in which each group's opinion evolution is driven by two types of forces:(i) the group's cohesive force which tends to restore the opinion back towards the initial status because of its company culture; and (ii) nonlinear coupling forces with other groups which attempt to bring opinions closer due to collaboration willingness.Bifurcation analysis for the case of a two-group project shows a cusp catastrophe phenomenon and three distinctive evolutionary regimes,i.e.,a deadlock regime,a convergence regime,and a bifurcation regime in opinion dynamics.The critical value of initial discord between the two groups is derived to discriminate which regime the opinion evolution belongs to.In the case of a three-group project with a symmetric social network,both bifurcation analysis and simulation results demonstrate that if each pair has a high initial discord,instead of symmetrically converging to consensus with the increase of coupling scale as expected by Gabbay's result (Physica A 378 (2007) p.125 Fig.5),project organization (PO) may be split into two distinct clusters because of the symmetry breaking phenomenon caused by pitchfork bifurcations,which urges that apart from divergence in participants' interests,nonlinear interaction can also make conflict inevitable in the PO.The effects of two asymmetric level parameters are tested in order to explore the ways of inducing dominant opinion in the whole PO.It is found that the strong influence imposed by a leader group with firm faith on the flexible and open minded follower groups can promote the formation of a positive dominant opinion in the PO.
Component Reuse in Iterative Solvers for the Solution of Fuzzy Partial Differential Equations
Corveleyn, Samuel; Vandewalle, Stefan
2009-09-01
We consider elliptic partial differential equations with an uncertain diffusion parameter, where the uncertainty is modeled by fuzzy numbers or a fuzzy field. Our aim is to efficiently compute the fuzzy characteristics of the solution to the fuzzy equation. Using the so-called α-cut approach, it is possible to reformulate the fuzzy problem as a long sequence of global optimisation problems. Function and gradient evaluations within these optimisation problems, differ from each other through a possibly small change in one or more of the partial differential equation parameters. In order to reduce the computational complexity of the optimisation problems we consider component reuse in iterative solvers. We concentrate in particular on the reuse of the setup phase in an algebraic multigrid strategy and on reuse of initial approximations.
Sparse Approximations of the Schur Complement for Parallel Algebraic Hybrid Solvers in 3D
Institute of Scientific and Technical Information of China (English)
L.Giraud; A.Haidar; Y.Saad
2010-01-01
In this paper we study the computational performance of variants of an al-gebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems. In earlier works, the local Schur complements were com- puted exactly using a sparse direct solver. The robustness of the preconditioner comes at the price of this memory and time intensive computation that is the main bottleneck of the approach for tackling huge problems. In this work we investigate the use of sparse approximation of the dense local Schur complements. These approximations are com-puted using a partial incomplete LU factorization. Such a numerical calculation is the core of the multi-level incomplete factorization such as the one implemented in pARMS. The numerical and computing performance of the new numerical scheme is illustrated on a set of large 3D convection-diffusion problems;preliminary experiments on linear systems arising from structural mechanics are also reported.
Coupling the beam tracing code TORBEAM and the Fokker-Planck solver RELAX for fast electrons
Maj, O.; Poli, E.; Westerhof, E.
2012-12-01
In this paper the interface between the beam tracing code TORBEAM [Poli, Peeters and Pereverzev, Comp. Phys. Comm. 136, 90 (2001)] and the quasi-linear Fokker-Planck solver RELAX [Westerhof, Peeters and Schippers, Rijnhuizen Report No. RR 92-211 CA, 1992] is presented together with preliminary testing results for electron cyclotron waves in ITER plasmas and their effects on the electron distribution function. The resulting numerical package allows us to account for diffraction effects in the construction of the quasi-linear wave-particle diffusion operator. The coupling of the paraxial-WKB code TORBEAM to the ray-based code RELAX requires a reinterpretation of the paraxial wave field in terms of extended rays, which are addressed in details.
Directory of Open Access Journals (Sweden)
Lena Nusser
2015-05-01
Full Text Available This article focuses on measurement invariance of the assessment of educationally relevant constructs via written questionnaires for students at special schools and at low track schools attending 5th grade. To examine optimal conditions of administration for students with special educational needs in the area of learning an experimental design was implemented. If accommodated questionnaires, different school enrollments as well as competence differences allow equivalent assessment of reading motivation and academic self-concepts will be investigated with multi-group comparison of confirmatory factor analysis. The results indicate that comparisons between groups of students at special schools and low track schools are meaningful for certain constructs.
Parallel time domain solvers for electrically large transient scattering problems
Liu, Yang
2014-09-26
Marching on in time (MOT)-based integral equation solvers represent an increasingly appealing avenue for analyzing transient electromagnetic interactions with large and complex structures. MOT integral equation solvers for analyzing electromagnetic scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary to finite difference and element competitors, these solvers apply to nonlinear and multi-scale structures comprising geometrically intricate and deep sub-wavelength features residing atop electrically large platforms. Moreover, they are high-order accurate, stable in the low- and high-frequency limits, and applicable to conducting and penetrable structures represented by highly irregular meshes. This presentation reviews some recent advances in the parallel implementations of time domain integral equation solvers, specifically those that leverage multilevel plane-wave time-domain algorithm (PWTD) on modern manycore computer architectures including graphics processing units (GPUs) and distributed memory supercomputers. The GPU-based implementation achieves at least one order of magnitude speedups compared to serial implementations while the distributed parallel implementation are highly scalable to thousands of compute-nodes. A distributed parallel PWTD kernel has been adopted to solve time domain surface/volume integral equations (TDSIE/TDVIE) for analyzing transient scattering from large and complex-shaped perfectly electrically conducting (PEC)/dielectric objects involving ten million/tens of millions of spatial unknowns.
Implementing parallel elliptic solver on a Beowulf cluster
Directory of Open Access Journals (Sweden)
Marcin Paprzycki
1999-12-01
Full Text Available In a recent paper cite{zara} a parallel direct solver for the linear systems arising from elliptic partial differential equations has been proposed. The aim of this note is to present the initial evaluation of the performance characteristics of this algorithm on Beowulf-type cluster. In this context the performance of PVM and MPI based implementations is compared.
Thinking Process of Naive Problem Solvers to Solve Mathematical Problems
Mairing, Jackson Pasini
2017-01-01
Solving problems is not only a goal of mathematical learning. Students acquire ways of thinking, habits of persistence and curiosity, and confidence in unfamiliar situations by learning to solve problems. In fact, there were students who had difficulty in solving problems. The students were naive problem solvers. This research aimed to describe…
Time-varying Riemann solvers for conservation laws on networks
Garavello, Mauro; Piccoli, Benedetto
We consider a conservation law on a network and generic Riemann solvers at nodes depending on parameters, which can be seen as control functions. Assuming that the parameters have bounded variation as functions of time, we prove existence of solutions to Cauchy problems on the whole network.
A new fast direct solver for the boundary element method
Huang, S.; Liu, Y. J.
2017-04-01
A new fast direct linear equation solver for the boundary element method (BEM) is presented in this paper. The idea of the new fast direct solver stems from the concept of the hierarchical off-diagonal low-rank matrix. The hierarchical off-diagonal low-rank matrix can be decomposed into the multiplication of several diagonal block matrices. The inverse of the hierarchical off-diagonal low-rank matrix can be calculated efficiently with the Sherman-Morrison-Woodbury formula. In this paper, a more general and efficient approach to approximate the coefficient matrix of the BEM with the hierarchical off-diagonal low-rank matrix is proposed. Compared to the current fast direct solver based on the hierarchical off-diagonal low-rank matrix, the proposed method is suitable for solving general 3-D boundary element models. Several numerical examples of 3-D potential problems with the total number of unknowns up to above 200,000 are presented. The results show that the new fast direct solver can be applied to solve large 3-D BEM models accurately and with better efficiency compared with the conventional BEM.
Performance evaluation of a parallel sparse lattice Boltzmann solver
Axner, L.; Bernsdorf, J.; Zeiser, T.; Lammers, P.; Linxweiler, J.; Hoekstra, A.G.
2008-01-01
We develop a performance prediction model for a parallelized sparse lattice Boltzmann solver and present performance results for simulations of flow in a variety of complex geometries. A special focus is on partitioning and memory/load balancing strategy for geometries with a high solid fraction and
Implementing parallel elliptic solver on a Beowulf cluster
Marcin Paprzycki; Svetozara Petrova; Julian Sanchez
1999-01-01
In a recent paper cite{zara} a parallel direct solver for the linear systems arising from elliptic partial differential equations has been proposed. The aim of this note is to present the initial evaluation of the performance characteristics of this algorithm on Beowulf-type cluster. In this context the performance of PVM and MPI based implementations is compared.
Navier-Stokes Solvers and Generalizations for Reacting Flow Problems
Energy Technology Data Exchange (ETDEWEB)
Elman, Howard C
2013-01-27
This is an overview of our accomplishments during the final term of this grant (1 September 2008 -- 30 June 2012). These fall mainly into three categories: fast algorithms for linear eigenvalue problems; solution algorithms and modeling methods for partial differential equations with uncertain coefficients; and preconditioning methods and solvers for models of computational fluid dynamics (CFD).
A vectorizable adaptive grid solver for PDEs in 3D
Blom, J.G.; Verwer, J.G.
1993-01-01
This paper describes the application of an adaptive-grid finite-difference solver to some time-dependent three-dimensional systems of partial differential equations. The code is a 3D extension of the 2D code VLUGR2[3].
Using a satisfiability solver to identify deterministic finite state automata
Heule, M.J.H.; Verwer, S.
2009-01-01
We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach seems to be competitive with alternative techniques. Our contributions are threefold: First, we p
PSH3D fast Poisson solver for petascale DNS
Adams, Darren; Dodd, Michael; Ferrante, Antonino
2016-11-01
Direct numerical simulation (DNS) of high Reynolds number, Re >= O (105) , turbulent flows requires computational meshes >= O (1012) grid points, and, thus, the use of petascale supercomputers. DNS often requires the solution of a Helmholtz (or Poisson) equation for pressure, which constitutes the bottleneck of the solver. We have developed a parallel solver of the Helmholtz equation in 3D, PSH3D. The numerical method underlying PSH3D combines a parallel 2D Fast Fourier transform in two spatial directions, and a parallel linear solver in the third direction. For computational meshes up to 81923 grid points, our numerical results show that PSH3D scales up to at least 262k cores of Cray XT5 (Blue Waters). PSH3D has a peak performance 6 × faster than 3D FFT-based methods when used with the 'partial-global' optimization, and for a 81923 mesh solves the Poisson equation in 1 sec using 128k cores. Also, we have verified that the use of PSH3D with the 'partial-global' optimization in our DNS solver does not reduce the accuracy of the numerical solution of the incompressible Navier-Stokes equations.
Hypersonic simulations using open-source CFD and DSMC solvers
Casseau, V.; Scanlon, T. J.; John, B.; Emerson, D. R.; Brown, R. E.
2016-11-01
Hypersonic hybrid hydrodynamic-molecular gas flow solvers are required to satisfy the two essential requirements of any high-speed reacting code, these being physical accuracy and computational efficiency. The James Weir Fluids Laboratory at the University of Strathclyde is currently developing an open-source hybrid code which will eventually reconcile the direct simulation Monte-Carlo method, making use of the OpenFOAM application called dsmcFoam, and the newly coded open-source two-temperature computational fluid dynamics solver named hy2Foam. In conjunction with employing the CVDV chemistry-vibration model in hy2Foam, novel use is made of the QK rates in a CFD solver. In this paper, further testing is performed, in particular with the CFD solver, to ensure its efficacy before considering more advanced test cases. The hy2Foam and dsmcFoam codes have shown to compare reasonably well, thus providing a useful basis for other codes to compare against.
Parallel Solver for H(div) Problems Using Hybridization and AMG
Energy Technology Data Exchange (ETDEWEB)
Lee, Chak S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-15
In this paper, a scalable parallel solver is proposed for H(div) problems discretized by arbitrary order finite elements on general unstructured meshes. The solver is based on hybridization and algebraic multigrid (AMG). Unlike some previously studied H(div) solvers, the hybridization solver does not require discrete curl and gradient operators as additional input from the user. Instead, only some element information is needed in the construction of the solver. The hybridization results in a H1-equivalent symmetric positive definite system, which is then rescaled and solved by AMG solvers designed for H1 problems. Weak and strong scaling of the method are examined through several numerical tests. Our numerical results show that the proposed solver provides a promising alternative to ADS, a state-of-the-art solver [12], for H(div) problems. In fact, it outperforms ADS for higher order elements.
White, Christopher J.; Stone, James M.; Gammie, Charles F.
2016-08-01
We present a new general relativistic magnetohydrodynamics (GRMHD) code integrated into the Athena++ framework. Improving upon the techniques used in most GRMHD codes, ours allows the use of advanced, less diffusive Riemann solvers, in particular HLLC and HLLD. We also employ a staggered-mesh constrained transport algorithm suited for curvilinear coordinate systems in order to maintain the divergence-free constraint of the magnetic field. Our code is designed to work with arbitrary stationary spacetimes in one, two, or three dimensions, and we demonstrate its reliability through a number of tests. We also report on its promising performance and scalability.
Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers
Tang, Yu-Hang; Kudo, Shuhei; Bian, Xin; Li, Zhen; Karniadakis, George Em
2015-09-01
Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM).
Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers
Energy Technology Data Exchange (ETDEWEB)
Tang, Yu-Hang, E-mail: yuhang_tang@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Kudo, Shuhei, E-mail: shuhei-kudo@outlook.jp [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe, 657-8501 (Japan); Bian, Xin, E-mail: xin_bian@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Li, Zhen, E-mail: zhen_li@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Karniadakis, George Em, E-mail: george_karniadakis@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Collaboratory on Mathematics for Mesoscopic Modeling of Materials, Pacific Northwest National Laboratory, Richland, WA 99354 (United States)
2015-09-15
Graphical abstract: - Abstract: Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM)
A High Performance QDWH-SVD Solver using Hardware Accelerators
Sukkari, Dalal E.
2015-04-08
This paper describes a new high performance implementation of the QR-based Dynamically Weighted Halley Singular Value Decomposition (QDWH-SVD) solver on multicore architecture enhanced with multiple GPUs. The standard QDWH-SVD algorithm was introduced by Nakatsukasa and Higham (SIAM SISC, 2013) and combines three successive computational stages: (1) the polar decomposition calculation of the original matrix using the QDWH algorithm, (2) the symmetric eigendecomposition of the resulting polar factor to obtain the singular values and the right singular vectors and (3) the matrix-matrix multiplication to get the associated left singular vectors. A comprehensive test suite highlights the numerical robustness of the QDWH-SVD solver. Although it performs up to two times more flops when computing all singular vectors compared to the standard SVD solver algorithm, our new high performance implementation on single GPU results in up to 3.8x improvements for asymptotic matrix sizes, compared to the equivalent routines from existing state-of-the-art open-source and commercial libraries. However, when only singular values are needed, QDWH-SVD is penalized by performing up to 14 times more flops. The singular value only implementation of QDWH-SVD on single GPU can still run up to 18% faster than the best existing equivalent routines. Integrating mixed precision techniques in the solver can additionally provide up to 40% improvement at the price of losing few digits of accuracy, compared to the full double precision floating point arithmetic. We further leverage the single GPU QDWH-SVD implementation by introducing the first multi-GPU SVD solver to study the scalability of the QDWH-SVD framework.
Advances in three-dimensional geoelectric forward solver techniques
Blome, M.; Maurer, H. R.; Schmidt, K.
2009-03-01
Modern geoelectrical data acquisition systems allow large amounts of data to be collected in a short time. Inversions of such data sets require powerful forward solvers for predicting the electrical potentials. State-of-the-art solvers are typically based on finite elements. Recent developments in numerical mathematics led to direct matrix solvers that allow the equation systems arising from such finite element problems to be solved very efficiently. They are particularly useful for 3-D geoelectrical problems, where many electrodes are involved. Although modern direct matrix solvers include optimized memory saving strategies, their application to realistic, large-scale 3-D problems is still somewhat limited. Therefore, we present two novel techniques that allow the number of gridpoints to be reduced considerably, while maintaining a high solution accuracy. In the areas surrounding an electrode array we attach infinite elements that continue the electrical potentials to infinity. This does not only reduce the number of gridpoints, but also avoids the artificial Dirichlet or mixed boundary conditions that are well known to be the cause of numerical inaccuracies. Our second development concerns the singularity removal in the presence of significant surface topography. We employ a fast multipole boundary element method for computing the singular potentials. This renders unnecessary mesh refinements near the electrodes, which results in substantial savings of gridpoints of up to more than 50 per cent. By means of extensive numerical tests we demonstrate that combined application of infinite elements and singularity removal allows the number of gridpoints to be reduced by a factor of ~6-10 compared with traditional finite element methods. This will be key for applying finite elements and direct matrix solver techniques to realistic 3-D inversion problems.
Decision Engines for Software Analysis Using Satisfiability Modulo Theories Solvers
Bjorner, Nikolaj
2010-01-01
The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A well-recognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing states and transformations between system states. The process of using this information for discovering and checking program properties (including such important properties as safety and security) amounts to automatic theorem proving. In particular, theorem provers that directly support common software constructs offer a compelling basis. Such provers are commonly called satisfiability modulo theories (SMT) solvers. Z3 is a state-of-the-art SMT solver. It is developed at Microsoft Research. It can be used to check the satisfiability of logical formulas over one or more theories such as arithmetic, bit-vectors, lists, records and arrays. The talk describes some of the technology behind modern SMT solvers, including the solver Z3. Z3 is currently mainly targeted at solving problems that arise in software analysis and verification. It has been applied to various contexts, such as systems for dynamic symbolic simulation (Pex, SAGE, Vigilante), for program verification and extended static checking (Spec#/Boggie, VCC, HAVOC), for software model checking (Yogi, SLAM), model-based design (FORMULA), security protocol code (F7), program run-time analysis and invariant generation (VS3). We will describe how it integrates support for a variety of theories that arise naturally in the context of the applications. There are several new promising avenues and the talk will touch on some of these and the challenges related to SMT solvers. Proceedings
Migration of vectorized iterative solvers to distributed memory architectures
Energy Technology Data Exchange (ETDEWEB)
Pommerell, C. [AT& T Bell Labs., Murray Hill, NJ (United States); Ruehl, R. [CSCS-ETH, Manno (Switzerland)
1994-12-31
Both necessity and opportunity motivate the use of high-performance computers for iterative linear solvers. Necessity results from the size of the problems being solved-smaller problems are often better handled by direct methods. Opportunity arises from the formulation of the iterative methods in terms of simple linear algebra operations, even if this {open_quote}natural{close_quotes} parallelism is not easy to exploit in irregularly structured sparse matrices and with good preconditioners. As a result, high-performance implementations of iterative solvers have attracted a lot of interest in recent years. Most efforts are geared to vectorize or parallelize the dominating operation-structured or unstructured sparse matrix-vector multiplication, or to increase locality and parallelism by reformulating the algorithm-reducing global synchronization in inner products or local data exchange in preconditioners. Target architectures for iterative solvers currently include mostly vector supercomputers and architectures with one or few optimized (e.g., super-scalar and/or super-pipelined RISC) processors and hierarchical memory systems. More recently, parallel computers with physically distributed memory and a better price/performance ratio have been offered by vendors as a very interesting alternative to vector supercomputers. However, programming comfort on such distributed memory parallel processors (DMPPs) still lags behind. Here the authors are concerned with iterative solvers and their changing computing environment. In particular, they are considering migration from traditional vector supercomputers to DMPPs. Application requirements force one to use flexible and portable libraries. They want to extend the portability of iterative solvers rather than reimplementing everything for each new machine, or even for each new architecture.
Munayer, Salim J; Horenczyk, Gabriel
2014-10-01
Grounded in a contextual approach to acculturation of minorities, this study examines changes in acculturation orientations among Palestinian Christian Arab adolescents in Israel following the "lost decade of Arab-Jewish coexistence." Multi-group acculturation orientations among 237 respondents were assessed vis-à-vis two majorities--Muslim Arabs and Israeli Jews--and compared to 1998 data. Separation was the strongest endorsed orientation towards both majority groups. Comparisons with the 1998 data also show a weakening of the Integration attitude towards Israeli Jews, and also distancing from Muslim Arabs. For the examination of the "Westernisation" hypothesis, multi-dimensional scaling (MDS) analyses of perceptions of Self and group values clearly showed that, after 10 years, Palestinian Christian Arabs perceive Israeli Jewish culture as less close to Western culture, and that Self and the Christian Arab group have become much closer, suggesting an increasing identification of Palestinian Christian Arab adolescents with their ethnoreligious culture. We discuss the value of a multi-group, multi-method, and multi-wave approach to the examination of the role of the political context in acculturation processes.
Geophysical modelling of 3D electromagnetic diffusion with multigrid
Mulder, W.A.
2008-01-01
The performance of a multigrid solver for time-harmonic electromagnetic problems in geophysical settings was investigated. With the low frequencies used in geophysical surveys for deeper targets, the light-speed waves in the earth can be neglected. Diffusion of induced currents is the dominant physi
An exact solver for the DCJ median problem.
Zhang, Meng; Arndt, William; Tang, Jijun
2009-01-01
The "double-cut-and-join" (DCJ) model of genome rearrangement proposed by Yancopoulos et al. uses the single DCJ operation to account for all genome rearrangement events. Given three signed permutations, the DCJ median problem is to find a fourth permutation that minimizes the sum of the pairwise DCJ distances between it and the three others. In this paper, we present a branch-and-bound method that provides accurate solution to the multichromosomal DCJ median problems. We conduct extensive simulations and the results show that the DCJ median solver performs better than other median solvers for most of the test cases. These experiments also suggest that DCJ model is more suitable for real datasets where both reversals and transpositions occur.
On improving linear solver performance: a block variant of GMRES
Energy Technology Data Exchange (ETDEWEB)
Baker, A H; Dennis, J M; Jessup, E R
2004-05-10
The increasing gap between processor performance and memory access time warrants the re-examination of data movement in iterative linear solver algorithms. For this reason, we explore and establish the feasibility of modifying a standard iterative linear solver algorithm in a manner that reduces the movement of data through memory. In particular, we present an alternative to the restarted GMRES algorithm for solving a single right-hand side linear system Ax = b based on solving the block linear system AX = B. Algorithm performance, i.e. time to solution, is improved by using the matrix A in operations on groups of vectors. Experimental results demonstrate the importance of implementation choices on data movement as well as the effectiveness of the new method on a variety of problems from different application areas.
Error Control of Iterative Linear Solvers for Integrated Groundwater Models
Dixon, Matthew; Brush, Charles; Chung, Francis; Dogrul, Emin; Kadir, Tariq
2010-01-01
An open problem that arises when using modern iterative linear solvers, such as the preconditioned conjugate gradient (PCG) method or Generalized Minimum RESidual method (GMRES) is how to choose the residual tolerance in the linear solver to be consistent with the tolerance on the solution error. This problem is especially acute for integrated groundwater models which are implicitly coupled to another model, such as surface water models, and resolve both multiple scales of flow and temporal interaction terms, giving rise to linear systems with variable scaling. This article uses the theory of 'forward error bound estimation' to show how rescaling the linear system affects the correspondence between the residual error in the preconditioned linear system and the solution error. Using examples of linear systems from models developed using the USGS GSFLOW package and the California State Department of Water Resources' Integrated Water Flow Model (IWFM), we observe that this error bound guides the choice of a prac...
LDRD report : parallel repartitioning for optimal solver performance.
Energy Technology Data Exchange (ETDEWEB)
Heaphy, Robert; Devine, Karen Dragon; Preis, Robert (University of Paderborn, Paderborn, Germany); Hendrickson, Bruce Alan; Heroux, Michael Allen; Boman, Erik Gunnar
2004-02-01
We have developed infrastructure, utilities and partitioning methods to improve data partitioning in linear solvers and preconditioners. Our efforts included incorporation of data repartitioning capabilities from the Zoltan toolkit into the Trilinos solver framework, (allowing dynamic repartitioning of Trilinos matrices); implementation of efficient distributed data directories and unstructured communication utilities in Zoltan and Trilinos; development of a new multi-constraint geometric partitioning algorithm (which can generate one decomposition that is good with respect to multiple criteria); and research into hypergraph partitioning algorithms (which provide up to 56% reduction of communication volume compared to graph partitioning for a number of emerging applications). This report includes descriptions of the infrastructure and algorithms developed, along with results demonstrating the effectiveness of our approaches.
Parallel Auxiliary Space AMG Solver for $H(div)$ Problems
Energy Technology Data Exchange (ETDEWEB)
Kolev, Tzanio V. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2012-12-18
We present a family of scalable preconditioners for matrices arising in the discretization of $H(div)$ problems using the lowest order Raviart--Thomas finite elements. Our approach belongs to the class of “auxiliary space''--based methods and requires only the finite element stiffness matrix plus some minimal additional discretization information about the topology and orientation of mesh entities. Also, we provide a detailed algebraic description of the theory, parallel implementation, and different variants of this parallel auxiliary space divergence solver (ADS) and discuss its relations to the Hiptmair--Xu (HX) auxiliary space decomposition of $H(div)$ [SIAM J. Numer. Anal., 45 (2007), pp. 2483--2509] and to the auxiliary space Maxwell solver AMS [J. Comput. Math., 27 (2009), pp. 604--623]. Finally, an extensive set of numerical experiments demonstrates the robustness and scalability of our implementation on large-scale $H(div)$ problems with large jumps in the material coefficients.
HLL Riemann Solvers and Alfven Waves in Black Hole Magnetospheres
Punsly, Brian; Kim, Jinho; Garain, Sudip
2016-01-01
In the magnetosphere of a rotating black hole, an inner Alfven critical surface (IACS) must be crossed by inflowing plasma. Inside the IACS, Alfven waves are inward directed toward the black hole. The majority of the proper volume of the active region of spacetime (the ergosphere) is inside of the IACS. The charge and the totally transverse momentum flux (the momentum flux transverse to both the wave normal and the unperturbed magnetic field) are both determined exclusively by the Alfven polarization. However, numerical simulations of black hole magnetospheres are often based on 1-D HLL Riemann solvers that readily dissipate Alfven waves. Elements of the dissipated wave emerge in adjacent cells regardless of the IACS, there is no mechanism to prevent Alfvenic information from crossing outward. Thus, it is unclear how simulated magnetospheres attain the substantial Goldreich-Julian charge density associated with the rotating magnetic field. The HLL Riemann solver is also notorious for producing large recurring...
Scalable Out-of-Core Solvers on Xeon Phi Cluster
Energy Technology Data Exchange (ETDEWEB)
D' Azevedo, Ed F [ORNL; Chan, Ki Shing [Chinese University of Hong Kong (CUHK); Su, Shiquan [Center for Computational Materials Science; Wong, Kwai [ORNL
2015-01-01
This paper documents the implementation of a distributive out-of-core (OOC) solver for performing LU and Cholesky factorizations of a large dense matrix on clusters of many-core programmable co-processors. The out-of- core algorithm combines both the left-looking and right-looking schemes aimed to minimize the movement of data between the CPU host and the co-processor, optimizing data locality as well as computing throughput. The OOC solver is built to align with the format of the ScaLAPACK software library, making it readily portable to any existing codes using ScaLAPACK. A runtime analysis conducted on Beacon (an Intel Xeon plus Intel Xeon Phi cluster which composed of 48 nodes of multi-core CPU and MIC) at the Na- tional Institute for Computational Sciences is presented. Comparison of the performance on the Intel Xeon Phi and GPU clusters are also provided.
Benchmarking ICRF Full-wave Solvers for ITER
Energy Technology Data Exchange (ETDEWEB)
R. V. Budny, L. Berry, R. Bilato, P. Bonoli, M. Brambilla, R. J. Dumont, A. Fukuyama, R. Harvey, E. F. Jaeger, K. Indireshkumar, E. Lerche, D. McCune, C. K. Phillips, V. Vdovin, J. Wright, and members of the ITPA-IOS
2011-01-06
Abstract Benchmarking of full-wave solvers for ICRF simulations is performed using plasma profiles and equilibria obtained from integrated self-consistent modeling predictions of four ITER plasmas. One is for a high performance baseline (5.3 T, 15 MA) DT H-mode. The others are for half-field, half-current plasmas of interest for the pre-activation phase with bulk plasma ion species being either hydrogen or He4. The predicted profiles are used by six full-wave solver groups to simulate the ICRF electromagnetic fields and heating, and by three of these groups to simulate the current-drive. Approximate agreement is achieved for the predicted heating power for the DT and He4 cases. Factor of two disagreements are found for the cases with second harmonic He3 heating in bulk H cases. Approximate agreement is achieved simulating the ICRF current drive.
Elliptic Solvers with Adaptive Mesh Refinement on Complex Geometries
Energy Technology Data Exchange (ETDEWEB)
Phillip, B.
2000-07-24
Adaptive Mesh Refinement (AMR) is a numerical technique for locally tailoring the resolution computational grids. Multilevel algorithms for solving elliptic problems on adaptive grids include the Fast Adaptive Composite grid method (FAC) and its parallel variants (AFAC and AFACx). Theory that confirms the independence of the convergence rates of FAC and AFAC on the number of refinement levels exists under certain ellipticity and approximation property conditions. Similar theory needs to be developed for AFACx. The effectiveness of multigrid-based elliptic solvers such as FAC, AFAC, and AFACx on adaptively refined overlapping grids is not clearly understood. Finally, a non-trivial eye model problem will be solved by combining the power of using overlapping grids for complex moving geometries, AMR, and multilevel elliptic solvers.
Brittle Solvers: Lessons and insights into effective solvers for visco-plasticity in geodynamics
Spiegelman, M. W.; May, D.; Wilson, C. R.
2014-12-01
Plasticity/Fracture and rock failure are essential ingredients in geodynamic models as terrestrial rocks do not possess an infinite yield strength. Numerous physical mechanisms have been proposed to limit the strength of rocks, including low temperature plasticity and brittle fracture. While ductile and creep behavior of rocks at depth is largely accepted, the constitutive relations associated with brittle failure, or shear localisation, are more controversial. Nevertheless, there are really only a few macroscopic constitutive laws for visco-plasticity that are regularly used in geodynamics models. Independent of derivation, all of these can be cast as simple effective viscosities which act as stress limiters with different choices for yield surfaces; the most common being a von Mises (constant yield stress) or Drucker-Prager (pressure dependent yield-stress) criterion. The choice of plasticity model, however, can have significant consequences for the degree of non-linearity in a problem and the choice and efficiency of non-linear solvers. Here we describe a series of simplified 2 and 3-D model problems to elucidate several issues associated with obtaining accurate description and solution of visco-plastic problems. We demonstrate that1) Picard/Successive substitution schemes for solution of the non-linear problems can often stall at large values of the non-linear residual, thus producing spurious solutions2) Combined Picard/Newton schemes can be effective for a range of plasticity models, however, they can produce serious convergence problems for strongly pressure dependent plasticity models such as Drucker-Prager.3) Nevertheless, full Drucker-Prager may not be the plasticity model of choice for strong materials as the dynamic pressures produced in these layers can develop pathological behavior with Drucker-Prager, leading to stress strengthening rather than stress weakening behavior.4) In general, for any incompressible Stoke's problem, it is highly advisable to
Sideridis, Georgios D.; Tsaousis, Ioannis; Al-harbi, Khaleel A.
2015-01-01
The purpose of the present study was to extend the model of measurement invariance by simultaneously estimating invariance across multiple populations in the dichotomous instrument case using multi-group confirmatory factor analytic and multiple indicator multiple causes (MIMIC) methodologies. Using the Arabic version of the General Aptitude Test…
Parallel Nonnegative Least Squares Solvers for Model Order Reduction
2016-03-01
not for the PQN method. For the latter method the size of the active set is controlled to promote sparse solutions. This is described in Section 3.2.1...or any other aspect of this collection of information, including suggestions for reducing the burden, to Department of Defense, Washington...21005-5066 primary author’s email: <james.p.collins106.civ@mail.mil>. Parallel nonnegative least squares (NNLS) solvers are developed specifically for
Surviving Solver Sensitivity: An ASP Practitioners Guide
Silverthorn, Bryan; Lierler, Yuliya; Schneider, Marius
2012-01-01
Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processing problem specifications are called answer set solvers. Because specified problems are often NP complete, these systems often require significant computational effort to succeed. Furthermore, they offer different heuristics, expose numerous parameters, and their running time is sensitive to the config...
Direct linear programming solver in C for structural applications
Damkilde, L.; Hoyer, O.; Krenk, S.
1994-08-01
An optimization problem can be characterized by an object-function, which is maximized, and restrictions, which limit the variation of the variables. A subclass of optimization is Linear Programming (LP), where both the object-function and the restrictions are linear functions of the variables. The traditional solution methods for LP problems are based on the simplex method, and it is customary to allow only non-negative variables. Compared to other optimization routines the LP solvers are more robust and the optimum is reached in a finite number of steps and is not sensitive to the starting point. For structural applications many optimization problems can be linearized and solved by LP routines. However, the structural variables are not always non-negative, and this requires a reformation, where a variable x is substituted by the difference of two non-negative variables, x(sup + ) and x(sup - ). The transformation causes a doubling of the number of variables, and in a computer implementation the memory allocation doubles and for a typical problem the execution time at least doubles. This paper describes a LP solver written in C, which can handle a combination of non-negative variables and unlimited variables. The LP solver also allows restart, and this may reduce the computational costs if the solution to a similar LP problem is known a priori. The algorithm is based on the simplex method, and differs only in the logical choices. Application of the new LP solver will at the same time give both a more direct problem formulation and a more efficient program.
Resolving Neighbourhood Relations in a Parallel Fluid Dynamic Solver
Frisch, Jerome
2012-06-01
Computational Fluid Dynamics simulations require an enormous computational effort if a physically reasonable accuracy should be reached. Therefore, a parallel implementation is inevitable. This paper describes the basics of our implemented fluid solver with a special aspect on the hierarchical data structure, unique cell and grid identification, and the neighbourhood relations in-between grids on different processes. A special server concept keeps track of every grid over all processes while minimising data transfer between the nodes. © 2012 IEEE.
A chemical reaction network solver for the astrophysics code NIRVANA
Ziegler, U.
2016-02-01
Context. Chemistry often plays an important role in astrophysical gases. It regulates thermal properties by changing species abundances and via ionization processes. This way, time-dependent cooling mechanisms and other chemistry-related energy sources can have a profound influence on the dynamical evolution of an astrophysical system. Modeling those effects with the underlying chemical kinetics in realistic magneto-gasdynamical simulations provide the basis for a better link to observations. Aims: The present work describes the implementation of a chemical reaction network solver into the magneto-gasdynamical code NIRVANA. For this purpose a multispecies structure is installed, and a new module for evolving the rate equations of chemical kinetics is developed and coupled to the dynamical part of the code. A small chemical network for a hydrogen-helium plasma was constructed including associated thermal processes which is used in test problems. Methods: Evolving a chemical network within time-dependent simulations requires the additional solution of a set of coupled advection-reaction equations for species and gas temperature. Second-order Strang-splitting is used to separate the advection part from the reaction part. The ordinary differential equation (ODE) system representing the reaction part is solved with a fourth-order generalized Runge-Kutta method applicable for stiff systems inherent to astrochemistry. Results: A series of tests was performed in order to check the correctness of numerical and technical implementation. Tests include well-known stiff ODE problems from the mathematical literature in order to confirm accuracy properties of the solver used as well as problems combining gasdynamics and chemistry. Overall, very satisfactory results are achieved. Conclusions: The NIRVANA code is now ready to handle astrochemical processes in time-dependent simulations. An easy-to-use interface allows implementation of complex networks including thermal processes
A contribution to the great Riemann solver debate
Quirk, James J.
1992-01-01
The aims of this paper are threefold: to increase the level of awareness within the shock capturing community to the fact that many Godunov-type methods contain subtle flaws that can cause spurious solutions to be computed; to identify one mechanism that might thwart attempts to produce very high resolution simulations; and to proffer a simple strategy for overcoming the specific failings of individual Riemann solvers.
STABLE PROGRAMMED MANIFOLD SOLVER FOR VIRTUAL PROTOTYPING MOTION SIMULATION
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Based on constructing programmed constraint and constraint perturbation equation, a kinematics and dynamics numerical simulation model is established for virtual mechanism, in which the difference scheme guarantee precision in simulation procedure and its numerical solutions satisfy programmed manifold stability. A crank-piston mechanism in a car engine, a steering mechanism and a suspension mechanism are simulated in a virtual environment, then comparing the simulation results with those obtained in ADAMS under the same circumstances proved the solver valid.
A Survey of Solver-Related Geometry and Meshing Issues
Masters, James; Daniel, Derick; Gudenkauf, Jared; Hine, David; Sideroff, Chris
2016-01-01
There is a concern in the computational fluid dynamics community that mesh generation is a significant bottleneck in the CFD workflow. This is one of several papers that will help set the stage for a moderated panel discussion addressing this issue. Although certain general "rules of thumb" and a priori mesh metrics can be used to ensure that some base level of mesh quality is achieved, inadequate consideration is often given to the type of solver or particular flow regime on which the mesh will be utilized. This paper explores how an analyst may want to think differently about a mesh based on considerations such as if a flow is compressible vs. incompressible or hypersonic vs. subsonic or if the solver is node-centered vs. cell-centered. This paper is a high-level investigation intended to provide general insight into how considering the nature of the solver or flow when performing mesh generation has the potential to increase the accuracy and/or robustness of the solution and drive the mesh generation process to a state where it is no longer a hindrance to the analysis process.
Direct solvers performance on h-adapted grids
Paszynski, Maciej
2015-05-27
We analyse the performance of direct solvers when applied to a system of linear equations arising from an hh-adapted, C0C0 finite element space. Theoretical estimates are derived for typical hh-refinement patterns arising as a result of a point, edge, or face singularity as well as boundary layers. They are based on the elimination trees constructed specifically for the considered grids. Theoretical estimates are compared with experiments performed with MUMPS using the nested-dissection algorithm for construction of the elimination tree from METIS library. The numerical experiments provide the same performance for the cases where our trees are identical with those constructed by the nested-dissection algorithm, and worse performance for some cases where our trees are different. We also present numerical experiments for the cases with mixed singularities, where how to construct optimal elimination trees is unknown. In all analysed cases, the use of hh-adaptive grids significantly reduces the cost of the direct solver algorithm per unknown as compared to uniform grids. The theoretical estimates predict and the experimental data confirm that the computational complexity is linear for various refinement patterns. In most cases, the cost of the direct solver per unknown is lower when employing anisotropic refinements as opposed to isotropic ones.
IGA-ADS: Isogeometric analysis FEM using ADS solver
Łoś, Marcin M.; Woźniak, Maciej; Paszyński, Maciej; Lenharth, Andrew; Hassaan, Muhamm Amber; Pingali, Keshav
2017-08-01
In this paper we present a fast explicit solver for solution of non-stationary problems using L2 projections with isogeometric finite element method. The solver has been implemented within GALOIS framework. It enables parallel multi-core simulations of different time-dependent problems, in 1D, 2D, or 3D. We have prepared the solver framework in a way that enables direct implementation of the selected PDE and corresponding boundary conditions. In this paper we describe the installation, implementation of exemplary three PDEs, and execution of the simulations on multi-core Linux cluster nodes. We consider three case studies, including heat transfer, linear elasticity, as well as non-linear flow in heterogeneous media. The presented package generates output suitable for interfacing with Gnuplot and ParaView visualization software. The exemplary simulations show near perfect scalability on Gilbert shared-memory node with four Intel® Xeon® CPU E7-4860 processors, each possessing 10 physical cores (for a total of 40 cores).
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Energy Technology Data Exchange (ETDEWEB)
Christensen, Max La Cour [Technical Univ. of Denmark, Lyngby (Denmark); Villa, Umberto E. [Univ. of Texas, Austin, TX (United States); Engsig-Karup, Allan P. [Technical Univ. of Denmark, Lyngby (Denmark); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-22
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.
QED multi-dimensional vacuum polarization finite-difference solver
Carneiro, Pedro; Grismayer, Thomas; Silva, Luís; Fonseca, Ricardo
2015-11-01
The Extreme Light Infrastructure (ELI) is expected to deliver peak intensities of 1023 - 1024 W/cm2 allowing to probe nonlinear Quantum Electrodynamics (QED) phenomena in an unprecedented regime. Within the framework of QED, the second order process of photon-photon scattering leads to a set of extended Maxwell's equations [W. Heisenberg and H. Euler, Z. Physik 98, 714] effectively creating nonlinear polarization and magnetization terms that account for the nonlinear response of the vacuum. To model this in a self-consistent way, we present a multi dimensional generalized Maxwell equation finite difference solver with significantly enhanced dispersive properties, which was implemented in the OSIRIS particle-in-cell code [R.A. Fonseca et al. LNCS 2331, pp. 342-351, 2002]. We present a detailed numerical analysis of this electromagnetic solver. As an illustration of the properties of the solver, we explore several examples in extreme conditions. We confirm the theoretical prediction of vacuum birefringence of a pulse propagating in the presence of an intense static background field [arXiv:1301.4918 [quant-ph
NITSOL: A Newton iterative solver for nonlinear systems
Energy Technology Data Exchange (ETDEWEB)
Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States); Walker, H.F. [Utah State Univ., Logan, UT (United States)
1996-12-31
Newton iterative methods, also known as truncated Newton methods, are implementations of Newton`s method in which the linear systems that characterize Newton steps are solved approximately using iterative linear algebra methods. Here, we outline a well-developed Newton iterative algorithm together with a Fortran implementation called NITSOL. The basic algorithm is an inexact Newton method globalized by backtracking, in which each initial trial step is determined by applying an iterative linear solver until an inexact Newton criterion is satisfied. In the implementation, the user can specify inexact Newton criteria in several ways and select an iterative linear solver from among several popular {open_quotes}transpose-free{close_quotes} Krylov subspace methods. Jacobian-vector products used by the Krylov solver can be either evaluated analytically with a user-supplied routine or approximated using finite differences of function values. A flexible interface permits a wide variety of preconditioning strategies and allows the user to define a preconditioner and optionally update it periodically. We give details of these and other features and demonstrate the performance of the implementation on a representative set of test problems.
Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics
Pavarino, L.F.
2015-07-18
The aim of this work is to design and study a Balancing Domain Decomposition by Constraints (BDDC) solver for the nonlinear elasticity system modeling the mechanical deformation of cardiac tissue. The contraction–relaxation process in the myocardium is induced by the generation and spread of the bioelectrical excitation throughout the tissue and it is mathematically described by the coupling of cardiac electro-mechanical models consisting of systems of partial and ordinary differential equations. In this study, the discretization of the electro-mechanical models is performed by Q1 finite elements in space and semi-implicit finite difference schemes in time, leading to the solution of a large-scale linear system for the bioelectrical potentials and a nonlinear system for the mechanical deformation at each time step of the simulation. The parallel mechanical solver proposed in this paper consists in solving the nonlinear system with a Newton-Krylov-BDDC method, based on the parallel solution of local mechanical problems and a coarse problem for the so-called primal unknowns. Three-dimensional parallel numerical tests on different machines show that the proposed parallel solver is scalable in the number of subdomains, quasi-optimal in the ratio of subdomain to mesh sizes, and robust with respect to tissue anisotropy.
Modeling of photon migration in the human lung using a finite volume solver
Sikorski, Zbigniew; Furmanczyk, Michal; Przekwas, Andrzej J.
2006-02-01
The application of the frequency domain and steady-state diffusive optical spectroscopy (DOS) and steady-state near infrared spectroscopy (NIRS) to diagnosis of the human lung injury challenges many elements of these techniques. These include the DOS/NIRS instrument performance and accurate models of light transport in heterogeneous thorax tissue. The thorax tissue not only consists of different media (e.g. chest wall with ribs, lungs) but its optical properties also vary with time due to respiration and changes in thorax geometry with contusion (e.g. pneumothorax or hemothorax). This paper presents a finite volume solver developed to model photon migration in the diffusion approximation in heterogeneous complex 3D tissues. The code applies boundary conditions that account for Fresnel reflections. We propose an effective diffusion coefficient for the void volumes (pneumothorax) based on the assumption of the Lambertian diffusion of photons entering the pleural cavity and accounting for the local pleural cavity thickness. The code has been validated using the MCML Monte Carlo code as a benchmark. The code environment enables a semi-automatic preparation of 3D computational geometry from medical images and its rapid automatic meshing. We present the application of the code to analysis/optimization of the hybrid DOS/NIRS/ultrasound technique in which ultrasound provides data on the localization of thorax tissue boundaries. The code effectiveness (3D complex case computation takes 1 second) enables its use to quantitatively relate detected light signal to absorption and reduced scattering coefficients that are indicators of the pulmonary physiologic state (hemoglobin concentration and oxygenation).
On the relationship between ODE solvers and iterative solvers for linear equations
Energy Technology Data Exchange (ETDEWEB)
Lorber, A.; Joubert, W.; Carey, G.F. [Univ. of Texas, Austin, TX (United States)
1994-12-31
The connection between the solution of linear systems of equations by both iterative methods and explicit time stepping techniques is investigated. Based on the similarities, a suite of Runge-Kutta time integration schemes with extended stability domains are developed using Chebyshev iteration polynomials. These Runge-Kutta schemes are applied to linear and non-linear systems arising from the numerical solution of PDE`s containing either physical or artificial transient terms. Specifically, the solutions of model linear convection and convection-diffusion equations are presented, as well as the solution of a representative non-linear Navier-Stokes fluid flow problem. Included are results of parallel computations.
Díez, C. J.; Cabellos, O.; Martínez, J. S.
2015-01-01
Several approaches have been developed in last decades to tackle nuclear data uncertainty propagation problems of burn-up calculations. One approach proposed was the Hybrid Method, where uncertainties in nuclear data are propagated only on the depletion part of a burn-up problem. Because only depletion is addressed, only one-group cross sections are necessary, and hence, their collapsed one-group uncertainties. This approach has been applied successfully in several advanced reactor systems like EFIT (ADS-like reactor) or ESFR (Sodium fast reactor) to assess uncertainties on the isotopic composition. However, a comparison with using multi-group energy structures was not carried out, and has to be performed in order to analyse the limitations of using one-group uncertainties.
Tominaga, Nozomu; Blinnikov, Sergei I
2015-01-01
We develop a time-dependent multi-group multidimensional relativistic radiative transfer code, which is required to numerically investigate radiation from relativistic fluids involved in, e.g., gamma-ray bursts and active galactic nuclei. The code is based on the spherical harmonic discrete ordinate method (SHDOM) that evaluates a source function including anisotropic scattering in spherical harmonics and implicitly solves the static radiative transfer equation with a ray tracing in discrete ordinates. We implement treatments of time dependence, multi-frequency bins, Lorentz transformation, and elastic Thomson and inelastic Compton scattering to the publicly available SHDOM code. Our code adopts a mixed frame approach; the source function is evaluated in the comoving frame whereas the radiative transfer equation is solved in the laboratory frame. This implementation is validated with various test problems and comparisons with results of a relativistic Monte Carlo code. These validations confirm that the code ...
Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities
Paszyńska, Anna
2015-06-01
This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver.
An improved and fully implicit multi-group non-local electron transport model and its validations
Sijoy, C. D.; Mishra, V.; Chaurasia, S.
2017-09-01
The combined effect of thermal flux inhibition and non-local electron heat flux in the radiation hydrodynamics (RHD) simulation of laser-driven systems can be accurately predicted by using non-local electron transport (NLET) models. These models can avoid commonly used space and time-independent ad-hoc flux-limiting procedures. However, the use of classical electron collision frequency in these models is rigorously valid for high temperature non-degenerate plasmas. In laser-driven systems, the electron thermal energy transport is important in regions between the critical density and ablation surface where the plasma is partially degenerate. Therefore, an improved model for electron collision frequency in this regime is required to accurately predict the thermal energy transport. Previously, we have reported an improved single group non-local electron transport model by using a wide-range electron collision frequency model valid from warm-dense matter (WDM) to fully ionized plasmas. In this work, we have extended this idea into a two-dimensional multi-group non-local electron transport (MG-NLET) model. Moreover, we have used a fully implicit numerical integration scheme in which the models for multi-group thermal radiation transport, laser absorption, electron-ion thermal energy relaxation and ion heat conduction are included in a single step. The performance of this improved MG-NLET model has been assessed by comparing the simulated foil trajectories with the reported experimental data for laser-driven plastic foils. The results indicate that the improved model yields results that are in better agreement with the experimental data.
Using Solver Interfaced Virtual Reality in PEACER Design Process
Energy Technology Data Exchange (ETDEWEB)
Lee, Hyong Won; Nam, Won Chang; Jeong, Seung Ho; Hwang, Il Soon; Shin, Jong Gye; Kim, Chang Hyo [Seoul National University, Seoul (Korea, Republic of)
2006-07-01
The recent research progress in the area of plant design and simulation highlighted the importance of integrating design and analysis models on a unified environment. For currently developed advanced reactors, either for power production or research, this effort has embraced impressive state-of-the-art information and automation technology. The PEACER (Proliferation-resistant, Environment friendly, Accident-tolerant, Continual and Economical Reactor) is one of the conceptual fast reactor system cooled by LBE (Lead Bismuth Eutectic) for nuclear waste transmutation. This reactor system is composed of innovative combination between design process and analysis. To establish an integrated design process by coupling design, analysis, and post-processing technology while minimizing the repetitive and costly manual interactions for design changes, a solver interfaced virtual reality simulation system (SIVR) has been developed for a nuclear transmutation energy system as PEACER. The SIVR was developed using Virtual Reality Modeling Language (VRML) in order to interface a commercial 3D CAD tool with various engineering solvers and to implement virtual reality presentation of results in a neutral format. In this paper, we have shown the SIVR approach viable and effective in the life-cycle management of complex nuclear energy systems, including design, construction and operation. For instance, The HELIOS is a down scaled model of the PEACER prototype to demonstrate the operability and safety as well as preliminary test of PEACER PLM (Product Life-cycle Management) with SIVR (Solver Interfaced Virtual Reality) concepts. Most components are designed by CATIA, which is 3D CAD tool. During the construction, 3D drawing by CATIA was effective to handle and arrange the loop configuration, especially when we changed the design. Most of all, This system shows the transparency of design and operational status of an energy complex to operators and inspectors can help ensure accident
Reformulation of the Fourier-Bessel steady state mode solver
Gauthier, Robert C.
2016-09-01
The Fourier-Bessel resonator state mode solver is reformulated using Maxwell's field coupled curl equations. The matrix generating expressions are greatly simplified as well as a reduction in the number of pre-computed tables making the technique simpler to implement on a desktop computer. The reformulation maintains the theoretical equivalence of the permittivity and permeability and as such structures containing both electric and magnetic properties can be examined. Computation examples are presented for a surface nanoscale axial photonic resonator and hybrid { ε , μ } quasi-crystal resonator.
High Energy Boundary Conditions for a Cartesian Mesh Euler Solver
Pandya, Shishir A.; Murman, Scott M.; Aftosmis, Michael J.
2004-01-01
Inlets and exhaust nozzles are often omitted or fared over in aerodynamic simulations of aircraft due to the complexities involving in the modeling of engine details such as complex geometry and flow physics. However, the assumption is often improper as inlet or plume flows have a substantial effect on vehicle aerodynamics. A tool for specifying inlet and exhaust plume conditions through the use of high-energy boundary conditions in an established inviscid flow solver is presented. The effects of the plume on the flow fields near the inlet and plume are discussed.
A Parallel Algebraic Multigrid Solver on Graphics Processing Units
Haase, Gundolf
2010-01-01
The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.
A Simple Quantum Integro-Differential Solver (SQuIDS)
Delgado, Carlos Alberto Arguelles; Weaver, Christopher N
2014-01-01
Simple Quantum Integro-Differential Solver (SQuIDS) is a C++ code designed to solve semi-analytically the evolution of a set of density matrices and scalar functions. This is done efficiently by expressing all operators in an SU(N) basis. SQuIDS provides a base class from which users can derive new classes to include new non-trivial terms from the right hand sides of density matrix equations. The code was designed in the context of solving neutrino oscillation problems, but can be applied to any problem that involves solving the quantum evolution of a collection of particles with Hilbert space of dimension up to six.
Fast Multipole-Based Elliptic PDE Solver and Preconditioner
Ibeid, Huda
2016-12-07
Exascale systems are predicted to have approximately one billion cores, assuming Gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the currently dominant parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale designs. It is therefore of interest to model application performance and to understand what changes need to be made to ensure extrapolated scalability. Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods in astrophysics and molecular dynamics. FMM is more than an N-body solver, however. Recent efforts to view the FMM as an elliptic PDE solver have opened the possibility to use it as a preconditioner for even a broader range of applications. In this thesis, we (i) discuss the challenges for FMM on current parallel computers and future exascale architectures, with a focus on inter-node communication, and develop a performance model that considers the communication patterns of the FMM for spatially quasi-uniform distributions, (ii) employ this performance model to guide performance and scaling improvement of FMM for all-atom molecular dynamics simulations of uniformly distributed particles, and (iii) demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, FMM is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity
Turbulent Flow Validation in the Helios Strand Solver
2014-01-07
aerodynamics solution procedure consists of unstructured meshes in the near-body to capture viscous flow around complex geometry , and block structured...on the approximate Riemann solver of Roe,20 F̂ = 1 2 (F (QR)+F (QL))− 1 2 |A(QR,QL)|(QR−QL) , (45) where F = Fjn j is the directed flux at a face with...uniform cartesian mesh that is 16×16×24. The off-body mesh is then adapted to the geometry and flow physics with up to nine levels of isotropic mesh
Preconditioned CG-solvers and finite element grids
Energy Technology Data Exchange (ETDEWEB)
Bauer, R.; Selberherr, S. [Technical Univ. of Vienna (Austria)
1994-12-31
To extract parasitic capacitances in wiring structures of integrated circuits the authors developed the two- and three-dimensional finite element program SCAP (Smart Capacitance Analysis Program). The program computes the task of the electrostatic field from a solution of Poisson`s equation via finite elements and calculates the energies from which the capacitance matrix is extracted. The unknown potential vector, which has for three-dimensional applications 5000-50000 unknowns, is computed by a ICCG solver. Currently three- and six-node triangular, four- and ten-node tetrahedronal elements are supported.
Advances in the hydrodynamics solver of CO5BOLD
Freytag, Bernd
Many features of the Roe solver used in the hydrodynamics module of CO5BOLD have recently been added or overhauled, including the reconstruction methods (by adding the new second-order ``Frankenstein's method''), the treatment of transversal velocities, energy-flux averaging and entropy-wave treatment at small Mach numbers, the CTU scheme to combine the one-dimensional fluxes, and additional safety measures. All this results in a significantly better behavior at low Mach number flows, and an improved stability at larger Mach numbers requiring less (or no) additional tensor viscosity, which then leads to a noticeable increase in effective resolution.
Conjugate gradient solvers on Intel Xeon Phi and NVIDIA GPUs
Kaczmarek, O; Steinbrecher, P; Wagner, M
2014-01-01
Lattice Quantum Chromodynamics simulations typically spend most of the runtime in inversions of the Fermion Matrix. This part is therefore frequently optimized for various HPC architectures. Here we compare the performance of the Intel Xeon Phi to current Kepler-based NVIDIA Tesla GPUs running a conjugate gradient solver. By exposing more parallelism to the accelerator through inverting multiple vectors at the same time, we obtain a performance greater than 300 GFlop/s on both architectures. This more than doubles the performance of the inversions. We also give a short overview of the Knights Corner architecture, discuss some details of the implementation and the effort required to obtain the achieved performance.
Modelo de selección de cartera con Solver
Directory of Open Access Journals (Sweden)
P. Fogués Zornoza
2012-04-01
Full Text Available In this paper, we present an example of linear optimization in the context of degrees in Economics or Business Administration and Management. We show techniques that enable students to go deep and investigate in real problems that have been modelled using the Excel platform. The model shown here has been developed by a student and it consists in minimizing the absolute deviations over the average expected return of a portfolio of securities, using the solver tool that it is included in this software.
Chavez, Gustavo Ivan
2017-07-10
This dissertation introduces a novel fast direct solver and preconditioner for the solution of block tridiagonal linear systems that arise from the discretization of elliptic partial differential equations on a Cartesian product mesh, such as the variable-coefficient Poisson equation, the convection-diffusion equation, and the wave Helmholtz equation in heterogeneous media. The algorithm extends the traditional cyclic reduction method with hierarchical matrix techniques. The resulting method exposes substantial concurrency, and its arithmetic operations and memory consumption grow only log-linearly with problem size, assuming bounded rank of off-diagonal matrix blocks, even for problems with arbitrary coefficient structure. The method can be used as a standalone direct solver with tunable accuracy, or as a black-box preconditioner in conjunction with Krylov methods. The challenges that distinguish this work from other thrusts in this active field are the hybrid distributed-shared parallelism that can demonstrate the algorithm at large-scale, full three-dimensionality, and the three stressors of the current state-of-the-art multigrid technology: high wavenumber Helmholtz (indefiniteness), high Reynolds convection (nonsymmetry), and high contrast diffusion (inhomogeneity). Numerical experiments corroborate the robustness, accuracy, and complexity claims and provide a baseline of the performance and memory footprint by comparisons with competing approaches such as the multigrid solver hypre, and the STRUMPACK implementation of the multifrontal factorization with hierarchically semi-separable matrices. The companion implementation can utilize many thousands of cores of Shaheen, KAUST\\'s Haswell-based Cray XC-40 supercomputer, and compares favorably with other implementations of hierarchical solvers in terms of time-to-solution and memory consumption.
On the implicit density based OpenFOAM solver for turbulent compressible flows
Fürst, Jiří
The contribution deals with the development of coupled implicit density based solver for compressible flows in the framework of open source package OpenFOAM. However the standard distribution of OpenFOAM contains several ready-made segregated solvers for compressible flows, the performance of those solvers is rather week in the case of transonic flows. Therefore we extend the work of Shen [15] and we develop an implicit semi-coupled solver. The main flow field variables are updated using lower-upper symmetric Gauss-Seidel method (LU-SGS) whereas the turbulence model variables are updated using implicit Euler method.
On the implicit density based OpenFOAM solver for turbulent compressible flows
Directory of Open Access Journals (Sweden)
Fürst Jiří
2017-01-01
Full Text Available The contribution deals with the development of coupled implicit density based solver for compressible flows in the framework of open source package OpenFOAM. However the standard distribution of OpenFOAM contains several ready-made segregated solvers for compressible flows, the performance of those solvers is rather week in the case of transonic flows. Therefore we extend the work of Shen [15] and we develop an implicit semi-coupled solver. The main flow field variables are updated using lower-upper symmetric Gauss-Seidel method (LU-SGS whereas the turbulence model variables are updated using implicit Euler method.
On the implicit density based OpenFOAM solver for turbulent compressible flows
Fürst, Jiří
2016-11-01
The contribution deals with the development of coupled implicit density based solver for compressible flows in the framework of open source package OpenFOAM. However the standard distribution of OpenFOAM contains several ready-made segregated solvers for compressible flows, the performance of those solvers is rather week in the case of transonic flows. Therefore we extend the work of Shen [15] and we develop an implicit semi-coupled solver. The main flow field variables are updated using lower-upper symmetric Gauss-Seidel method (LU-SGS) whereas the turbulence model variables are updated using implicit Euler method.
Energy Technology Data Exchange (ETDEWEB)
Wilson, W.B.; England, T.R.; LaBauve, R.J.
1978-02-01
The ENDF/B-IV fission-product data file includes data describing 824 nuclides. Cross sections, given for 181 of these nuclides, were processed into 154 neutron energy groups. The production of the data file is described. The TOAFEW code, useful in collapsing the multigroup values to few-group cross sections, is presented with instructions and examples of its use. The file of multigroup cross sections is available on request. 3 figures, 11 tables.
Application of alternating decision trees in selecting sparse linear solvers
Bhowmick, Sanjukta
2010-01-01
The solution of sparse linear systems, a fundamental and resource-intensive task in scientific computing, can be approached through multiple algorithms. Using an algorithm well adapted to characteristics of the task can significantly enhance the performance, such as reducing the time required for the operation, without compromising the quality of the result. However, the best solution method can vary even across linear systems generated in course of the same PDE-based simulation, thereby making solver selection a very challenging problem. In this paper, we use a machine learning technique, Alternating Decision Trees (ADT), to select efficient solvers based on the properties of sparse linear systems and runtime-dependent features, such as the stages of simulation. We demonstrate the effectiveness of this method through empirical results over linear systems drawn from computational fluid dynamics and magnetohydrodynamics applications. The results also demonstrate that using ADT can resolve the problem of over-fitting, which occurs when limited amount of data is available. © 2010 Springer Science+Business Media LLC.
Riemann solvers and Alfven waves in black hole magnetospheres
Punsly, Brian; Balsara, Dinshaw; Kim, Jinho; Garain, Sudip
2016-09-01
In the magnetosphere of a rotating black hole, an inner Alfven critical surface (IACS) must be crossed by inflowing plasma. Inside the IACS, Alfven waves are inward directed toward the black hole. The majority of the proper volume of the active region of spacetime (the ergosphere) is inside of the IACS. The charge and the totally transverse momentum flux (the momentum flux transverse to both the wave normal and the unperturbed magnetic field) are both determined exclusively by the Alfven polarization. Thus, it is important for numerical simulations of black hole magnetospheres to minimize the dissipation of Alfven waves. Elements of the dissipated wave emerge in adjacent cells regardless of the IACS, there is no mechanism to prevent Alfvenic information from crossing outward. Thus, numerical dissipation can affect how simulated magnetospheres attain the substantial Goldreich-Julian charge density associated with the rotating magnetic field. In order to help minimize dissipation of Alfven waves in relativistic numerical simulations we have formulated a one-dimensional Riemann solver, called HLLI, which incorporates the Alfven discontinuity and the contact discontinuity. We have also formulated a multidimensional Riemann solver, called MuSIC, that enables low dissipation propagation of Alfven waves in multiple dimensions. The importance of higher order schemes in lowering the numerical dissipation of Alfven waves is also catalogued.
Domain decomposition solvers for nonlinear multiharmonic finite element equations
Copeland, D. M.
2010-01-01
In many practical applications, for instance, in computational electromagnetics, the excitation is time-harmonic. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple elliptic equation for the amplitude. This is true for linear problems, but not for nonlinear problems. However, due to the periodicity of the solution, we can expand the solution in a Fourier series. Truncating this Fourier series and approximating the Fourier coefficients by finite elements, we arrive at a large-scale coupled nonlinear system for determining the finite element approximation to the Fourier coefficients. The construction of fast solvers for such systems is very crucial for the efficiency of this multiharmonic approach. In this paper we look at nonlinear, time-harmonic potential problems as simple model problems. We construct and analyze almost optimal solvers for the Jacobi systems arising from the Newton linearization of the large-scale coupled nonlinear system that one has to solve instead of performing the expensive time-integration procedure. © 2010 de Gruyter.
Wu, Jun; Chen, Yi-Xue; Wang, Wei-Jin; Yin, Wen; Liang, Tian-Jiao; Jia, Xue-Jun
2012-03-01
ENDF/B-VII.0, which was released by the USA Cross Section Evaluation Working Group (CSEWG) in December 2006, was demonstrated to perform much better than previous ENDF evaluations over a broad range of benchmark experiments. A high-energy (up to 150 MeV) multi-group library set named HEST1.0 with 253-neutron and 48-photon groups has been developed based on ENDF/B-VII.0 using the NJOY code. This paper provides a summary of the procedure to produce the library set and a detailed description of the verification of the multi-group library set by several shielding benchmark devices, in particular for high-energy neutron data. In addition, the first application of HEST1.0 to the shielding design of the China Spallation Neutron Source (CSNS) is demonstrated.
Institute of Scientific and Technical Information of China (English)
WU Jun; CHEN Yi-Xue; WANG Wei-Jin; YIN Wen; LIANG Tian-Jiao; JIA Xue-Jun
2012-01-01
ENDF/B-Ⅶ.0,which was released by the USA Cross Section Evaluation Working Group (CSEWG)in December 2006,was demonstrated to perform much better than previous ENDF evaluations over a broad range of benchmark experiments.A high-energy (up to 150 MeV) multi-group library set named HEST1.0with 253-neutron and 48-photon groups has been developed based on ENDF/B-Ⅶ.0 using the N JOY code.This paper provides a summary of the procedure to produce the library set and a detailed description of the verification of the multi-group library set by several shielding benchmark devices,in particular for high-energy neutron data.In addition,the first application of HEST1.0 to the shielding design of the China Spallation Neutron Source (CSNS) is demonstrated.
Fukuyama, Hidenao
Recent advances of magnetic resonance imaging have been described, especially stressed on the diffusion sequences. We have recently applied the diffusion sequence to functional brain imaging, and found the appropriate results. In addition to the neurosciences fields, diffusion weighted images have improved the accuracies of clinical diagnosis depending upon magnetic resonance images in stroke as well as inflammations.
Energy Technology Data Exchange (ETDEWEB)
Yang, W. S.; Lee, C. H. (Nuclear Engineering Division)
2008-05-16
Under the fast reactor simulation program launched in April 2007, development of an advanced multigroup cross section generation code was initiated in July 2007, in conjunction with the development of the high-fidelity deterministic neutron transport code UNIC. The general objectives are to simplify the existing multi-step schemes and to improve the resolved and unresolved resonance treatments. Based on the review results of current methods and the fact that they have been applied successfully to fast critical experiment analyses and fast reactor designs for last three decades, the methodologies of the ETOE-2/MC{sup 2}-2/SDX code system were selected as the starting set of methodologies for multigroup cross section generation for fast reactor analysis. As the first step for coupling with the UNIC code and use in a parallel computing environment, the MC{sup 2}-2 code was updated by modernizing the memory structure and replacing old data management package subroutines and functions with FORTRAN 90 based routines. Various modifications were also made in the ETOE-2 and MC{sup 2}-2 codes to process the ENDF/B-VII.0 data properly. Using the updated ETOE-2/MC{sup 2}-2 code system, the ENDF/B-VII.0 data was successfully processed for major heavy and intermediate nuclides employed in sodium-cooled fast reactors. Initial verification tests of the MC{sup 2}-2 libraries generated from ENDF/B-VII.0 data were performed by inter-comparison of twenty-one group infinite dilute total cross sections obtained from MC{sup 2}-2, VIM, and NJOY. For almost all nuclides considered, MC{sup 2}-2 cross sections agreed very well with those from VIM and NJOY. Preliminary validation tests of the ENDF/B-VII.0 libraries of MC{sup 2}-2 were also performed using a set of sixteen fast critical benchmark problems. The deterministic results based on MC{sup 2}-2/TWODANT calculations were in good agreement with MCNP solutions within {approx}0.25% {Delta}{rho}, except a few small LANL fast assemblies
Theoretical study of some nodal methods for the solution of the diffusion equation. Numerical tests
Energy Technology Data Exchange (ETDEWEB)
Fedon-Magnaud, C.
1983-08-01
The nodal methods used in the solution of the neutron multigroup diffusion equation are described. A new formulation of this methods is obtained in order to have a comparison with the finite element methods. After a brief review of nonconforming finite element theory, we use a Radau formula to establish the equivalence with nodal schemes. Convergence theorems and error estimations are then obtained. In the last part, numerical calculations are performed for two reactor test configurations. Comparisons are done between nodal or nonconforming schemes and more classical methods (F.D., conforming F.E.) wich are used in reactor analysis.
Numerical method for solving the three-dimensional time-dependent neutron diffusion equation
Energy Technology Data Exchange (ETDEWEB)
Khaled, S.M. [Institute of Nuclear Techniques, Budapest University of Technology and Economics, Budapest (Hungary)]. E-mail: K_S_MAHMOUD@hotmail.com; Szatmary, Z. [Institute of Nuclear Techniques, Budapest University of Technology and Economics, Budapest (Hungary)]. E-mail: szatmary@reak.bme.hu
2005-07-01
A numerical time-implicit method has been developed for solving the coupled three-dimensional time-dependent multi-group neutron diffusion and delayed neutron precursor equations. The numerical stability of the implicit computation scheme and the convergence of the iterative associated processes have been evaluated. The computational scheme requires the solution of large linear systems at each time step. For this purpose, the point over-relaxation Gauss-Seidel method was chosen. A new scheme was introduced instead of the usual source iteration scheme. (author)
Parallel Sparse Linear System and Eigenvalue Problem Solvers: From Multicore to Petascale Computing
2015-06-01
problems that achieve high performance on a single multicore node and clusters of many multicore nodes. Further, we demonstrate both the superior ...the superior robustness and parallel scalability of our solvers compared to other publicly available parallel solvers for these two fundamental...LU‐ and algebraic multigrid‐preconditioned Krylov subspace methods. This has been demonstrated in previous annual reports of this
Ivanov, I.D.; de Klerk, E.
2007-01-01
In this paper we present the algorithmic framework and practical aspects of implementing a parallel version of a primal-dual semidefinite programming solver on a distributed memory computer cluster. Our implementation is based on the CSDP solver and uses a message passing interface (MPI), and the Sc
Motivation, Challenge, and Opportunity of Successful Solvers on an Innovation Platform
DEFF Research Database (Denmark)
Hossain, Mokter
2017-01-01
The objective of this study is to identify motivations, challenges, and opportunities of successful solvers participating in virtual teams of innovation contests (ICs) organized by an innovation intermediary. Based on 82 interviews of successful solvers, this study provides novel insights into ICs...
Ivanov, I.D.; de Klerk, E.
2007-01-01
In this paper we present the algorithmic framework and practical aspects of implementing a parallel version of a primal-dual semidefinite programming solver on a distributed memory computer cluster. Our implementation is based on the CSDP solver and uses a message passing interface (MPI), and the Sc
A Comparative Study on Different Parallel Solvers for Nonlinear Analysis of Complex Structures
Directory of Open Access Journals (Sweden)
Lei Zhang
2013-01-01
Full Text Available The parallelization of 2D/3D software SAPTIS is discussed for nonlinear analysis of complex structures. A comparative study is made on different parallel solvers. The numerical models are presented, including hydration models, water cooling models, modulus models, creep model, and autogenous deformation models. A finite element simulation is made for the whole process of excavation and pouring of dams using these models. The numerical results show a good agreement with the measured ones. To achieve a better computing efficiency, four parallel solvers utilizing parallelization techniques are employed: (1 a parallel preconditioned conjugate gradient (PCG solver based on OpenMP, (2 a parallel preconditioned Krylov subspace solver based on MPI, (3 a parallel sparse equation solver based on OpenMP, and (4 a parallel GPU equation solver. The parallel solvers run either in a shared memory environment OpenMP or in a distributed memory environment MPI. A comparative study on these parallel solvers is made, and the results show that the parallelization makes SAPTIS more efficient, powerful, and adaptable.
An implementation of a parallel MOL solver on the Intel gamma parallel computer
Energy Technology Data Exchange (ETDEWEB)
Lawkins, W.F.; Payne, J.S.
1992-06-17
A implicit parallel method-of-lines solver that has been implemented on the MIMD Intel Gamma prototype supercomputer is discussed. The strategy for implementation is to execute the ODE solver sequentially and to do the numerical linear algebra in parallel. Performance studies for this implementation are presented.
Institute of Scientific and Technical Information of China (English)
李满仓; 王侃; 姚栋
2012-01-01
两步法反应堆物理计算流程中,组件均匀化群常数显著影响堆芯计算精度.相比确定论方法,连续能量蒙特卡罗方法均匀化精确描述各种几何构型栅格,避免繁琐共振自屏计算,保留更多连续能量信息,不仅产生的群常数更精确,而且普适性也更强.作为实现连续能量蒙特卡罗组件均匀化的第一步,本文应用径迹长度方法统计计算一般群截面和群常数,提出并使用散射事件方法获得不能直接应用确定论方法计算群间散射截面和高阶勒让德系数,应用P1截面计算扩散系数.为还原两步法计算流程中组件在堆芯的临界状态,本文应用BN理论对均匀化群常数进行泄漏修正.在4种类型组件和简化压水堆堆芯上数值验证蒙特卡罗均匀化群常数.验证结果表明:连续能量蒙特卡罗方法组件均匀化群常数具有良好几何适应性,显著提高堆芯计算精度.%The efficiency of the standard two-step reactor physics calculation relies on the accuracy of multi-group constants from the assembly-level homogenization process. In contrast to the traditional deterministic methods, generating the homogenization cross sections via Monte Carlo method overcomes the difficulties in geometry and treats energy in continuum, thus provides more accuracy parameters. Besides, the same code and data bank can be used for a wide range of applications, resulting in the versatility using Monte Carlo codes for homogenization. As the first stage to realize Monte Carlo based lattice homogenization, the track length scheme is used as the foundation of cross section generation, which is straight forward. The scattering matrix and Legendre components, however, require special techniques. The Scattering Event method was proposed to solve the problem. There are no continuous energy counterparts in the Monte Carlo calculation for neutron diffusion coefficients. P1 cross sections were used to calculate the diffusion
A Newton-Krylov solver for fast spin-up of online ocean tracers
Lindsay, Keith
2017-01-01
We present a Newton-Krylov based solver to efficiently spin up tracers in an online ocean model. We demonstrate that the solver converges, that tracer simulations initialized with the solution from the solver have small drift, and that the solver takes orders of magnitude less computational time than the brute force spin-up approach. To demonstrate the application of the solver, we use it to efficiently spin up the tracer ideal age with respect to the circulation from different time intervals in a long physics run. We then evaluate how the spun-up ideal age tracer depends on the duration of the physics run, i.e., on how equilibrated the circulation is.
General second order complete active space self-consistent-field solver for large-scale systems
Sun, Qiming
2016-01-01
One challenge of the complete active space self-consistent field (CASSCF) program is to solve the transition metal complexes which are typically medium or large-size molecular systems with large active space. We present an AO-driven second order CASSCF solver to efficiently handle systems which have a large number of AO functions and many active orbitals. This solver allows user to replace the active space Full CI solver with any multiconfigurational solver without breaking the quadratic convergence feature. We demonstrate the capability of the CASSCF solver with the study of Fe(ii)-porphine ground state using DMRG-CASSCF method for 22 electrons in 27 active orbitals and 3000 basis functions.
Stochastic 2D Incompressible Navier-Stokes Solver Using the Vorticity-Stream Function Formulation
Directory of Open Access Journals (Sweden)
Mohamed A. El-Beltagy
2013-01-01
Full Text Available A two-dimensional stochastic solver for the incompressible Navier-Stokes equations is developed. The vorticity-stream function formulation is considered. The polynomial chaos expansion was integrated with an unstructured node-centered finite-volume solver. A second-order upwind scheme is used in the convection term for numerical stability and higher-order discretization. The resulting sparse linear system is solved efficiently by a direct parallel solver. The mean and variance simulations of the cavity flow are done for random variation of the viscosity and the lid velocity. The solver was tested and compared with the Monte-Carlo simulations and with previous research works. The developed solver is proved to be efficient in simulating the stochastic two-dimensional incompressible flows.
Progress in developing Poisson-Boltzmann equation solvers
Li, Chuan; Li, Lin; Petukh, Marharyta; Alexov, Emil
2013-01-01
This review outlines the recent progress made in developing more accurate and efficient solutions to model electrostatics in systems comprised of bio-macromolecules and nano-objects, the last one referring to objects that do not have biological function themselves but nowadays are frequently used in biophysical and medical approaches in conjunction with bio-macromolecules. The problem of modeling macromolecular electrostatics is reviewed from two different angles: as a mathematical task provided the specific definition of the system to be modeled and as a physical problem aiming to better capture the phenomena occurring in the real experiments. In addition, specific attention is paid to methods to extend the capabilities of the existing solvers to model large systems toward applications of calculations of the electrostatic potential and energies in molecular motors, mitochondria complex, photosynthetic machinery and systems involving large nano-objects. PMID:24199185
Progress in developing Poisson-Boltzmann equation solvers.
Li, Chuan; Li, Lin; Petukh, Marharyta; Alexov, Emil
2013-03-01
This review outlines the recent progress made in developing more accurate and efficient solutions to model electrostatics in systems comprised of bio-macromolecules and nano-objects, the last one referring to objects that do not have biological function themselves but nowadays are frequently used in biophysical and medical approaches in conjunction with bio-macromolecules. The problem of modeling macromolecular electrostatics is reviewed from two different angles: as a mathematical task provided the specific definition of the system to be modeled and as a physical problem aiming to better capture the phenomena occurring in the real experiments. In addition, specific attention is paid to methods to extend the capabilities of the existing solvers to model large systems toward applications of calculations of the electrostatic potential and energies in molecular motors, mitochondria complex, photosynthetic machinery and systems involving large nano-objects.
A General Symbolic PDE Solver Generator: Beyond Explicit Schemes
Directory of Open Access Journals (Sweden)
K. Sheshadri
2003-01-01
Full Text Available This paper presents an extension of our Mathematica- and MathCode-based symbolic-numeric framework for solving a variety of partial differential equation (PDE problems. The main features of our earlier work, which implemented explicit finite-difference schemes, include the ability to handle (1 arbitrary number of dependent variables, (2 arbitrary dimensionality, and (3 arbitrary geometry, as well as (4 developing finite-difference schemes to any desired order of approximation. In the present paper, extensions of this framework to implicit schemes and the method of lines are discussed. While C++ code is generated, using the MathCode system for the implicit method, Modelica code is generated for the method of lines. The latter provides a preliminary PDE support for the Modelica language. Examples illustrating the various aspects of the solver generator are presented.
SolveDB: Integrating Optimization Problem Solvers Into SQL Databases
DEFF Research Database (Denmark)
Siksnys, Laurynas; Pedersen, Torben Bach
2016-01-01
Many real-world decision problems involve solving optimization problems based on data in an SQL database. Traditionally, solving such problems requires combining a DBMS with optimization software packages for each required class of problems (e.g. linear and constraint programming) -- leading...... to workflows that are cumbersome, complex, inefficient, and error-prone. In this paper, we present SolveDB - a DBMS for optimization applications. SolveDB supports solvers for different problem classes and offers seamless data management and optimization problem solving in a pure SQL-based setting. This allows...... for much simpler and more effective solutions of database-based optimization problems. SolveDB is based on the 3-level ANSI/SPARC architecture and allows formulating, solving, and analysing solutions of optimization problems using a single so-called solve query. SolveDB provides (1) an SQL-based syntax...
Accurate derivative evaluation for any Grad–Shafranov solver
Energy Technology Data Exchange (ETDEWEB)
Ricketson, L.F. [Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 (United States); Cerfon, A.J., E-mail: cerfon@cims.nyu.edu [Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 (United States); Rachh, M. [Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 (United States); Freidberg, J.P. [Plasma Science and Fusion Center, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States)
2016-01-15
We present a numerical scheme that can be combined with any fixed boundary finite element based Poisson or Grad–Shafranov solver to compute the first and second partial derivatives of the solution to these equations with the same order of convergence as the solution itself. At the heart of our scheme is an efficient and accurate computation of the Dirichlet to Neumann map through the evaluation of a singular volume integral and the solution to a Fredholm integral equation of the second kind. Our numerical method is particularly useful for magnetic confinement fusion simulations, since it allows the evaluation of quantities such as the magnetic field, the parallel current density and the magnetic curvature with much higher accuracy than has been previously feasible on the affordable coarse grids that are usually implemented.
Fast Multipole-Based Preconditioner for Sparse Iterative Solvers
Ibeid, Huda
2014-05-04
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.
Reflection-free finite volume Maxwell's solver for adaptive grids
Elkina, Nina
2015-01-01
We present a non-staggered method for the Maxwell equations in adaptively refined grids. The code is based on finite volume central scheme that preserves in a discrete form both divergence-free property of magnetic field and the Gauss law. High spatial accuracy is achieved with help of non-oscillatory extrema preserving piece-wise or piece-wise-quadratic reconstructions. The semi-discrete equations are solved by implicit-explicit Runge-Kutta method. The new adaptive grid Maxwell's solver is examined based on several 1d examples, including the an propagation of a Gaussian pulse through vacuum and partially ionised gas. Two-dimensional extension is tested with a Gaussian pulse incident on dielectric disc. Additionally, we focus on testing computational accuracy and efficiency.
Visualising magnetic fields numerical equation solvers in action
Beeteson, John Stuart
2001-01-01
Visualizing Magnetic Fields: Numerical Equation Solvers in Action provides a complete description of the theory behind a new technique, a detailed discussion of the ways of solving the equations (including a software visualization of the solution algorithms), the application software itself, and the full source code. Most importantly, there is a succinct, easy-to-follow description of each procedure in the code.The physicist Michael Faraday said that the study of magnetic lines of force was greatly influential in leading him to formulate many of those concepts that are now so fundamental to our modern world, proving to him their "great utility as well as fertility." Michael Faraday could only visualize these lines in his mind's eye and, even with modern computers to help us, it has been very expensive and time consuming to plot lines of force in magnetic fields
Preconditioned fully implicit PDE solvers for monument conservation
Semplice, Matteo
2010-01-01
Mathematical models for the description, in a quantitative way, of the damages induced on the monuments by the action of specific pollutants are often systems of nonlinear, possibly degenerate, parabolic equations. Although some the asymptotic properties of the solutions are known, for a short window of time, one needs a numerical approximation scheme in order to have a quantitative forecast at any time of interest. In this paper a fully implicit numerical method is proposed, analyzed and numerically tested for parabolic equations of porous media type and on a systems of two PDEs that models the sulfation of marble in monuments. Due to the nonlinear nature of the underlying mathematical model, the use of a fixed point scheme is required and every step implies the solution of large, locally structured, linear systems. A special effort is devoted to the spectral analysis of the relevant matrices and to the design of appropriate iterative or multi-iterative solvers, with special attention to preconditioned Krylo...
Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
Livne, Oren E
2011-01-01
Laplacian matrices of graphs arise in large-scale computational applications such as machine learning; spectral clustering of images, genetic data and web pages; transportation network flows; electrical resistor circuits; and elliptic partial differential equations discretized on unstructured grids with finite elements. A Lean Algebraic Multigrid (LAMG) solver of the linear system Ax=b is presented, where A is a graph Laplacian. LAMG's run time and storage are linear in the number of graph edges. LAMG consists of a setup phase, in which a sequence of increasingly-coarser Laplacian systems is constructed, and an iterative solve phase using multigrid cycles. General graphs pose algorithmic challenges not encountered in traditional applications of algebraic multigrid. LAMG combines a lean piecewise-constant interpolation, judicious node aggregation based on a new node proximity definition, and an energy correction of the coarse-level systems. This results in fast convergence and substantial overhead and memory s...
Periodic Density Functional Theory Solver using Multiresolution Analysis with MADNESS
Harrison, Robert; Thornton, William
2011-03-01
We describe the first implementation of the all-electron Kohn-Sham density functional periodic solver (DFT) using multi-wavelets and fast integral equations using MADNESS (multiresolution adaptive numerical environment for scientific simulation; http://code.google.com/p/m-a-d-n-e-s-s). The multiresolution nature of a multi-wavelet basis allows for fast computation with guaranteed precision. By reformulating the Kohn-Sham eigenvalue equation into the Lippmann-Schwinger equation, we can avoid using the derivative operator which allows better control of overall precision for the all-electron problem. Other highlights include the development of periodic integral operators with low-rank separation, an adaptable model potential for nuclear potential, and an implementation for Hartree Fock exchange. This work was supported by NSF project OCI-0904972 and made use of resources at the Center for Computational Sciences at Oak Ridge National Laboratory under contract DE-AC05-00OR22725.
A new numerical solver for flows at various Mach numbers
Miczek, F; Edelmann, P V F
2014-01-01
Many problems in stellar astrophysics feature low Mach number flows. However, conventional compressible hydrodynamics schemes frequently used in the field have been developed for the transonic regime and exhibit excessive numerical dissipation for these flows. While schemes were proposed that solve hydrodynamics strictly in the low Mach regime and thus restrict their applicability, we aim at developing a scheme that correctly operates in a wide range of Mach numbers. Based on an analysis of the asymptotic behavior of the Euler equations in the low Mach limit we propose a novel scheme that is able to maintain a low Mach number flow setup while retaining all effects of compressibility. This is achieved by a suitable modification of the well-known Roe solver. Numerical tests demonstrate the capability of this new scheme to reproduce slow flow structures even in moderate numerical resolution. Our scheme provides a promising approach to a consistent multidimensional hydrodynamical treatment of astrophysical low Ma...
Anton, L; Marti, J M; Ibanez, J M; Aloy, M A; Mimica, P
2009-01-01
We obtain renormalized sets of right and left eigenvectors of the flux vector Jacobians of the relativistic MHD equations, which are regular and span a complete basis in any physical state including degenerate ones. The renormalization procedure relies on the characterization of the degeneracy types in terms of the normal and tangential components of the magnetic field to the wavefront in the fluid rest frame. Proper expressions of the renormalized eigenvectors in conserved variables are obtained through the corresponding matrix transformations. Our work completes previous analysis that present different sets of right eigenvectors for non-degenerate and degenerate states, and can be seen as a relativistic generalization of earlier work performed in classical MHD. Based on the full wave decomposition (FWD) provided by the the renormalized set of eigenvectors in conserved variables, we have also developed a linearized (Roe-type) Riemann solver. Extensive testing against one- and two-dimensional standard numeric...
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan
2010-10-05
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
Extending the QUDA Library with the eigCG Solver
Energy Technology Data Exchange (ETDEWEB)
Strelchenko, Alexei [Fermilab; Stathopoulos, Andreas [William-Mary Coll.
2014-12-12
While the incremental eigCG algorithm [ 1 ] is included in many LQCD software packages, its realization on GPU micro-architectures was still missing. In this session we report our experi- ence of the eigCG implementation in the QUDA library. In particular, we will focus on how to employ the mixed precision technique to accelerate solutions of large sparse linear systems with multiple right-hand sides on GPUs. Although application of mixed precision techniques is a well-known optimization approach for linear solvers, its utilization for the eigenvector com- puting within eigCG requires special consideration. We will discuss implementation aspects of the mixed precision deflation and illustrate its numerical behavior on the example of the Wilson twisted mass fermion matrix inversions
Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Villa, Umberto; Engsig-Karup, Allan Peter;
The paper introduces a nonlinear multigrid solver for mixed finite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstructured problems is the guaranteed approximation property of the AMGe coarse...... spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method), were less successful due to lack of such good approximation...... are compared to FAS on a nonlinear saddle point problem with applications to porous media flow. It is demonstrated that FAS is faster than Newton’s method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate...
Westbrook, T'pring R; Harden, Brenda Jones
2010-07-01
The present study examined the impact of proximal (maternal depression, family structure) and distal (exposure to violence) risk factors on parenting characteristics (warmth, control), which were in turn hypothesized to affect child social-emotional functioning. Using the Family and Child Experiences Study (FACES) 2000 cohort, findings revealed that study variables were significant predictors of child social-emotional functioning. Despite limited significant pathways in the structural equation models, the cumulative effect of the variables resulted in models accounting for 21%-37% of the outcome. Multigroup analysis revealed that although the amount of variance explained varied, the model held across subgroups. Findings support theories such as the family stress model that suggest that family risk factors negatively influencing children's development through influencing parenting behaviors. Findings also support considering both warmth and control as key parenting dimensions. It may be impractical for practitioners to address the myriad of potential risks encountered by low-income families, but parents can be equipped with mental health services, parent education, and other assistance to help them maintain positive parenting practices in the face of challenges.
Energy Technology Data Exchange (ETDEWEB)
Ghrayeb, Shadi Z. [Pennsylvania State Univ., University Park, PA (United States). Dept. of Mechanical and Nuclear Engineering; Ougouag, Abderrafi M. [Idaho National Laboratory (INL), Idaho Falls, ID (United States); Ouisloumen, Mohamed [Westinghouse Electric Company, Cranberry Township, PA (United States); Ivanov, Kostadin N. [Pennsylvania State Univ., University Park, PA (United States). Dept. of Mechanical and Nuclear Engineering
2014-01-01
A multi-group formulation for the exact neutron elastic scattering kernel is developed. It incorporates the neutron up-scattering effects, stemming from lattice atoms thermal motion and accounts for it within the resulting effective nuclear cross-section data. The effects pertain essentially to resonant scattering off of heavy nuclei. The formulation, implemented into a standalone code, produces effective nuclear scattering data that are then supplied directly into the DRAGON lattice physics code where the effects on Doppler Reactivity and neutron flux are demonstrated. The correct accounting for the crystal lattice effects influences the estimated values for the probability of neutron absorption and scattering, which in turn affect the estimation of core reactivity and burnup characteristics. The results show an increase in values of Doppler temperature feedback coefficients up to -10% for UOX and MOX LWR fuels compared to the corresponding values derived using the traditional asymptotic elastic scattering kernel. This paper also summarizes the results done on this topic to date.
Merz, Erin L.; Malcarne, Vanessa L.; Roesch, Scott C.; Riley, Natasha; Sadler, Georgia Robins
2014-01-01
Depression is a significant problem for ethnic minorities that remains understudied partly due to a lack of strong measures with established psychometric properties. One screening tool, the Patient Health Questionnaire-9 (PHQ-9), which was developed for use in primary care has also gained popularity in research settings. The reliability and validity of the PHQ-9 has been well established among predominantly Caucasian samples, in addition to many minority groups. However, there is little evidence regarding its utility among Hispanic Americans, a large and growing cultural group in the United States. In this study, we investigated the reliability and structural validity of the PHQ-9 in Hispanic American women. A community sample of 479 Latina women from southern California completed the PHQ-9 in their preferred language of English or Spanish. Cronbach’s alphas suggested that there was good internal consistency for both the English- and Spanish-language versions. Structural validity was investigated using multigroup confirmatory factor analysis (CFA). Results support a similar one-factor structure with equivalent response patterns and variances among English- and Spanish-speaking Latinas. These results suggest that the PHQ-9 can be used with confidence in both English and Spanish versions to screen Latinas for depression. PMID:21787063
Du, Gang; Jiang, Zhibin; Diao, Xiaodi; Yao, Yang
2012-04-01
Although the clinical pathway (CP) predefines predictable standardized care process for a particular diagnosis or procedure, many variances may still unavoidably occur. Some key index parameters have strong relationship with variances handling measures of CP. In real world, these problems are highly nonlinear in nature so that it's hard to develop a comprehensive mathematic model. In this paper, a rule extraction approach based on combing hybrid genetic double multi-group cooperative particle swarm optimization algorithm (PSO) and discrete PSO algorithm (named HGDMCPSO/DPSO) is developed to discovery the previously unknown and potentially complicated nonlinear relationship between key parameters and variances handling measures of CP. Then these extracted rules can provide abnormal variances handling warning for medical professionals. Three numerical experiments on Iris of UCI data sets, Wisconsin breast cancer data sets and CP variances data sets of osteosarcoma preoperative chemotherapy are used to validate the proposed method. When compared with the previous researches, the proposed rule extraction algorithm can obtain the high prediction accuracy, less computing time, more stability and easily comprehended by users, thus it is an effective knowledge extraction tool for CP variances handling.
Domain decomposed preconditioners with Krylov subspace methods as subdomain solvers
Energy Technology Data Exchange (ETDEWEB)
Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States)
1994-12-31
Domain decomposed preconditioners for nonsymmetric partial differential equations typically require the solution of problems on the subdomains. Most implementations employ exact solvers to obtain these solutions. Consequently work and storage requirements for the subdomain problems grow rapidly with the size of the subdomain problems. Subdomain solves constitute the single largest computational cost of a domain decomposed preconditioner, and improving the efficiency of this phase of the computation will have a significant impact on the performance of the overall method. The small local memory available on the nodes of most message-passing multicomputers motivates consideration of the use of an iterative method for solving subdomain problems. For large-scale systems of equations that are derived from three-dimensional problems, memory considerations alone may dictate the need for using iterative methods for the subdomain problems. In addition to reduced storage requirements, use of an iterative solver on the subdomains allows flexibility in specifying the accuracy of the subdomain solutions. Substantial savings in solution time is possible if the quality of the domain decomposed preconditioner is not degraded too much by relaxing the accuracy of the subdomain solutions. While some work in this direction has been conducted for symmetric problems, similar studies for nonsymmetric problems appear not to have been pursued. This work represents a first step in this direction, and explores the effectiveness of performing subdomain solves using several transpose-free Krylov subspace methods, GMRES, transpose-free QMR, CGS, and a smoothed version of CGS. Depending on the difficulty of the subdomain problem and the convergence tolerance used, a reduction in solution time is possible in addition to the reduced memory requirements. The domain decomposed preconditioner is a Schur complement method in which the interface operators are approximated using interface probing.
Bounded fractional diffusion in geological media: Definition and Lagrangian approximation
Zhang, Yong; Green, Christopher T.; LaBolle, Eric M.; Neupauer, Roseanna M.; Sun, HongGuang
2016-11-01
Spatiotemporal fractional-derivative models (FDMs) have been increasingly used to simulate non-Fickian diffusion, but methods have not been available to define boundary conditions for FDMs in bounded domains. This study defines boundary conditions and then develops a Lagrangian solver to approximate bounded, one-dimensional fractional diffusion. Both the zero-value and nonzero-value Dirichlet, Neumann, and mixed Robin boundary conditions are defined, where the sign of Riemann-Liouville fractional derivative (capturing nonzero-value spatial-nonlocal boundary conditions with directional superdiffusion) remains consistent with the sign of the fractional-diffusive flux term in the FDMs. New Lagrangian schemes are then proposed to track solute particles moving in bounded domains, where the solutions are checked against analytical or Eulerian solutions available for simplified FDMs. Numerical experiments show that the particle-tracking algorithm for non-Fickian diffusion differs from Fickian diffusion in relocating the particle position around the reflective boundary, likely due to the nonlocal and nonsymmetric fractional diffusion. For a nonzero-value Neumann or Robin boundary, a source cell with a reflective face can be applied to define the release rate of random-walking particles at the specified flux boundary. Mathematical definitions of physically meaningful nonlocal boundaries combined with bounded Lagrangian solvers in this study may provide the only viable techniques at present to quantify the impact of boundaries on anomalous diffusion, expanding the applicability of FDMs from infinite domains to those with any size and boundary conditions.
A Fast Poisson Solver with Periodic Boundary Conditions for GPU Clusters in Various Configurations
Rattermann, Dale Nicholas
Fast Poisson solvers using the Fast Fourier Transform on uniform grids are especially suited for parallel implementation, making them appropriate for portability on graphical processing unit (GPU) devices. The goal of the following work was to implement, test, and evaluate a fast Poisson solver for periodic boundary conditions for use on a variety of GPU configurations. The solver used in this research was FLASH, an immersed-boundary-based method, which is well suited for complex, time-dependent geometries, has robust adaptive mesh refinement/de-refinement capabilities to capture evolving flow structures, and has been successfully implemented on conventional, parallel supercomputers. However, these solvers are still computationally costly to employ, and the total solver time is dominated by the solution of the pressure Poisson equation using state-of-the-art multigrid methods. FLASH improves the performance of its multigrid solvers by integrating a parallel FFT solver on a uniform grid during a coarse level. This hybrid solver could then be theoretically improved by replacing the highly-parallelizable FFT solver with one that utilizes GPUs, and, thus, was the motivation for my research. In the present work, the CPU-utilizing parallel FFT solver (PFFT) used in the base version of FLASH for solving the Poisson equation on uniform grids has been modified to enable parallel execution on CUDA-enabled GPU devices. New algorithms have been implemented to replace the Poisson solver that decompose the computational domain and send each new block to a GPU for parallel computation. One-dimensional (1-D) decomposition of the computational domain minimizes the amount of network traffic involved in this bandwidth-intensive computation by limiting the amount of all-to-all communication required between processes. Advanced techniques have been incorporated and implemented in a GPU-centric code design, while allowing end users the flexibility of parameter control at runtime in
The impact of improved sparse linear solvers on industrial engineering applications
Energy Technology Data Exchange (ETDEWEB)
Heroux, M. [Cray Research, Inc., Eagan, MN (United States); Baddourah, M.; Poole, E.L.; Yang, Chao Wu
1996-12-31
There are usually many factors that ultimately determine the quality of computer simulation for engineering applications. Some of the most important are the quality of the analytical model and approximation scheme, the accuracy of the input data and the capability of the computing resources. However, in many engineering applications the characteristics of the sparse linear solver are the key factors in determining how complex a problem a given application code can solve. Therefore, the advent of a dramatically improved solver often brings with it dramatic improvements in our ability to do accurate and cost effective computer simulations. In this presentation we discuss the current status of sparse iterative and direct solvers in several key industrial CFD and structures codes, and show the impact that recent advances in linear solvers have made on both our ability to perform challenging simulations and the cost of those simulations. We also present some of the current challenges we have and the constraints we face in trying to improve these solvers. Finally, we discuss future requirements for sparse linear solvers on high performance architectures and try to indicate the opportunities that exist if we can develop even more improvements in linear solver capabilities.
A parallel direct solver for the self-adaptive hp Finite Element Method
Paszyński, Maciej R.
2010-03-01
In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p = 1 to p = 9. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf. © 2009 Elsevier Inc. All rights reserved.
Robust large-scale parallel nonlinear solvers for simulations.
Energy Technology Data Exchange (ETDEWEB)
Bader, Brett William; Pawlowski, Roger Patrick; Kolda, Tamara Gibson (Sandia National Laboratories, Livermore, CA)
2005-11-01
This report documents research to develop robust and efficient solution techniques for solving large-scale systems of nonlinear equations. The most widely used method for solving systems of nonlinear equations is Newton's method. While much research has been devoted to augmenting Newton-based solvers (usually with globalization techniques), little has been devoted to exploring the application of different models. Our research has been directed at evaluating techniques using different models than Newton's method: a lower order model, Broyden's method, and a higher order model, the tensor method. We have developed large-scale versions of each of these models and have demonstrated their use in important applications at Sandia. Broyden's method replaces the Jacobian with an approximation, allowing codes that cannot evaluate a Jacobian or have an inaccurate Jacobian to converge to a solution. Limited-memory methods, which have been successful in optimization, allow us to extend this approach to large-scale problems. We compare the robustness and efficiency of Newton's method, modified Newton's method, Jacobian-free Newton-Krylov method, and our limited-memory Broyden method. Comparisons are carried out for large-scale applications of fluid flow simulations and electronic circuit simulations. Results show that, in cases where the Jacobian was inaccurate or could not be computed, Broyden's method converged in some cases where Newton's method failed to converge. We identify conditions where Broyden's method can be more efficient than Newton's method. We also present modifications to a large-scale tensor method, originally proposed by Bouaricha, for greater efficiency, better robustness, and wider applicability. Tensor methods are an alternative to Newton-based methods and are based on computing a step based on a local quadratic model rather than a linear model. The advantage of Bouaricha's method is that it can use any
A 2-D/3-D cartesian geometry non-conforming spherical harmonic neutron transport solver
Energy Technology Data Exchange (ETDEWEB)
Van Criekingen, S. [Laboratoire J.-L. Lions, Universite Pierre et Marie Curie, 175 rue du Chevaleret, 75013 Paris (France)]. E-mail: vancriekingen@ann.jussieu.fr
2007-03-15
A new 2-D/3-D transport core solver for the time-independent Boltzmann transport equation is presented. This solver, named FIESTA, is based on the second-order even-parity form of the transport equation. The angular discretization is performed through the expansion of the angular neutron flux into spherical harmonics (P {sub N} method). The novelty of this solver is the use of non-conforming finite elements for the spatial discretization. Such elements lead to a discontinuous scalar flux approximation. This interface continuity requirement relaxation property is shared with mixed-dual formulations discretized using Raviart-Thomas finite elements. Encouraging numerical results are presented.
Senoo, Y.
The influence of vaneless diffusers on flow in centrifugal compressors, particularly on surge, is discussed. A vaneless diffuser can demonstrate stable operation in a wide flow range only if it is installed with a backward leaning blade impeller. The circumferential distortion of flow in the impeller disappears quickly in the vaneless diffuser. The axial distortion of flow at the diffuser inlet does not decay easily. In large specific speed compressors, flow out of the impeller is distorted axially. Pressure recovery of diffusers at distorted inlet flow is considerably improved by half guide vanes. The best height of the vanes is a little 1/2 diffuser width. In small specific speed compressors, flow out of the impeller is not much distorted and pressure recovery can be predicted with one-dimensional flow analysis. Wall friction loss is significant in narrow diffusers. The large pressure drop at a small flow rate can cause the positive gradient of the pressure-flow rate characteristic curve, which may cause surging.
Directory of Open Access Journals (Sweden)
Ahmad Mujahid Ahmad Zaidi
2013-01-01
Full Text Available Rolled homogeneous armor (RHA plate subjected to blast loading is a complex problem involving the nonlinear fluid-structure interaction. The numerical techniques using the spatial discretization scheme that has been provided as a solver in the AUTODYN computer code will be used in this study in order to predict the RHA response subjected to explosive (TNT blast loading. The final deflection will be used as a reference in order to identify the suitable solver for both materials RHA and TNT; then the plastic deformation will be chosen in the simulation process. Instead of using the same solver for RHA and TNT domains, the optimization of solver can be achieved if it is only used in an appropriate domain, or in other words, a different domain will be using different solver. The solvers, which were available in AUTODYN, were used in the analysis of impact and explosion or fluid-structure interaction. Therefore, in this paper, we will determine the suitable solver for both materials (TNT and RHA plate, and the appropriate interaction coupling solver will be obtained. Defining TNT and RHA plates using the Arbitrary Lagrangian Eulerian solver has found the best coupling solver for this case study when compared with existing experimental data. This coupling solver will be used for future analysis in simulating blast-loading phenomena.
An optimal iterative solver for the Stokes problem
Energy Technology Data Exchange (ETDEWEB)
Wathen, A. [Univ. of Bristol (United Kingdom); Silvester, D.
1994-12-31
Discretisations of the classical Stokes Problem for slow viscous incompressible flow gives rise to systems of equations in matrix form for the velocity u and the pressure p, where the coefficient matrix is symmetric but necessarily indefinite. The square submatrix A is symmetric and positive definite and represents a discrete (vector) Laplacian and the submatrix C may be the zero matrix or more generally will be symmetric positive semi-definite. For `stabilised` discretisations (C {ne} 0) and descretisations which are inherently `stable` (C = 0) and so do not admit spurious pressure components even as the mesh size, h approaches zero, the Schur compliment of the matrix has spectral condition number independent of h (given also that B is bounded). Here the authors will show how this property together with a multigrid preconditioner only for the Laplacian block A yields an optimal solver for the Stokes problem through use of the Minimum Residual iteration. That is, combining Minimum Residual iteration for the matrix equation with a block preconditioner which comprises a small number of multigrid V-cycles for the Laplacian block A together with a simple diagonal scaling block provides an iterative solution procedure for which the computational work grows only linearly with the problem size.
Approximate Riemann Solvers for the Cosmic Ray Magnetohydrodynamical Equations
Kudoh, Yuki
2016-01-01
We analyze the cosmic-ray magnetohydrodynamic (CR MHD) equations to improve the numerical simulations. We propose to solve them in the fully conservation form, which is equivalent to the conventional CR MHD equations. In the fully conservation form, the CR energy equation is replaced with the CR "number" conservation, where the CR number density is defined as the three fourths power of the CR energy density. The former contains an extra source term, while latter does not. An approximate Riemann solver is derived from the CR MHD equations in the fully conservation form. Based on the analysis, we propose a numerical scheme of which solutions satisfy the Rankine-Hugoniot relation at any shock. We demonstrate that it reproduces the Riemann solution derived by Pfrommer et al. (2006) for a 1D CR hydrodynamic shock tube problem. We compare the solution with those obtained by solving the CR energy equation. The latter solutions deviate from the Riemann solution seriously, when the CR pressure dominates over the gas p...
Approximate Riemann solvers for the cosmic ray magnetohydrodynamical equations
Kudoh, Yuki; Hanawa, Tomoyuki
2016-11-01
We analyse the cosmic ray magnetohydrodynamic (CR MHD) equations to improve the numerical simulations. We propose to solve them in the fully conservation form, which is equivalent to the conventional CR MHD equations. In the fully conservation form, the CR energy equation is replaced with the CR `number' conservation, where the CR number density is defined as the three-fourths power of the CR energy density. The former contains an extra source term, while latter does not. An approximate Riemann solver is derived from the CR MHD equations in the fully conservation form. Based on the analysis, we propose a numerical scheme of which solutions satisfy the Rankine-Hugoniot relation at any shock. We demonstrate that it reproduces the Riemann solution derived by Pfrommer et al. for a 1D CR hydrodynamic shock tube problem. We compare the solution with those obtained by solving the CR energy equation. The latter solutions deviate from the Riemann solution seriously, when the CR pressure dominates over the gas pressure in the post-shocked gas. The former solutions converge to the Riemann solution and are of the second-order accuracy in space and time. Our numerical examples include an expansion of high-pressure sphere in a magnetized medium. Fast and slow shocks are sharply resolved in the example. We also discuss possible extension of the CR MHD equations to evaluate the average CR energy.
Development and acceleration of unstructured mesh-based cfd solver
Emelyanov, V.; Karpenko, A.; Volkov, K.
2017-06-01
The study was undertaken as part of a larger effort to establish a common computational fluid dynamics (CFD) code for simulation of internal and external flows and involves some basic validation studies. The governing equations are solved with ¦nite volume code on unstructured meshes. The computational procedure involves reconstruction of the solution in each control volume and extrapolation of the unknowns to find the flow variables on the faces of control volume, solution of Riemann problem for each face of the control volume, and evolution of the time step. The nonlinear CFD solver works in an explicit time-marching fashion, based on a three-step Runge-Kutta stepping procedure. Convergence to a steady state is accelerated by the use of geometric technique and by the application of Jacobi preconditioning for high-speed flows, with a separate low Mach number preconditioning method for use with low-speed flows. The CFD code is implemented on graphics processing units (GPUs). Speedup of solution on GPUs with respect to solution on central processing units (CPU) is compared with the use of different meshes and different methods of distribution of input data into blocks. The results obtained provide promising perspective for designing a GPU-based software framework for applications in CFD.
Incremental planning to control a blackboard-based problem solver
Durfee, E. H.; Lesser, V. R.
1987-01-01
To control problem solving activity, a planner must resolve uncertainty about which specific long-term goals (solutions) to pursue and about which sequences of actions will best achieve those goals. A planner is described that abstracts the problem solving state to recognize possible competing and compatible solutions and to roughly predict the importance and expense of developing these solutions. With this information, the planner plans sequences of problem solving activities that most efficiently resolve its uncertainty about which of the possible solutions to work toward. The planner only details actions for the near future because the results of these actions will influence how (and whether) a plan should be pursued. As problem solving proceeds, the planner adds new details to the plan incrementally, and monitors and repairs the plan to insure it achieves its goals whenever possible. Through experiments, researchers illustrate how these new mechanisms significantly improve problem solving decisions and reduce overall computation. They briefly discuss current research directions, including how these mechanisms can improve a problem solver's real-time response and can enhance cooperation in a distributed problem solving network.
Algorithmic Enhancements to the VULCAN Navier-Stokes Solver
Litton, D. K.; Edwards, J. R.; White, J. A.
2003-01-01
VULCAN (Viscous Upwind aLgorithm for Complex flow ANalysis) is a cell centered, finite volume code used to solve high speed flows related to hypersonic vehicles. Two algorithms are presented for expanding the range of applications of the current Navier-Stokes solver implemented in VULCAN. The first addition is a highly implicit approach that uses subiterations to enhance block to block connectivity between adjacent subdomains. The addition of this scheme allows more efficient solution of viscous flows on highly-stretched meshes. The second algorithm addresses the shortcomings associated with density-based schemes by the addition of a time-derivative preconditioning strategy. High speed, compressible flows are typically solved with density based schemes, which show a high level of degradation in accuracy and convergence at low Mach numbers (M less than or equal to 0.1). With the addition of preconditioning and associated modifications to the numerical discretization scheme, the eigenvalues will scale with the local velocity, and the above problems will be eliminated. With these additions, VULCAN now has improved convergence behavior for multi-block, highly-stretched meshes and also can solve the Navier-Stokes equations for very low Mach numbers.
Intrusive Method for Uncertainty Quantification in a Multiphase Flow Solver
Turnquist, Brian; Owkes, Mark
2016-11-01
Uncertainty quantification (UQ) is a necessary, interesting, and often neglected aspect of fluid flow simulations. To determine the significance of uncertain initial and boundary conditions, a multiphase flow solver is being created which extends a single phase, intrusive, polynomial chaos scheme into multiphase flows. Reliably estimating the impact of input uncertainty on design criteria can help identify and minimize unwanted variability in critical areas, and has the potential to help advance knowledge in atomizing jets, jet engines, pharmaceuticals, and food processing. Use of an intrusive polynomial chaos method has been shown to significantly reduce computational cost over non-intrusive collocation methods such as Monte-Carlo. This method requires transforming the model equations into a weak form through substitution of stochastic (random) variables. Ultimately, the model deploys a stochastic Navier Stokes equation, a stochastic conservative level set approach including reinitialization, as well as stochastic normals and curvature. By implementing these approaches together in one framework, basic problems may be investigated which shed light on model expansion, uncertainty theory, and fluid flow in general. NSF Grant Number 1511325.
A new parallel n-body gravity solver TPM
Xu, G
1994-01-01
We have developed a gravity solver based on combining the well developed Particle-Mesh (PM) method and TREE methods. It is designed for and has been implemented on parallel computer architectures. The new code can deal with tens of millions of particles on current computers, with the calculation done on a parallel supercomputer or a group of workstations. Typically, the spatial resolution is enhanced by more than a factor of 20 over the pure PM code with mass resolution retained at nearly the PM level. This code runs much faster than a pure TREE code with the same number of particles and maintains almost the same resolution in high density regions. Multiple time step integration has also been implemented with the code, with second order time accuracy. The performance of the code has been checked in several kinds of parallel computer configuration, including IBM SP1, SGI Challenge and a group of workstations, with the speedup of the parallel code on a 32 processor IBM SP2 supercomputer nearly linear (efficienc...
Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver
Moustafa, Salli; Dutka-Malen, Ivan; Plagne, Laurent; Ponçot, Angélique; Ramet, Pierre
2014-06-01
This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOMINO can exploit the full power of modern multi-core processors and is able to tackle very large simulations, that usually require large HPC clusters, using a single computing node. For example, DOMINO solves a 3D full core PWR eigenvalue problem involving 26 energy groups, 288 angular directions (S16), 46 × 106 spatial cells and 1 × 1012 DoFs within 11 hours on a single 32-core SMP node. This represents a sustained performance of 235 GFlops and 40:74% of the SMP node peak performance for the DOMINO sweep implementation. The very high Flops/Watt ratio of DOMINO makes it a very interesting building block for a future many-nodes nuclear simulation tool.
Parallelizable approximate solvers for recursions arising in preconditioning
Energy Technology Data Exchange (ETDEWEB)
Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)
1996-12-31
For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.
On Riemann Solvers and Kinetic Relations for Isothermal Two-Phase Flows with Surface Tension
Rohde, Christian
2016-01-01
We consider a sharp-interface approach for the inviscid isothermal dynamics of compressible two-phase flow, that accounts for phase transition and surface tension effects. To fix the mass exchange and entropy dissipation rate across the interface kinetic relations are frequently used. The complete uni-directional dynamics can then be understood by solving generalized two-phase Riemann problems. We present new well-posedness theorems for the Riemann problem and corresponding computable Riemann solvers, that cover quite general equations of state, metastable input data and curvature effects. The new Riemann solver is used to validate different kinetic relations on physically relevant problems including a comparison with experimental data. Riemann solvers are building blocks for many numerical schemes that are used to track interfaces in two-phase flow. It is shown that the new Riemann solver enables reliable and efficient computations for physical situations that could not be treated before.
An Investigation of the Performance of the Colored Gauss-Seidel Solver on CPU and GPU
Energy Technology Data Exchange (ETDEWEB)
Yoon, Jong Seon; Choi, Hyoung Gwon [Seoul Nat’l Univ. of Science and Technology, Seoul (Korea, Republic of); Jeon, Byoung Jin [Yonsei Univ., Seoul (Korea, Republic of)
2017-02-15
The performance of the colored Gauss–Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss–Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss–Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.
A Novel High-Order, Entropy Stable, 3D AMR MHD Solver with Guaranteed Positive Pressure
Derigs, Dominik; Gassner, Gregor J; Walch, Stefanie
2016-01-01
We describe a high-order numerical magnetohydrodynamics (MHD) solver built upon a novel non-linear entropy stable numerical flux function that supports eight travelling wave solutions. By construction the solver conserves mass, momentum, and energy and is entropy stable. The method is designed to treat the divergence-free constraint on the magnetic field in a similar fashion to a hyperbolic divergence cleaning technique. The solver described herein is especially well-suited for flows involving strong discontinuities. Furthermore, we present a new formulation to guarantee positivity of the pressure. We present the underlying theory and implementation of the new solver into the multi-physics, multi-scale adaptive mesh refinement (AMR) simulation code $\\texttt{FLASH}$ (http://flash.uchicago.edu). The accuracy, robustness and computational efficiency is demonstrated with a number of tests, including comparisons to available MHD implementations in $\\texttt{FLASH}$.
libmpdata++ 0.1: a library of parallel MPDATA solvers for systems of generalised transport equations
Jaruga, Anna; Jarecka, Dorota; Pawlowska, Hanna; Smolarkiewicz, Piotr K; Waruszewski, Maciej
2014-01-01
This paper accompanies first release of libmpdata++, a C++ library implementing the Multidimensional Positive-Definite Advection Transport Algorithm (MPDATA). The library offers basic numerical solvers for systems of generalised transport equations. The solvers are forward-in-time, conservative and non-linearly stable. The libmpdata++ library covers the basic second-order-accurate formulation of MPDATA, its third-order variant, the infinite-gauge option for variable-sign fields and a flux-corrected transport extension to guarantee non-oscillatory solutions. The library is equipped with a non-symmetric variational elliptic solver for implicit evaluation of pressure gradient terms. All solvers offer parallelisation through domain decomposition using shared-memory parallelisation. The paper describes the library programming interface, and serves as a user guide. Supported options are illustrated with benchmarks discussed in the MPDATA literature. Benchmark descriptions include code snippets as well as quantitati...
Advanced field-solver techniques for RC extraction of integrated circuits
Yu, Wenjian
2014-01-01
Resistance and capacitance (RC) extraction is an essential step in modeling the interconnection wires and substrate coupling effect in nanometer-technology integrated circuits (IC). The field-solver techniques for RC extraction guarantee the accuracy of modeling, and are becoming increasingly important in meeting the demand for accurate modeling and simulation of VLSI designs. Advanced Field-Solver Techniques for RC Extraction of Integrated Circuits presents a systematic introduction to, and treatment of, the key field-solver methods for RC extraction of VLSI interconnects and substrate coupling in mixed-signal ICs. Various field-solver techniques are explained in detail, with real-world examples to illustrate the advantages and disadvantages of each algorithm. This book will benefit graduate students and researchers in the field of electrical and computer engineering, as well as engineers working in the IC design and design automation industries. Dr. Wenjian Yu is an Associate Professor at the Department of ...
Hybrid direct and iterative solvers for h refined grids with singularities
Paszyński, Maciej R.
2015-04-27
This paper describes a hybrid direct and iterative solver for two and three dimensional h adaptive grids with point singularities. The point singularities are eliminated by using a sequential linear computational cost solver O(N) on CPU [1]. The remaining Schur complements are submitted to incomplete LU preconditioned conjugated gradient (ILUPCG) iterative solver. The approach is compared to the standard algorithm performing static condensation over the entire mesh and executing the ILUPCG algorithm on top of it. The hybrid solver is applied for two or three dimensional grids automatically h refined towards point or edge singularities. The automatic refinement is based on the relative error estimations between the coarse and fine mesh solutions [2], and the optimal refinements are selected using the projection based interpolation. The computational mesh is partitioned into sub-meshes with local point and edge singularities separated. This is done by using the following greedy algorithm.
A NEW HIGH PERFORMANCE SPARSE STATIC SOLVER IN FINITE ELEMENT ANALYSIS WITH LOOP-UNROLLING
Institute of Scientific and Technical Information of China (English)
Chen Pu; Sun Shuli
2005-01-01
In the previous papers, a high performance sparse static solver with two-level unrolling based on a cell-sparse storage scheme was reported. Although the solver reaches quite a high efficiency for a big percentage of finite element analysis benchmark tests, the MFLOPS (million floating operations per second) of LDLT factorization of benchmark tests vary on a Dell Pentium Ⅳ 850 MHz machine from 100 to 456 depending on the average size of the super-equations, i.e.,on the average depth of unrolling. In this paper, a new sparse static solver with two-level unrolling that employs the concept of master-equations and searches for an appropriate depths of unrolling is proposed. The new solver provides higher MFLOPS for LDLT factorization of benchmark tests,and therefore speeds up the solution process.
A Solver for Massively Parallel Direct Numerical Simulation of Three-Dimensional Multiphase Flows
Shin, S; Juric, D
2014-01-01
We present a new solver for massively parallel simulations of fully three-dimensional multiphase flows. The solver runs on a variety of computer architectures from laptops to supercomputers and on 65536 threads or more (limited only by the availability to us of more threads). The code is wholly written by the authors in Fortran 2003 and uses a domain decomposition strategy for parallelization with MPI. The fluid interface solver is based on a parallel implementation of the LCRM hybrid Front Tracking/Level Set method designed to handle highly deforming interfaces with complex topology changes. We discuss the implementation of this interface method and its particular suitability to distributed processing where all operations are carried out locally on distributed subdomains. We have developed parallel GMRES and Multigrid iterative solvers suited to the linear systems arising from the implicit solution of the fluid velocities and pressure in the presence of strong density and viscosity discontinuities across flu...
GPU-Accelerated Sparse Matrix Solvers for Large-Scale Simulations Project
National Aeronautics and Space Administration — At the heart of scientific computing and numerical analysis are linear algebra solvers. In scientific computing, the focus is on the partial differential equations...
Schmidhuber, Jürgen
2011-01-01
Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. At any given time, the novel algorithmic framework POWERPLAY searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. The new task and its corresponding task-solving skill are those first found and validated. Newly invented tasks may require making previously learned skills more efficient. The greedy search of typical POWERPLAY variants orders candidate pairs of tasks and solver modifications by their conditional computational complexity, given the stored experience so far. This biases the search towards pairs that can...
A novel high-order, entropy stable, 3D AMR MHD solver with guaranteed positive pressure
Derigs, Dominik; Winters, Andrew R.; Gassner, Gregor J.; Walch, Stefanie
2016-07-01
We describe a high-order numerical magnetohydrodynamics (MHD) solver built upon a novel non-linear entropy stable numerical flux function that supports eight travelling wave solutions. By construction the solver conserves mass, momentum, and energy and is entropy stable. The method is designed to treat the divergence-free constraint on the magnetic field in a similar fashion to a hyperbolic divergence cleaning technique. The solver described herein is especially well-suited for flows involving strong discontinuities. Furthermore, we present a new formulation to guarantee positivity of the pressure. We present the underlying theory and implementation of the new solver into the multi-physics, multi-scale adaptive mesh refinement (AMR) simulation code FLASH (http://flash.uchicago.edu)
A 3D Unstructured Mesh Euler Solver Based on the Fourth-Order CESE Method
2013-06-01
conservation in space and time without using a one-dimensional Riemann solver, (ii) genuinely multi-dimensional treatment without dimensional splitting (iii...of the original second-order CESE method, including: (i) flux conservation in space and time without using a one-dimensional Riemann solver, (ii...treated in a unified manner. The geometry for a three-dimensional CESE method is more difficult to visualize than the one- and two-dimensional methods
2015-04-12
in terms of time and energy thus requires a dramatic shift in the eld of algorithmic design. Solvers for sparse linear algebra problems, ubiquitous...of time and energy thus requires a dramatic shift in the field of algorithmic design. Solvers for sparse linear algebra problems, ubiquitous...algorithm the matrix A must be read from slow memory (when it is too large to fit in cache, the most interesting case). Inner products involve a global
Experimental validation of a boundary element solver for exterior acoustic radiation problems
Visser, Rene; Nilsson, A; Boden, H.
2003-01-01
The relation between harmonic structural vibrations and the corresponding acoustic radiation is given by the Helmholtz integral equation (HIE). To solve this integral equation a new solver (BEMSYS) based on the boundary element method (BEM) has been implemented. This numerical tool can be used for both sound radiation and nearfield acoustic source localization purposes. After validation of the solver with analytic solutions of simple test problems, a well-defined experimental setup has been d...
The development of an intelligent interface to a computational fluid dynamics flow-solver code
Williams, Anthony D.
1988-01-01
Researchers at NASA Lewis are currently developing an 'intelligent' interface to aid in the development and use of large, computational fluid dynamics flow-solver codes for studying the internal fluid behavior of aerospace propulsion systems. This paper discusses the requirements, design, and implementation of an intelligent interface to Proteus, a general purpose, three-dimensional, Navier-Stokes flow solver. The interface is called PROTAIS to denote its introduction of artificial intelligence (AI) concepts to the Proteus code.
Update on Advection-Diffusion Purge Flow Model
Brieda, Lubos
2015-01-01
Gaseous purge is commonly used in sensitive spacecraft optical or electronic instruments to prevent infiltration of contaminants and/or water vapor. Typically, purge is sized using simplistic zero-dimensional models that do not take into account instrument geometry, surface effects, and the dependence of diffusive flux on the concentration gradient. For this reason, an axisymmetric computational fluid dynamics (CFD) simulation was recently developed to model contaminant infiltration and removal by purge. The solver uses a combined Navier-Stokes and Advection-Diffusion approach. In this talk, we report on updates in the model, namely inclusion of a particulate transport model.
Head and neck (192)Ir HDR-brachytherapy dosimetry using a grid-based Boltzmann solver.
Siebert, Frank-André; Wolf, Sabine; Kóvacs, George
2013-12-01
To compare dosimetry for head and neck cancer patients, calculated with TG-43 formalism and a commercially available grid-based Boltzmann solver. This study included 3D-dosimetry of 49 consecutive brachytherapy head and neck cancer patients, computed by a grid-based Boltzmann solver that takes into account tissue inhomogeneities as well as TG-43 formalism. 3D-treatment planning was carried out by using computed tomography. Dosimetric indices D90 and V100 for target volume were about 3% lower (median value) for the grid-based Boltzmann solver relative to TG-43-based computation (p Boltzmann solver to TG-43 (p Boltzmann solver and TG-43 formalism for high-dose-rate head and neck brachytherapy patients to the target volume were found. Distinctions in D90 of CTV were low (2.63 Gy for grid-based Boltzmann solver vs. 2.71 Gy TG-43 in mean). In our clinical practice, prescription doses remain unchanged for high-dose-rate head and neck brachytherapy for the time being.
Yosui, Kuniaki; Iwashita, Takeshi; Mori, Michiya; Kobayashi, Eiichi
Finite element analyses of electromagnetic field are commonly used for designing of various electronic devices. The scale of the analyses becomes larger and larger, therefore, a fast linear solver is needed to solve linear equations arising from the finite element method. Since a multigrid solver is the fastest linear solver for these problems, parallelization of a multigrid solver is a quite useful approach. From the viewpoint of industrial applications, an effective usage of a small-scale PC cluster is important due to initial cost for introducing parallel computers. In this paper, a distributed parallel multigrid solver for a small-scale PC cluster is developed. In high frequency electromagnetic field analyses, a special block Gauss-Seidel smoother is used for the multigrid solver instead of general smoothers such as Gauss-Seidel smoother or Jacobi smoother in order to improve a convergence rate. The block multicolor ordering technique is applied to parallelize the smoother. A numerical exsample shows that a 3.7-fold speed-up in computational time and a 3.0-fold increase in the scale of the analysis were attained when the number of CPU was increased from one to five.
A five-wave Harten-Lax-van Leer Riemann solver for relativistic magnetohydrodynamics
Mignone, A.; Ugliano, M.; Bodo, G.
2009-03-01
We present a five-wave Riemann solver for the equations of ideal relativistic magneto-hydrodynamics. Our solver can be regarded as a relativistic extension of the five-wave HLLD Riemann solver initially developed by Miyoshi & Kusano for the equations of ideal magnetohydrodynamics. The solution to the Riemann problem is approximated by a five-wave pattern, comprising two outermost fast shocks, two rotational discontinuities and a contact surface in the middle. The proposed scheme is considerably more elaborate than in the classical case since the normal velocity is no longer constant across the rotational modes. Still, proper closure to the Rankine-Hugoniot jump conditions can be attained by solving a non-linear scalar equation in the total pressure variable which, for the chosen configuration, has to be constant over the whole Riemann fan. The accuracy of the new Riemann solver is validated against one-dimensional tests and multidimensional applications. It is shown that our new solver considerably improves over the popular Harten-Lax-van Leer solver or the recently proposed HLLC schemes.
Solving the Advection-Diffusion Equations in Biological Contexts using the Cellular Potts Model
Dan, D; Chen, K; Glazier, J A; Dan, Debasis; Mueller, Chris; Chen, Kun; Glazier, James A.
2005-01-01
The Cellular Potts Model (CPM) is a robust, cell-level methodology for simulation of biological tissues and morphogenesis. Both tissue physiology and morphogenesis depend on diffusion of chemical morphogens in the extra-cellular fluid or matrix (ECM). Standard diffusion solvers applied to the cellular potts model use finite difference methods on the underlying CPM lattice. However, these methods produce a diffusing field tied to the underlying lattice, which is inaccurate in many biological situations in which cell or ECM movement causes advection rapid compared to diffusion. Finite difference schemes suffer numerical instabilities solving the resulting advection-diffusion equations. To circumvent these problems we simulate advection-diffusion within the framework of the CPM using off-lattice finite-difference methods. We define a set of generalized fluid particles which detach advection and diffusion from the lattice. Diffusion occurs between neighboring fluid particles by local averaging rules which approxi...
A parallel solver for huge dense linear systems
Badia, J. M.; Movilla, J. L.; Climente, J. I.; Castillo, M.; Marqués, M.; Mayo, R.; Quintana-Ortí, E. S.; Planelles, J.
2011-11-01
HDSS (Huge Dense Linear System Solver) is a Fortran Application Programming Interface (API) to facilitate the parallel solution of very large dense systems to scientists and engineers. The API makes use of parallelism to yield an efficient solution of the systems on a wide range of parallel platforms, from clusters of processors to massively parallel multiprocessors. It exploits out-of-core strategies to leverage the secondary memory in order to solve huge linear systems O(100.000). The API is based on the parallel linear algebra library PLAPACK, and on its Out-Of-Core (OOC) extension POOCLAPACK. Both PLAPACK and POOCLAPACK use the Message Passing Interface (MPI) as the communication layer and BLAS to perform the local matrix operations. The API provides a friendly interface to the users, hiding almost all the technical aspects related to the parallel execution of the code and the use of the secondary memory to solve the systems. In particular, the API can automatically select the best way to store and solve the systems, depending of the dimension of the system, the number of processes and the main memory of the platform. Experimental results on several parallel platforms report high performance, reaching more than 1 TFLOP with 64 cores to solve a system with more than 200 000 equations and more than 10 000 right-hand side vectors. New version program summaryProgram title: Huge Dense System Solver (HDSS) Catalogue identifier: AEHU_v1_1 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHU_v1_1.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 87 062 No. of bytes in distributed program, including test data, etc.: 1 069 110 Distribution format: tar.gz Programming language: Fortran90, C Computer: Parallel architectures: multiprocessors, computer clusters Operating system
General purpose flow solver applied to flow over hills
Energy Technology Data Exchange (ETDEWEB)
Soerensen, N.N.
1995-09-01
The present report describes the development a 2D and 3D finite-volume code in general curvilinear coordinates using the Basis 2D/3D platform by Michelsen. The codes are based on the Reynolds averaged incompressible isothermal Navier-Stokes equations and use primitive variables (U, V, W and P). The turbulence is modelled by the high Reynolds number {kappa} - {epsilon} model. Cartesian velocity components are used in a non-staggered arrangement following the methodology of Rhie. The equation system is solved using the SIMPLE method of Patankar and Spalding. Solution of the transport equations is obtained by a successive application of a TDMA solver in alternating direction. The solution of the pressure correction equation is accelerated using the multigrid tools from the Basis 2D/3D platform. Additionally a three-level grid sequence is implemented in order to minimize the overall solution time. Higher-order schemes (SUDS and QUICK) are implemented as explicit corrections to a first-order upwind difference scheme. In both the 2D and the 3D code it is possible to handle multiblock configurations. This feature is added in order to obtain a greater geometric flexibility. To mesh natural terrain in connection with atmospheric flow over complex terrain, a two- and a three-dimensional hyperbolic mesh generator are constructed. Additionally, a two- and a three-dimensional mesh generator based on a simple version of the transfinite interpolation technique are implemented. Several two-dimensional test cases are calculated e.g. laminar flow over a circular cylinder, turbulent channel flow, and turbulent flow over a backward facing step, all with satisfying results. In order to illustrate the application of the codes to atmospheric flow two cases are calculated, flow over a cube in a thick turbulent boundary-layer, and the atmospheric flow over the Askervein hill. (au) 13 tabs., 75 ills., 66 refs.
Using Python to Construct a Scalable Parallel Nonlinear Wave Solver
Mandli, Kyle
2011-01-01
Computational scientists seek to provide efficient, easy-to-use tools and frameworks that enable application scientists within a specific discipline to build and/or apply numerical models with up-to-date computing technologies that can be executed on all available computing systems. Although many tools could be useful for groups beyond a specific application, it is often difficult and time consuming to combine existing software, or to adapt it for a more general purpose. Python enables a high-level approach where a general framework can be supplemented with tools written for different fields and in different languages. This is particularly important when a large number of tools are necessary, as is the case for high performance scientific codes. This motivated our development of PetClaw, a scalable distributed-memory solver for time-dependent nonlinear wave propagation, as a case-study for how Python can be used as a highlevel framework leveraging a multitude of codes, efficient both in the reuse of code and programmer productivity. We present scaling results for computations on up to four racks of Shaheen, an IBM BlueGene/P supercomputer at King Abdullah University of Science and Technology. One particularly important issue that PetClaw has faced is the overhead associated with dynamic loading leading to catastrophic scaling. We use the walla library to solve the issue which does so by supplanting high-cost filesystem calls with MPI operations at a low enough level that developers may avoid any changes to their codes.
Directory of Open Access Journals (Sweden)
Mohsin Altaf
2017-09-01
Full Text Available The objective of the study is to investigate the moderating role of affective sentiments of brand psychological ownership of an employee in the relationship among the cognitive sentiments of employee brand understanding and employee brand equity of conventional and Islamic banks. Survey method was adopted to collect data from respondents from conventional and Islamic banks. Data were collected from 279 employees from the banking sector using two-stage probability sampling. Disproportionate stratified random sampling and simple random sampling were employed to collect responses. To analyze the data, multi-group analysis was applied using PLS-SEM technique through SmartPLS 3.0. Results demonstrated that congruence between brand image and individuals has a moderating effect on the relationship between brand confidence and employee brand equity in conventional banking. Responsibility to maintain brand image has a moderating effect on the relationship between brand knowledge and employee brand equity in conventional banking. In case of Islamic banking, only congruence between brand image and individuals exhibited a moderating role on the relationship between brand knowledge and employee brand equity. The importance of brand understanding of employees and psychological ownership of a brand has been widely discussed in branding literature. However, only a few studies investigated the relationship between dimensions of employee brand understanding and the employee brand psychological ownership with employee brand equity. The cognitive and affective sentiments of both exogenous latent constructs, their relationships, and the interaction effect of cognitive and affective sentiments were seldom discussed in branding literature. This study covers the in-depth view and investigation of brand understanding of employ¬ees and the affective and cognitive sentiments of brand psychological ownership with em¬ployee behavior toward a brand. This study also
Energy Technology Data Exchange (ETDEWEB)
Ford, W.E. III; Arwood, J.W.; Greene, N.M.; Moses, D.L.; Petrie, L.M.; Primm, R.T. III; Slater, C.O.; Westfall, R.M.; Wright, R.Q.
1990-09-01
Pseudo-problem-independent, multigroup cross-section libraries were generated to support Advanced Neutron Source (ANS) Reactor design studies. The ANS is a proposed reactor which would be fueled with highly enriched uranium and cooled with heavy water. The libraries, designated ANSL-V (Advanced Neutron Source Cross Section Libraries based on ENDF/B-V), are data bases in AMPX master format for subsequent generation of problem-dependent cross-sections for use with codes such as KENO, ANISN, XSDRNPM, VENTURE, DOT, DORT, TORT, and MORSE. Included in ANSL-V are 99-group and 39-group neutron, 39-neutron-group 44-gamma-ray-group secondary gamma-ray production (SGRP), 44-group gamma-ray interaction (GRI), and coupled, 39-neutron group 44-gamma-ray group (CNG) cross-section libraries. The neutron and SGRP libraries were generated primarily from ENDF/B-V data; the GRI library was generated from DLC-99/HUGO data, which is recognized as the ENDF/B-V photon interaction data. Modules from the AMPX and NJOY systems were used to process the multigroup data. Validity of selected data from the fine- and broad-group neutron libraries was satisfactorily tested in performance parameter calculations.
Energy Technology Data Exchange (ETDEWEB)
Kostorz, G. [Eidgenoessische Technische Hochschule, Angewandte Physik, Zurich (Switzerland)
1996-12-31
While Bragg scattering is characteristic for the average structure of crystals, static local deviations from the average lattice lead to diffuse elastic scattering around and between Bragg peaks. This scattering thus contains information on the occupation of lattice sites by different atomic species and on static local displacements, even in a macroscopically homogeneous crystalline sample. The various diffuse scattering effects, including those around the incident beam (small-angle scattering), are introduced and illustrated by typical results obtained for some Ni alloys. (author) 7 figs., 41 refs.
Haba, Z
2009-02-01
We discuss relativistic diffusion in proper time in the approach of Schay (Ph.D. thesis, Princeton University, Princeton, NJ, 1961) and Dudley [Ark. Mat. 6, 241 (1965)]. We derive (Langevin) stochastic differential equations in various coordinates. We show that in some coordinates the stochastic differential equations become linear. We obtain momentum probability distribution in an explicit form. We discuss a relativistic particle diffusing in an external electromagnetic field. We solve the Langevin equations in the case of parallel electric and magnetic fields. We derive a kinetic equation for the evolution of the probability distribution. We discuss drag terms leading to an equilibrium distribution. The relativistic analog of the Ornstein-Uhlenbeck process is not unique. We show that if the drag comes from a diffusion approximation to the master equation then its form is strongly restricted. The drag leading to the Tsallis equilibrium distribution satisfies this restriction whereas the one of the Jüttner distribution does not. We show that any function of the relativistic energy can be the equilibrium distribution for a particle in a static electric field. A preliminary study of the time evolution with friction is presented. It is shown that the problem is equivalent to quantum mechanics of a particle moving on a hyperboloid with a potential determined by the drag. A relation to diffusions appearing in heavy ion collisions is briefly discussed.
A fast Laplace solver approach to pore scale permeability
Arns, Christoph; Adler, Pierre
2017-04-01
alpha=0.5. Third, the most important test was performed on two types of real media that were used for previous studies. A fracture network measured by FIB/SEM in a low permeability sandstone was used for that purpose; the two dimensionless permeabilities KS and KL are equal to 9.3d-3 and 8.5d-3. Similar calculations were performed on 256 samples of Fontainebleau sandstones and the agreement was in general excellent, except may be for very low permeabilities. To conclude, the Laplace solver is significantly more stable than the lattice Boltzmann approach, uses less memory, and is significantly faster. Permeabilities are in excellent agreement over a wide range of porosities.
Scalable implicit methods for reaction-diffusion equations in two and three space dimensions
Energy Technology Data Exchange (ETDEWEB)
Veronese, S.V.; Othmer, H.G. [Univ. of Utah, Salt Lake City, UT (United States)
1996-12-31
This paper describes the implementation of a solver for systems of semi-linear parabolic partial differential equations in two and three space dimensions. The solver is based on a parallel implementation of a non-linear Alternating Direction Implicit (ADI) scheme which uses a Cartesian grid in space and an implicit time-stepping algorithm. Various reordering strategies for the linearized equations are used to reduce the stride and improve the overall effectiveness of the parallel implementation. We have successfully used this solver for large-scale reaction-diffusion problems in computational biology and medicine in which the desired solution is a traveling wave that may contain rapid transitions. A number of examples that illustrate the efficiency and accuracy of the method are given here; the theoretical analysis will be presented.
Bounded fractional diffusion in geological media: Definition and Lagrangian approximation
Zhang, Yong; Green, Christopher T.; LaBolle, Eric M.; Neupauer, Roseanna M.; Sun, HongGuang
2016-01-01
Spatiotemporal Fractional-Derivative Models (FDMs) have been increasingly used to simulate non-Fickian diffusion, but methods have not been available to define boundary conditions for FDMs in bounded domains. This study defines boundary conditions and then develops a Lagrangian solver to approximate bounded, one-dimensional fractional diffusion. Both the zero-value and non-zero-value Dirichlet, Neumann, and mixed Robin boundary conditions are defined, where the sign of Riemann-Liouville fractional derivative (capturing non-zero-value spatial-nonlocal boundary conditions with directional super-diffusion) remains consistent with the sign of the fractional-diffusive flux term in the FDMs. New Lagrangian schemes are then proposed to track solute particles moving in bounded domains, where the solutions are checked against analytical or Eularian solutions available for simplified FDMs. Numerical experiments show that the particle-tracking algorithm for non-Fickian diffusion differs from Fickian diffusion in relocating the particle position around the reflective boundary, likely due to the non-local and non-symmetric fractional diffusion. For a non-zero-value Neumann or Robin boundary, a source cell with a reflective face can be applied to define the release rate of random-walking particles at the specified flux boundary. Mathematical definitions of physically meaningful nonlocal boundaries combined with bounded Lagrangian solvers in this study may provide the only viable techniques at present to quantify the impact of boundaries on anomalous diffusion, expanding the applicability of FDMs from infinite do mains to those with any size and boundary conditions.
Fork Tensor-Product States: Efficient Multiorbital Real-Time DMFT Solver
Bauernfeind, Daniel; Zingl, Manuel; Triebl, Robert; Aichhorn, Markus; Evertz, Hans Gerd
2017-07-01
We present a tensor network especially suited for multi-orbital Anderson impurity models and as an impurity solver for multi-orbital dynamical mean-field theory (DMFT). The solver works directly on the real-frequency axis and yields high spectral resolution at all frequencies. We use a large number (O (100 )) of bath sites and therefore achieve an accurate representation of the bath. The solver can treat full rotationally invariant interactions with reasonable numerical effort. We show the efficiency and accuracy of the method by a benchmark for the three-orbital test-bed material SrVO3 . There we observe multiplet structures in the high-energy spectrum, which are almost impossible to resolve by other multi-orbital methods. The resulting structure of the Hubbard bands can be described as a broadened atomic spectrum with rescaled interaction parameters. Additional features emerge when U is increased. Finally, we show that our solver can be applied even to models with five orbitals. This impurity solver offers a new route to the calculation of precise real-frequency spectral functions of correlated materials.
Imachi, Hiroto
2015-01-01
Optimally hybrid numerical solvers were constructed for massively parallel generalized eigenvalue problem (GEP).The strong scaling benchmark was carried out on the K computer and other supercomputers for electronic structure calculation problems in the matrix sizes of M = 10^4-10^6 with upto 105 cores. The procedure of GEP is decomposed into the two subprocedures of the reducer to the standard eigenvalue problem (SEP) and the solver of SEP. A hybrid solver is constructed, when a routine is chosen for each subprocedure from the three parallel solver libraries of ScaLAPACK, ELPA and EigenExa. The hybrid solvers with the two newer libraries, ELPA and EigenExa, give better benchmark results than the conventional ScaLAPACK library. The detailed analysis on the results implies that the reducer can be a bottleneck in next-generation (exa-scale) supercomputers, which indicates the guidance for future research. The code was developed as a middleware and a mini-application and will appear online.
A modified global Newton solver for viscous-plastic sea ice models
Mehlmann, C.; Richter, T.
2017-08-01
We present and analyze a modified Newton solver, the so called operator-related damped Jacobian method, with a line search globalization for the solution of the strongly nonlinear momentum equation in a viscous-plastic (VP) sea ice model.Due to large variations in the viscosities, the resulting nonlinear problem is very difficult to solve. The development of fast, robust and converging solvers is subject to present research. There are mainly three approaches for solving the nonlinear momentum equation of the VP model, a fixed-point method denoted as Picard solver, an inexact Newton method and a subcycling procedure based on an elastic-viscous-plastic model approximation. All methods tend to have problems on fine meshes by sharp structures in the solution. Convergence rates deteriorate such that either too many iterations are required to reach sufficient accuracy or convergence is not obtained at all.To improve robustness globalization and acceleration approaches, which increase the area of fast convergence, are needed. We develop an implicit scheme with improved convergence properties by combining an inexact Newton method with a Picard solver. We derive the full Jacobian of the viscous-plastic sea ice momentum equation and show that the Jacobian is a positive definite matrix, guaranteeing global convergence of a properly damped Newton iteration. We compare our modified Newton solver with line search damping to an inexact Newton method with established globalization and acceleration techniques. We present a test case that shows improved robustness of our new approach, in particular on fine meshes.
Fu, X.; Waters, T.; Gary, S. P.
2014-12-01
Collisionless space plasmas often deviate from Maxwellian-like velocity distributions. To study kinetic waves and instabilities in such plasmas, the dispersion relation, which depends on the velocity distribution, needs to be solved numerically. Most current dispersion solvers (e.g. WHAMP) take advantage of mathematical properties of the Gaussian (or generalized Lorentzian) function, and assume that the velocity distributions can be modeled by a combination of several drift-Maxwellian (or drift-Lorentzian) components. In this study we are developing a kinetic dispersion solver that admits nearly arbitrary non-relativistic parallel velocity distributions. A key part of any dispersion solver is the evaluation of a Hilbert transform of the velocity distribution function and its derivative along Landau contours. Our new solver builds upon a recent method to compute the Hilbert transform accurately and efficiently using the fast Fourier transform, while simultaneously treating the singularities arising from resonances analytically. We have benchmarked our new solver against other codes dealing with Maxwellian distributions. As an example usage of our code, we will show results for several instabilities that occur for electron velocity distributions observed in the solar wind.
Finite Element Interface to Linear Solvers (FEI) version 2.9 : users guide and reference manual.
Energy Technology Data Exchange (ETDEWEB)
Williams, Alan B.
2005-02-01
The Finite Element Interface to Linear Solvers (FEI) is a linear system assembly library. Sparse systems of linear equations arise in many computational engineering applications, and the solution of linear systems is often the most computationally intensive portion of the application. Depending on the complexity of problems addressed by the application, there may be no single solver package capable of solving all of the linear systems that arise. This motivates the need to switch an application from one solver library to another, depending on the problem being solved. The interfaces provided by various solver libraries for data assembly and problem solution differ greatly, making it difficult to switch an application code from one library to another. The amount of library-specific code in an application can be greatly reduced by having an abstraction layer that puts a 'common face' on various solver libraries. The FEI has seen significant use by finite element applications at Sandia National Laboratories and Lawrence Livermore National Laboratory. The original FEI offered several advantages over using linear algebra libraries directly, but also imposed significant limitations and disadvantages. A new set of interfaces has been added with the goal of removing the limitations of the original FEI while maintaining and extending its strengths.
Liu, Yang; Michielssen, Eric
2016-01-01
A butterfly-based fast direct integral equation solver for analyzing high-frequency scattering from two-dimensional objects is presented. The solver leverages a randomized butterfly scheme to compress blocks corresponding to near- and far-field interactions in the discretized forward and inverse electric field integral operators. The observed memory requirements and computational cost of the proposed solver scale as O(Nlog^2N) and O(N^1.5 logN), respectively. The solver is applied to the analysis of scattering from electrically large objects spanning over ten thousand of wavelengths and modeled in terms of five million unknowns.
Two-Dimensional Rotating Stall Analysis in a Wide Vaneless Diffuser
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available We report a numerical study on the vaneless diffuser core flow instability in centrifugal compressors. The analysis is performed for the purpose of better understanding of the rotating stall flow mechanism in radial vaneless diffusers. Since the analysis is restricted to the two-dimensional core flow, the effect of the wall boundary layers is neglected. A commercial code with the standard incompressible viscous flow solver is applied to model the vaneless diffuser core flow in the plane parallel to the diffuser walls. At the diffuser inlet, rotating jet-wake velocity pattern is prescribed and at the diffuser outlet constant static pressure is assumed. Under these circumstances, two-dimensional rotating flow instability similar to rotating stall is found to exist. Performed parameter analysis reveals that this instability is strongly influenced by the diffuser geometry and the inlet and outlet flow conditions.
A Novel Partial Differential Algebraic Equation (PDAE) Solver
DEFF Research Database (Denmark)
Lim, Young-il; Chang, Sin-Chung; Jørgensen, Sten Bay
2004-01-01
accuracy and stability. The space-time CE/SE method is successfully implemented to solve PDAE systems through combining an iteration procedure for nonlinear algebraic equations. For illustration, chromatographic adsorption problems including convection, diffusion and reaction terms with a linear......For solving partial differential algebraic equations (PDAEs), the space-time conservation element/solution element (CE/SE) method is addressed in this study. The method of lines (MOL) using an implicit time integrator is compared with the CE/SE method in terms of computational efficiency, solution...
Flutter and Forced Response Analyses of Cascades using a Two-Dimensional Linearized Euler Solver
Reddy, T. S. R.; Srivastava, R.; Mehmed, O.
1999-01-01
Flutter and forced response analyses for a cascade of blades in subsonic and transonic flow is presented. The structural model for each blade is a typical section with bending and torsion degrees of freedom. The unsteady aerodynamic forces due to bending and torsion motions. and due to a vortical gust disturbance are obtained by solving unsteady linearized Euler equations. The unsteady linearized equations are obtained by linearizing the unsteady nonlinear equations about the steady flow. The predicted unsteady aerodynamic forces include the effect of steady aerodynamic loading due to airfoil shape, thickness and angle of attack. The aeroelastic equations are solved in the frequency domain by coupling the un- steady aerodynamic forces to the aeroelastic solver MISER. The present unsteady aerodynamic solver showed good correlation with published results for both flutter and forced response predictions. Further improvements are required to use the unsteady aerodynamic solver in a design cycle.
High-performance small-scale solvers for linear Model Predictive Control
DEFF Research Database (Denmark)
Frison, Gianluca; Sørensen, Hans Henrik Brandenborg; Dammann, Bernd
2014-01-01
In Model Predictive Control (MPC), an optimization problem needs to be solved at each sampling time, and this has traditionally limited use of MPC to systems with slow dynamic. In recent years, there has been an increasing interest in the area of fast small-scale solvers for linear MPC......, with the two main research areas of explicit MPC and tailored on-line MPC. State-of-the-art solvers in this second class can outperform optimized linear-algebra libraries (BLAS) only for very small problems, and do not explicitly exploit the hardware capabilities, relying on compilers for that. This approach...... problems 2 to 8 times faster than the current state-of-the-art solver for this class of problems, and the high-performance is maintained for MPC problems with up to a few hundred states....
A Generic High-performance GPU-based Library for PDE solvers
DEFF Research Database (Denmark)
Glimberg, Stefan Lemvig; Engsig-Karup, Allan Peter
legacy codes are not always easily parallelized and the time spent on conversion might not pay o in the end. We present a highly generic C++ library for fast assembling of partial differential equation (PDE) solvers, aiming at utilizing the computational resources of GPUs. The library requires a minimum......, two important features for ecient GPU utilization and for enabling solution of large problems. In order to solve the large linear systems of equations, arising from the discretization of PDEs, the library includes a set of common iterative solvers. All iterative solvers are based on template arguments...... of fully nonlinear free surface water waves over uneven depths[1, 2, 3]. The wave model is based on the potential ow formulation, with the computational bottleneck of solving a fully three dimensional Laplace problem eciently. A robust h- or p-multigrid preconditioned defect correction method is applied...
Towards Green Multi-frontal Solver for Adaptive Finite Element Method
AbbouEisha, H.
2015-06-01
In this paper we present the optimization of the energy consumption for the multi-frontal solver algorithm executed over two dimensional grids with point singularities. The multi-frontal solver algorithm is controlled by so-called elimination tree, defining the order of elimination of rows from particular frontal matrices, as well as order of memory transfers for Schur complement matrices. For a given mesh there are many possible elimination trees resulting in different number of floating point operations (FLOPs) of the solver or different amount of data trans- ferred via memory transfers. In this paper we utilize the dynamic programming optimization procedure and we compare elimination trees optimized with respect to FLOPs with elimination trees optimized with respect to energy consumption.
A Parallel Multigrid Solver for Viscous Flows on Anisotropic Structured Grids
Prieto, Manuel; Montero, Ruben S.; Llorente, Ignacio M.; Bushnell, Dennis M. (Technical Monitor)
2001-01-01
This paper presents an efficient parallel multigrid solver for speeding up the computation of a 3-D model that treats the flow of a viscous fluid over a flat plate. The main interest of this simulation lies in exhibiting some basic difficulties that prevent optimal multigrid efficiencies from being achieved. As the computing platform, we have used Coral, a Beowulf-class system based on Intel Pentium processors and equipped with GigaNet cLAN and switched Fast Ethernet networks. Our study not only examines the scalability of the solver but also includes a performance evaluation of Coral where the investigated solver has been used to compare several of its design choices, namely, the interconnection network (GigaNet versus switched Fast-Ethernet) and the node configuration (dual nodes versus single nodes). As a reference, the performance results have been compared with those obtained with the NAS-MG benchmark.
Gomez-Sousa, Hipolito; Martinez-Lorenzo, Jose Angel
2015-01-01
The electromagnetic behavior of plasmonic structures can be predicted after discretizing and solving a linear system of equations, derived from a continuous surface integral equation (SIE) and the appropriate boundary conditions, using a method of moments (MoM) methodology. In realistic large-scale optical problems, a direct inversion of the SIE-MoM matrix cannot be performed due to its large size, and an iterative solver must be used instead. This paper investigates the performance of four iterative solvers (GMRES, TFQMR, CGS, and BICGSTAB) for five different SIE-MoM formulations (PMCHWT, JMCFIE, CTF, CNF, and MNMF). Moreover, under this plasmonic context, a set of suggested guidelines are provided to choose a suitable SIE formulation and iterative solver depending on the desired simulation error and available runtime resources.
Deriving all minimal consistency-based diagnosis sets using SAT solvers
Institute of Scientific and Technical Information of China (English)
Xiangfu Zhao; Liming Zhang; Dantong Ouyang; Yu Jiao
2009-01-01
In this paper,a novel method is proposed for judging whether a component set is a consistency-based diagnostic set,using SAT solvers.Firstly,the model of the system to be diagnosed and all the observations are described with conjunctive normal forms (CNF).Then,all the related clauses in the CNF files to the components other than the considered ones are extracted,to be used for satisfiability checking by SAT solvers.Next,all the minimal consistency-based diagnostic sets are derived by the CSSE-tree or by other similar algorithms.We have implemented four related algorithms,by calling the gold medal SAT solver in SAT07 competition - RSAT.Experimental results show that all the minimal consistency-based diagnostic sets can be quickly computed.Especially our CSSE-tree has the best efficiency for the single-or double-fault diagnosis.
Energy Technology Data Exchange (ETDEWEB)
Secher, Bernard [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SFME/LGLS, Bat. 454, F-91191 Gif-sur-Yvette Cedex (France)], E-mail: bsecher@cea.fr; Belliard, Michel [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Cadarache DER/SSTH/LMDL, Bat. 238, F-13108 Saint-Paul-lez-Durance Cedex (France); Calvin, Christophe [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SERMA/LLPR, Bat. 470, F-91191 Gif-sur-Yvette Cedex (France)
2009-01-15
This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost.
A meshless method for compressible flows with the HLLC Riemann solver
Ma, Z H; Qian, L
2014-01-01
The HLLC Riemann solver, which resolves both the shock waves and contact discontinuities, is popular to the computational fluid dynamics community studying compressible flow problems with mesh methods. Although it was reported to be used in meshless methods, the crucial information and procedure to realise this scheme within the framework of meshless methods were not clarified fully. Moreover, the capability of the meshless HLLC solver to deal with compressible liquid flows is not completely clear yet as very few related studies have been reported. Therefore, a comprehensive investigation of a dimensional non-split HLLC Riemann solver for the least-square meshless method is carried out in this study. The stiffened gas equation of state is adopted to capacitate the proposed method to deal with single-phase gases and/or liquids effectively, whilst direct applying the perfect gas equation of state for compressible liquid flows might encounter great difficulties in correlating the state variables. The spatial der...
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
Bickson, Danny; Dolev, Danny
2008-01-01
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic programming problem, which is quadratic in the number of training samples. We introduce an efficient parallel implementation of an support vector regression solver, based on the Gaussian Belief Propagation algorithm (GaBP). In this paper, we demonstrate that methods from the complex system domain could be utilized for performing efficient distributed computation. We compare the proposed algorithm to previously proposed distributed and single-node SVM solvers. Our comparison shows that the proposed algorithm is just as accurate as these solvers, while being significantly faster, especially for large datasets. We demonstrate scalability of the proposed algorithm to up to 1,024 computing nodes and hundreds of thousands of data points using an IBM Blue Gene supercomputer. As far as we know, our work is the largest parallel implementation of bel...
A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements
Chávez, Gustavo
2017-03-17
A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with O(Nlog2N) arithmetic complexity and O(NlogN) memory footprint. We provide a baseline for performance and applicability by comparing with well-known implementations of the $$\\\\mathcal{H}$$ -LU factorization and algebraic multigrid within a shared-memory parallel environment that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable with other fast direct solvers based on Hierarchical Matrices such as $$\\\\mathcal{H}$$ -LU and that it can tackle problems where algebraic multigrid fails to converge.
Solving non-linear Horn clauses using a linear Horn clause solver
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick; Ganty, Pierre
2016-01-01
then proceeds by applying the linearisation transformation and solver for linear Horn clauses to a sequence of sets of clauses with successively increasing dimension bound. The approach is then further developed by using a solution of clauses of lower dimension to (partially) linearise clauses of higher......In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn...... clauses (also called a solver for linear Horn clauses). The program transformation is based on the notion of tree dimension, which we apply to a set of non-linear clauses, yielding a set whose derivation trees have bounded dimension. Such a set of clauses can be linearised. The main algorithm...
Gao, Hao; Phan, Lan; Lin, Yuting
2012-09-01
A graphics processing unit-based parallel multigrid solver for a radiative transfer equation with vacuum boundary condition or reflection boundary condition is presented for heterogeneous media with complex geometry based on two-dimensional triangular meshes or three-dimensional tetrahedral meshes. The computational complexity of this parallel solver is linearly proportional to the degrees of freedom in both angular and spatial variables, while the full multigrid method is utilized to minimize the number of iterations. The overall gain of speed is roughly 30 to 300 fold with respect to our prior multigrid solver, which depends on the underlying regime and the parallelization. The numerical validations are presented with the MATLAB codes at https://sites.google.com/site/rtefastsolver/.
High-performance Parallel Solver for Integral Equations of Electromagnetics Based on Galerkin Method
Kruglyakov, Mikhail
2015-01-01
A new parallel solver for the volumetric integral equations (IE) of electrodynamics is presented. The solver is based on the Galerkin method which ensures the convergent numerical solution. The main features include: 1) the reduction of the memory usage in half, compared to analogous IE based algorithms, without additional restriction on the background media; 2) accurate and stable method to compute matrix coefficients corresponding to the IE; 3) high degree of parallelism. The solver's computational efficiency is shown on a problem of magnetotelluric sounding of the high conductivity contrast media. A good agreement with the results obtained with the second order finite element method is demonstrated. Due to effective approach to parallelization and distributed data storage the program exhibits perfect scalability on different hardware platforms.
The role and status of Euler solvers in impulsive rotor noise computations
Baeder, James D.
1995-01-01
Several recent applications (in the last five years) of Euler solvers in the computation of impulsive noise from rotor blades emphasize their emerging role in complementing other methods and experimental work. In the area of high-speed impulsive noise the use of Euler solvers as research tools has become fairly mature with very favorable comparisons with experimental data, especially in hover. The grid sizes and resulting computational times are reasonable when compared to those required for accurate surface aerodynamics alone. Furthermore, Euler solvers have provided a rich database with the resolution and accuracy needed for input to Kirchhoff and acoustic analogy methods for predicting the far-field noise. On the other hand, the application of Euler solvers to calculate blade-vortex interaction noise is still far from mature. The computational resources required for accurate calculations away from the blade are much larger than for high-speed impulsive noise. Current calculations help improve the basic understanding of the phenomena involved, but to date no comparisons with experiment have been made. Fortunately, the use of coupled Euler solver/Kirchhoff methods seems to offer promise for a robust and efficient technique for predicting both high-speed impulsive noise and blade-vortex interaction noise. Finally, a simple model problem of an isolated vortex interacting with an arbitrarily prescribed pitching airfoil demonstrates the feasibility of using Euler solvers to examine noise reduction techniques. The use of simple aerodynamic quasi-static theory and the computed lift time history as feedback to determine the required pitching motion appears sufficient to significantly dampen the unsteady loading and subsequent acoustics by an order of magnitude within a few blade passages.
A Family of High-Performance Solvers for Linear Model Predictive Control
DEFF Research Database (Denmark)
Frison, Gianluca; Sokoler, Leo Emil; Jørgensen, John Bagterp
2014-01-01
In Model Predictive Control (MPC), an optimization problem has to be solved at each sampling time, and this has traditionally limited the use of MPC to systems with slow dynamic. In this paper, we propose an e_cient solution strategy for the unconstrained sub-problems that give the search......, and techniques such as inexact search direction and mixed precision computation. Finally, we test our HPMPC toolbox, a family of high-performance solvers tailored for MPC and implemented using these techniques, that is shown to be several times faster than current state-of-the-art solvers for linear MPC....
Collier, Nathaniel Oren
2012-03-01
We study the performance of direct solvers on linear systems of equations resulting from isogeometric analysis. The problem of choice is the canonical Laplace equation in three dimensions. From this study we conclude that for a fixed number of unknowns and polynomial degree of approximation, a higher degree of continuity k drastically increases the CPU time and RAM needed to solve the problem when using a direct solver. This paper presents numerical results detailing the phenomenon as well as a theoretical analysis that explains the underlying cause. © 2011 Elsevier B.V.
García-Risueño, Pablo; Oliveira, Micael J T; Andrade, Xavier; Pippig, Michael; Muguerza, Javier; Arruabarrena, Agustin; Rubio, Angel
2012-01-01
We present an analysis of different methods to calculate the classical electrostatic Hartree potential created by charge distributions. Our goal is to provide the reader with an estimation on the performance ---in terms of both numerical complexity and accuracy--- of popular Poisson solvers, and to give an intuitive idea on the way these solvers operate. Highly parallelisable routines have been implemented in the first-principle simulation code Octopus to be used in our tests, so that reliable conclusions about the capability of methods to tackle large systems in cluster computing can be obtained from our work.
Solving non-linear Horn clauses using a linear Horn clause solver
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick; Ganty, Pierre
2016-01-01
In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn...... clauses (also called a solver for linear Horn clauses). The program transformation is based on the notion of tree dimension, which we apply to a set of non-linear clauses, yielding a set whose derivation trees have bounded dimension. Such a set of clauses can be linearised. The main algorithm...
Parallel H1-based auxiliary space AMG solver for H(curl) problems
Energy Technology Data Exchange (ETDEWEB)
Kolev, T V; Vassilevski, P S
2006-06-30
This report describes a parallel implementation of the auxiliary space methods for definite Maxwell problems proposed in [4]. The solver, named AMS, extends our previous study [7]. AMS uses ParCSR sparse matrix storage and the parallel AMG (algebraic multigrid) solver BoomerAMG [1] from the hypre library. It is designed for general unstructured finite element discretizations of (semi)definite H(curl) problems discretized by Nedelec elements. We document the usage of AMS and illustrate its parallel scalability and overall performance.
An accurate predictor-corrector HOC solver for the two dimensional Riemann problem of gas dynamics
Gogoi, Bidyut B.
2016-10-01
The work in the present manuscript is concerned with the simulation of twodimensional (2D) Riemann problem of gas dynamics. We extend our recently developed higher order compact (HOC) method from one-dimensional (1D) to 2D solver and simulate the problem on a square geometry with different initial conditions. The method is fourth order accurate in space and second order accurate in time. We then compare our results with the available benchmark results. The comparison shows an excellent agreement of our results with the existing ones in the literature. Being a finite difference solver, it is quite straight-forward and simple.
Newton-Raphson preconditioner for Krylov type solvers on GPU devices.
Kushida, Noriyuki
2016-01-01
A new Newton-Raphson method based preconditioner for Krylov type linear equation solvers for GPGPU is developed, and the performance is investigated. Conventional preconditioners improve the convergence of Krylov type solvers, and perform well on CPUs. However, they do not perform well on GPGPUs, because of the complexity of implementing powerful preconditioners. The developed preconditioner is based on the BFGS Hessian matrix approximation technique, which is well known as a robust and fast nonlinear equation solver. Because the Hessian matrix in the BFGS represents the coefficient matrix of a system of linear equations in some sense, the approximated Hessian matrix can be a preconditioner. On the other hand, BFGS is required to store dense matrices and to invert them, which should be avoided on modern computers and supercomputers. To overcome these disadvantages, we therefore introduce a limited memory BFGS, which requires less memory space and less computational effort than the BFGS. In addition, a limited memory BFGS can be implemented with BLAS libraries, which are well optimized for target architectures. There are advantages and disadvantages to the Hessian matrix approximation becoming better as the Krylov solver iteration continues. The preconditioning matrix varies through Krylov solver iterations, and only flexible Krylov solvers can work well with the developed preconditioner. The GCR method, which is a flexible Krylov solver, is employed because of the prevalence of GCR as a Krylov solver with a variable preconditioner. As a result of the performance investigation, the new preconditioner indicates the following benefits: (1) The new preconditioner is robust; i.e., it converges while conventional preconditioners (the diagonal scaling, and the SSOR preconditioners) fail. (2) In the best case scenarios, it is over 10 times faster than conventional preconditioners on a CPU. (3) Because it requries only simple operations, it performs well on a GPGPU. In
High-Order Calderón Preconditioned Time Domain Integral Equation Solvers
Valdes, Felipe
2013-05-01
Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.
High-Performance Small-Scale Solvers for Moving Horizon Estimation
DEFF Research Database (Denmark)
Frison, Gianluca; Vukov, Milan; Poulsen, Niels Kjølstad
2015-01-01
In this paper we present a moving horizon estimation (MHE) formulation suitable to easily describe the quadratic programs (QPs) arising in constrained and nonlinear MHE. We propose algorithms for factorization and solution of the underlying Karush-Kuhn-Tucker (KKT) system, as well as the ecient...... implementation techniques focusing on small-scale problems. The proposed MHE solver is implemented using custom linear algebra routines and is compared against implementations using BLAS libraries. Additionally, the MHE solver is interfaced to a code generation tool for nonlinear model predictive control (NMPC...
Directory of Open Access Journals (Sweden)
Ingrid Moons
2015-05-01
Full Text Available An Extended Decomposed Theory of Planned Behaviour (DTPB is developed that integrates emotions towards car driving and electric cars as well as car driving habits of the DTPB, and is empirically validated in a Belgian sample (n = 1023. Multi-group comparisons explore how the determinants of usage intention are different between groups of consumers differing in environmentally-friendly behaviour, environmental concern, innovativeness and personal values. Besides attitudes, media, perceived complexity, compatibility and relative advantage, emotions towards the electric car and reflective emotions towards car driving have a strong effect on usage intention. Car driving habits and perceived behavioural control (facilitators and constraints do not substantially affect usage intention. Only people differing in personal values show a different motivational structure for a number of important drivers of usage intention.
Geiser, Christian; Griffin, Daniel; Shiffman, Saul
2016-01-01
Sometimes, researchers are interested in whether an intervention, experimental manipulation, or other treatment causes changes in intra-individual state variability. The authors show how multigroup-multiphase latent state-trait (MG-MP-LST) models can be used to examine treatment effects with regard to both mean differences and differences in state variability. The approach is illustrated based on a randomized controlled trial in which N = 338 smokers were randomly assigned to nicotine replacement therapy (NRT) vs. placebo prior to quitting smoking. We found that post quitting, smokers in both the NRT and placebo group had significantly reduced intra-individual affect state variability with respect to the affect items calm and content relative to the pre-quitting phase. This reduction in state variability did not differ between the NRT and placebo groups, indicating that quitting smoking may lead to a stabilization of individuals' affect states regardless of whether or not individuals receive NRT.
Directory of Open Access Journals (Sweden)
Christian Geiser
2016-07-01
Full Text Available Sometimes, researchers are interested in whether an intervention, experimental manipulation, or other treatment causes changes in intra-individual state variability. The authors show how multigroup-multiphase latent state-trait (MG-MP-LST models can be used to examine treatment effects with regard to both mean differences and differences in state variability. The approach is illustrated based on a randomized controlled trial in which N = 338 smokers were randomly assigned to nicotine replacement therapy (NRT versus placebo prior to quitting smoking. We found that post quitting, smokers in both the NRT and placebo group had significantly reduced intra-individual affect variability with respect to the affect items calm and content relative to the pre-quitting phase. This reduction in state variability did not differ between the NRT and placebo groups, indicating that quitting smoking may lead to a stabilization of individuals’ affect states regardless of whether or not individuals receive NRT.
Gifford, Kent A; Wareing, Todd A; Failla, Gregory; Horton, John L; Eifel, Patricia J; Mourtada, Firas
2009-12-03
A patient dose distribution was calculated by a 3D multi-group S N particle transport code for intracavitary brachytherapy of the cervix uteri and compared to previously published Monte Carlo results. A Cs-137 LDR intracavitary brachytherapy CT data set was chosen from our clinical database. MCNPX version 2.5.c, was used to calculate the dose distribution. A 3D multi-group S N particle transport code, Attila version 6.1.1 was used to simulate the same patient. Each patient applicator was built in SolidWorks, a mechanical design package, and then assembled with a coordinate transformation and rotation for the patient. The SolidWorks exported applicator geometry was imported into Attila for calculation. Dose matrices were overlaid on the patient CT data set. Dose volume histograms and point doses were compared. The MCNPX calculation required 14.8 hours, whereas the Attila calculation required 22.2 minutes on a 1.8 GHz AMD Opteron CPU. Agreement between Attila and MCNPX dose calculations at the ICRU 38 points was within +/- 3%. Calculated doses to the 2 cc and 5 cc volumes of highest dose differed by not more than +/- 1.1% between the two codes. Dose and DVH overlays agreed well qualitatively. Attila can calculate dose accurately and efficiently for this Cs-137 CT-based patient geometry. Our data showed that a three-group cross-section set is adequate for Cs-137 computations. Future work is aimed at implementing an optimized version of Attila for radiotherapy calculations.
Furuichi, M.
2009-12-01
We are interested in solving a large-scale plate-mantle simulation enables capture of the large and complex deformation of a subducting plate. In our earlier study (Furuichi, et al 2008), we developed a numerical method toward plate-mantle simulation especially for the highly parallel vector supercomputer system (e.g. Earth Simulator). Our scheme is based on the finite volume method combines (i) the multigrid technique together with ACuTE smoother algorithm (Kameyama et al., 2005), and (ii) the low diffusive CIP-CSLR advection. The validity test of our simulation code by using a fluid rope coiling event (Furuichi, et al 2009) showed that our method enable us to reproduce large non-linear deformation problems of a rigid plate surrounded by soft material without serious quantitative errors. Then as a next step, I am trying to create a Stokes flow solver scalable against a large jump in a viscosity profile, for moving surface (geometrically free boundary) problems. It is for solving the Stokes flow motion under the same condition as real earth. In this presentation, I propose to apply BFBt preconditioner and AMG techniques for the problems of large viscosity contrast and moving free surface boundary condition respectively. I would like to show some numerical experiments for a self-gravitating motion of the layered Stokes flow.
Hereditary Diffuse Gastric Cancer
... Hereditary Diffuse Gastric Cancer Request Permissions Hereditary Diffuse Gastric Cancer Approved by the Cancer.Net Editorial Board , 11/2015 What is hereditary diffuse gastric cancer? Hereditary diffuse gastric cancer (HDGC) is an inherited ...
Energy Technology Data Exchange (ETDEWEB)
Abu Saleem, Rabie A., E-mail: raabusaleem@just.edu.jo [Nuclear Engineering Department, Jordan University of Science and Technology, P.O. Box 3030, Irbid 22110 (Jordan); Kozlowski, Tomasz, E-mail: txk@illinois.edu [Department of Nuclear, Plasma and Radiological Engineering, University of Illinois at Urbana-Champaign, 216 Talbot Laboratory, 104 S. Wright St., Urbana, IL 61801 (United States); Shrestha, Rijan, E-mail: rijan.shrestha@intel.com [Portland Technology Development, Intel Corporation, 2501 NW 229th Ave Hillsboro OR 97124 (United States)
2016-05-15
Highlights: • The two-fluid model and the challenges associated with its numerical modeling are investigated. • A high-order solver based on flux limiter schemes and the theta method was developed. • The solver was compared to existing thermal hydraulics codes used in nuclear industry. • The solver was shown to handle fast transients with discontinuities and phase change. - Abstract: Finite volume techniques with staggered mesh are used to develop a new numerical solver for the one-dimensional two-phase two-fluid model using a high-resolution, Total Variation Diminishing (TVD) scheme. The solver is implemented to analyze numerical benchmark problems for verification and testing its abilities to handle discontinuities and fast transients with phase change. Convergence rates are investigated by comparing numerical results to analytical solutions available in literature for the case of the faucet flow problem. The solver based on a new TVD scheme is shown to exhibit higher-order of accuracy compared to other numerical schemes. Mass errors are also examined when phase change occurs for the shock tube problem, and compared to those of the 1st-order upwind scheme implemented in the nuclear thermal-hydraulics code TRACE. The solver is shown to exhibit numerical stability when applied to problems with discontinuous solutions and results of the new solver are free of spurious oscillations.
Diffusion coefficient in photon diffusion theory
Graaff, R; Ten Bosch, JJ
2000-01-01
The choice of the diffusion coefficient to be used in photon diffusion theory has been a subject of discussion in recent publications on tissue optics. We compared several diffusion coefficients with the apparent diffusion coefficient from the more fundamental transport theory, D-app. Application to
Diffusion coefficient in photon diffusion theory
Graaff, R; Ten Bosch, JJ
2000-01-01
The choice of the diffusion coefficient to be used in photon diffusion theory has been a subject of discussion in recent publications on tissue optics. We compared several diffusion coefficients with the apparent diffusion coefficient from the more fundamental transport theory, D-app. Application to
Mixed, Nonsplit, Extended Stability, Stiff Integration of Reaction Diffusion Equations
Alzahrani, Hasnaa H.
2016-07-26
A tailored integration scheme is developed to treat stiff reaction-diffusion prob- lems. The construction adapts a stiff solver, namely VODE, to treat reaction im- plicitly together with explicit treatment of diffusion. The second-order Runge-Kutta- Chebyshev (RKC) scheme is adjusted to integrate diffusion. Spatial operator is de- scretised by second-order finite differences on a uniform grid. The overall solution is advanced over S fractional stiff integrations, where S corresponds to the number of RKC stages. The behavior of the scheme is analyzed by applying it to three simple problems. The results show that it achieves second-order accuracy, thus, preserving the formal accuracy of the original RKC. The presented development sets the stage for future extensions, particularly, to multidimensional reacting flows with detailed chemistry.
Biedron, Robert T.; Vatsa, Veer N.; Atkins, Harold L.
2005-01-01
We apply an unsteady Reynolds-averaged Navier-Stokes (URANS) solver for unstructured grids to unsteady flows on moving and stationary grids. Example problems considered are relevant to active flow control and stability and control. Computational results are presented using the Spalart-Allmaras turbulence model and are compared to experimental data. The effect of grid and time-step refinement are examined.
Parallel FFT-based Poisson Solver for Isolated Three-dimensional Systems
Budiardja, Reuben D
2011-01-01
We describe an implementation to solve Poisson's equation for an isolated system on a unigrid mesh using FFTs. The method solves the equation globally on mesh blocks distributed across multiple processes on a distributed-memory parallel computer. Test results to demonstrate the convergence and scaling properties of the implementation are presented. The solver is offered to interested users as the library PSPFFT.
An approximate Riemann solver for real gas parabolized Navier-Stokes equations
Energy Technology Data Exchange (ETDEWEB)
Urbano, Annafederica, E-mail: annafederica.urbano@uniroma1.it [Dipartimento di Ingegneria Meccanica e Aerospaziale, Sapienza Universita di Roma, Via Eudossiana 18, Roma 00184 (Italy); Nasuti, Francesco, E-mail: francesco.nasuti@uniroma1.it [Dipartimento di Ingegneria Meccanica e Aerospaziale, Sapienza Universita di Roma, Via Eudossiana 18, Roma 00184 (Italy)
2013-01-15
Under specific assumptions, parabolized Navier-Stokes equations are a suitable mean to study channel flows. A special case is that of high pressure flow of real gases in cooling channels where large crosswise gradients of thermophysical properties occur. To solve the parabolized Navier-Stokes equations by a space marching approach, the hyperbolicity of the system of governing equations is obtained, even for very low Mach number flow, by recasting equations such that the streamwise pressure gradient is considered as a source term. For this system of equations an approximate Roe's Riemann solver is developed as the core of a Godunov type finite volume algorithm. The properties of the approximated Riemann solver, which is a modification of Roe's Riemann solver for the parabolized Navier-Stokes equations, are presented and discussed with emphasis given to its original features introduced to handle fluids governed by a generic real gas EoS. Sample solutions are obtained for low Mach number high compressible flows of transcritical methane, heated in straight long channels, to prove the solver ability to describe flows dominated by complex thermodynamic phenomena.
A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments
Energy Technology Data Exchange (ETDEWEB)
Fisicaro, G., E-mail: giuseppe.fisicaro@unibas.ch; Goedecker, S. [Department of Physics, University of Basel, Klingelbergstrasse 82, 4056 Basel (Switzerland); Genovese, L. [University of Grenoble Alpes, CEA, INAC-SP2M, L-Sim, F-38000 Grenoble (France); Andreussi, O. [Institute of Computational Science, Università della Svizzera Italiana, Via Giuseppe Buffi 13, CH-6904 Lugano (Switzerland); Theory and Simulations of Materials (THEOS) and National Centre for Computational Design and Discovery of Novel Materials (MARVEL), École Polytechnique Fédérale de Lausanne, Station 12, CH-1015 Lausanne (Switzerland); Marzari, N. [Theory and Simulations of Materials (THEOS) and National Centre for Computational Design and Discovery of Novel Materials (MARVEL), École Polytechnique Fédérale de Lausanne, Station 12, CH-1015 Lausanne (Switzerland)
2016-01-07
The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.
Heil, Matthias; Hazel, Andrew L.; Boyle, Jonathan
2008-12-01
We compare the relative performance of monolithic and segregated (partitioned) solvers for large- displacement fluid structure interaction (FSI) problems within the framework of oomph-lib, the object-oriented multi-physics finite-element library, available as open-source software at http://www.oomph-lib.org . Monolithic solvers are widely acknowledged to be more robust than their segregated counterparts, but are believed to be too expensive for use in large-scale problems. We demonstrate that monolithic solvers are competitive even for problems in which the fluid solid coupling is weak and, hence, the segregated solvers converge within a moderate number of iterations. The efficient monolithic solution of large-scale FSI problems requires the development of preconditioners for the iterative solution of the linear systems that arise during the solution of the monolithically coupled fluid and solid equations by Newton’s method. We demonstrate that recent improvements to oomph-lib’s FSI preconditioner result in mesh-independent convergence rates under uniform and non-uniform (adaptive) mesh refinement, and explore its performance in a number of two- and three-dimensional test problems involving the interaction of finite-Reynolds-number flows with shell and beam structures, as well as finite-thickness solids.
A Tensor-Train accelerated solver for integral equations in complex geometries
Corona, Eduardo; Rahimian, Abtin; Zorin, Denis
2017-04-01
We present a framework using the Quantized Tensor Train (QTT) decomposition to accurately and efficiently solve volume and boundary integral equations in three dimensions. We describe how the QTT decomposition can be used as a hierarchical compression and inversion scheme for matrices arising from the discretization of integral equations. For a broad range of problems, computational and storage costs of the inversion scheme are extremely modest O (log N) and once the inverse is computed, it can be applied in O (Nlog N) . We analyze the QTT ranks for hierarchically low rank matrices and discuss its relationship to commonly used hierarchical compression techniques such as FMM and HSS. We prove that the QTT ranks are bounded for translation-invariant systems and argue that this behavior extends to non-translation invariant volume and boundary integrals. For volume integrals, the QTT decomposition provides an efficient direct solver requiring significantly less memory compared to other fast direct solvers. We present results demonstrating the remarkable performance of the QTT-based solver when applied to both translation and non-translation invariant volume integrals in 3D. For boundary integral equations, we demonstrate that using a QTT decomposition to construct preconditioners for a Krylov subspace method leads to an efficient and robust solver with a small memory footprint. We test the QTT preconditioners in the iterative solution of an exterior elliptic boundary value problem (Laplace) formulated as a boundary integral equation in complex, multiply connected geometries.
Graph Grammar-Based Multi-Frontal Parallel Direct Solver for Two-Dimensional Isogeometric Analysis
Kuźnik, Krzysztof
2012-06-02
This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence of graph grammar productions generates element frontal matri-ces at leaf nodes, merges matrices at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar productions allows us to explore the concurrency of the algorithm. The graph grammar productions are grouped into sets of independent tasks that can be executed concurrently. The resulting concurrent multi-frontal solver algorithm is implemented and tested on NVIDIA GPU, providing O(NlogN) execution time complexity where N is the number of degrees of freedom. We have confirmed this complexity by solving up to 1 million of degrees of freedom with 448 cores GPU.
Experimental validation of a boundary element solver for exterior acoustic radiation problems
Visser, Rene; Nilsson, A.; Boden, H.
2003-01-01
The relation between harmonic structural vibrations and the corresponding acoustic radiation is given by the Helmholtz integral equation (HIE). To solve this integral equation a new solver (BEMSYS) based on the boundary element method (BEM) has been implemented. This numerical tool can be used for b
Development of a multigrid finite difference solver for benchmark permeability analysis
Loendersloot, Richard; Grouve, Wouter J.B.; Akkerman, Remko; Boer, de André; Michaud, V.
2010-01-01
A finite difference solver, dedicated to flow around fibre architectures is currently being developed. The complexity of the internal geometry of textile reinforcements results in extreme computation times, or inaccurate solutions. A compromise between the two is found by implementing a multigrid al
Modelling dynamic liquid-gas systems: Extensions to the volume-of-fluid solver
CSIR Research Space (South Africa)
Heyns, Johan A
2013-06-01
Full Text Available This study presents the extension of the volume-of-fluid solver, interFoam, for improved accuracy and efficiency when modelling dynamic liquid-gas systems. Examples of these include the transportation of liquids, such as in the case of fuel carried...
Mathematical Tasks without Words and Word Problems: Perceptions of Reluctant Problem Solvers
Holbert, Sydney Margaret
2013-01-01
This qualitative research study used a multiple, holistic case study approach (Yin, 2009) to explore the perceptions of reluctant problem solvers related to mathematical tasks without words and word problems. Participants were given a choice of working a mathematical task without words or a word problem during four problem-solving sessions. Data…
Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers
Woźniak, Maciej
2014-06-01
In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.
Multi-block/multi-core SSOR preconditioner for the QCD quark solver for K computer
Boku, T; Kuramashi, Y; Minami, K; Nakamura, Y; Shoji, F; Takahashi, D; Terai, M; Ukawa, A; Yoshie, T
2012-01-01
We study the algorithmic optimization and performance tuning of the Lattice QCD clover-fermion solver for the K computer. We implement the L\\"uscher's SAP preconditioner with sub-blocking in which the lattice block in a node is further divided to several sub-blocks to extract enough parallelism for the 8-core CPU SPARC64$^{\\mathrm{TM}}$ VIIIfx of the K computer. To achieve a better convergence property we use the symmetric successive over-relaxation (SSOR) iteration with {\\it locally-lexicographical} ordering for the sub-blocks in obtaining the block inverse. The SAP preconditioner is included in the single precision BiCGStab solver of the nested BiCGStab solver. The single precision part of the computational kernel are solely written with the SIMD oriented intrinsics to achieve the best performance of the \\SPARC on the K computer. We benchmark the single precision BiCGStab solver on the three lattice sizes: $12^3\\times 24$, $24^3\\times 48$ and $48^3\\times 96$, with fixing the local lattice size in a node at ...
ROS3P : an accurate third-order Rosenbrock solver designed for parabolic problems
Lang, J.; Verwer, J.G.
2000-01-01
In this note we present a new Rosenbrock solver which is third--order accurate for nonlinear parabolic problems. Since Rosenbrock methods suffer from order reductions when they are applied to partial differential equations, additional order conditions have to be satisfied. Although these conditions
A fast parallel solver for the forward problem in electrical impedance tomography.
Jehl, Markus; Dedner, Andreas; Betcke, Timo; Aristovich, Kirill; Klöfkorn, Robert; Holder, David
2015-01-01
Electrical impedance tomography (EIT) is a noninvasive imaging modality, where imperceptible currents are applied to the skin and the resulting surface voltages are measured. It has the potential to distinguish between ischaemic and haemorrhagic stroke with a portable and inexpensive device. The image reconstruction relies on an accurate forward model of the experimental setup. Because of the relatively small signal in stroke EIT, the finite-element modeling requires meshes of more than 10 million elements. To study the requirements in the forward modeling in EIT and also to reduce the time for experimental image acquisition, it is necessary to reduce the run time of the forward computation. We show the implementation of a parallel forward solver for EIT using the Dune-Fem C++ library and demonstrate its performance on many CPU's of a computer cluster. For a typical EIT application a direct solver was significantly slower and not an alternative to iterative solvers with multigrid preconditioning. With this new solver, we can compute the forward solutions and the Jacobian matrix of a typical EIT application with 30 electrodes on a 15-million element mesh in less than 15 min. This makes it a valuable tool for simulation studies and EIT applications with high precision requirements. It is freely available for download.
WIENER-HOPF SOLVER WITH SMOOTH PROBABILITY DISTRIBUTIONS OF ITS COMPONENTS
Directory of Open Access Journals (Sweden)
Mr. Vladimir A. Smagin
2016-12-01
Full Text Available The Wiener – Hopf solver with smooth probability distributions of its component is presented. The method is based on hyper delta approximations of initial distributions. The use of Fourier series transformation and characteristic function allows working with the random variable method concentrated in transversal axis of absc.
A wavelet-based PWTD algorithm-accelerated time domain surface integral equation solver
Liu, Yang
2015-10-26
© 2015 IEEE. The multilevel plane-wave time-domain (PWTD) algorithm allows for fast and accurate analysis of transient scattering from, and radiation by, electrically large and complex structures. When used in tandem with marching-on-in-time (MOT)-based surface integral equation (SIE) solvers, it reduces the computational and memory costs of transient analysis from equation and equation to equation and equation, respectively, where Nt and Ns denote the number of temporal and spatial unknowns (Ergin et al., IEEE Trans. Antennas Mag., 41, 39-52, 1999). In the past, PWTD-accelerated MOT-SIE solvers have been applied to transient problems involving half million spatial unknowns (Shanker et al., IEEE Trans. Antennas Propag., 51, 628-641, 2003). Recently, a scalable parallel PWTD-accelerated MOT-SIE solver that leverages a hiearchical parallelization strategy has been developed and successfully applied to the transient problems involving ten million spatial unknowns (Liu et. al., in URSI Digest, 2013). We further enhanced the capabilities of this solver by implementing a compression scheme based on local cosine wavelet bases (LCBs) that exploits the sparsity in the temporal dimension (Liu et. al., in URSI Digest, 2014). Specifically, the LCB compression scheme was used to reduce the memory requirement of the PWTD ray data and computational cost of operations in the PWTD translation stage.
Uysal, Ismail Enes
2016-10-01
Plasmonic structures are utilized in many applications ranging from bio-medicine to solar energy generation and transfer. Numerical schemes capable of solving equations of classical electrodynamics have been the method of choice for characterizing scattering properties of such structures. However, as dimensions of these plasmonic structures reduce to nanometer scale, quantum mechanical effects start to appear. These effects cannot be accurately modeled by available classical numerical methods. One of these quantum effects is the tunneling, which is observed when two structures are located within a sub-nanometer distance of each other. At these small distances electrons “jump" from one structure to another and introduce a path for electric current to flow. Classical equations of electrodynamics and the schemes used for solving them do not account for this additional current path. This limitation can be lifted by introducing an auxiliary tunnel with material properties obtained using quantum models and applying a classical solver to the structures connected by this auxiliary tunnel. Early work on this topic focused on quantum models that are generated using a simple one-dimensional wave function to find the tunneling probability and assume a simple Drude model for the permittivity of the tunnel. These tunnel models are then used together with a classical frequency domain solver. In this thesis, a time domain surface integral equation solver for quantum corrected analysis of transient plasmonic interactions is proposed. This solver has several advantages: (i) As opposed to frequency domain solvers, it provides results at a broad band of frequencies with a single simulation. (ii) As opposed to differential equation solvers, it only discretizes surfaces (reducing number of unknowns), enforces the radiation condition implicitly (increasing the accuracy), and allows for time step selection independent of spatial discretization (increasing efficiency). The quantum model
AQUASOL: An efficient solver for the dipolar Poisson–Boltzmann–Langevin equation
Koehl, Patrice; Delarue, Marc
2010-01-01
The Poisson–Boltzmann (PB) formalism is among the most popular approaches to modeling the solvation of molecules. It assumes a continuum model for water, leading to a dielectric permittivity that only depends on position in space. In contrast, the dipolar Poisson–Boltzmann–Langevin (DPBL) formalism represents the solvent as a collection of orientable dipoles with nonuniform concentration; this leads to a nonlinear permittivity function that depends both on the position and on the local electric field at that position. The differences in the assumptions underlying these two models lead to significant differences in the equations they generate. The PB equation is a second order, elliptic, nonlinear partial differential equation (PDE). Its response coefficients correspond to the dielectric permittivity and are therefore constant within each subdomain of the system considered (i.e., inside and outside of the molecules considered). While the DPBL equation is also a second order, elliptic, nonlinear PDE, its response coefficients are nonlinear functions of the electrostatic potential. Many solvers have been developed for the PB equation; to our knowledge, none of these can be directly applied to the DPBL equation. The methods they use may adapt to the difference; their implementations however are PBE specific. We adapted the PBE solver originally developed by Holst and Saied [J. Comput. Chem. 16, 337 (1995)] to the problem of solving the DPBL equation. This solver uses a truncated Newton method with a multigrid preconditioner. Numerical evidences suggest that it converges for the DPBL equation and that the convergence is superlinear. It is found however to be slow and greedy in memory requirement for problems commonly encountered in computational biology and computational chemistry. To circumvent these problems, we propose two variants, a quasi-Newton solver based on a simplified, inexact Jacobian and an iterative self-consistent solver that is based directly on
Transonic Drag Prediction on a DLR-F6 Transport Configuration Using Unstructured Grid Solvers
Lee-Rausch, E. M.; Frink, N. T.; Mavriplis, D. J.; Rausch, R. D.; Milholen, W. E.
2004-01-01
A second international AIAA Drag Prediction Workshop (DPW-II) was organized and held in Orlando Florida on June 21-22, 2003. The primary purpose was to inves- tigate the code-to-code uncertainty. address the sensitivity of the drag prediction to grid size and quantify the uncertainty in predicting nacelle/pylon drag increments at a transonic cruise condition. This paper presents an in-depth analysis of the DPW-II computational results from three state-of-the-art unstructured grid Navier-Stokes flow solvers exercised on similar families of tetrahedral grids. The flow solvers are USM3D - a tetrahedral cell-centered upwind solver. FUN3D - a tetrahedral node-centered upwind solver, and NSU3D - a general element node-centered central-differenced solver. For the wingbody, the total drag predicted for a constant-lift transonic cruise condition showed a decrease in code-to-code variation with grid refinement as expected. For the same flight condition, the wing/body/nacelle/pylon total drag and the nacelle/pylon drag increment predicted showed an increase in code-to-code variation with grid refinement. Although the range in total drag for the wingbody fine grids was only 5 counts, a code-to-code comparison of surface pressures and surface restricted streamlines indicated that the three solvers were not all converging to the same flow solutions- different shock locations and separation patterns were evident. Similarly, the wing/body/nacelle/pylon solutions did not appear to be converging to the same flow solutions. Overall, grid refinement did not consistently improve the correlation with experimental data for either the wingbody or the wing/body/nacelle pylon configuration. Although the absolute values of total drag predicted by two of the solvers for the medium and fine grids did not compare well with the experiment, the incremental drag predictions were within plus or minus 3 counts of the experimental data. The correlation with experimental incremental drag was not
AQUASOL: An efficient solver for the dipolar Poisson-Boltzmann-Langevin equation.
Koehl, Patrice; Delarue, Marc
2010-02-14
The Poisson-Boltzmann (PB) formalism is among the most popular approaches to modeling the solvation of molecules. It assumes a continuum model for water, leading to a dielectric permittivity that only depends on position in space. In contrast, the dipolar Poisson-Boltzmann-Langevin (DPBL) formalism represents the solvent as a collection of orientable dipoles with nonuniform concentration; this leads to a nonlinear permittivity function that depends both on the position and on the local electric field at that position. The differences in the assumptions underlying these two models lead to significant differences in the equations they generate. The PB equation is a second order, elliptic, nonlinear partial differential equation (PDE). Its response coefficients correspond to the dielectric permittivity and are therefore constant within each subdomain of the system considered (i.e., inside and outside of the molecules considered). While the DPBL equation is also a second order, elliptic, nonlinear PDE, its response coefficients are nonlinear functions of the electrostatic potential. Many solvers have been developed for the PB equation; to our knowledge, none of these can be directly applied to the DPBL equation. The methods they use may adapt to the difference; their implementations however are PBE specific. We adapted the PBE solver originally developed by Holst and Saied [J. Comput. Chem. 16, 337 (1995)] to the problem of solving the DPBL equation. This solver uses a truncated Newton method with a multigrid preconditioner. Numerical evidences suggest that it converges for the DPBL equation and that the convergence is superlinear. It is found however to be slow and greedy in memory requirement for problems commonly encountered in computational biology and computational chemistry. To circumvent these problems, we propose two variants, a quasi-Newton solver based on a simplified, inexact Jacobian and an iterative self-consistent solver that is based directly on the PBE
Energy Technology Data Exchange (ETDEWEB)
Na, Y. W.; Park, C. E.; Lee, S. Y. [KOPEC, Daejeon (Korea, Republic of)
2009-10-15
As a part of the Ministry of Knowledge Economy (MKE) project, 'Development of safety analysis codes for nuclear power plants', KOPEC has been developing the hydraulic solver code package applicable to the safety analyses of nuclear power plants (NPP's). The matrices of the hydraulic solver are usually sparse and may be asymmetric. In the earlier stage of this project, typical direct matrix solver packages MA48 and MA28 had been tested as matrix solver for the hydraulic solver code, SPACE. The selection was based on the reasonably reliable performance experience from their former version MA18 in RELAP computer code. In the later stage of this project, the iterative methodologies have been being tested in the SPACE code. Among a few candidate iterative solution methodologies tested so far, the biconjugate gradient stabilization methodology (BICGSTAB) has shown the best performance in the applicability test and in the application to the SPACE code. Regardless of all the merits of using the direct solver packages, there are some other aspects of tackling the iterative solution methodologies. The algorithm is much simpler and easier to handle. The potential problems related to the robustness of the iterative solution methodologies have been resolved by applying pre-conditioning methods adjusted and modified as appropriate to the application in the SPACE code. The application strategy of conjugate gradient method was introduced in detail by Schewchuk, Golub and Saad in the middle of 1990's. The application of his methodology to nuclear engineering in Korea started about the same time and is still going on and there are quite a few examples of application to neutronics. Besides, Yang introduced a conjugate gradient method programmed in C++ language. The purpose of this study is to assess the performance and behavior of the iterative solution methodology compared to those of the direct solution methodology still being preferred due to its robustness and
Adiabatic optimization versus diffusion Monte Carlo methods
Jarret, Michael; Jordan, Stephen P.; Lackey, Brad
2016-10-01
Most experimental and theoretical studies of adiabatic optimization use stoquastic Hamiltonians, whose ground states are expressible using only real nonnegative amplitudes. This raises a question as to whether classical Monte Carlo methods can simulate stoquastic adiabatic algorithms with polynomial overhead. Here we analyze diffusion Monte Carlo algorithms. We argue that, based on differences between L1 and L2 normalized states, these algorithms suffer from certain obstructions preventing them from efficiently simulating stoquastic adiabatic evolution in generality. In practice however, we obtain good performance by introducing a method that we call Substochastic Monte Carlo. In fact, our simulations are good classical optimization algorithms in their own right, competitive with the best previously known heuristic solvers for MAX-k -SAT at k =2 ,3 ,4 .
Quantum Monte Carlo using a Stochastic Poisson Solver
Energy Technology Data Exchange (ETDEWEB)
Das, D; Martin, R M; Kalos, M H
2005-05-06
Quantum Monte Carlo (QMC) is an extremely powerful method to treat many-body systems. Usually quantum Monte Carlo has been applied in cases where the interaction potential has a simple analytic form, like the 1/r Coulomb potential. However, in a complicated environment as in a semiconductor heterostructure, the evaluation of the interaction itself becomes a non-trivial problem. Obtaining the potential from any grid-based finite-difference method, for every walker and every step is unfeasible. We demonstrate an alternative approach of solving the Poisson equation by a classical Monte Carlo within the overall quantum Monte Carlo scheme. We have developed a modified ''Walk On Spheres'' algorithm using Green's function techniques, which can efficiently account for the interaction energy of walker configurations, typical of quantum Monte Carlo algorithms. This stochastically obtained potential can be easily incorporated within popular quantum Monte Carlo techniques like variational Monte Carlo (VMC) or diffusion Monte Carlo (DMC). We demonstrate the validity of this method by studying a simple problem, the polarization of a helium atom in the electric field of an infinite capacitor.
Aricò, Costanza; Lo Re, Carlo
2016-12-01
We extend a recently proposed 2D depth-integrated Finite Volume solver for the nonlinear shallow water equations with non-hydrostatic pressure distribution. The proposed model is aimed at simulating both nonlinear and dispersive shallow water processes. We split the total pressure into its hydrostatic and dynamic components and solve a hydrostatic problem and a non-hydrostatic problem sequentially, in the framework of a fractional time step procedure. The dispersive properties are achieved by incorporating the non-hydrostatic pressure component in the governing equations. The governing equations are the depth-integrated continuity equation and the depth-integrated momentum equations along the x, y and z directions. Unlike the previous non-hydrostatic shallow water solver, in the z momentum equation, we retain both the vertical local and convective acceleration terms. In the former solver, we keep only the local vertical acceleration term. In this paper, we investigate the effects of these convective terms and the possible improvements of the computed solution when these terms are not neglected in the governing equations, especially in strongly nonlinear processes. The presence of the convective terms in the vertical momentum equation leads to a numerical solution procedure, which is quite different from the one of the previous solver, in both the hydrostatic and dynamic steps. We discretize the spatial domain using unstructured triangular meshes satisfying the Generalized Delaunay property. The numerical solver is shock capturing and easily addresses wetting/drying problems, without any additional equation to solve at wet/dry interfaces. We present several numerical applications for challenging flooding processes encountered in practical aspects over irregular topography, including a new set of experiments carried out at the Hydraulics Laboratory of the University of Palermo.
Directory of Open Access Journals (Sweden)
Jürgen eSchmidhuber
2013-06-01
Full Text Available Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. The novel algorithmic framework POWERPLAY (2011 continually searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Wow-effects are achieved by continually making previously learned skills more efficient such that they require less time and space. New skills may (partially re-use previously learned skills. POWERPLAY's search orders candidate pairs of tasks and solver modifications by their conditional computational (time & space complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. The computational costs of validating new tasks need not grow with task repertoire size. POWERPLAY's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Goedel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing repertoire of problem solving procedures can be exploited by a parallel search for solutions to additional externally posed tasks. POWERPLAY may be viewed as a greedy but practical implementation of basic principles of creativity. A first experimental analysis can be found in separate papers [58, 56, 57].
Large-scale 3-D EM modelling with a Block Low-Rank multifrontal direct solver
Shantsev, Daniil V.; Jaysaval, Piyoosh; de la Kethulle de Ryhove, Sébastien; Amestoy, Patrick R.; Buttari, Alfredo; L'Excellent, Jean-Yves; Mary, Theo
2017-06-01
We put forward the idea of using a Block Low-Rank (BLR) multifrontal direct solver to efficiently solve the linear systems of equations arising from a finite-difference discretization of the frequency-domain Maxwell equations for 3-D electromagnetic (EM) problems. The solver uses a low-rank representation for the off-diagonal blocks of the intermediate dense matrices arising in the multifrontal method to reduce the computational load. A numerical threshold, the so-called BLR threshold, controlling the accuracy of low-rank representations was optimized by balancing errors in the computed EM fields against savings in floating point operations (flops). Simulations were carried out over large-scale 3-D resistivity models representing typical scenarios for marine controlled-source EM surveys, and in particular the SEG SEAM model which contains an irregular salt body. The flop count, size of factor matrices and elapsed run time for matrix factorization are reduced dramatically by using BLR representations and can go down to, respectively, 10, 30 and 40 per cent of their full-rank values for our largest system with N = 20.6 million unknowns. The reductions are almost independent of the number of MPI tasks and threads at least up to 90 × 10 = 900 cores. The BLR savings increase for larger systems, which reduces the factorization flop complexity from O(N2) for the full-rank solver to O(Nm) with m = 1.4-1.6. The BLR savings are significantly larger for deep-water environments that exclude the highly resistive air layer from the computational domain. A study in a scenario where simulations are required at multiple source locations shows that the BLR solver can become competitive in comparison to iterative solvers as an engine for 3-D controlled-source electromagnetic Gauss-Newton inversion that requires forward modelling for a few thousand right-hand sides.
Partitioned coupling of advection-diffusion-reaction systems and Brinkman flows
Lenarda, Pietro; Paggi, Marco; Ruiz Baier, Ricardo
2017-09-01
We present a partitioned algorithm aimed at extending the capabilities of existing solvers for the simulation of coupled advection-diffusion-reaction systems and incompressible, viscous flow. The space discretisation of the governing equations is based on mixed finite element methods defined on unstructured meshes, whereas the time integration hinges on an operator splitting strategy that exploits the differences in scales between the reaction, advection, and diffusion processes, considering the global system as a number of sequentially linked sets of partial differential, and algebraic equations. The flow solver presents the advantage that all unknowns in the system (here vorticity, velocity, and pressure) can be fully decoupled and thus turn the overall scheme very attractive from the computational perspective. The robustness of the proposed method is illustrated with a series of numerical tests in 2D and 3D, relevant in the modelling of bacterial bioconvection and Boussinesq systems.
Frickenhaus, Stephan; Hiller, Wolfgang; Best, Meike
The portable software FoSSI is introduced that—in combination with additional free solver software packages—allows for an efficient and scalable parallel solution of large sparse linear equations systems arising in finite element model codes. FoSSI is intended to support rapid model code development, completely hiding the complexity of the underlying solver packages. In particular, the model developer need not be an expert in parallelization and is yet free to switch between different solver packages by simple modifications of the interface call. FoSSI offers an efficient and easy, yet flexible interface to several parallel solvers, most of them available on the web, such as PETSC, AZTEC, MUMPS, PILUT and HYPRE. FoSSI makes use of the concept of handles for vectors, matrices, preconditioners and solvers, that is frequently used in solver libraries. Hence, FoSSI allows for a flexible treatment of several linear equations systems and associated preconditioners at the same time, even in parallel on separate MPI-communicators. The second special feature in FoSSI is the task specifier, being a combination of keywords, each configuring a certain phase in the solver setup. This enables the user to control a solver over one unique subroutine. Furthermore, FoSSI has rather similar features for all solvers, making a fast solver intercomparison or exchange an easy task. FoSSI is a community software, proven in an adaptive 2D-atmosphere model and a 3D-primitive equation ocean model, both formulated in finite elements. The present paper discusses perspectives of an OpenMP-implementation of parallel iterative solvers based on domain decomposition methods. This approach to OpenMP solvers is rather attractive, as the code for domain-local operations of factorization, preconditioning and matrix-vector product can be readily taken from a sequential implementation that is also suitable to be used in an MPI-variant. Code development in this direction is in an advanced state under
Multiscale integration schemes for jump-diffusion systems
Energy Technology Data Exchange (ETDEWEB)
Givon, D.; Kevrekidis, I.G.
2008-12-09
We study a two-time-scale system of jump-diffusion stochastic differential equations. We analyze a class of multiscale integration methods for these systems, which, in the spirit of [1], consist of a hybridization between a standard solver for the slow components and short runs for the fast dynamics, which are used to estimate the effect that the fast components have on the slow ones. We obtain explicit bounds for the discrepancy between the results of the multiscale integration method and the slow components of the original system.
A localized meshless method for diffusion on folded surfaces
Cheung, Ka Chun; Ling, Leevan; Ruuth, Steven J.
2015-09-01
Partial differential equations (PDEs) on surfaces arise in a variety of application areas including biological systems, medical imaging, fluid dynamics, mathematical physics, image processing and computer graphics. In this paper, we propose a radial basis function (RBF) discretization of the closest point method. The corresponding localized meshless method may be used to approximate diffusion on smooth or folded surfaces. Our method has the benefit of having an a priori error bound in terms of percentage of the norm of the solution. A stable solver is used to avoid the ill-conditioning that arises when the radial basis functions (RBFs) become flat.
An accurate solver for forward and inverse transport
Monard, François; Bal, Guillaume
2010-07-01
This paper presents a robust and accurate way to solve steady-state linear transport (radiative transfer) equations numerically. Our main objective is to address the inverse transport problem, in which the optical parameters of a domain of interest are reconstructed from measurements performed at the domain's boundary. This inverse problem has important applications in medical and geophysical imaging, and more generally in any field involving high frequency waves or particles propagating in scattering environments. Stable solutions of the inverse transport problem require that the singularities of the measurement operator, which maps the optical parameters to the available measurements, be captured with sufficient accuracy. This in turn requires that the free propagation of particles be calculated with care, which is a difficult problem on a Cartesian grid. A standard discrete ordinates method is used for the direction of propagation of the particles. Our methodology to address spatial discretization is based on rotating the computational domain so that each direction of propagation is always aligned with one of the grid axes. Rotations are performed in the Fourier domain to achieve spectral accuracy. The numerical dispersion of the propagating particles is therefore minimal. As a result, the ballistic and single scattering components of the transport solution are calculated robustly and accurately. Physical blurring effects, such as small angular diffusion, are also incorporated into the numerical tool. Forward and inverse calculations performed in a two-dimensional setting exemplify the capabilities of the method. Although the methodology might not be the fastest way to solve transport equations, its physical accuracy provides us with a numerical tool to assess what can and cannot be reconstructed in inverse transport theory.
Elimination of numerical diffusion in 1 - phase and 2 - phase flows
Energy Technology Data Exchange (ETDEWEB)
Rajamaeki, M. [VTT Energy (Finland)
1997-07-01
The new hydraulics solution method PLIM (Piecewise Linear Interpolation Method) is capable of avoiding the excessive errors, numerical diffusion and also numerical dispersion. The hydraulics solver CFDPLIM uses PLIM and solves the time-dependent one-dimensional flow equations in network geometry. An example is given for 1-phase flow in the case when thermal-hydraulics and reactor kinetics are strongly coupled. Another example concerns oscillations in 2-phase flow. Both the example computations are not possible with conventional methods.
SYN3D: a single-channel, spatial flux synthesis code for diffusion theory calculations
Energy Technology Data Exchange (ETDEWEB)
Adams, C. H.
1976-07-01
This report is a user's manual for SYN3D, a computer code which uses single-channel, spatial flux synthesis to calculate approximate solutions to two- and three-dimensional, finite-difference, multigroup neutron diffusion theory equations. SYN3D is designed to run in conjunction with any one of several one- and two-dimensional, finite-difference codes (required to generate the synthesis expansion functions) currently being used in the fast reactor community. The report describes the theory and equations, the use of the code, and the implementation on the IBM 370/195 and CDC 7600 of the version of SYN3D available through the Argonne Code Center.
Diffusion archeology for diffusion progression history reconstruction.
Sefer, Emre; Kingsford, Carl
2016-11-01
Diffusion through graphs can be used to model many real-world processes, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring - perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need to reconstruct how the present state of the diffusion came to be from partial diffusion data. Here, we tackle the problem of reconstructing a diffusion history from one or more snapshots of the diffusion state. This ability can be invaluable to learn when certain computer nodes are infected or which people are the initial disease spreaders to control future diffusions. We formulate this problem over discrete-time SEIRS-type diffusion models in terms of maximum likelihood. We design methods that are based on submodularity and a novel prize-collecting dominating-set vertex cover (PCDSVC) relaxation that can identify likely diffusion steps with some provable performance guarantees. Our methods are the first to be able to reconstruct complete diffusion histories accurately in real and simulated situations. As a special case, they can also identify the initial spreaders better than the existing methods for that problem. Our results for both meme and contaminant diffusion show that the partial diffusion data problem can be overcome with proper modeling and methods, and that hidden temporal characteristics of diffusion can be predicted from limited data.
DEFF Research Database (Denmark)
Pang, Kar Mun; Ivarsson, Anders; Haider, Sajjad
2013-01-01
is henceforth addressed as radiationReactingLTSFoam (rareLTSFoam). A performance benchmarking exercise is here carried out to evaluate the effect of each LTS parameter on calculation stability, results accuracy and computational runtime. The model validation uses two test cases. The first test case presents...... library in the edcSimpleFoam solver which was introduced during the 6th OpenFOAM workshop is modified and coupled with the current solver. One of the main amendments made is the integration of soot radiation submodel since this is significant in rich flames where soot particles are formed. The new solver...
A Massively Parallel Solver for the Mechanical Harmonic Analysis of Accelerator Cavities
Energy Technology Data Exchange (ETDEWEB)
Kononenko, O. [SLAC National Accelerator Lab., Menlo Park, CA (United States)
2015-02-17
ACE3P is a 3D massively parallel simulation suite that developed at SLAC National Accelerator Laboratory that can perform coupled electromagnetic, thermal and mechanical study. Effectively utilizing supercomputer resources, ACE3P has become a key simulation tool for particle accelerator R and D. A new frequency domain solver to perform mechanical harmonic response analysis of accelerator components is developed within the existing parallel framework. This solver is designed to determine the frequency response of the mechanical system to external harmonic excitations for time-efficient accurate analysis of the large-scale problems. Coupled with the ACE3P electromagnetic modules, this capability complements a set of multi-physics tools for a comprehensive study of microphonics in superconducting accelerating cavities in order to understand the RF response and feedback requirements for the operational reliability of a particle accelerator. (auth)
Linear optical response of finite systems using multishift linear system solvers.
Hübener, Hannes; Giustino, Feliciano
2014-07-28
We discuss the application of multishift linear system solvers to linear-response time-dependent density functional theory. Using this technique the complete frequency-dependent electronic density response of finite systems to an external perturbation can be calculated at the cost of a single solution of a linear system via conjugate gradients. We show that multishift time-dependent density functional theory yields excitation energies and oscillator strengths in perfect agreement with the standard diagonalization of the response matrix (Casida's method), while being computationally advantageous. We present test calculations for benzene, porphin, and chlorophyll molecules. We argue that multishift solvers may find broad applicability in the context of excited-state calculations within density-functional theory and beyond.
Steady-State Anderson Accelerated Coupling of Lattice Boltzmann and Navier–Stokes Solvers
Atanasov, Atanas
2016-10-17
We present an Anderson acceleration-based approach to spatially couple three-dimensional Lattice Boltzmann and Navier–Stokes (LBNS) flow simulations. This allows to locally exploit the computational features of both fluid flow solver approaches to the fullest extent and yields enhanced control to match the LB and NS degrees of freedom within the LBNS overlap layer. Designed for parallel Schwarz coupling, the Anderson acceleration allows for the simultaneous execution of both Lattice Boltzmann and Navier–Stokes solver. We detail our coupling methodology, validate it, and study convergence and accuracy of the Anderson accelerated coupling, considering three steady-state scenarios: plane channel flow, flow around a sphere and channel flow across a porous structure. We find that the Anderson accelerated coupling yields a speed-up (in terms of iteration steps) of up to 40% in the considered scenarios, compared to strictly sequential Schwarz coupling.
Application of wavelets to a Poisson equation solver and its parallel processing
Energy Technology Data Exchange (ETDEWEB)
Tanaka, Nobuatsu [Toshiba Corp., Kawasaki, Kanagawa (Japan)
1998-03-01
This paper describes a powerful and simple new wavelet-based preconditioning method for the CG solvers of Poisson equation. The equation can be solved with an iterative matrix solver, however, in the absence of our method, the computing time will increase exponentially with respect to an increase in grid points. Use of our technique leads to a matrix with a bounded condition number so that computing time is reduced significantly. Results from our numerical experiments confirm the power and accuracy of our wavelet-based preconditioning method. Unlike many preconditioning methods which are not suitable for vector and parallel processing, our algorithm can take advantage of the extra processing capabilities and enhance computing performance. For example, a speed up of over 100 fold can be achieved when solving Poisson equations on a Cray T3D using 128 processors in parallel. (author)
Courant Number and Mach Number Insensitive CE/SE Euler Solvers
Chang, Sin-Chung
2005-01-01
It has been known that the space-time CE/SE method can be used to obtain ID, 2D, and 3D steady and unsteady flow solutions with Mach numbers ranging from 0.0028 to 10. However, it is also known that a CE/SE solution may become overly dissipative when the Mach number is very small. As an initial attempt to remedy this weakness, new 1D Courant number and Mach number insensitive CE/SE Euler solvers are developed using several key concepts underlying the recent successful development of Courant number insensitive CE/SE schemes. Numerical results indicate that the new solvers are capable of resolving crisply a contact discontinuity embedded in a flow with the maximum Mach number = 0.01.
Wang, Xiao-Yen; Chow, Chuen-Yen; Chang, Sin-Chung
1996-01-01
The I-D, quasi I-D and 2-D Euler solvers based on the method of space-time conservation element and solution element are used to simulate various flow phenomena including shock waves, Mach stem, contact surface, expansion waves, and their intersections and reflections. Seven test problems are solved to demonstrate the capability of this method for handling unsteady compressible flows in various configurations. Numerical results so obtained are compared with exact solutions and/or numerical solutions obtained by schemes based on other established computational techniques. Comparisons show that the present Euler solvers can generate highly accurate numerical solutions to complex flow problems in a straightforward manner without using any ad hoc techniques in the scheme.
Direct and inverse solver for the 3D optoacoustic Volterra equation
Stritzel, J; Wollweber, M; Roth, B
2016-01-01
The direct problem of optoacoustic signal generation in biological media consists of solving the inhomogeneous optoacoustic wave equation for an initial acoustic stress profile. In contrast, the mathematically challenging inverse problem requires the reconstruction of the initial stress profile from a proper set of observed signals. In this article, we consider the particular case of a Gaussian transverse irradiation source profile in the paraxial approximation of the wave equation, for which the direct problem along the beam axis can be cast into a linear Volterra integral equation of the second kind. This integral equation can be used in two ways: as a forward solver to predict optoacoustic signals in terms of the direct problem, and as an inverse solver for which we here devise highly efficient numerical schemes used for the reconstruction of initial pressure profiles from observed signals, constituting a methodical progress of computational aspects of optoacoustics. In this regard, we explore the validity...
SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Energy Technology Data Exchange (ETDEWEB)
Li, Xiaoye S.; Demmel, James W.
2002-03-27
In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with focus on scalability issues, and demonstrate the parallel performance and scalability on current machines. The solver is based on sparse Gaussian elimination, with an innovative static pivoting strategy proposed earlier by the authors. The main advantage of static pivoting over classical partial pivoting is that it permits a priori determination of data structures and communication pattern for sparse Gaussian elimination, which makes it more scalable on distributed memory machines. Based on this a priori knowledge, we designed highly parallel and scalable algorithms for both LU decomposition and triangular solve and we show that they are suitable for large-scale distributed memory machines.
Parallel performance of a preconditioned CG solver for unstructured finite element applications
Energy Technology Data Exchange (ETDEWEB)
Shadid, J.N.; Hutchinson, S.A.; Moffat, H.K. [Sandia National Labs., Albuquerque, NM (United States)
1994-12-31
A parallel unstructured finite element (FE) implementation designed for message passing MIMD machines is described. This implementation employs automated problem partitioning algorithms for load balancing unstructured grids, a distributed sparse matrix representation of the global finite element equations and a parallel conjugate gradient (CG) solver. In this paper a number of issues related to the efficient implementation of parallel unstructured mesh applications are presented. These include the differences between structured and unstructured mesh parallel applications, major communication kernels for unstructured CG solvers, automatic mesh partitioning algorithms, and the influence of mesh partitioning metrics on parallel performance. Initial results are presented for example finite element (FE) heat transfer analysis applications on a 1024 processor nCUBE 2 hypercube. Results indicate over 95% scaled efficiencies are obtained for some large problems despite the required unstructured data communication.
Fast 3D EM scattering and radiation solvers based on MLFMA
Institute of Scientific and Technical Information of China (English)
Hu Jun; Nie Zaiping; Lei Lin; Hu Jie; Gong Xiaodong; Zhao Huapeng
2008-01-01
As the fastest integral equation solver to date, the multilevel fast multipole algorithm (MLFMA)has been applied successfully to solve electromagnetic scattering and radiation from 3D electrically large objects.But for very large-scale problems, the storage and CPU time required in MLFMA are still expensive. Fast 3D electromagnetic scattering and radiation solvers are introduced based on MLFMA. A brief review of MLFMA is first given. Then, four fast methods including higher-order MLFMA (HO-MLFMA), fast far field approximation combined with adaptive ray propagation MLFMA (FAFFA-ARP-MLFMA), local MLFMA and parallel MLFMA are introduced. Some typical numerical results demonstrate the efficiency of these fast methods.
A fast, high-order solver for the Grad–Shafranov equation
Energy Technology Data Exchange (ETDEWEB)
Pataki, Andras, E-mail: apataki@apataki.net [Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 (United States); Cerfon, Antoine J., E-mail: cerfon@cims.nyu.edu [Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 (United States); Freidberg, Jeffrey P., E-mail: jpfreid@mit.edu [Plasma Science and Fusion Center, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States); Greengard, Leslie, E-mail: greengard@cims.nyu.edu [Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 (United States); O’Neil, Michael, E-mail: oneil@cims.nyu.edu [Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 (United States)
2013-06-15
We present a new fast solver to calculate fixed-boundary plasma equilibria in toroidally axisymmetric geometries. By combining conformal mapping with Fourier and integral equation methods on the unit disk, we show that high-order accuracy can be achieved for the solution of the equilibrium equation and its first and second derivatives. Smooth arbitrary plasma cross-sections as well as arbitrary pressure and poloidal current profiles are used as initial data for the solver. Equilibria with large Shafranov shifts can be computed without difficulty. Spectral convergence is demonstrated by comparing the numerical solution with a known exact analytic solution. A fusion-relevant example of an equilibrium with a pressure pedestal is also presented.
GPU TECHNOLOGIES EMBODIED IN PARALLEL SOLVERS OF LINEAR ALGEBRAIC EQUATION SYSTEMS
Directory of Open Access Journals (Sweden)
Sidorov Alexander Vladimirovich
2012-10-01
Full Text Available The author reviews existing shareware solvers that are operated by graphical computer devices. The purpose of this review is to explore the opportunities and limitations of the above parallel solvers applicable for resolution of linear algebraic problems that arise at Research and Educational Centre of Computer Modeling at MSUCE, and Research and Engineering Centre STADYO. The author has explored new applications of the GPU in the PETSc suite and compared them with the results generated absent of the GPU. The research is performed within the CUSP library developed to resolve the problems of linear algebra through the application of GPU. The author has also reviewed the new MAGMA project which is analogous to LAPACK for the GPU.
A GPU-enabled Finite Volume solver for global magnetospheric simulations on unstructured grids
Lani, Andrea; Yalim, Mehmet Sarp; Poedts, Stefaan
2014-10-01
This paper describes an ideal Magnetohydrodynamics (MHD) solver for global magnetospheric simulations based on a B1 +B0 splitting approach, which has been implemented within the COOLFluiD platform and adapted to run on modern heterogeneous architectures featuring General Purpose Graphical Processing Units (GPGPUs). The code is based on a state-of-the-art Finite Volume discretization for unstructured grids and either explicit or implicit time integration, suitable for both steady and time accurate problems. Innovative object-oriented design and coding techniques mixing C++ and CUDA are discussed. Performance results of the modified code on single and multiple processors are presented and compared with those provided by the original solver.
A steady-state solver and stability calculator for nonlinear internal wave flows
Viner, Kevin C.; Epifanio, Craig C.; Doyle, James D.
2013-10-01
A steady solver and stability calculator is presented for the problem of nonlinear internal gravity waves forced by topography. Steady-state solutions are obtained using Newton's method, as applied to a finite-difference discretization in terrain-following coordinates. The iteration is initialized using a boundary-inflation scheme, in which the nonlinearity of the flow is gradually increased over the first few Newton steps. The resulting method is shown to be robust over the full range of nonhydrostatic and rotating parameter space. Examples are given for both nonhydrostatic and rotating flows, as well as flows with realistic upstream shear and static stability profiles. With a modest extension, the solver also allows for a linear stability analysis of the steady-state wave fields. Unstable modes are computed using a shifted-inverse method, combined with a parameter-space search over a set of realistic target values. An example is given showing resonant instability in a nonhydrostatic mountain wave.
Solving Lattice QCD systems of equations using mixed precision solvers on GPUs
Clark, M A; Barros, K; Brower, R C; Rebbi, C
2009-01-01
Modern graphics hardware is designed for highly parallel numerical tasks and promises significant cost and performance benefits for many scientific applications. One such application is lattice quantum chromodyamics (lattice QCD), where the main computational challenge is to efficiently solve the discretized Dirac equation in the presence of an SU(3) gauge field. Using NVIDIA's CUDA platform we have implemented a Wilson-Dirac sparse matrix-vector product that performs at up to 36 Gflops, 135 Gflops and 205 Gflops for double, single and half precision respectively on NVIDIA's GeForce GTX 280 GPU. We have developed a new mixed precision approach for Krylov solvers using reliable updates which allows for full double precision accuracy while using only single or half precision arithmetic for the bulk of the computation. The resulting BiCGstab and CG solvers run in excess of 100 Gflops and, in terms of iterations until convergence, perform better than the usual defect-correction approach for mixed precision.
Energy Technology Data Exchange (ETDEWEB)
Duan, Nan [ORNL; Dimitrovski, Aleksandar D [ORNL; Simunovic, Srdjan [ORNL; Sun, Kai [University of Tennessee (UT)
2016-01-01
The development of high-performance computing techniques and platforms has provided many opportunities for real-time or even faster-than-real-time implementation of power system simulations. One approach uses the Parareal in time framework. The Parareal algorithm has shown promising theoretical simulation speedups by temporal decomposing a simulation run into a coarse simulation on the entire simulation interval and fine simulations on sequential sub-intervals linked through the coarse simulation. However, it has been found that the time cost of the coarse solver needs to be reduced to fully exploit the potentials of the Parareal algorithm. This paper studies a Parareal implementation using reduced generator models for the coarse solver and reports the testing results on the IEEE 39-bus system and a 327-generator 2383-bus Polish system model.
Cerroni, D.; Fancellu, L.; Manservisi, S.; Menghini, F.
2016-06-01
In this work we propose to study the behavior of a solid elastic object that interacts with a multiphase flow. Fluid structure interaction and multiphase problems are of great interest in engineering and science because of many potential applications. The study of this interaction by coupling a fluid structure interaction (FSI) solver with a multiphase problem could open a large range of possibilities in the investigation of realistic problems. We use a FSI solver based on a monolithic approach, while the two-phase interface advection and reconstruction is computed in the framework of a Volume of Fluid method which is one of the more popular algorithms for two-phase flow problems. The coupling between the FSI and VOF algorithm is efficiently handled with the use of MEDMEM libraries implemented in the computational platform Salome. The numerical results of a dam break problem over a deformable solid are reported in order to show the robustness and stability of this numerical approach.
Linear optical response of finite systems using multishift linear system solvers
Energy Technology Data Exchange (ETDEWEB)
Hübener, Hannes; Giustino, Feliciano [Department of Materials, University of Oxford, Oxford OX1 3PH (United Kingdom)
2014-07-28
We discuss the application of multishift linear system solvers to linear-response time-dependent density functional theory. Using this technique the complete frequency-dependent electronic density response of finite systems to an external perturbation can be calculated at the cost of a single solution of a linear system via conjugate gradients. We show that multishift time-dependent density functional theory yields excitation energies and oscillator strengths in perfect agreement with the standard diagonalization of the response matrix (Casida's method), while being computationally advantageous. We present test calculations for benzene, porphin, and chlorophyll molecules. We argue that multishift solvers may find broad applicability in the context of excited-state calculations within density-functional theory and beyond.
Gauss-Seidel Accelerated: Implementing Flow Solvers on Field Programmable Gate Arrays
Energy Technology Data Exchange (ETDEWEB)
Chassin, David P.; Armstrong, Peter R.; Chavarría-Miranda, Daniel; Guttromson, Ross T.
2006-06-01
Non-linear steady-state power flow solvers have typically relied on the Newton-Raphson method to efficiently compute solutions on today's computer systems. Field Programmable Gate Array (FPGA) devices, which have recently been integrated into high-performance computers by major computer system vendors, offer an opportunity to significantly increase the performance of power flow solvers. However, only some algorithms are suitable for an FPGA implementation. The Gauss-Seidel method of solving the AC power flow problem is an excellent example of such an opportunity. In this paper we discuss algorithmic design considerations, optimization, implementation, and performance results of the implementation of the Gauss-Seidel method running on a Silicon Graphics Inc. Altix-350 computer equipped with a Xilinx Virtex II 6000 FPGA.
Parallel Computation of the Jacobian Matrix for Nonlinear Equation Solvers Using MATLAB
Rose, Geoffrey K.; Nguyen, Duc T.; Newman, Brett A.
2017-01-01
Demonstrating speedup for parallel code on a multicore shared memory PC can be challenging in MATLAB due to underlying parallel operations that are often opaque to the user. This can limit potential for improvement of serial code even for the so-called embarrassingly parallel applications. One such application is the computation of the Jacobian matrix inherent to most nonlinear equation solvers. Computation of this matrix represents the primary bottleneck in nonlinear solver speed such that commercial finite element (FE) and multi-body-dynamic (MBD) codes attempt to minimize computations. A timing study using MATLAB's Parallel Computing Toolbox was performed for numerical computation of the Jacobian. Several approaches for implementing parallel code were investigated while only the single program multiple data (spmd) method using composite objects provided positive results. Parallel code speedup is demonstrated but the goal of linear speedup through the addition of processors was not achieved due to PC architecture.
Fostering Creative Problem Solvers in Higher Education: A Response to Complexity of Societies
DEFF Research Database (Denmark)
2016-01-01
Recent studies have emphasized issues of social emergence based on thinking of societies as complex systems. The complexity of professional practice has been recognized as the root of challenges for higher education. To foster creative problem solvers is a key response of higher education in order...... to meet such challenges. This chapter aims to illustrate how to understand: 1) complexity as the nature of professional practice; 2) creative problem solving as the core skill in professional practice; 3) creativity as interplay between persons and their environment; 4) higher education as the context...... of fostering creative problem solvers; and 5) some innovative strategies such as Problem-Based Learning (PBL) and building a learning environment by Information Communication Technology (ICT) as potential strategies of creativity development. Accordingly, this chapter contributes to bridge the complexity...
Analysis of transient plasmonic interactions using an MOT-PMCHWT integral equation solver
Uysal, Ismail Enes
2014-07-01
Device design involving metals and dielectrics at nano-scales and optical frequencies calls for simulation tools capable of analyzing plasmonic interactions. To this end finite difference time domain (FDTD) and finite element methods have been used extensively. Since these methods require volumetric meshes, the discretization size should be very small to accurately resolve fast-decaying fields in the vicinity of metal/dielectric interfaces. This can be avoided using integral equation (IE) techniques that discretize only on the interfaces. Additionally, IE solvers implicitly enforce the radiation condition and consequently do not need (approximate) absorbing boundary conditions. Despite these advantages, IE solvers, especially in time domain, have not been used for analyzing plasmonic interactions.
Object-oriented implementations of the MPDATA advection equation solver in C++, Python and Fortran
Arabas, Sylwester; Jaruga, Anna; Fijałkowski, Maciej
2013-01-01
Three object-oriented implementations of a prototype solver of the advection equation are introduced. Presented programs are based on Blitz++ (C++), NumPy (Python), and Fortran's built-in array containers. The solvers include an implementation of the Multidimensional Positive-Definite Advective Transport Algorithm (MPDATA). The introduced codes exemplify how the application of object-oriented programming (OOP) techniques allows to reproduce the mathematical notation used in the literature within the program code. The introduced codes serve as a basis for discussion on the tradeoffs of the programming language choice. The main angles of comparison are code brevity and syntax clarity (and hence maintainability and auditability) as well as performance. In case of Python, a significant performance gain is observed when switching from the standard interpreter (CPython) to the PyPy implementation of Python. Entire source code of all three implementations is embedded in the text and is licensed under the terms of th...
Energy Technology Data Exchange (ETDEWEB)
Gorodkov, S.S.; Kalugin, M.A. [Nuclear Research Centre ' ' Kurchatov Institute' ' , Moscow (Russian Federation)
2015-09-15
Up to now core calculations with Monte Carlo provided only average cross-sections of mesh cells for further use either in finite difference calculations or as benchmark ones for approximate spectral algorithms. Now MCU code is capable to handle functions, which may be interpreted as average diffusion coefficients. Subsequently the results of finite difference calculations with cells characteristic sets obtained in such a way can be compared with Monte Carlo results as benchmarks, giving reliable information on quality of production code under consideration. As an example of such analysis, the results of mesh calculations with 1-, 2-, 4-, 8- and 12 neutron groups of some model VVER fuel assembly are presented in comparison with the exact Monte Carlo solution. As a second example, an analysis is presented of water gap approximate enlargement between fuel assemblies, allowing VVER core region be covered by regular mesh.
On the application of two-fluid flows solver to the casting problem
Kamran, Kazem; Rossi, Riccardo; Dadvand, Pooyan; Idelsohn Barg, Sergio Rodolfo
2014-01-01
This book presents and discusses mathematical models, numerical methods and computational techniques used for solving coupled problems in science and engineering. It takes a step forward in the formulation and solution of real-life problems with a multidisciplinary vision, accounting for all of the complex couplings involved in the physical description. Simulation of multifaceted physics problems is a common task in applied research and industry. Often a suitable solver is built by connecting...
Predictions of a Supersonic Jet-in-Crossflow: Comparisons Among CFD Solvers and with Experiment
2014-09-01
outflow boundaries were specified as modified Riemann invariants conditions at the freestream flow conditions. The computational inlet is a planar face and...jet-on cases. Figure 6. ARL computational mesh. Figure 7. ARL geometry and mesh in jet nozzle area. D ow nl oa de d by J am es D...The inviscid flux function was a second-order, upwind scheme using a Harten-Lax-van Leer-Contact (HLLC) Riemann solver and a multi- dimensional Total
A semi-direct solver for compressible three-dimensional rotational flow
Chang, S.-C.; Adamczyk, J. J.
1983-01-01
An iterative procedure is presented for solving steady inviscid 3-D subsonic rotational flow problems. The procedure combines concepts from classical secondary flow theory with an extension to 3-D of a novel semi-direct Cauchy-Riemann solver. It is developed for generalized coordinates and can be exercised using standard finite difference procedures. The stability criterion of the iterative procedure is discussed along with its ability to capture the evolution of inviscid secondary flow in a turning channel.
A semi-direct solver for compressible 3-dimensional rotational flow
Chang, S. C.; Adamczyk, J. J.
1983-01-01
An iterative procedure is presented for solving steady inviscid 3-D subsonic rotational flow problems. The procedure combines concepts from classical secondary flow theory with an extension to 3-D of a novel semi-direct Cauchy-Riemann solver. It is developed for generalized coordinates and can be exercised using standard finite difference procedures. The stability criterion of the iterative procedure is discussed along with its ability to capture the evolution of inviscid secondary flow in a turning channel.
Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
Liang, Jia Hui; Ganesh, Vijay; Zulkoski, Ed; Zaman, Atulan; Czarnecki, Krzysztof
2015-01-01
Conflict-Driven Clause-Learning SAT solvers crucially depend on the Variable State Independent Decaying Sum (VSIDS) branching heuristic for their performance. Although VSIDS was proposed nearly fifteen years ago, and many other branching heuristics for SAT solving have since been proposed, VSIDS remains one of the most effective branching heuristics. In this paper, we advance our understanding of VSIDS by answering the following key questions. The first question we pose is "what is special ab...
ROMI 3.1 Least-cost lumber grade mix solver using open source statistical software
Rebecca A. Buck; Urs Buehlmann; R. Edward. Thomas
2010-01-01
The least-cost lumber grade mix solution has been a topic of interest to both industry and academia for many years due to its potential to help wood processing operations reduce costs. A least-cost lumber grade mix solver is a rough mill decision support system that describes the lumber grade or grade mix needed to minimize raw material or total production cost (raw...
libmpdata++ 1.0: a library of parallel MPDATA solvers for systems of generalised transport equations
Directory of Open Access Journals (Sweden)
A. Jaruga
2015-04-01
Full Text Available This paper accompanies the first release of libmpdata++, a C++ library implementing the multi-dimensional positive-definite advection transport algorithm (MPDATA on regular structured grid. The library offers basic numerical solvers for systems of generalised transport equations. The solvers are forward-in-time, conservative and non-linearly stable. The libmpdata++ library covers the basic second-order-accurate formulation of MPDATA, its third-order variant, the infinite-gauge option for variable-sign fields and a flux-corrected transport extension to guarantee non-oscillatory solutions. The library is equipped with a non-symmetric variational elliptic solver for implicit evaluation of pressure gradient terms. All solvers offer parallelisation through domain decomposition using shared-memory parallelisation. The paper describes the library programming interface, and serves as a user guide. Supported options are illustrated with benchmarks discussed in the MPDATA literature. Benchmark descriptions include code snippets as well as quantitative representations of simulation results. Examples of applications include homogeneous transport in one, two and three dimensions in Cartesian and spherical domains; a shallow-water system compared with analytical solution (originally derived for a 2-D case; and a buoyant convection problem in an incompressible Boussinesq fluid with interfacial instability. All the examples are implemented out of the library tree. Regardless of the differences in the problem dimensionality, right-hand-side terms, boundary conditions and parallelisation approach, all the examples use the same unmodified library, which is a key goal of libmpdata++ design. The design, based on the principle of separation of concerns, prioritises the user and developer productivity. The libmpdata++ library is implemented in C++, making use of the Blitz++ multi-dimensional array containers, and is released as free/libre and open-source software.
A mimetic spectral element solver for the Grad-Shafranov equation
Palha, Artur; Felici, Federico
2015-01-01
In this work we present a robust and accurate arbitrary order solver for the fixed-boundary plasma equilibria in toroidally axisymmetric geometries. To achieve this we apply the mimetic spectral element formulation presented in [56] to the solution of the Grad-Shafranov equation. This approach combines a finite volume discretization with the mixed finite element method. In this way the discrete differential operators ($\
Takahashi, Yusuke
2015-01-01
An analysis model of plasma flow and electromagnetic waves around a reentry vehicle for radio frequency blackout prediction during aerodynamic heating was developed in this study. The model was validated based on experimental results from the radio attenuation measurement program. The plasma flow properties, such as electron number density, in the shock layer and wake region were obtained using a newly developed unstructured grid solver that incorporated real gas effect models ...
A FINITE ELEMENT SOLVER FOR NAVIER-STOKES EQUATIONS VIA VORTICITY AND VELOCITY
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
The incompressible Navier-Stokes equations are solved via variables of vorticity and velocity. Firstly, a rigorous variational framework with the equivalence between the velocity-pressure and the vorticity-velocity formulations is presented in a Lipschitz domain. Next, a class of Galerkin finite element approximations of the corresponding variational form is introduced, and a convergence analysis is given for the Stokes problem. Finally,an iterative finite element solver for the Navier-Stokes problem is proposed.``
libmpdata++ 1.0: a library of parallel MPDATA solvers for systems of generalised transport equations
Jaruga, A.; Arabas, S.; Jarecka, D.; Pawlowska, H.; Smolarkiewicz, P. K.; Waruszewski, M.
2015-04-01
This paper accompanies the first release of libmpdata++, a C++ library implementing the multi-dimensional positive-definite advection transport algorithm (MPDATA) on regular structured grid. The library offers basic numerical solvers for systems of generalised transport equations. The solvers are forward-in-time, conservative and non-linearly stable. The libmpdata++ library covers the basic second-order-accurate formulation of MPDATA, its third-order variant, the infinite-gauge option for variable-sign fields and a flux-corrected transport extension to guarantee non-oscillatory solutions. The library is equipped with a non-symmetric variational elliptic solver for implicit evaluation of pressure gradient terms. All solvers offer parallelisation through domain decomposition using shared-memory parallelisation. The paper describes the library programming interface, and serves as a user guide. Supported options are illustrated with benchmarks discussed in the MPDATA literature. Benchmark descriptions include code snippets as well as quantitative representations of simulation results. Examples of applications include homogeneous transport in one, two and three dimensions in Cartesian and spherical domains; a shallow-water system compared with analytical solution (originally derived for a 2-D case); and a buoyant convection problem in an incompressible Boussinesq fluid with interfacial instability. All the examples are implemented out of the library tree. Regardless of the differences in the problem dimensionality, right-hand-side terms, boundary conditions and parallelisation approach, all the examples use the same unmodified library, which is a key goal of libmpdata++ design. The design, based on the principle of separation of concerns, prioritises the user and developer productivity. The libmpdata++ library is implemented in C++, making use of the Blitz++ multi-dimensional array containers, and is released as free/libre and open-source software.
The value of continuity: Refined isogeometric analysis and fast direct solvers
Garcia, Daniel
2016-08-26
We propose the use of highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, we introduce . C0-separators to reduce the interconnection between degrees of freedom in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method
Parallel satellite orbital situational problems solver for space missions design and control
Atanassov, Atanas Marinov
2016-11-01
Solving different scientific problems for space applications demands implementation of observations, measurements or realization of active experiments during time intervals in which specific geometric and physical conditions are fulfilled. The solving of situational problems for determination of these time intervals when the satellite instruments work optimally is a very important part of all activities on every stage of preparation and realization of space missions. The elaboration of universal, flexible and robust approach for situation analysis, which is easily portable toward new satellite missions, is significant for reduction of missions' preparation times and costs. Every situation problem could be based on one or more situation conditions. Simultaneously solving different kinds of situation problems based on different number and types of situational conditions, each one of them satisfied on different segments of satellite orbit requires irregular calculations. Three formal approaches are presented. First one is related to situation problems description that allows achieving flexibility in situation problem assembling and presentation in computer memory. The second formal approach is connected with developing of situation problem solver organized as processor that executes specific code for every particular situational condition. The third formal approach is related to solver parallelization utilizing threads and dynamic scheduling based on "pool of threads" abstraction and ensures a good load balance. The developed situation problems solver is intended for incorporation in the frames of multi-physics multi-satellite space mission's design and simulation tools.
AQUAgpusph, a new free 3D SPH solver accelerated with OpenCL
Cercos-Pita, J. L.
2015-07-01
In this paper, AQUAgpusph, a new free Smoothed Particle Hydrodynamics (SPH) software accelerated with OpenCL, is described. The main differences and progress with respect to other existing alternatives are considered. These are the use of the Open Computing Language (OpenCL) framework instead of the Compute Unified Device Architecture (CUDA), the implementation of the most popular boundary conditions, the easy customization of the code to different problems, the extensibility with regard to Python scripts, and the runtime output which allows the tracking of simulations in real time, or a higher frequency in saving some results without a significant performance lost. These modifications are shown to improve the solver speed, the results quality, and allow for a wider areas of application. AQUAgpusph has been designed trying to provide researchers and engineers with a valuable tool to test and apply the SPH method. Three practical applications are discussed in detail. The evolution of a dam break is used to quantify and compare the computational performance and modeling accuracy with the most popular SPH Graphics Processing Unit (GPU) accelerated alternatives. The dynamics of a coupled system, a Tuned Liquid Damper (TLD), is discussed in order to show the integration capabilities of the solver with external dynamics. Finally, the sloshing flow inside a nuclear reactor is simulated in order to show the capabilities of the solver to treat 3-D problems with complex geometries and of industrial interest.
Evaluation of parallel direct sparse linear solvers in electromagnetic geophysical problems
Puzyrev, Vladimir; Koric, Seid; Wilkin, Scott
2016-04-01
High performance computing is absolutely necessary for large-scale geophysical simulations. In order to obtain a realistic image of a geologically complex area, industrial surveys collect vast amounts of data making the computational cost extremely high for the subsequent simulations. A major computational bottleneck of modeling and inversion algorithms is solving the large sparse systems of linear ill-conditioned equations in complex domains with multiple right hand sides. Recently, parallel direct solvers have been successfully applied to multi-source seismic and electromagnetic problems. These methods are robust and exhibit good performance, but often require large amounts of memory and have limited scalability. In this paper, we evaluate modern direct solvers on large-scale modeling examples that previously were considered unachievable with these methods. Performance and scalability tests utilizing up to 65,536 cores on the Blue Waters supercomputer clearly illustrate the robustness, efficiency and competitiveness of direct solvers compared to iterative techniques. Wide use of direct methods utilizing modern parallel architectures will allow modeling tools to accurately support multi-source surveys and 3D data acquisition geometries, thus promoting a more efficient use of the electromagnetic methods in geophysics.
Development and validation of a magneto-hydrodynamic solver for blood flow analysis
Energy Technology Data Exchange (ETDEWEB)
Kainz, W; Guag, J; Krauthamer, V; Myklebust, J; Bassen, H; Chang, I [Center for Devices and Radiological Health, FDA, Silver Spring, MD (United States); Benkler, S; Chavannes, N [Schmid and Partner Engineering AG, Zurich (Switzerland); Szczerba, D; Neufeld, E; Kuster, N [Foundation for Research on Information Technology in Society (IT' IS), Zurich (Switzerland); Kim, J H; Sarntinoranont, M, E-mail: wolfgang.kainz@fda.hhs.go [Soft Tissue Mechanics and Drug Delivery Laboratory, Mechanical and Aerospace Engineering, University of Florida, FL (United States)
2010-12-07
The objective of this study was to develop a numerical solver to calculate the magneto-hydrodynamic (MHD) signal produced by a moving conductive liquid, i.e. blood flow in the great vessels of the heart, in a static magnetic field. We believe that this MHD signal is able to non-invasively characterize cardiac blood flow in order to supplement the present non-invasive techniques for the assessment of heart failure conditions. The MHD signal can be recorded on the electrocardiogram (ECG) while the subject is exposed to a strong static magnetic field. The MHD signal can only be measured indirectly as a combination of the heart's electrical signal and the MHD signal. The MHD signal itself is caused by induced electrical currents in the blood due to the moving of the blood in the magnetic field. To characterize and eventually optimize MHD measurements, we developed a MHD solver based on a finite element code. This code was validated against literature, experimental and analytical data. The validation of the MHD solver shows good agreement with all three reference values. Future studies will include the calculation of the MHD signals for anatomical models. We will vary the orientation of the static magnetic field to determine an optimized location for the measurement of the MHD blood flow signal.
Robust Multiscale Iterative Solvers for Nonlinear Flows in Highly Heterogeneous Media
Efendiev, Y.
2012-08-01
In this paper, we study robust iterative solvers for finite element systems resulting in approximation of steady-state Richards\\' equation in porous media with highly heterogeneous conductivity fields. It is known that in such cases the contrast, ratio between the highest and lowest values of the conductivity, can adversely affect the performance of the preconditioners and, consequently, a design of robust preconditioners is important for many practical applications. The proposed iterative solvers consist of two kinds of iterations, outer and inner iterations. Outer iterations are designed to handle nonlinearities by linearizing the equation around the previous solution state. As a result of the linearization, a large-scale linear system needs to be solved. This linear system is solved iteratively (called inner iterations), and since it can have large variations in the coefficients, a robust preconditioner is needed. First, we show that under some assumptions the number of outer iterations is independent of the contrast. Second, based on the recently developed iterative methods, we construct a class of preconditioners that yields convergence rate that is independent of the contrast. Thus, the proposed iterative solvers are optimal with respect to the large variation in the physical parameters. Since the same preconditioner can be reused in every outer iteration, this provides an additional computational savings in the overall solution process. Numerical tests are presented to confirm the theoretical results. © 2012 Global-Science Press.
An asynchronous solver for systems of ODEs linked by a directed tree structure
Small, Scott J.; Jay, Laurent O.; Mantilla, Ricardo; Curtu, Rodica; Cunha, Luciana K.; Fonley, Morgan; Krajewski, Witold F.
2013-03-01
This paper documents our development and evaluation of a numerical solver for systems of sparsely linked ordinary differential equations in which the connectivity between equations is determined by a directed tree. These types of systems arise in distributed hydrological models. The numerical solver is based on dense output Runge-Kutta methods that allow for asynchronous integration. A partition of the system is used to distribute the workload among different processes, enabling a parallel implementation that capitalizes on a distributed memory system. Communication between processes is performed asynchronously. We illustrate the solver capabilities by integrating flow transport equations for a ˜17,000 km2 river basin subdivided into 305,000 sub-watersheds that are interconnected by the river network. Numerical experiments for a few models are performed and the runtimes and scalability on our parallel computer are presented. Efficient numerical integrators such as the one demonstrated here bring closer to reality the goal of implementing fully distributed real-time flood forecasting systems supported by physics based hydrological models and high-quality/high-resolution rainfall products.
Coordinate-Space Hartree-Fock-Bogoliubov Solvers for Superfluid Fermi Systems in Large Boxes
Energy Technology Data Exchange (ETDEWEB)
Pei, J. C. [University of Tennessee (UTK) and Oak Ridge National Laboratory (ORNL); Fann, George I [ORNL; Harrison, Robert J [ORNL; Nazarewicz, W. [University of Tennessee (UTK) and Oak Ridge National Laboratory (ORNL); Hill, Judith C [ORNL; Galindo, Diego A [ORNL; Jia, Jun [ORNL
2012-01-01
The self-consistent Hartree-Fock-Bogoliubov problem in large boxes can be solved accurately in the coordinate space with the recently developed solvers HFB-AX (2D) and MADNESS-HFB (3D). This is essential for the description of superfluid Fermi systems with complicated topologies and significant spatial extend, such as fissioning nuclei, weakly-bound nuclei, nuclear matter in the neutron star rust, and ultracold Fermi atoms in elongated traps. The HFB-AX solver based on B-spline techniques uses a hybrid MPI and OpenMP programming model for parallel computation for distributed parallel computation, within a node multi-threaded LAPACK and BLAS libraries are used to further enable parallel calculations of large eigensystems. The MADNESS-HFB solver uses a novel multi-resolution analysis based adaptive pseudo-spectral techniques to enable fully parallel 3D calculations of very large systems. In this work we present benchmark results for HFB-AX and MADNESS-HFB on ultracold trapped fermions.
Zubair, Mohammad; Nielsen, Eric; Luitjens, Justin; Hammond, Dana
2016-01-01
In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.
Šíp, Viktor
2016-01-01
We present a description and validation of a finite volume solver aimed at solving the problems of microscale urban flows where vegetation is present. The solver is based on the five equation system of Reynolds-averaged Navier-Stokes equations for atmospheric boundary layer flows, which are complemented by the k-epsilon turbulence model. The vegetation is modelled as a porous zone, and the effects of the vegetation are included in the momentum and turbulence equations. A detailed dry deposition model is incorporated in the pollutant transport equation, allowing the investigation of the filtering properties of urban vegetation. The solver is validated on four test cases to assess the components of the model: the flow and pollutant dispersion around the 2D hill, the temporal evolution of the rising thermal bubble, the flow through and around the forest canopy, and a hedgerow filtering the particle-laden flow. Generally good agreement with the measured values or previously computed numerical solution is observed...
A comparison of SuperLU solvers on the intel MIC architecture
Tuncel, Mehmet; Duran, Ahmet; Celebi, M. Serdar; Akaydin, Bora; Topkaya, Figen O.
2016-10-01
In many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2D problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from UFMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential SuperLU benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.
PUFoam : A novel open-source CFD solver for the simulation of polyurethane foams
Karimi, M.; Droghetti, H.; Marchisio, D. L.
2017-08-01
In this work a transient three-dimensional mathematical model is formulated and validated for the simulation of polyurethane (PU) foams. The model is based on computational fluid dynamics (CFD) and is coupled with a population balance equation (PBE) to describe the evolution of the gas bubbles/cells within the PU foam. The front face of the expanding foam is monitored on the basis of the volume-of-fluid (VOF) method using a compressible solver available in OpenFOAM version 3.0.1. The solver is additionally supplemented to include the PBE, solved with the quadrature method of moments (QMOM), the polymerization kinetics, an adequate rheological model and a simple model for the foam thermal conductivity. The new solver is labelled as PUFoam and is, for the first time in this work, validated for 12 different mixing-cup experiments. Comparison of the time evolution of the predicted and experimentally measured density and temperature of the PU foam shows the potentials and limitations of the approach.
Cartesian Mesh Linearized Euler Equations Solver for Aeroacoustic Problems around Full Aircraft
Directory of Open Access Journals (Sweden)
Yuma Fukushima
2015-01-01
Full Text Available The linearized Euler equations (LEEs solver for aeroacoustic problems has been developed on block-structured Cartesian mesh to address complex geometry. Taking advantage of the benefits of Cartesian mesh, we employ high-order schemes for spatial derivatives and for time integration. On the other hand, the difficulty of accommodating curved wall boundaries is addressed by the immersed boundary method. The resulting LEEs solver is robust to complex geometry and numerically efficient in a parallel environment. The accuracy and effectiveness of the present solver are validated by one-dimensional and three-dimensional test cases. Acoustic scattering around a sphere and noise propagation from the JT15D nacelle are computed. The results show good agreement with analytical, computational, and experimental results. Finally, noise propagation around fuselage-wing-nacelle configurations is computed as a practical example. The results show that the sound pressure level below the over-the-wing nacelle (OWN configuration is much lower than that of the conventional DLR-F6 aircraft configuration due to the shielding effect of the OWN configuration.
Notes on the ExactPack Implementation of the DSD Rate Stick Solver
Energy Technology Data Exchange (ETDEWEB)
Kaul, Ann [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-08-01
It has been shown above that the discretization scheme implemented in the ExactPack solver for the DSD Rate Stick equation is consistent with the Rate Stick PDE. In addition, a stability analysis has provided a CFL condition for a stable time step. Together, consistency and stability imply convergence of the scheme, which is expected to be close to first-order in time and second-order in space. It is understood that the nonlinearity of the underlying PDE will affect this rate somewhat. In the solver I implemented in ExactPack, I used the one-sided boundary condition described above at the outer boundary. In addition, I used 80% of the time step calculated in the stability analysis above. By making these two changes, I was able to implement a solver that calculates the solution without any arbitrary limits placed on the values of the curvature at the boundary. Thus, the calculation is driven directly by the conditions at the boundary as formulated in the DSD theory. The chosen scheme is completely coherent and defensible from a mathematical standpoint.
A mimetic spectral element solver for the Grad-Shafranov equation
Palha, A.; Koren, B.; Felici, F.
2016-07-01
In this work we present a robust and accurate arbitrary order solver for the fixed-boundary plasma equilibria in toroidally axisymmetric geometries. To achieve this we apply the mimetic spectral element formulation presented in [56] to the solution of the Grad-Shafranov equation. This approach combines a finite volume discretization with the mixed finite element method. In this way the discrete differential operators (∇, ∇×, ∇ṡ) can be represented exactly and metric and all approximation errors are present in the constitutive relations. The result of this formulation is an arbitrary order method even on highly curved meshes. Additionally, the integral of the toroidal current Jϕ is exactly equal to the boundary integral of the poloidal field over the plasma boundary. This property can play an important role in the coupling between equilibrium and transport solvers. The proposed solver is tested on a varied set of plasma cross sections (smooth and with an X-point) and also for a wide range of pressure and toroidal magnetic flux profiles. Equilibria accurate up to machine precision are obtained. Optimal algebraic convergence rates of order p + 1 and geometric convergence rates are shown for Soloviev solutions (including high Shafranov shifts), field-reversed configuration (FRC) solutions and spheromak analytical solutions. The robustness of the method is demonstrated for non-linear test cases, in particular on an equilibrium solution with a pressure pedestal.
Applications of an implicit HLLC-based Godunov solver for steady state hypersonic problems
Energy Technology Data Exchange (ETDEWEB)
Link, R.A.; Sharman, B. [Martec Limited, Halifax, Nova Scotia (Canada)]. E-mail: rickl@martec.com
2005-07-01
Over the past few years, there has been considerable activity developing research vehicles for studying hypersonic propulsion. Successful launches of the Australian Hyshot and the US Hyper-X vehicles have added a significant amount of flight test data to a field that had previously been limited to numerical simulation. A number of approaches have been proposed for hypersonics propulsion, including attached detonation wave, supersonics combustion, and shock induced combustion. Due to the high cost of developing flight hardware, CFD simulations will continue to be a key tool for investigating the feasibility of these concepts. Capturing the interactions of the vehicle body with the boundary layer and chemical reactions pushes the limits of available modelling tools and computer hardware. Explicit formulations are extremely slow in converging to a steady state; therefore, the use of implicit methods are warranted. An implicit LLC-based Godunov solver has been developed at Martec in collaboration with DRDC Valcartier to solve hypersonic problems with a minimum of CPU time and RAM storage. The solver, Chinook Implicit, is based upon the implicit formulation adopted by Batten et. al. The solver is based on a point implicit Gauss-Seidel method for unstructured grids, and includes fully implicit boundary conditions. Preliminary results for small and large scale inviscid hypersonics problems will be presented. (author)
Directory of Open Access Journals (Sweden)
Jianfei Zhang
2013-01-01
Full Text Available Graphics processing unit (GPU has obtained great success in scientific computations for its tremendous computational horsepower and very high memory bandwidth. This paper discusses the efficient way to implement polynomial preconditioned conjugate gradient solver for the finite element computation of elasticity on NVIDIA GPUs using compute unified device architecture (CUDA. Sliced block ELLPACK (SBELL format is introduced to store sparse matrix arising from finite element discretization of elasticity with fewer padding zeros than traditional ELLPACK-based formats. Polynomial preconditioning methods have been investigated both in convergence and running time. From the overall performance, the least-squares (L-S polynomial method is chosen as a preconditioner in PCG solver to finite element equations derived from elasticity for its best results on different example meshes. In the PCG solver, mixed precision algorithm is used not only to reduce the overall computational, storage requirements and bandwidth but to make full use of the capacity of the GPU devices. With SBELL format and mixed precision algorithm, the GPU-based L-S preconditioned CG can get a speedup of about 7–9 to CPU-implementation.
Optimum plane selection for transport-of-intensity-equation-based solvers.
Martinez-Carranza, J; Falaggis, K; Kozacki, T
2014-10-20
Deterministic single beam phase retrieval techniques based on the transport of intensity equation (TIE) use the axial intensity derivative obtained from a series of intensities recorded along the propagation axis as an input to the TIE-based solver. The common belief is that, when reducing the error present in the axial intensity derivative, there will be minimal error in the retrieved phase. Thus, reported optimization schemes of measurement condition focuses on the minimization of error in the axial intensity derivative. As it is shown in this contribution, this assumption is not correct and leads to underestimating the value of plane separation, which increases the phase retrieval errors and sensitivity to noise of the TIE-based measurement system. Therefore, in this paper, a detailed analysis that shows the existence of an optimal separation that minimizes the error in the retrieved phase for a given TIE-based solver is carried out. The developed model is used to derive analytical expressions that provide an optimal plane separation for a given number of planes and level of noise for the case of equidistant plane separation. The obtained results are derived for the widely used Fourier-transform-based TIE solver, but it is shown that they can also be applied to multigrid-based techniques.
Uysal, Ismail E.
2016-08-09
Transient electromagnetic interactions on plasmonic nanostructures are analyzed by solving the Poggio-Miller-Chan-Harrington-Wu-Tsai (PMCHWT) surface integral equation (SIE). Equivalent (unknown) electric and magnetic current densities, which are introduced on the surfaces of the nanostructures, are expanded using Rao-Wilton-Glisson and polynomial basis functions in space and time, respectively. Inserting this expansion into the PMCHWT-SIE and Galerkin testing the resulting equation at discrete times yield a system of equations that is solved for the current expansion coefficients by a marching on-in-time (MOT) scheme. The resulting MOT-PMCHWT-SIE solver calls for computation of additional convolutions between the temporal basis function and the plasmonic medium\\'s permittivity and Green function. This computation is carried out with almost no additional cost and without changing the computational complexity of the solver. Time-domain samples of the permittivity and the Green function required by these convolutions are obtained from their frequency-domain samples using a fast relaxed vector fitting algorithm. Numerical results demonstrate the accuracy and applicability of the proposed MOT-PMCHWT solver. © 2016 Optical Society of America.
Liu, Yang
2013-07-01
The computational complexity and memory requirements of multilevel plane wave time domain (PWTD)-accelerated marching-on-in-time (MOT)-based surface integral equation (SIE) solvers scale as O(NtNs(log 2)Ns) and O(Ns 1.5); here N t and Ns denote numbers of temporal and spatial basis functions discretizing the current [Shanker et al., IEEE Trans. Antennas Propag., 51, 628-641, 2003]. In the past, serial versions of these solvers have been successfully applied to the analysis of scattering from perfect electrically conducting as well as homogeneous penetrable targets involving up to Ns ≈ 0.5 × 106 and Nt ≈ 10 3. To solve larger problems, parallel PWTD-enhanced MOT solvers are called for. Even though a simple parallelization strategy was demonstrated in the context of electromagnetic compatibility analysis [M. Lu et al., in Proc. IEEE Int. Symp. AP-S, 4, 4212-4215, 2004], by and large, progress in this area has been slow. The lack of progress can be attributed wholesale to difficulties associated with the construction of a scalable PWTD kernel. © 2013 IEEE.
Energy Technology Data Exchange (ETDEWEB)
Moriakov, A. [Russian Research Centre, Kurchatov Institute, Moscow (Russian Federation); Vasyukhno, V.; Netecha, M.; Khacheresov, G. [Research and Development Institute of Power Engineering, Moscow (Russian Federation)
2003-07-01
Powerful supercomputers are available today. MBC-1000M is one of Russian supercomputers that may be used by distant way access. Programs LUCKY and LUCKY{sub C} were created to work for multi-processors systems. These programs have algorithms created especially for these computers and used MPI (message passing interface) service for exchanges between processors. LUCKY may resolved shielding tasks by multigroup discreet ordinate method. LUCKY{sub C} may resolve critical tasks by same method. Only XYZ orthogonal geometry is available. Under little space steps to approximate discreet operator this geometry may be used as universal one to describe complex geometrical structures. Cross section libraries are used up to P8 approximation by Legendre polynomials for nuclear data in GIT format. Programming language is Fortran-90. 'Vector' processors may be used that lets get a time profit up to 30 times. But unfortunately MBC-1000M has not these processors. Nevertheless sufficient value for efficiency of parallel calculations was obtained under 'space' (LUCKY) and 'space and energy' (LUCKY{sub C}) paralleling. AUTOCAD program is used to control geometry after a treatment of input data. Programs have powerful geometry module, it is a beautiful tool to achieve any geometry. Output results may be processed by graphic programs on personal computer. (authors)
Ramírez-Correa, Patricio E; Arenas-Gaitán, Jorge; Rondán-Cataluña, F Javier
2015-01-01
The scope of this study was to evaluate whether the adoption of e-learning in two universities, and in particular, the relationship between the perception of external control and perceived ease of use, is different because of gender differences. The study was carried out with participating students in two different universities, one in Chile and one in Spain. The Technology Acceptance Model was used as a theoretical framework for the study. A multi-group analysis method in partial least squares was employed to relate differences between groups. The four main conclusions of the study are: (1) a version of the Technology Acceptance Model has been successfully used to explain the process of adoption of e-learning at an undergraduate level of study; (2) the finding of a strong and significant relationship between perception of external control and perception of ease of use of the e-learning platform; (3) a significant relationship between perceived enjoyment and perceived ease of use and between results demonstrability and perceived usefulness is found; (4) the study indicates a few statistically significant differences between males and females when adopting an e-learning platform, according to the tested model.
Directory of Open Access Journals (Sweden)
Sharmila Vaz
Full Text Available The relationship between school belongingness and mental health functioning before and after the primary-secondary school transition has not been previously investigated in students with and without disabilities. This study used a prospective longitudinal design to test the bi-directional relationships between these constructs, by surveying 266 students with and without disabilities and their parents, 6-months before and after the transition to secondary school. Cross-lagged multi-group analyses found student perception of belongingness in the final year of primary school to contribute to change in their mental health functioning a year later. The beneficial longitudinal effects of school belongingness on subsequent mental health functioning were evident in all student subgroups; even after accounting for prior mental health scores and the cross-time stability in mental health functioning and school belongingness scores. Findings of the current study substantiate the role of school contextual influences on early adolescent mental health functioning. They highlight the importance for primary and secondary schools to assess students' school belongingness and mental health functioning and transfer these records as part of the transition process, so that appropriate scaffolds are in place to support those in need. Longer term longitudinal studies are needed to increase the understanding of the temporal sequencing between school belongingness and mental health functioning of all mainstream students.