WorldWideScience

Sample records for solving transport equations

  1. Transport equation solving methods

    International Nuclear Information System (INIS)

    Granjean, P.M.

    1984-06-01

    This work is mainly devoted to Csub(N) and Fsub(N) methods. CN method: starting from a lemma stated by Placzek, an equivalence is established between two problems: the first one is defined in a finite medium bounded by a surface S, the second one is defined in the whole space. In the first problem the angular flux on the surface S is shown to be the solution of an integral equation. This equation is solved by Galerkin's method. The Csub(N) method is applied here to one-velocity problems: in plane geometry, slab albedo and transmission with Rayleigh scattering, calculation of the extrapolation length; in cylindrical geometry, albedo and extrapolation length calculation with linear scattering. Fsub(N) method: the basic integral transport equation of the Csub(N) method is integrated on Case's elementary distributions; another integral transport equation is obtained: this equation is solved by a collocation method. The plane problems solved by the Csub(N) method are also solved by the Fsub(N) method. The Fsub(N) method is extended to any polynomial scattering law. Some simple spherical problems are also studied. Chandrasekhar's method, collision probability method, Case's method are presented for comparison with Csub(N) and Fsub(N) methods. This comparison shows the respective advantages of the two methods: a) fast convergence and possible extension to various geometries for Csub(N) method; b) easy calculations and easy extension to polynomial scattering for Fsub(N) method [fr

  2. A method for solving neutron transport equation

    International Nuclear Information System (INIS)

    Dimitrijevic, Z.

    1993-01-01

    The procedure for solving the transport equation by directly integrating for case one-dimensional uniform multigroup medium is shown. The solution is expressed in terms of linear combination of function H n (x,μ), and the coefficient is determined from given conditions. The solution is applied for homogeneous slab of critical thickness. (author)

  3. Solving the equation of neutron transport

    International Nuclear Information System (INIS)

    Nasfi, Rim

    2009-01-01

    This work is devoted to the study of some numerical methods of resolution of the problem of transport of the neutrons. We started by introducing the equation integro-differential transport of the neutrons. Then we applied the finite element method traditional for stationary and nonstationary linear problems in 2D. A great part is reserved for the presentation of the mixed numerical diagram and mixed hybrid with two types of uniform grids: triangular and rectangular. Thereafter we treated some numerical examples by implementations in Matlab in order to test the convergence of each method. To finish, we had results of simulation by the Monte Carlo method on a problem of two-dimensional transport with an aim of comparing them with the results resulting from the finite element method mixed hybrids. Some remarks and prospects conclude this work.

  4. New numerical method for solving the solute transport equation

    International Nuclear Information System (INIS)

    Ross, B.; Koplik, C.M.

    1978-01-01

    The solute transport equation can be solved numerically by approximating the water flow field by a network of stream tubes and using a Green's function solution within each stream tube. Compared to previous methods, this approach permits greater computational efficiency and easier representation of small discontinuities, and the results are easier to interpret physically. The method has been used to study hypothetical sites for disposal of high-level radioactive waste

  5. Deterministic methods to solve the integral transport equation in neutronic

    International Nuclear Information System (INIS)

    Warin, X.

    1993-11-01

    We present a synthesis of the methods used to solve the integral transport equation in neutronic. This formulation is above all used to compute solutions in 2D in heterogeneous assemblies. Three kinds of methods are described: - the collision probability method; - the interface current method; - the current coupling collision probability method. These methods don't seem to be the most effective in 3D. (author). 9 figs

  6. A Photon Free Method to Solve Radiation Transport Equations

    International Nuclear Information System (INIS)

    Chang, B

    2006-01-01

    The multi-group discrete-ordinate equations of radiation transfer is solved for the first time by Newton's method. It is a photon free method because the photon variables are eliminated from the radiation equations to yield a N group XN direction smaller but equivalent system of equations. The smaller set of equations can be solved more efficiently than the original set of equations. Newton's method is more stable than the Semi-implicit Linear method currently used by conventional radiation codes

  7. Modeling Blazar Spectra by Solving an Electron Transport Equation

    Science.gov (United States)

    Lewis, Tiffany; Finke, Justin; Becker, Peter A.

    2018-01-01

    Blazars are luminous active galaxies across the entire electromagnetic spectrum, but the spectral formation mechanisms, especially the particle acceleration, in these sources are not well understood. We develop a new theoretical model for simulating blazar spectra using a self-consistent electron number distribution. Specifically, we solve the particle transport equation considering shock acceleration, adiabatic expansion, stochastic acceleration due to MHD waves, Bohm diffusive particle escape, synchrotron radiation, and Compton radiation, where we implement the full Compton cross-section for seed photons from the accretion disk, the dust torus, and 26 individual broad lines. We used a modified Runge-Kutta method to solve the 2nd order equation, including development of a new mathematical method for normalizing stiff steady-state ordinary differential equations. We show that our self-consistent, transport-based blazar model can qualitatively fit the IR through Fermi g-ray data for 3C 279, with a single-zone, leptonic configuration. We use the solution for the electron distribution to calculate multi-wavelength SED spectra for 3C 279. We calculate the particle and magnetic field energy densities, which suggest that the emitting region is not always in equipartition (a common assumption), but sometimes matter dominated. The stratified broad line region (based on ratios in quasar reverberation mapping, and thus adding no free parameters) improves our estimate of the location of the emitting region, increasing it by ~5x. Our model provides a novel view into the physics at play in blazar jets, especially the relative strength of the shock and stochastic acceleration, where our model is well suited to distinguish between these processes, and we find that the latter tends to dominate.

  8. Numerical method for solving integral equations of neutron transport. II

    International Nuclear Information System (INIS)

    Loyalka, S.K.; Tsai, R.W.

    1975-01-01

    In a recent paper it was pointed out that the weakly singular integral equations of neutron transport can be quite conveniently solved by a method based on subtraction of singularity. This previous paper was devoted entirely to the consideration of simple one-dimensional isotropic-scattering and one-group problems. The present paper constitutes interesting extensions of the previous work in that in addition to a typical two-group anisotropic-scattering albedo problem in the slab geometry, the method is also applied to an isotropic-scattering problem in the x-y geometry. These results are compared with discrete S/sub N/ (ANISN or TWOTRAN-II) results, and for the problems considered here, the proposed method is found to be quite effective. Thus, the method appears to hold considerable potential for future applications. (auth)

  9. Application of Trotter approximation for solving time dependent neutron transport equation

    International Nuclear Information System (INIS)

    Stancic, V.

    1987-01-01

    A method is proposed to solve multigroup time dependent neutron transport equation with arbitrary scattering anisotropy. The recurrence relation thus obtained is simple, numerically stable and especially suitable for treatment of complicated geometries. (author)

  10. The discontinuous finite element method for solving Eigenvalue problems of transport equations

    International Nuclear Information System (INIS)

    Yang, Shulin; Wang, Ruihong

    2011-01-01

    In this paper, the multigroup transport equations for solving the eigenvalues λ and K_e_f_f under two dimensional cylindrical coordinate are discussed. Aimed at the equations, the discretizing way combining discontinuous finite element method (DFE) with discrete ordinate method (SN) is developed, and the iterative algorithms and steps are studied. The numerical results show that the algorithms are efficient. (author)

  11. The H-N method for solving linear transport equation: theory and application

    International Nuclear Information System (INIS)

    Kaskas, A.; Gulecyuz, M.C.; Tezcan, C.

    2002-01-01

    The system of singular integral equation which is obtained from the integro-differential form of the linear transport equation as a result of Placzec lemma is solved. Application are given using the exit distributions and the infinite medium Green's function. The same theoretical results are also obtained with the use of the singular eigenfunction of the method of elementary solutions

  12. Adomian decomposition method for solving the telegraph equation in charged particle transport

    International Nuclear Information System (INIS)

    Abdou, M.A.

    2005-01-01

    In this paper, the analysis for the telegraph equation in case of isotropic small angle scattering from the Boltzmann transport equation for charged particle is presented. The Adomian decomposition is used to solve the telegraph equation. By means of MAPLE the Adomian polynomials of obtained series (ADM) solution have been calculated. The behaviour of the distribution function are shown graphically. The results reported in this article provide further evidence of the usefulness of Adomain decomposition for obtaining solution of linear and nonlinear problems

  13. Normal scheme for solving the transport equation independently of spatial discretization

    International Nuclear Information System (INIS)

    Zamonsky, O.M.

    1993-01-01

    To solve the discrete ordinates neutron transport equation, a general order nodal scheme is used, where nodes are allowed to have different orders of approximation and the whole system reaches a final order distribution. Independence in the election of system discretization and order of approximation is obtained without loss of accuracy. The final equations and the iterative method to reach a converged order solution were implemented in a two-dimensional computer code to solve monoenergetic, isotropic scattering, external source problems. Two benchmark problems were solved using different automatic selection order methods. Results show accurate solutions without spatial discretization, regardless of the initial selection of distribution order. (author)

  14. FMCEIR: a Monte Carlo program for solving the stationary neutron and gamma transport equation

    International Nuclear Information System (INIS)

    Taormina, A.

    1978-05-01

    FMCEIR is a three-dimensional Monte Carlo program for solving the stationary neutron and gamma transport equation. It is used to study the problem of neutron and gamma streaming in the GCFR and HHT reactor channels. (G.T.H.)

  15. Solving the transport equation with quadratic finite elements: Theory and applications

    International Nuclear Information System (INIS)

    Ferguson, J.M.

    1997-01-01

    At the 4th Joint Conference on Computational Mathematics, the author presented a paper introducing a new quadratic finite element scheme (QFEM) for solving the transport equation. In the ensuing year the author has obtained considerable experience in the application of this method, including solution of eigenvalue problems, transmission problems, and solution of the adjoint form of the equation as well as the usual forward solution. He will present detailed results, and will also discuss other refinements of his transport codes, particularly for 3-dimensional problems on rectilinear and non-rectilinear grids

  16. Transport methods: general. 7. Formulation of a Fourier-Boltzmann Transformation to Solve the Three-Dimensional Transport Equation

    International Nuclear Information System (INIS)

    Stancic, V.

    2001-01-01

    This paper presents some elements of a new approach to solve analytically the linearized three-dimensional (3-D) transport equation of neutral particles. Since this task is of such special importance, we present some results of a paper that is still in progress. The most important is that using this transformation, an integro-differential equation with an analytical solution is obtained. For this purpose, a simplest 3-D equation is being considered which describes the transport process in an infinite medium. Until now, this equation has been analytically considered either using the Laplace transform with respect to time parameter t or applying the Fourier transform over the space coordinate. Both of them reduce the number of differential terms in the equation; however, evaluation of the inverse transformation is complicated. In this paper, we introduce for the first time a Fourier transform induced by the Boltzmann operator. For this, we use a complete set of 3-D eigenfunctions of the Boltzmann transport operator defined in a similar way as those that have been already used in 3-D transport theory as a basic set to transform the transport equation. This set consists of a continuous part and a discrete one with spectral measure. The density distribution equation shows the known form asymptotic behavior. Several applications are to be performed using this equation and compared to the benchmark one. Such an analysis certainly would be out of the available space

  17. Comparison of two Ssub(infinity) methods for solving the neutron transport equation

    International Nuclear Information System (INIS)

    Mennig, J.; Brandt, D.; Haelg, W.

    1978-01-01

    A semianalytic method (S 0 sub(infinity)) is presented for solving the monoenergetic multi-region transport equation. This method is compared with results from S 1 sub(infinity)-theory given in the literature. Application of S 1 sub(infinity)-theory to reactor shields may lead to negative neutron fluxes and to flux oscillations. These unphysical effects are completely avoided by the new method. Numerical results demonstrate the limitations of S 1 sub(infinity) and confirm the numerical stability of (S 0 sub(infinity)). (Auth.)

  18. LOCFES-B: Solving the one-dimensional transport equation with user-selected spatial approximations

    International Nuclear Information System (INIS)

    Jarvis, R.D.; Nelson, P.

    1993-01-01

    Closed linear one-cell functional (CLOF) methods constitute an abstractly defined class of spatial approximations to the one-dimensional discrete ordinates equations of linear particle transport that encompass, as specific instances, the vast majority of the spatial approximations that have been either used or suggested in the computational solution of these equations. A specific instance of the class of CLOF methods is defined by a (typically small) number of functions of the cell width, total cross section, and direction cosine of particle motion. The LOCFES code takes advantage of the latter observation by permitting the use, within a more-or-less standard source iteration solution process, of an arbitrary CLOF method as defined by a user-supplied subroutine. The design objective of LOCFES was to provide automated determination of the order of accuracy (i.e., order of the discretization error) in the fine-mesh limit for an arbitrary user-selected CLOF method. This asymptotic order of accuracy is one widely used measure of the merit of a spatial approximation. This paper discusses LOCFES-B, which is a code that uses methods developed in LOCFES to solve one-dimensional linear particle transport problems with any user-selected CLOF method. LOCFES-B provides automatic solution of a given problem to within an accuracy specified by user input and provides comparison of the computational results against results from externally provided benchmark results

  19. Angular finite volume method for solving the multigroup transport equation with piecewise average scattering cross sections

    Energy Technology Data Exchange (ETDEWEB)

    Calloo, A.; Vidal, J.F.; Le Tellier, R.; Rimpault, G., E-mail: ansar.calloo@cea.fr, E-mail: jean-francois.vidal@cea.fr, E-mail: romain.le-tellier@cea.fr, E-mail: gerald.rimpault@cea.fr [CEA, DEN, DER/SPRC/LEPh, Saint-Paul-lez-Durance (France)

    2011-07-01

    This paper deals with the solving of the multigroup integro-differential form of the transport equation for fine energy group structure. In that case, multigroup transfer cross sections display strongly peaked shape for light scatterers and the current Legendre polynomial expansion is not well-suited to represent them. Furthermore, even if considering an exact scattering cross sections representation, the scattering source in the discrete ordinates method (also known as the Sn method) being calculated by sampling the angular flux at given directions, may be wrongly computed due to lack of angular support for the angular flux. Hence, following the work of Gerts and Matthews, an angular finite volume solver has been developed for 2D Cartesian geometries. It integrates the multigroup transport equation over discrete volume elements obtained by meshing the unit sphere with a product grid over the polar and azimuthal coordinates and by considering the integrated flux per solid angle element. The convergence of this method has been compared to the S{sub n} method for a highly anisotropic benchmark. Besides, piecewise-average scattering cross sections have been produced for non-bound Hydrogen atoms using a free gas model for thermal neutrons. LWR lattice calculations comparing Legendre representations of the Hydrogen scattering multigroup cross section at various orders and piecewise-average cross sections for this same atom are carried out (while keeping a Legendre representation for all other isotopes). (author)

  20. A numerical spectral approach to solve the dislocation density transport equation

    International Nuclear Information System (INIS)

    Djaka, K S; Taupin, V; Berbenni, S; Fressengeas, C

    2015-01-01

    A numerical spectral approach is developed to solve in a fast, stable and accurate fashion, the quasi-linear hyperbolic transport equation governing the spatio-temporal evolution of the dislocation density tensor in the mechanics of dislocation fields. The approach relies on using the Fast Fourier Transform algorithm. Low-pass spectral filters are employed to control both the high frequency Gibbs oscillations inherent to the Fourier method and the fast-growing numerical instabilities resulting from the hyperbolic nature of the transport equation. The numerical scheme is validated by comparison with an exact solution in the 1D case corresponding to dislocation dipole annihilation. The expansion and annihilation of dislocation loops in 2D and 3D settings are also produced and compared with finite element approximations. The spectral solutions are shown to be stable, more accurate for low Courant numbers and much less computation time-consuming than the finite element technique based on an explicit Galerkin-least squares scheme. (paper)

  1. Angular finite volume method for solving the multigroup transport equation with piecewise average scattering cross sections

    International Nuclear Information System (INIS)

    Calloo, A.; Vidal, J.F.; Le Tellier, R.; Rimpault, G.

    2011-01-01

    This paper deals with the solving of the multigroup integro-differential form of the transport equation for fine energy group structure. In that case, multigroup transfer cross sections display strongly peaked shape for light scatterers and the current Legendre polynomial expansion is not well-suited to represent them. Furthermore, even if considering an exact scattering cross sections representation, the scattering source in the discrete ordinates method (also known as the Sn method) being calculated by sampling the angular flux at given directions, may be wrongly computed due to lack of angular support for the angular flux. Hence, following the work of Gerts and Matthews, an angular finite volume solver has been developed for 2D Cartesian geometries. It integrates the multigroup transport equation over discrete volume elements obtained by meshing the unit sphere with a product grid over the polar and azimuthal coordinates and by considering the integrated flux per solid angle element. The convergence of this method has been compared to the S_n method for a highly anisotropic benchmark. Besides, piecewise-average scattering cross sections have been produced for non-bound Hydrogen atoms using a free gas model for thermal neutrons. LWR lattice calculations comparing Legendre representations of the Hydrogen scattering multigroup cross section at various orders and piecewise-average cross sections for this same atom are carried out (while keeping a Legendre representation for all other isotopes). (author)

  2. An extended step characteristic method for solving the transport equation in general geometries

    International Nuclear Information System (INIS)

    DeHart, M.D.; Pevey, R.E.; Parish, T.A.

    1994-01-01

    A method for applying the discrete ordinates method to solve the Boltzmann transport equation on arbitrary two-dimensional meshes has been developed. The finite difference approach normally used to approximate spatial derivatives in extrapolating angular fluxes across a cell is replaced by direct solution of the characteristic form of the transport equation for each discrete direction. Thus, computational cells are not restricted to the geometrical shape of a mesh element characteristic of a given coordinate system. However, in terms of the treatment of energy and angular dependencies, this method resembles traditional discrete ordinates techniques. By using the method developed here, a general two-dimensional space can be approximated by an irregular mesh comprised of arbitrary polygons. Results for a number of test problems have been compared with solutions obtained from traditional methods, with good agreement. Comparisons include benchmarks against analytical results for problems with simple geometry, as well as numerical results obtained from traditional discrete ordinates methods by applying the ANISN and TWOTRAN-II computer programs

  3. Program to solve the multigroup discrete ordinates transport equation in (x,y,z) geometry

    International Nuclear Information System (INIS)

    Lathrop, K.D.

    1976-04-01

    Numerical formulations and programming algorithms are given for the THREETRAN computer program which solves the discrete ordinates, multigroup transport equation in (x,y,z) geometry. An efficient, flexible, and general data-handling strategy is derived to make use of three hierarchies of storage: small core memory, large core memory, and disk file. Data management, input instructions, and sample problem output are described. A six-group, S 4 , 18 502 mesh point, 2 800 zone, k/sub eff/ calculation of the ZPPR-4 critical assembly required 144 min of CDC-7600 time to execute to a convergence tolerance of 5 x 10 -4 and gave results in good qualitative agreement with experiment and other calculations. 6 references

  4. Transmission probability method for solving neutron transport equation in three-dimensional triangular-z geometry

    Energy Technology Data Exchange (ETDEWEB)

    Liu Guoming [Department of Nuclear Engineering, Xi' an Jiaotong University, Xi' an, Shaanxi 710049 (China)], E-mail: gmliusy@gmail.com; Wu Hongchun; Cao Liangzhi [Department of Nuclear Engineering, Xi' an Jiaotong University, Xi' an, Shaanxi 710049 (China)

    2008-09-15

    This paper presents a transmission probability method (TPM) to solve the neutron transport equation in three-dimensional triangular-z geometry. The source within the mesh is assumed to be spatially uniform and isotropic. At the mesh surface, the constant and the simplified P{sub 1} approximation are invoked for the anisotropic angular flux distribution. Based on this model, a code TPMTDT is encoded. It was verified by three 3D Takeda benchmark problems, in which the first two problems are in XYZ geometry and the last one is in hexagonal-z geometry, and an unstructured geometry problem. The results of the present method agree well with those of Monte-Carlo calculation method and Spherical Harmonics (P{sub N}) method.

  5. A fast, parallel algorithm to solve the basic fluvial erosion/transport equations

    Science.gov (United States)

    Braun, J.

    2012-04-01

    Quantitative models of landform evolution are commonly based on the solution of a set of equations representing the processes of fluvial erosion, transport and deposition, which leads to predict the geometry of a river channel network and its evolution through time. The river network is often regarded as the backbone of any surface processes model (SPM) that might include other physical processes acting at a range of spatial and temporal scales along hill slopes. The basic laws of fluvial erosion requires the computation of local (slope) and non-local (drainage area) quantities at every point of a given landscape, a computationally expensive operation which limits the resolution of most SPMs. I present here an algorithm to compute the various components required in the parameterization of fluvial erosion (and transport) and thus solve the basic fluvial geomorphic equation, that is very efficient because it is O(n) (the number of required arithmetic operations is linearly proportional to the number of nodes defining the landscape), and is fully parallelizable (the computation cost decreases in a direct inverse proportion to the number of processors used to solve the problem). The algorithm is ideally suited for use on latest multi-core processors. Using this new technique, geomorphic problems can be solved at an unprecedented resolution (typically of the order of 10,000 X 10,000 nodes) while keeping the computational cost reasonable (order 1 sec per time step). Furthermore, I will show that the algorithm is applicable to any regular or irregular representation of the landform, and is such that the temporal evolution of the landform can be discretized by a fully implicit time-marching algorithm, making it unconditionally stable. I will demonstrate that such an efficient algorithm is ideally suited to produce a fully predictive SPM that links observationally based parameterizations of small-scale processes to the evolution of large-scale features of the landscapes on

  6. Spectral finite element methods for solving fractional differential equations with applications in anomalous transport

    Energy Technology Data Exchange (ETDEWEB)

    Carella, Alfredo Raul

    2012-09-15

    Quantifying species transport rates is a main concern in chemical and petrochemical industries. In particular, the design and operation of many large-scale industrial chemical processes is as much dependent on diffusion as it is on reaction rates. However, the existing diffusion models sometimes fail to predict experimentally observed behaviors and their accuracy is usually insufficient for process optimization purposes. Fractional diffusion models offer multiple possibilities for generalizing Flick's law in a consistent manner in order to account for history dependence and nonlocal effects. These models have not been extensively applied to the study of real systems, mainly due to their computational cost and mathematical complexity. A least squares spectral formulation was developed for solving fractional differential equations. The proposed method was proven particularly well-suited for dealing with the numerical difficulties inherent to fractional differential operators. The practical implementation was explained in detail in order to enhance reproducibility, and directions were specified for extending it to multiple dimensions and arbitrarily shaped domains. A numerical framework based on the least-squares spectral element method was developed for studying and comparing anomalous diffusion models in pellets. This simulation tool is capable of solving arbitrary integro-differential equations and can be effortlessly adapted to various problems in any number of dimensions. Simulations of the flow around a cylindrical particle were achieved by extending the functionality of the developed framework. A test case was analyzed by coupling the boundary condition yielded by the fluid model with two families of anomalous diffusion models: hyperbolic diffusion and fractional diffusion. Qualitative guidelines for determining the suitability of diffusion models can be formulated by complementing experimental data with the results obtained from this approach.(Author)

  7. Analysis and development of spatial hp-refinement methods for solving the neutron transport equation

    International Nuclear Information System (INIS)

    Fournier, D.

    2011-01-01

    The different neutronic parameters have to be calculated with a higher accuracy in order to design the 4. generation reactor cores. As memory storage and computation time are limited, adaptive methods are a solution to solve the neutron transport equation. The neutronic flux, solution of this equation, depends on the energy, angle and space. The different variables are successively discretized. The energy with a multigroup approach, considering the different quantities to be constant on each group, the angle by a collocation method called SN approximation. Once the energy and angle variable are discretized, a system of spatially-dependent hyperbolic equations has to be solved. Discontinuous finite elements are used to make possible the development of hp-refinement methods. Thus, the accuracy of the solution can be improved by spatial refinement (h-refinement), consisting into subdividing a cell into sub-cells, or by order refinement (p-refinement), by increasing the order of the polynomial basis. In this thesis, the properties of this methods are analyzed showing the importance of the regularity of the solution to choose the type of refinement. Thus, two error estimators are used to lead the refinement process. Whereas the first one requires high regularity hypothesis (analytical solution), the second one supposes only the minimal hypothesis required for the solution to exist. The comparison of both estimators is done on benchmarks where the analytic solution is known by the method of manufactured solutions. Thus, the behaviour of the solution as a regard of the regularity can be studied. It leads to a hp-refinement method using the two estimators. Then, a comparison is done with other existing methods on simplified but also realistic benchmarks coming from nuclear cores. These adaptive methods considerably reduces the computational cost and memory footprint. To further improve these two points, an approach with energy-dependent meshes is proposed. Actually, as the

  8. LUCKY-TD code for solving the time-dependent transport equation with the use of parallel computations

    Energy Technology Data Exchange (ETDEWEB)

    Moryakov, A. V., E-mail: sailor@orc.ru [National Research Centre Kurchatov Institute (Russian Federation)

    2016-12-15

    An algorithm for solving the time-dependent transport equation in the P{sub m}S{sub n} group approximation with the use of parallel computations is presented. The algorithm is implemented in the LUCKY-TD code for supercomputers employing the MPI standard for the data exchange between parallel processes.

  9. Two split cell numerical methods for solving 2-D non-equilibrium radiation transport equations

    International Nuclear Information System (INIS)

    Feng Tinggui

    2004-11-01

    Two numerically positive methods, the step characteristic integral method and subcell balance method, for solving radiative transfer equations on quadrilateral grids are presented. Numerical examples shows that the schemes presented are feasible on non-rectangle grid computation, and that the computing results by the schemes presented are comparative to that by the discrete ordinate diamond scheme on rectangle grid. (author)

  10. LOCFES-B: A program for solving the one-dimensional particle transport equation with user-selected CLOF methods

    International Nuclear Information System (INIS)

    Jarvis, R.D.; Nelson, P.

    1995-01-01

    LOCFES-B solves the steady-state, monoenergetic and azimuthally symmetric neutral-particle transport equation in one-dimensional plane-parallel geometry. LOCFES-B is designed to facilitate testing and comparison of different spatial approximations in neutron transport. Accordingly, it permits performance of user-provided CLOF spatial approximations to be compared directly on successively refined mesh sizes and user-input physical problems with automatic comparison of results. if desired, to user-supplied benchmark results

  11. On the history of a stochastic ansatz for solving the transport equation

    International Nuclear Information System (INIS)

    Williams, M.M.R.

    2010-01-01

    A very useful approximate tool for understanding the role of random material properties on solutions of the transport equation is described and its historical derivation given. The development of this stochastic tool, from its introduction by Randall, to its use in describing current problems involving dichotomic or pseudo-dichotomic Markov processes is discussed.

  12. Solving the two-dimensional stationary transport equation with the aid of the nodal method

    International Nuclear Information System (INIS)

    Mesina, M.

    1976-07-01

    In this document the two-dimensional stationary transport equation for the geometry of a fuel assembly or for a system of square boxes has been formulated as an algebraic eigenvalue problem, and the solution was achieved with the computer code NODE 2 which was developed for this purpose. (orig.) [de

  13. A Spatial Discretization Scheme for Solving the Transport Equation on Unstructured Grids of Polyhedra

    International Nuclear Information System (INIS)

    Thompson, K.G.

    2000-01-01

    In this work, we develop a new spatial discretization scheme that may be used to numerically solve the neutron transport equation. This new discretization extends the family of corner balance spatial discretizations to include spatial grids of arbitrary polyhedra. This scheme enforces balance on subcell volumes called corners. It produces a lower triangular matrix for sweeping, is algebraically linear, is non-negative in a source-free absorber, and produces a robust and accurate solution in thick diffusive regions. Using an asymptotic analysis, we design the scheme so that in thick diffusive regions it will attain the same solution as an accurate polyhedral diffusion discretization. We then refine the approximations in the scheme to reduce numerical diffusion in vacuums, and we attempt to capture a second order truncation error. After we develop this Upstream Corner Balance Linear (UCBL) discretization we analyze its characteristics in several limits. We complete a full diffusion limit analysis showing that we capture the desired diffusion discretization in optically thick and highly scattering media. We review the upstream and linear properties of our discretization and then demonstrate that our scheme captures strictly non-negative solutions in source-free purely absorbing media. We then demonstrate the minimization of numerical diffusion of a beam and then demonstrate that the scheme is, in general, first order accurate. We also note that for slab-like problems our method actually behaves like a second-order method over a range of cell thicknesses that are of practical interest. We also discuss why our scheme is first order accurate for truly 3D problems and suggest changes in the algorithm that should make it a second-order accurate scheme. Finally, we demonstrate 3D UCBL's performance on several very different test problems. We show good performance in diffusive and streaming problems. We analyze truncation error in a 3D problem and demonstrate robustness in a

  14. Approximate method for solving the velocity dependent transport equation in a slab lattice

    International Nuclear Information System (INIS)

    Ferrari, A.

    1966-01-01

    A method is described that is intended to provide an approximate solution of the transport equation in a medium simulating a water-moderated plate filled reactor core. This medium is constituted by a periodic array of water channels and absorbing plates. The velocity dependent transport equation in slab geometry is included. The computation is performed in a water channel: the absorbing plates are accounted for by the boundary conditions. The scattering of neutrons in water is assumed isotropic, which allows the use of a double Pn approximation to deal with the angular dependence. This method is able to represent the discontinuity of the angular distribution at the channel boundary. The set of equations thus obtained is dependent only on x and v and the coefficients are independent on x. This solution suggests to try solutions involving Legendre polynomials. This scheme leads to a set of equations v dependent only. To obtain an explicit solution, a thermalization model must now be chosen. Using the secondary model of Cadilhac a solution of this set is easy to get. The numerical computations were performed with a particular secondary model, the well-known model of Wigner and Wilkins. (author) [fr

  15. A method for solving the spherical harmonics equations applied for space-energy transport of fast and resonance neutrons

    International Nuclear Information System (INIS)

    Matausek, M.

    1972-01-01

    A new proposed method for solving the space-energy dependent spherical harmonics equations represents a methodological contribution to neutron transport theory. The proposed method was applied for solving the problem of spec-energy transport of fast and resonance neutrons in multi-zone, cylindrical y symmetric infinite reactor cell and is related to previously developed procedure for treating the thermal energy region. The advantages of this method are as follows: a unique algorithm was obtained for detailed determination of spatial and energy distribution of neutrons (from thermal to fast) in the reactor cell; these detailed distributions enable more precise calculations of criticality conditions, obtaining adequate multigroup data and better interpretation of experimental data; computing time is rather short

  16. Discrete energy formulation of neutron transport theory applied to solving the discrete ordinates equations

    International Nuclear Information System (INIS)

    Ching, J.; Oblow, E.M.; Goldstein, H.

    1976-01-01

    An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated that allows the development of a discrete energy, discrete ordinates method for the solution of radiation transport problems. In the discrete energy method, the group averaging required in the cross-section processing for multigroup calculations is replaced by a faster numerical quadrature scheme capable of generating transfer cross sections describing all the physical processes of interest on a fine point-energy grid. Test calculations in which the discrete energy method is compared with the multigroup method show that, for the same energy grid, the discrete energy method is much faster, although somewhat less accurate, than the multigroup method. However, the accuracy of the discrete energy method increases rapidly as the spacing between energy grid points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum, the discrete energy method is therefore expected to be far more economical than the multigroup technique for equivalent accuracy solutions. This advantage of the point method is demonstrated by application to the study of neutron transport in a thick iron slab

  17. Solving the multigroup adjoint transport equations using the method of cyclic characteristics

    Energy Technology Data Exchange (ETDEWEB)

    Assawaroongruengchot, M.; Marleau, G. [Ecole Polytechnique de Montreal, Inst. de genie nucleaire, Montreal, Quebec (Canada)]. E-mail: monchai.assawar@polymtl.ca

    2005-07-01

    The adjoint transport solution algorithm based on the method of cyclic characteristics (MOCC) is developed for the heterogeneous 2D geometries. The adjoint characteristics equation associated with a cyclic tracking line is formulated, then a closed form for adjoint angular flux can be determined. The acceleration techniques are implemented using the group-reduction and group-splitting techniques. To demonstrate the efficacy of the algorithm, the calculations are performed on the 37 pin CANDU cell and on the Watanabe-Maynard benchmark problem. Comparisons of adjoint flux and k{sub eff} results obtained by MOCC and collision probability (CP) methods are performed. The mathematical relationship between pseudo-adjoint flux obtained by CP method and adjoint flux by MOCC method is presented. (author)

  18. Solving the multigroup adjoint transport equations using the method of cyclic characteristics

    International Nuclear Information System (INIS)

    Assawaroongruengchot, M.; Marleau, G.

    2005-01-01

    The adjoint transport solution algorithm based on the method of cyclic characteristics (MOCC) is developed for the heterogeneous 2D geometries. The adjoint characteristics equation associated with a cyclic tracking line is formulated, then a closed form for adjoint angular flux can be determined. The acceleration techniques are implemented using the group-reduction and group-splitting techniques. To demonstrate the efficacy of the algorithm, the calculations are performed on the 37 pin CANDU cell and on the Watanabe-Maynard benchmark problem. Comparisons of adjoint flux and k eff results obtained by MOCC and collision probability (CP) methods are performed. The mathematical relationship between pseudo-adjoint flux obtained by CP method and adjoint flux by MOCC method is presented. (author)

  19. A Novel Algorithm for Solving the Multidimensional Neutron Transport Equation on Massively Parallel Architectures

    Energy Technology Data Exchange (ETDEWEB)

    Azmy, Yousry

    2014-06-10

    We employ the Integral Transport Matrix Method (ITMM) as the kernel of new parallel solution methods for the discrete ordinates approximation of the within-group neutron transport equation. The ITMM abandons the repetitive mesh sweeps of the traditional source iterations (SI) scheme in favor of constructing stored operators that account for the direct coupling factors among all the cells' fluxes and between the cells' and boundary surfaces' fluxes. The main goals of this work are to develop the algorithms that construct these operators and employ them in the solution process, determine the most suitable way to parallelize the entire procedure, and evaluate the behavior and parallel performance of the developed methods with increasing number of processes, P. The fastest observed parallel solution method, Parallel Gauss-Seidel (PGS), was used in a weak scaling comparison with the PARTISN transport code, which uses the source iteration (SI) scheme parallelized with the Koch-baker-Alcouffe (KBA) method. Compared to the state-of-the-art SI-KBA with diffusion synthetic acceleration (DSA), this new method- even without acceleration/preconditioning-is completitive for optically thick problems as P is increased to the tens of thousands range. For the most optically thick cells tested, PGS reduced execution time by an approximate factor of three for problems with more than 130 million computational cells on P = 32,768. Moreover, the SI-DSA execution times's trend rises generally more steeply with increasing P than the PGS trend. Furthermore, the PGS method outperforms SI for the periodic heterogeneous layers (PHL) configuration problems. The PGS method outperforms SI and SI-DSA on as few as P = 16 for PHL problems and reduces execution time by a factor of ten or more for all problems considered with more than 2 million computational cells on P = 4.096.

  20. Application of Trotter approximation for solving time dependent neutron transport equation; Primena Trotterove aproksimacije za resavanje vremenski zavisne transportne jednacine neutrona

    Energy Technology Data Exchange (ETDEWEB)

    Stancic, V [Institut za nuklearne nauke Boris Kidric, Vinca, Beograd (Yugoslavia)

    1987-07-01

    A method is proposed to solve multigroup time dependent neutron transport equation with arbitrary scattering anisotropy. The recurrence relation thus obtained is simple, numerically stable and especially suitable for treatment of complicated geometries. (author)

  1. Solving Ordinary Differential Equations

    Science.gov (United States)

    Krogh, F. T.

    1987-01-01

    Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

  2. Study of a method to solve the one speed, three dimensional transport equation using the finite element method and the associated Legendre function

    International Nuclear Information System (INIS)

    Fernandes, A.

    1991-01-01

    A method to solve three dimensional neutron transport equation and it is based on the original work suggested by J.K. Fletcher (42, 43). The angular dependence of the flux is approximated by associated Legendre functions and the finite element method is applied to the space components is presented. When the angular flux, the scattering cross section and the neutrons source are expanded in associated Legendre functions, the first order neutron transport equation is reduced to a coupled set of second order diffusion like equations. These equations are solved in an iterative way by the finite element method to the moments. (author)

  3. Solving Linear Differential Equations

    NARCIS (Netherlands)

    Nguyen, K.A.; Put, M. van der

    2010-01-01

    The theme of this paper is to 'solve' an absolutely irreducible differential module explicitly in terms of modules of lower dimension and finite extensions of the differential field K. Representations of semi-simple Lie algebras and differential Galo is theory are the main tools. The results extend

  4. Analysis of a HP-refinement method for solving the neutron transport equation using two error estimators

    International Nuclear Information System (INIS)

    Fournier, D.; Le Tellier, R.; Suteau, C.; Herbin, R.

    2011-01-01

    The solution of the time-independent neutron transport equation in a deterministic way invariably consists in the successive discretization of the three variables: energy, angle and space. In the SNATCH solver used in this study, the energy and the angle are respectively discretized with a multigroup approach and the discrete ordinate method. A set of spatial coupled transport equations is obtained and solved using the Discontinuous Galerkin Finite Element Method (DGFEM). Within this method, the spatial domain is decomposed into elements and the solution is approximated by a hierarchical polynomial basis in each one. This approach is time and memory consuming when the mesh becomes fine or the basis order high. To improve the computational time and the memory footprint, adaptive algorithms are proposed. These algorithms are based on an error estimation in each cell. If the error is important in a given region, the mesh has to be refined (h−refinement) or the polynomial basis order increased (p−refinement). This paper is related to the choice between the two types of refinement. Two ways to estimate the error are compared on different benchmarks. Analyzing the differences, a hp−refinement method is proposed and tested. (author)

  5. The discrete ordinates method for solving the azimuthally dependent transport equation in plane geometry

    International Nuclear Information System (INIS)

    Chalhoub, Ezzat Selim

    1997-01-01

    The method of discrete ordinates is applied to the solution of the slab albedo problem with azimuthal dependence in transport theory. A new set of quadratures appropriate to the problem is introduced. In addition to the ANISN code, modified to include the proposed formalism, two new programs, PEESNC and PEESNA, which were created on the basis of the discrete ordinates formalism, using the direct integration method and the analytic solution method respectively, are used in the generation of results for a few sample problems. Program PEESNC was created to validate the results obtained with the discrete ordinates method and the finite difference approximation (ANISN), while program PEESNA was developed in order to implement an analytical discrete ordinates formalism, which provides more accurate results. The obtained results for selected sample problems are compared with highly accurate numerical results published in the literature. Compared to ANISN and PEESNC, program PEESNA presents a greater efficiency in execution time and much more precise numerical results. (author)

  6. Solving Differential Equations in R: Package deSolve

    Science.gov (United States)

    In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines appr...

  7. Solving Differential Equations in R: Package deSolve

    NARCIS (Netherlands)

    Soetaert, K.E.R.; Petzoldt, T.; Setzer, R.W.

    2010-01-01

    In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines approach. The

  8. Laser radiation in active amplifying media treated as a transport problem - Transfer equation derived and exactly solved

    Science.gov (United States)

    Gupta, S. R. D.; Gupta, Santanu D.

    1991-10-01

    The flow of laser radiation in a plane-parallel cylindrical slab of active amplifying medium with axial symmetry is treated as a problem in radiative transfer. The appropriate one-dimensional transfer equation describing the transfer of laser radiation has been derived by an appeal to Einstein's A, B coefficients (describing the processes of stimulated line absorption, spontaneous line emission, and stimulated line emission sustained by population inversion in the medium) and considering the 'rate equations' to completely establish the rational of the transfer equation obtained. The equation is then exactly solved and the angular distribution of the emergent laser beam intensity is obtained; its numerically computed values are given in tables and plotted in graphs showing the nature of peaks of the emerging laser beam intensity about the axis of the laser cylinder.

  9. Coupling of discrete ordinates methods by transmission of boundary conditions in solving the neutron transport equation in slab geometry; Couplage de discretisations aux ordonnees discretes d`equations de transport 1D par passage de conditions frontieres

    Energy Technology Data Exchange (ETDEWEB)

    Bal, G. [Departement MMN, Service IMA, Direction des Etudes et Recherches, Electricite de France (EDF), 92 - Clamart (France)

    1995-10-01

    Neutron transport in nuclear reactors is quite well modelled by the linear Boltzmann transport equation. Its solution is relatively easy, but unfortunately too expensive to achieve whole core computations. Thus, we have to simplify it, for example by homogenizing some physical characteristics. However, the solution may then be inaccurate. Moreover, in strongly homogeneous areas, the error may be too big. Then we would like to deal with such an inconvenient by solving the equation accurately on this area, but more coarsely away from it, so that the computation is not too expensive. This problem is the subject of a thesis. We present here some results obtained for slab geometry. The couplings between the fine and coarse discretization regions could be conceived in a number of approaches. Here, we only deal with the coupling at crossing the interface between two sub-domains. In the first section, we present the coupling of discrete ordinate methods for solving the homogeneous, isotropic and mono-kinetic equation. Coupling operators are defined and shown to be optimal. The second and the third sections are devoted to an extension of the previous results when the equation is non-homogeneous, anisotropic and multigroup (under some restrictive assumptions). Some numerical results are given in the case of isotropic and mono-kinetic equations. (author) 15 refs.

  10. Heat transport in two-dimensional materials by directly solving the phonon Boltzmann equation under Callaway's dual relaxation model

    Science.gov (United States)

    Guo, Yangyu; Wang, Moran

    2017-10-01

    The single mode relaxation time approximation has been demonstrated to greatly underestimate the lattice thermal conductivity of two-dimensional materials due to the collective effect of phonon normal scattering. Callaway's dual relaxation model represents a good approximation to the otherwise ab initio solution of the phonon Boltzmann equation. In this work we develop a discrete-ordinate-method (DOM) scheme for the numerical solution of the phonon Boltzmann equation under Callaway's model. Heat transport in a graphene ribbon with different geometries is modeled by our scheme, which produces results quite consistent with the available molecular dynamics, Monte Carlo simulations, and experimental measurements. Callaway's lattice thermal conductivity model with empirical boundary scattering rates is examined and shown to overestimate or underestimate the direct DOM solution. The length convergence of the lattice thermal conductivity of a rectangular graphene ribbon is explored and found to depend appreciably on the ribbon width, with a semiquantitative correlation provided between the convergence length and the width. Finally, we predict the existence of a phonon Knudsen minimum in a graphene ribbon only at a low system temperature and isotope concentration so that the average normal scattering rate is two orders of magnitude stronger than the intrinsic resistive one. The present work will promote not only the methodology for the solution of the phonon Boltzmann equation but also the theoretical modeling and experimental detection of hydrodynamic phonon transport in two-dimensional materials.

  11. Methodology for solving the equation of transport ordered discrete TORT code in the reactor IPEN/MB-01; Metodologia para resolver la ecuacion del transporte con el codigo de Ordenadas Discretas TORT en el reactor IPEN/MB-01

    Energy Technology Data Exchange (ETDEWEB)

    Bernal, A.; Abarca, A.; Barrachina, T.; Miro, R.; Verdu, G.

    2013-07-01

    The resolution of the neutron transport equation in steady state in pool-type nuclear reactors, is normally achieved through 2 different numerical methods: Monte Carlo (stochastic) and discrete ordinates (deterministic). The discrete ordinates method solves the neutron transport equation for a set of specific addresses, obtaining a set of equations and solutions for each direction, where the solution for each direction is the angular flux. With the aim of treating energy dependence, used energy multigroup approximation, thus obtaining a set of equations that depends on the number of energy groups considered.

  12. Solving Nonlinear Coupled Differential Equations

    Science.gov (United States)

    Mitchell, L.; David, J.

    1986-01-01

    Harmonic balance method developed to obtain approximate steady-state solutions for nonlinear coupled ordinary differential equations. Method usable with transfer matrices commonly used to analyze shaft systems. Solution to nonlinear equation, with periodic forcing function represented as sum of series similar to Fourier series but with form of terms suggested by equation itself.

  13. ANISN-L, a CDC-7600 code which solves the one-dimensional, multigroup, time dependent transport equation by the method of discrete ordinates

    Energy Technology Data Exchange (ETDEWEB)

    Wilcox, T. P.

    1973-09-20

    The code ANISN-L solves the one-dimensional, multigroup, time-independent Boltzmann transport equation by the method of discrete ordinates. In problems involving a fissionable system, it can calculate the system multiplication or alpha. In such cases, it is also capable of determining isotopic concentrations, radii, zone widths, or buckling in order to achieve a given multiplication or alpha. The code may also calculate fluxes caused by a specified fixed source. Neutron, gamma, and coupled neutron--gamma problems may be solved in either the forward or adjoint (backward) modes. Cross sections describing upscatter, as well as the usual downscatter, may be employed. This report describes the use of ANISN-L; this is a revised version of ANISN which handles both large and small problems efficiently on CDC-7600 computers. (RWR)

  14. Solving equations by topological methods

    Directory of Open Access Journals (Sweden)

    Lech Górniewicz

    2005-01-01

    Full Text Available In this paper we survey most important results from topological fixed point theory which can be directly applied to differential equations. Some new formulations are presented. We believe that our article will be useful for analysts applying topological fixed point theory in nonlinear analysis and in differential equations.

  15. Solving Differential Equations in R

    Science.gov (United States)

    Although R is still predominantly applied for statistical analysis and graphical representation, it is rapidly becoming more suitable for mathematical computing. One of the fields where considerable progress has been made recently is the solution of differential equations. Here w...

  16. Solving Absolute Value Equations Algebraically and Geometrically

    Science.gov (United States)

    Shiyuan, Wei

    2005-01-01

    The way in which students can improve their comprehension by understanding the geometrical meaning of algebraic equations or solving algebraic equation geometrically is described. Students can experiment with the conditions of the absolute value equation presented, for an interesting way to form an overall understanding of the concept.

  17. Parallel Algorithm Solves Coupled Differential Equations

    Science.gov (United States)

    Hayashi, A.

    1987-01-01

    Numerical methods adapted to concurrent processing. Algorithm solves set of coupled partial differential equations by numerical integration. Adapted to run on hypercube computer, algorithm separates problem into smaller problems solved concurrently. Increase in computing speed with concurrent processing over that achievable with conventional sequential processing appreciable, especially for large problems.

  18. Some improvements in the discrete ordinate method of B.G. Carlson for solving the neutron transport equation

    Energy Technology Data Exchange (ETDEWEB)

    Askew, J R; Brissenden, R J [Technical Assessments and Services Division, Atomic Energy Establishment, Winfrith, Dorchester, Dorset (United Kingdom)

    1963-08-15

    This report gives an account of the DSN method for simulating neutron transport, together with methods of solution developed to deal with problems in the physics of thermal reactors, for which previously available computer programmes were unsatisfactory. The methods described are those incorporated in the programmes WINFRITH DSN written in FORTRAN language for the IBM 7090 and STRETCH computers. (author)

  19. Analysis of space and energy homogenization techniques for the solving of the neutron transport equation in nuclear reactor

    International Nuclear Information System (INIS)

    Magat, Ph.

    1997-04-01

    Today neutron transport in PWR's core is routinely computed through the transport-diffusion(2 groups) scheme. This method gives satisfactory results for reactors operating in normal conditions but the 2 group diffusion approximation is unable to take into account interface effects or anisotropy. The improvement of this scheme is logically possible through the use of a simplified P N method (SP N ) for the modeling of the core. The comparison between S N calculations and SP N calculations shows an excellent agreement on eigenvalues as well as on power maps. We can notice that: -) it is no use extending the development beyond P 3 , there is no effect; -) the P 1 development is adequate; and -) the P 0 development is totally inappropriate. Calculations performed on the N4 core of the Chooz power plant have enabled us to compare diffusion operators with transport operators (SP 1 , SP 3 , SP 5 and SP 7 ). These calculations show that the implementation of the SP N method is feasible but the extra-costs in computation times and memory are important. We recommend: SP 5 P 1 calculations for heterogeneous 2-dimension geometry and SP 3 P 1 calculations for the homogeneous 3-dimension geometry. (A.C.)

  20. Solving Differential Equations in R: Package deSolve

    Directory of Open Access Journals (Sweden)

    Karline Soetaert

    2010-02-01

    Full Text Available In this paper we present the R package deSolve to solve initial value problems (IVP written as ordinary differential equations (ODE, differential algebraic equations (DAE of index 0 or 1 and partial differential equations (PDE, the latter solved using the method of lines approach. The differential equations can be represented in R code or as compiled code. In the latter case, R is used as a tool to trigger the integration and post-process the results, which facilitates model development and application, whilst the compiled code significantly increases simulation speed. The methods implemented are efficient, robust, and well documented public-domain Fortran routines. They include four integrators from the ODEPACK package (LSODE, LSODES, LSODA, LSODAR, DVODE and DASPK2.0. In addition, a suite of Runge-Kutta integrators and special-purpose solvers to efficiently integrate 1-, 2- and 3-dimensional partial differential equations are available. The routines solve both stiff and non-stiff systems, and include many options, e.g., to deal in an efficient way with the sparsity of the Jacobian matrix, or finding the root of equations. In this article, our objectives are threefold: (1 to demonstrate the potential of using R for dynamic modeling, (2 to highlight typical uses of the different methods implemented and (3 to compare the performance of models specified in R code and in compiled code for a number of test cases. These comparisons demonstrate that, if the use of loops is avoided, R code can efficiently integrate problems comprising several thousands of state variables. Nevertheless, the same problem may be solved from 2 to more than 50 times faster by using compiled code compared to an implementation using only R code. Still, amongst the benefits of R are a more flexible and interactive implementation, better readability of the code, and access to R’s high-level procedures. deSolve is the successor of package odesolve which will be deprecated in

  1. Solving the Schroedinger equation using Smolyak interpolants

    International Nuclear Information System (INIS)

    Avila, Gustavo; Carrington, Tucker Jr.

    2013-01-01

    In this paper, we present a new collocation method for solving the Schroedinger equation. Collocation has the advantage that it obviates integrals. All previous collocation methods have, however, the crucial disadvantage that they require solving a generalized eigenvalue problem. By combining Lagrange-like functions with a Smolyak interpolant, we device a collocation method that does not require solving a generalized eigenvalue problem. We exploit the structure of the grid to develop an efficient algorithm for evaluating the matrix-vector products required to compute energy levels and wavefunctions. Energies systematically converge as the number of points and basis functions are increased

  2. Analysis and development of spatial hp-refinement methods for solving the neutron transport equation; Analyse et developpement de methodes de raffinement hp en espace pour l'equation de transport des neutrons

    Energy Technology Data Exchange (ETDEWEB)

    Fournier, D.

    2011-10-10

    The different neutronic parameters have to be calculated with a higher accuracy in order to design the 4. generation reactor cores. As memory storage and computation time are limited, adaptive methods are a solution to solve the neutron transport equation. The neutronic flux, solution of this equation, depends on the energy, angle and space. The different variables are successively discretized. The energy with a multigroup approach, considering the different quantities to be constant on each group, the angle by a collocation method called SN approximation. Once the energy and angle variable are discretized, a system of spatially-dependent hyperbolic equations has to be solved. Discontinuous finite elements are used to make possible the development of hp-refinement methods. Thus, the accuracy of the solution can be improved by spatial refinement (h-refinement), consisting into subdividing a cell into sub-cells, or by order refinement (p-refinement), by increasing the order of the polynomial basis. In this thesis, the properties of this methods are analyzed showing the importance of the regularity of the solution to choose the type of refinement. Thus, two error estimators are used to lead the refinement process. Whereas the first one requires high regularity hypothesis (analytical solution), the second one supposes only the minimal hypothesis required for the solution to exist. The comparison of both estimators is done on benchmarks where the analytic solution is known by the method of manufactured solutions. Thus, the behaviour of the solution as a regard of the regularity can be studied. It leads to a hp-refinement method using the two estimators. Then, a comparison is done with other existing methods on simplified but also realistic benchmarks coming from nuclear cores. These adaptive methods considerably reduces the computational cost and memory footprint. To further improve these two points, an approach with energy-dependent meshes is proposed. Actually, as the

  3. Students’ difficulties in solving linear equation problems

    Science.gov (United States)

    Wati, S.; Fitriana, L.; Mardiyana

    2018-03-01

    A linear equation is an algebra material that exists in junior high school to university. It is a very important material for students in order to learn more advanced mathematics topics. Therefore, linear equation material is essential to be mastered. However, the result of 2016 national examination in Indonesia showed that students’ achievement in solving linear equation problem was low. This fact became a background to investigate students’ difficulties in solving linear equation problems. This study used qualitative descriptive method. An individual written test on linear equation tasks was administered, followed by interviews. Twenty-one sample students of grade VIII of SMPIT Insan Kamil Karanganyar did the written test, and 6 of them were interviewed afterward. The result showed that students with high mathematics achievement donot have difficulties, students with medium mathematics achievement have factual difficulties, and students with low mathematics achievement have factual, conceptual, operational, and principle difficulties. Based on the result there is a need of meaningfulness teaching strategy to help students to overcome difficulties in solving linear equation problems.

  4. The Use of Transformations in Solving Equations

    Science.gov (United States)

    Libeskind, Shlomo

    2010-01-01

    Many workshops and meetings with the US high school mathematics teachers revealed a lack of familiarity with the use of transformations in solving equations and problems related to the roots of polynomials. This note describes two transformational approaches to the derivation of the quadratic formula as well as transformational approaches to…

  5. Domain decomposition method using a hybrid parallelism and a low-order acceleration for solving the Sn transport equation on unstructured geometry

    International Nuclear Information System (INIS)

    Odry, Nans

    2016-01-01

    Deterministic calculation schemes are devised to numerically solve the neutron transport equation in nuclear reactors. Dealing with core-sized problems is very challenging for computers, so much that the dedicated core calculations have no choice but to allow simplifying assumptions (assembly- then core scale steps..). The PhD work aims at overcoming some of these approximations: thanks to important changes in computer architecture and capacities (HPC), nowadays one can solve 3D core-sized problems, using both high mesh refinement and the transport operator. It is an essential step forward in order to perform, in the future, reference calculations using deterministic schemes. This work focuses on a spatial domain decomposition method (DDM). Using massive parallelism, DDM allows much more ambitious computations in terms of both memory requirements and calculation time. Developments were performed inside the Sn core solver Minaret, from the new CEA neutronics platform APOLLO3. Only fast reactors (hexagonal periodicity) are considered, even if all kinds of geometries can be dealt with, using Minaret. The work has been divided in four steps: 1) The spatial domain decomposition with no overlap is inserted into the standard algorithmic structure of Minaret. The fundamental idea involves splitting a core-sized problem into smaller, independent, spatial sub-problems. angular flux is exchanged between adjacent sub-domains. In doing so, all combined sub-problems converge to the global solution at the outcome of an iterative process. Various strategies were explored regarding both data management and algorithm design. Results (k eff and flux) are systematically compared to the reference in a numerical verification step. 2) Introducing more parallelism is an unprecedented opportunity to heighten performances of deterministic schemes. Domain decomposition is particularly suited to this. A two-layer hybrid parallelism strategy, suited to HPC, is chosen. It benefits from the

  6. Optimal calculational schemes for solving multigroup photon transport problem

    International Nuclear Information System (INIS)

    Dubinin, A.A.; Kurachenko, Yu.A.

    1987-01-01

    A scheme of complex algorithm for solving multigroup equation of radiation transport is suggested. The algorithm is based on using the method of successive collisions, the method of forward scattering and the spherical harmonics method, and is realized in the FORAP program (FORTRAN, BESM-6 computer). As an example the results of calculating reactor photon transport in water are presented. The considered algorithm being modified may be used for solving neutron transport problems

  7. Solving Kepler's equation using implicit functions

    Science.gov (United States)

    Mortari, Daniele; Elipe, Antonio

    2014-01-01

    A new approach to solve Kepler's equation based on the use of implicit functions is proposed here. First, new upper and lower bounds are derived for two ranges of mean anomaly. These upper and lower bounds initialize a two-step procedure involving the solution of two implicit functions. These two implicit functions, which are non-rational (polynomial) Bézier functions, can be linear or quadratic, depending on the derivatives of the initial bound values. These are new initial bounds that have been compared and proven more accurate than Serafin's bounds. The procedure reaches machine error accuracy with no more that one quadratic and one linear iterations, experienced in the "tough range", where the eccentricity is close to one and the mean anomaly to zero. The proposed method is particularly suitable for space-based applications with limited computational capability.

  8. Cognitive Load in Algebra: Element Interactivity in Solving Equations

    Science.gov (United States)

    Ngu, Bing Hiong; Chung, Siu Fung; Yeung, Alexander Seeshing

    2015-01-01

    Central to equation solving is the maintenance of equivalence on both sides of the equation. However, when the process involves an interaction of multiple elements, solving an equation can impose a high cognitive load. The balance method requires operations on both sides of the equation, whereas the inverse method involves operations on one side…

  9. Aspheric surface testing by irradiance transport equation

    Science.gov (United States)

    Shomali, Ramin; Darudi, Ahmad; Nasiri, Sadollah; Asgharsharghi Bonab, Armir

    2010-10-01

    In this paper a method for aspheric surface testing is presented. The method is based on solving the Irradiance Transport Equation (ITE).The accuracy of ITE normally depends on the amount of the pick to valley of the phase distribution. This subject is investigated by a simulation procedure.

  10. Solving the generalized Langevin equation with the algebraically correlated noise

    International Nuclear Information System (INIS)

    Srokowski, T.; Ploszajczak, M.

    1997-01-01

    The Langevin equation with the memory kernel is solved. The stochastic force possesses algebraic correlations, proportional to 1/t. The velocity autocorrelation function and related quantities characterizing transport properties are calculated at the assumption that the system is in the thermal equilibrium. Stochastic trajectories are simulated numerically, using the kangaroo process as a noise generator. Results of this simulation resemble Levy walks with divergent moments of the velocity distribution. The motion of a Brownian particle is considered both without any external potential and in the harmonic oscillator field, in particular the escape from a potential well. The results are compared with memory-free calculations for the Brownian particle. (author)

  11. Applying homotopy analysis method for solving differential-difference equation

    International Nuclear Information System (INIS)

    Wang Zhen; Zou Li; Zhang Hongqing

    2007-01-01

    In this Letter, we apply the homotopy analysis method to solving the differential-difference equations. A simple but typical example is applied to illustrate the validity and the great potential of the generalized homotopy analysis method in solving differential-difference equation. Comparisons are made between the results of the proposed method and exact solutions. The results show that the homotopy analysis method is an attractive method in solving the differential-difference equations

  12. Solving the transport equation by Monte Carlo method and application for biological shield calculations; Resavanje transportne jednacine Monte Carlo metodom i njena primena u zadacima proracuna bioloskog stita

    Energy Technology Data Exchange (ETDEWEB)

    Kocic, A [Institute of Nuclear Sciences Boris Kidric, Vinca, Beograd (Serbia and Montenegro)

    1977-07-01

    General sampling Monte Carlo scheme for neutron transport equation has been described. Programme TRANSFER for neutron beam transmission analysis has been used to calculate the neutron leakage spectrum, detector efficiency and neutron angular distribution of the example problem (author) [Serbo-Croat] U radu se najpre razmatraju osnovni problemi resavanja transportne jednacine i nacin kako Monte Karlo metoda omogucuje da se prevazidju neki od njih: visedimenzionalnost zadatka, problem dubokog prodiranja i dovoljno fino tretiranje efikasnih preseka. Dalje, govori se o iskustvima sa primenom Monte Karlo metode u Laboratoriji za nuklearnu energetiku i tehnicku fiziku i o primeni ove metode na probleme zastite. Na kraju dati su i analizirani ilustrativni primeri proracuna transporta neutrona kroz ravan sloj zastitnog materijala koriscenjem Monte Karlo programa TRANSFER (author)

  13. Solving Variable Coefficient Fourth-Order Parabolic Equation by ...

    African Journals Online (AJOL)

    Solving Variable Coefficient Fourth-Order Parabolic Equation by Modified initial guess Variational ... variable coefficient fourth order parabolic partial differential equations. The new method shows rapid convergence to the exact solution.

  14. Sinc-collocation method for solving the Blasius equation

    International Nuclear Information System (INIS)

    Parand, K.; Dehghan, Mehdi; Pirkhedri, A.

    2009-01-01

    Sinc-collocation method is applied for solving Blasius equation which comes from boundary layer equations. It is well known that sinc procedure converges to the solution at an exponential rate. Comparison with Howarth and Asaithambi's numerical solutions reveals that the proposed method is of high accuracy and reduces the solution of Blasius' equation to the solution of a system of algebraic equations.

  15. Swarm analysis by using transport equations

    International Nuclear Information System (INIS)

    Dote, Toshihiko.

    1985-01-01

    As the basis of weak ionization plasma phenomena, the motion, i.e. swarm, of charged particles in the gas is analyzed by use of the transport equations, from which basic nature of the swarm is discussed. The present report is an overview of the studies made in the past several years. Described are principally the most basic aspects concerning behaviors of the electrons and positive ions, that is, the basic equations and their significance, characteristics of the behaviors of the electron and positive ion swarms as revealed by solving the equations, and various characteristics of the swarm parameters. Contents are: Maxwell-Boltzmann's transport equations, behavior of the electron swarm, energy loss of the electrons, and behavior of the positive ion swarm. (Mori, K.)

  16. Saturation and linear transport equation

    International Nuclear Information System (INIS)

    Kutak, K.

    2009-03-01

    We show that the GBW saturation model provides an exact solution to the one dimensional linear transport equation. We also show that it is motivated by the BK equation considered in the saturated regime when the diffusion and the splitting term in the diffusive approximation are balanced by the nonlinear term. (orig.)

  17. Solving Differential Equations Using Modified Picard Iteration

    Science.gov (United States)

    Robin, W. A.

    2010-01-01

    Many classes of differential equations are shown to be open to solution through a method involving a combination of a direct integration approach with suitably modified Picard iterative procedures. The classes of differential equations considered include typical initial value, boundary value and eigenvalue problems arising in physics and…

  18. Auxiliary equation method for solving nonlinear partial differential equations

    International Nuclear Information System (INIS)

    Sirendaoreji,; Jiong, Sun

    2003-01-01

    By using the solutions of an auxiliary ordinary differential equation, a direct algebraic method is described to construct several kinds of exact travelling wave solutions for some nonlinear partial differential equations. By this method some physically important nonlinear equations are investigated and new exact travelling wave solutions are explicitly obtained with the aid of symbolic computation

  19. Variational iteration method for solving coupled-KdV equations

    International Nuclear Information System (INIS)

    Assas, Laila M.B.

    2008-01-01

    In this paper, the He's variational iteration method is applied to solve the non-linear coupled-KdV equations. This method is based on the use of Lagrange multipliers for identification of optimal value of a parameter in a functional. This technique provides a sequence of functions which converge to the exact solution of the coupled-KdV equations. This procedure is a powerful tool for solving coupled-KdV equations

  20. Finite element method for solving neutron transport problems

    International Nuclear Information System (INIS)

    Ferguson, J.M.; Greenbaum, A.

    1984-01-01

    A finite element method is introduced for solving the neutron transport equations. Our method falls into the category of Petrov-Galerkin solution, since the trial space differs from the test space. The close relationship between this method and the discrete ordinate method is discussed, and the methods are compared for simple test problems

  1. The accuracy of time dependent transport equation ergodic approximation

    International Nuclear Information System (INIS)

    Stancic, V.

    1995-01-01

    In order to predict the accuracy of the ergodic approximation for solving the time dependent transport equation, a comparison with respect to multiple collision and time finite difference methods, has been considered. (author)

  2. Constructing and solving equations - inverse operations

    Czech Academy of Sciences Publication Activity Database

    Neuman, František

    2005-01-01

    Roč. 70, č. 1 (2005), s. 77-87 ISSN 0001-9054 R&D Projects: GA AV ČR(CZ) IAA1163401 Institutional research plan: CEZ:AV0Z10190503 Keywords : functional and differential equations * representation of solution spaces * discretization of smooth relations Subject RIV: BA - General Mathematics

  3. Final report [on solving the multigroup diffusion equations

    International Nuclear Information System (INIS)

    Birkhoff, G.

    1975-01-01

    Progress achieved in the development of variational methods for solving the multigroup neutron diffusion equations is described. An appraisal is made of the extent to which improved variational methods could advantageously replace difference methods currently used

  4. students' preference of method of solving simultaneous equations

    African Journals Online (AJOL)

    Ugboduma,Samuel.O.

    substitution method irrespective of their gender for solving simultaneous equations. A recommendation ... advantage given to one method over others. Students' interest .... from two (2) single girls' schools, two (2) single boys schools and ten.

  5. Adams Predictor-Corrector Systems for Solving Fuzzy Differential Equations

    Directory of Open Access Journals (Sweden)

    Dequan Shang

    2013-01-01

    Full Text Available A predictor-corrector algorithm and an improved predictor-corrector (IPC algorithm based on Adams method are proposed to solve first-order differential equations with fuzzy initial condition. These algorithms are generated by updating the Adams predictor-corrector method and their convergence is also analyzed. Finally, the proposed methods are illustrated by solving an example.

  6. Range of validity of transport equations

    International Nuclear Information System (INIS)

    Berges, Juergen; Borsanyi, Szabolcs

    2006-01-01

    Transport equations can be derived from quantum field theory assuming a loss of information about the details of the initial state and a gradient expansion. While the latter can be systematically improved, the assumption about a memory loss is not known to be controlled by a small expansion parameter. We determine the range of validity of transport equations for the example of a scalar g 2 Φ 4 theory. We solve the nonequilibrium time evolution using the three-loop 2PI effective action. The approximation includes off-shell and memory effects and assumes no gradient expansion. This is compared to transport equations to lowest order (LO) and beyond (NLO). We find that the earliest time for the validity of transport equations is set by the characteristic relaxation time scale t damp =-2ω/Σ ρ (eq) , where -Σ ρ (eq) /2 denotes the on-shell imaginary-part of the self-energy. This time scale agrees with the characteristic time for partial memory loss, but is much shorter than thermal equilibration times. For times larger than about t damp the gradient expansion to NLO is found to describe the full results rather well for g 2 (less-or-similar sign)1

  7. Solving polynomial differential equations by transforming them to linear functional-differential equations

    OpenAIRE

    Nahay, John Michael

    2008-01-01

    We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order Abel differential equation with two nonlinear terms in order to demonstrate in as much detail as possible the computations necessary for a complete solution. We mention in our section on further developments that the basic transformation idea can be generali...

  8. Solving Fuzzy Fractional Differential Equations Using Zadeh's Extension Principle

    Science.gov (United States)

    Ahmad, M. Z.; Hasan, M. K.; Abbasbandy, S.

    2013-01-01

    We study a fuzzy fractional differential equation (FFDE) and present its solution using Zadeh's extension principle. The proposed study extends the case of fuzzy differential equations of integer order. We also propose a numerical method to approximate the solution of FFDEs. To solve nonlinear problems, the proposed numerical method is then incorporated into an unconstrained optimisation technique. Several numerical examples are provided. PMID:24082853

  9. Students' errors in solving linear equation word problems: Case ...

    African Journals Online (AJOL)

    The study examined errors students make in solving linear equation word problems with a view to expose the nature of these errors and to make suggestions for classroom teaching. A diagnostic test comprising 10 linear equation word problems, was administered to a sample (n=130) of senior high school first year Home ...

  10. Solving the Richardson equations close to the critical points

    Energy Technology Data Exchange (ETDEWEB)

    DomInguez, F [Departamento de Matematicas, Universidad de Alcala, 28871 Alcala de Henares (Spain); Esebbag, C [Departamento de Matematicas, Universidad de Alcala, 28871 Alcala de Henares (Spain); Dukelsky, J [Instituto de Estructura de la Materia, CSIC, Serrano 123, 28006 Madrid (Spain)

    2006-09-15

    We study the Richardson equations close to the critical values of the pairing strength g{sub c}, where the occurrence of divergences precludes numerical solutions. We derive a set of equations for determining the critical g values and the non-collapsing pair energies. Studying the behaviour of the solutions close to the critical points, we develop a procedure to solve numerically the Richardson equations for arbitrary coupling strength.

  11. Moment equation approach to neoclassical transport theory

    International Nuclear Information System (INIS)

    Hirshman, S.P.

    1978-01-01

    The neoclassical cross-field fluxes for a toroidally confined, axisymmetric plasma are calculated in terms of the thermodynamic forces from the fluid continuity and momentum balance equations. This macroscopic formulation of neoclassical transport theory unifies the numerous complex expressions for the transport coefficients, previously obtained by solving the Fokker--Planck equation, and elucidates their physical basis. In the large aspect ratio limit, the continuous transition in the scaling of the diffusion coefficient throughout various collisionality regimes is shown to depend on the ratio of parallel viscosity coefficients of the plasma species. Comparison of the present results with the kinetic theory expressions for the neoclassical fluxes determines the parallel viscosity coefficients for a multispecies plasma in the long-mean-free-path regime

  12. New method for solving three-dimensional Schroedinger equation

    International Nuclear Information System (INIS)

    Melezhik, V.S.

    1992-01-01

    A new method is developed for solving the multidimensional Schroedinger equation without the variable separation. To solve the Schroedinger equation in a multidimensional coordinate space X, a difference grid Ω i (i=1,2,...,N) for some of variables, Ω, from X={R,Ω} is introduced and the initial partial-differential equation is reduced to a system of N differential-difference equations in terms of one of the variables R. The arising multi-channel scattering (or eigenvalue) problem is solved by the algorithm based on a continuous analog of the Newton method. The approach has been successfully tested for several two-dimensional problems (scattering on a nonspherical potential well and 'dipole' scatterer, a hydrogen atom in a homogenous magnetic field) and for a three-dimensional problem of the helium-atom bound states. (author)

  13. Symmetrized neutron transport equation and the fast Fourier transform method

    International Nuclear Information System (INIS)

    Sinh, N.Q.; Kisynski, J.; Mika, J.

    1978-01-01

    The differential equation obtained from the neutron transport equation by the application of the source iteration method in two-dimensional rectangular geometry is transformed into a symmetrized form with respect to one of the angular variables. The discretization of the symmetrized equation leads to finite difference equations based on the five-point scheme and solved by use of the fast Fourier transform method. Possible advantages of the approach are shown on test calculations

  14. An integral equation arising in two group neutron transport theory

    International Nuclear Information System (INIS)

    Cassell, J S; Williams, M M R

    2003-01-01

    An integral equation describing the fuel distribution necessary to maintain a flat flux in a nuclear reactor in two group transport theory is reduced to the solution of a singular integral equation. The formalism developed enables the physical aspects of the problem to be better understood and its relationship with the corresponding diffusion theory model is highlighted. The integral equation is solved by reducing it to a non-singular Fredholm equation which is then evaluated numerically

  15. Nodal spectrum method for solving neutron diffusion equation

    International Nuclear Information System (INIS)

    Sanchez, D.; Garcia, C. R.; Barros, R. C. de; Milian, D.E.

    1999-01-01

    Presented here is a new numerical nodal method for solving static multidimensional neutron diffusion equation in rectangular geometry. Our method is based on a spectral analysis of the nodal diffusion equations. These equations are obtained by integrating the diffusion equation in X, Y directions and then considering flat approximations for the current. These flat approximations are the only approximations that are considered in this method, as a result the numerical solutions are completely free from truncation errors. We show numerical results to illustrate the methods accuracy for coarse mesh calculations

  16. Transport equation and shock waves

    International Nuclear Information System (INIS)

    Besnard, D.

    1981-04-01

    A multi-group method is derived from a one dimensional transport equation for the slowing down and spatial transport of energetic positive ions in a plasma. This method is used to calculate the behaviour of energetic charged particles in non homogeneous and non stationary plasma, and the effect of energy deposition of the particles on the heating of the plasma. In that purpose, an equation for the density of fast ions is obtained from the Fokker-Planck equation, and a closure condition for the second moment of this equation is deduced from phenomenological considerations. This method leads to a numerical method, simple and very efficient, which doesn't require much computer storage. Two types of numerical results are obtained. First, results on the slowing down of 3.5 MeV alpha particles in a 50 keV plasma plublished by Corman and al and Moses are compared with the results obtained with both our method and a Monte Carlo type method. Good agreement was obtained, even for energy deposition on the ions of the plasma. Secondly, we have calculated propagation of alpha particles heating a cold plasma. These results are in very good agreement with those given by an accurate Monte Carlo method, for both the thermal velocity, and the energy deposition in the plasma

  17. Multiparameter extrapolation and deflation methods for solving equation systems

    Directory of Open Access Journals (Sweden)

    A. J. Hughes Hallett

    1984-01-01

    Full Text Available Most models in economics and the applied sciences are solved by first order iterative techniques, usually those based on the Gauss-Seidel algorithm. This paper examines the convergence of multiparameter extrapolations (accelerations of first order iterations, as an improved approximation to the Newton method for solving arbitrary nonlinear equation systems. It generalises my earlier results on single parameter extrapolations. Richardson's generalised method and the deflation method for detecting successive solutions in nonlinear equation systems are also presented as multiparameter extrapolations of first order iterations. New convergence results are obtained for those methods.

  18. Approximate Method for Solving the Linear Fuzzy Delay Differential Equations

    Directory of Open Access Journals (Sweden)

    S. Narayanamoorthy

    2015-01-01

    Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.

  19. A neuro approach to solve fuzzy Riccati differential equations

    Energy Technology Data Exchange (ETDEWEB)

    Shahrir, Mohammad Shazri, E-mail: mshazri@gmail.com [InstitutSainsMatematik, Universiti Malaya 50603 Kuala Lumpur, Wilayah Persekutuan Kuala Lumpur (Malaysia); Telekom Malaysia, R& D TM Innovation Centre, LingkaranTeknokrat Timur, 63000 Cyberjaya, Selangor (Malaysia); Kumaresan, N., E-mail: drnk2008@gmail.com; Kamali, M. Z. M.; Ratnavelu, Kurunathan [InstitutSainsMatematik, Universiti Malaya 50603 Kuala Lumpur, Wilayah Persekutuan Kuala Lumpur (Malaysia)

    2015-10-22

    There are many applications of optimal control theory especially in the area of control systems in engineering. In this paper, fuzzy quadratic Riccati differential equation is estimated using neural networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). The solution can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that NN approach shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over RK4.

  20. Modified Chebyshev Collocation Method for Solving Differential Equations

    Directory of Open Access Journals (Sweden)

    M Ziaul Arif

    2015-05-01

    Full Text Available This paper presents derivation of alternative numerical scheme for solving differential equations, which is modified Chebyshev (Vieta-Lucas Polynomial collocation differentiation matrices. The Scheme of modified Chebyshev (Vieta-Lucas Polynomial collocation method is applied to both Ordinary Differential Equations (ODEs and Partial Differential Equations (PDEs cases. Finally, the performance of the proposed method is compared with finite difference method and the exact solution of the example. It is shown that modified Chebyshev collocation method more effective and accurate than FDM for some example given.

  1. A highly accurate method to solve Fisher's equation

    Indian Academy of Sciences (India)

    The solution of the Helmholtz equation was approximated by a sixth-order compact finite difference. (CFD6) method in [29]. In [30], a CFD6 scheme has been presented to ... efficiency of the proposed method are reported in §3. Finally .... our discussion, one can apply the proposed method to solve the more general problem.

  2. A Simple Derivation of Kepler's Laws without Solving Differential Equations

    Science.gov (United States)

    Provost, J.-P.; Bracco, C.

    2009-01-01

    Proceeding like Newton with a discrete time approach of motion and a geometrical representation of velocity and acceleration, we obtain Kepler's laws without solving differential equations. The difficult part of Newton's work, when it calls for non-trivial properties of ellipses, is avoided by the introduction of polar coordinates. Then a simple…

  3. Using Computer Symbolic Algebra to Solve Differential Equations.

    Science.gov (United States)

    Mathews, John H.

    1989-01-01

    This article illustrates that mathematical theory can be incorporated into the process to solve differential equations by a computer algebra system, muMATH. After an introduction to functions of muMATH, several short programs for enhancing the capabilities of the system are discussed. Listed are six references. (YP)

  4. New method for solving three-dimensional Schroedinger equation

    International Nuclear Information System (INIS)

    Melezhik, V.S.

    1990-01-01

    The method derived recently for solving a multidimensional scattering problem is applied to a three-dimensional Schroedinger equation. As compared with direct three-dimensional calculations of finite elements and finite differences, this approach gives sufficiently accurate upper and lower approximations to the helium-atom binding energy, which demonstrates its efficiency. 15 refs.; 1 fig.; 2 tabs

  5. Ten-Year-Old Students Solving Linear Equations

    Science.gov (United States)

    Brizuela, Barbara; Schliemann, Analucia

    2004-01-01

    In this article, the authors seek to re-conceptualize the perspective regarding students' difficulties with algebra. While acknowledging that students "do" have difficulties when learning algebra, they also argue that the generally espoused criteria for algebra as the ability to work with the syntactical rules for solving equations is…

  6. Insights into the School Mathematics Tradition from Solving Linear Equations

    Science.gov (United States)

    Buchbinder, Orly; Chazan, Daniel; Fleming, Elizabeth

    2015-01-01

    In this article, we explore how the solving of linear equations is represented in English­-language algebra text books from the early nineteenth century when schooling was becoming institutionalized, and then survey contemporary teachers. In the text books, we identify the increasing presence of a prescribed order of steps (a canonical method) for…

  7. Students' errors in solving linear equation word problems: Case ...

    African Journals Online (AJOL)

    kofi.mereku

    Development in most areas of life is based on effective knowledge of science and ... Problem solving, as used in mathematics education literature, refers ... word problems, on the other hand, are those linear equation tasks or ... taught LEWPs in the junior high school, many of them reach the senior high school without a.

  8. Experimental quantum computing to solve systems of linear equations.

    Science.gov (United States)

    Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

    2013-06-07

    Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

  9. Splitting Method for Solving the Coarse-Mesh Discretized Low-Order Quasi-Diffusion Equations

    International Nuclear Information System (INIS)

    Hiruta, Hikaru; Anistratov, Dmitriy Y.; Adams, Marvin L.

    2005-01-01

    In this paper, the development is presented of a splitting method that can efficiently solve coarse-mesh discretized low-order quasi-diffusion (LOQD) equations. The LOQD problem can reproduce exactly the transport scalar flux and current. To solve the LOQD equations efficiently, a splitting method is proposed. The presented method splits the LOQD problem into two parts: (a) the D problem that captures a significant part of the transport solution in the central parts of assemblies and can be reduced to a diffusion-type equation and (b) the Q problem that accounts for the complicated behavior of the transport solution near assembly boundaries. Independent coarse-mesh discretizations are applied: the D problem equations are approximated by means of a finite element method, whereas the Q problem equations are discretized using a finite volume method. Numerical results demonstrate the efficiency of the methodology presented. This methodology can be used to modify existing diffusion codes for full-core calculations (which already solve a version of the D problem) to account for transport effects

  10. Solving Eigenvalue response matrix equations with Jacobian-Free Newton-Krylov methods

    International Nuclear Information System (INIS)

    Roberts, Jeremy A.; Forget, Benoit

    2011-01-01

    The response matrix method for reactor eigenvalue problems is motivated as a technique for solving coarse mesh transport equations, and the classical approach of power iteration (PI) for solution is described. The method is then reformulated as a nonlinear system of equations, and the associated Jacobian is derived. A Jacobian-Free Newton-Krylov (JFNK) method is employed to solve the system, using an approximate Jacobian coupled with incomplete factorization as a preconditioner. The unpreconditioned JFNK slightly outperforms PI, and preconditioned JFNK outperforms both PI and Steffensen-accelerated PI significantly. (author)

  11. Approximate analytical methods for solving ordinary differential equations

    CERN Document Server

    Radhika, TSL; Rani, T Raja

    2015-01-01

    Approximate Analytical Methods for Solving Ordinary Differential Equations (ODEs) is the first book to present all of the available approximate methods for solving ODEs, eliminating the need to wade through multiple books and articles. It covers both well-established techniques and recently developed procedures, including the classical series solution method, diverse perturbation methods, pioneering asymptotic methods, and the latest homotopy methods.The book is suitable not only for mathematicians and engineers but also for biologists, physicists, and economists. It gives a complete descripti

  12. Reproducing Kernel Method for Solving Nonlinear Differential-Difference Equations

    Directory of Open Access Journals (Sweden)

    Reza Mokhtari

    2012-01-01

    Full Text Available On the basis of reproducing kernel Hilbert spaces theory, an iterative algorithm for solving some nonlinear differential-difference equations (NDDEs is presented. The analytical solution is shown in a series form in a reproducing kernel space, and the approximate solution , is constructed by truncating the series to terms. The convergence of , to the analytical solution is also proved. Results obtained by the proposed method imply that it can be considered as a simple and accurate method for solving such differential-difference problems.

  13. A method of solving simple harmonic oscillator Schroedinger equation

    Science.gov (United States)

    Maury, Juan Carlos F.

    1995-01-01

    A usual step in solving totally Schrodinger equation is to try first the case when dimensionless position independent variable w is large. In this case the Harmonic Oscillator equation takes the form (d(exp 2)/dw(exp 2) - w(exp 2))F = 0, and following W.K.B. method, it gives the intermediate corresponding solution F = exp(-w(exp 2)/2), which actually satisfies exactly another equation, (d(exp 2)/dw(exp 2) + 1 - w(exp 2))F = 0. We apply a different method, useful in anharmonic oscillator equations, similar to that of Rampal and Datta, and although it is slightly more complicated however it is also more general and systematic.

  14. A universal concept based on cellular neural networks for ultrafast and flexible solving of differential equations.

    Science.gov (United States)

    Chedjou, Jean Chamberlain; Kyamakya, Kyandoghere

    2015-04-01

    This paper develops and validates a comprehensive and universally applicable computational concept for solving nonlinear differential equations (NDEs) through a neurocomputing concept based on cellular neural networks (CNNs). High-precision, stability, convergence, and lowest-possible memory requirements are ensured by the CNN processor architecture. A significant challenge solved in this paper is that all these cited computing features are ensured in all system-states (regular or chaotic ones) and in all bifurcation conditions that may be experienced by NDEs.One particular quintessence of this paper is to develop and demonstrate a solver concept that shows and ensures that CNN processors (realized either in hardware or in software) are universal solvers of NDE models. The solving logic or algorithm of given NDEs (possible examples are: Duffing, Mathieu, Van der Pol, Jerk, Chua, Rössler, Lorenz, Burgers, and the transport equations) through a CNN processor system is provided by a set of templates that are computed by our comprehensive templates calculation technique that we call nonlinear adaptive optimization. This paper is therefore a significant contribution and represents a cutting-edge real-time computational engineering approach, especially while considering the various scientific and engineering applications of this ultrafast, energy-and-memory-efficient, and high-precise NDE solver concept. For illustration purposes, three NDE models are demonstratively solved, and related CNN templates are derived and used: the periodically excited Duffing equation, the Mathieu equation, and the transport equation.

  15. A New Fractional Projective Riccati Equation Method for Solving Fractional Partial Differential Equations

    International Nuclear Information System (INIS)

    Feng Qing-Hua

    2014-01-01

    In this paper, a new fractional projective Riccati equation method is proposed to establish exact solutions for fractional partial differential equations in the sense of modified Riemann—Liouville derivative. This method can be seen as the fractional version of the known projective Riccati equation method. For illustrating the validity of this method, we apply this method to solve the space-time fractional Whitham—Broer—Kaup (WBK) equations and the nonlinear fractional Sharma—Tasso—Olever (STO) equation, and as a result, some new exact solutions for them are obtained. (general)

  16. Solving nonlinear evolution equation system using two different methods

    Science.gov (United States)

    Kaplan, Melike; Bekir, Ahmet; Ozer, Mehmet N.

    2015-12-01

    This paper deals with constructing more general exact solutions of the coupled Higgs equation by using the (G0/G, 1/G)-expansion and (1/G0)-expansion methods. The obtained solutions are expressed by three types of functions: hyperbolic, trigonometric and rational functions with free parameters. It has been shown that the suggested methods are productive and will be used to solve nonlinear partial differential equations in applied mathematics and engineering. Throughout the paper, all the calculations are made with the aid of the Maple software.

  17. Solving Nonlinear Partial Differential Equations with Maple and Mathematica

    CERN Document Server

    Shingareva, Inna K

    2011-01-01

    The emphasis of the book is given in how to construct different types of solutions (exact, approximate analytical, numerical, graphical) of numerous nonlinear PDEs correctly, easily, and quickly. The reader can learn a wide variety of techniques and solve numerous nonlinear PDEs included and many other differential equations, simplifying and transforming the equations and solutions, arbitrary functions and parameters, presented in the book). Numerous comparisons and relationships between various types of solutions, different methods and approaches are provided, the results obtained in Maple an

  18. Various Newton-type iterative methods for solving nonlinear equations

    Directory of Open Access Journals (Sweden)

    Manoj Kumar

    2013-10-01

    Full Text Available The aim of the present paper is to introduce and investigate new ninth and seventh order convergent Newton-type iterative methods for solving nonlinear equations. The ninth order convergent Newton-type iterative method is made derivative free to obtain seventh-order convergent Newton-type iterative method. These new with and without derivative methods have efficiency indices 1.5518 and 1.6266, respectively. The error equations are used to establish the order of convergence of these proposed iterative methods. Finally, various numerical comparisons are implemented by MATLAB to demonstrate the performance of the developed methods.

  19. An Unconditionally Stable Method for Solving the Acoustic Wave Equation

    Directory of Open Access Journals (Sweden)

    Zhi-Kai Fu

    2015-01-01

    Full Text Available An unconditionally stable method for solving the time-domain acoustic wave equation using Associated Hermit orthogonal functions is proposed. The second-order time derivatives in acoustic wave equation are expanded by these orthogonal basis functions. By applying Galerkin temporal testing procedure, the time variable can be eliminated from the calculations. The restriction of Courant-Friedrichs-Levy (CFL condition in selecting time step for analyzing thin layer can be avoided. Numerical results show the accuracy and the efficiency of the proposed method.

  20. A Meshfree Quasi-Interpolation Method for Solving Burgers’ Equation

    Directory of Open Access Journals (Sweden)

    Mingzhu Li

    2014-01-01

    Full Text Available The main aim of this work is to consider a meshfree algorithm for solving Burgers’ equation with the quartic B-spline quasi-interpolation. Quasi-interpolation is very useful in the study of approximation theory and its applications, since it can yield solutions directly without the need to solve any linear system of equations and overcome the ill-conditioning problem resulting from using the B-spline as a global interpolant. The numerical scheme is presented, by using the derivative of the quasi-interpolation to approximate the spatial derivative of the dependent variable and a low order forward difference to approximate the time derivative of the dependent variable. Compared to other numerical methods, the main advantages of our scheme are higher accuracy and lower computational complexity. Meanwhile, the algorithm is very simple and easy to implement and the numerical experiments show that it is feasible and valid.

  1. The Laplace transformation of adjoint transport equations

    International Nuclear Information System (INIS)

    Hoogenboom, J.E.

    1985-01-01

    A clarification is given of the difference between the equation adjoint to the Laplace-transformed time-dependent transport equation and the Laplace-transformed time-dependent adjoint transport equation. Proper procedures are derived to obtain the Laplace transform of the instantaneous detector response. (author)

  2. New Efficient Fourth Order Method for Solving Nonlinear Equations

    Directory of Open Access Journals (Sweden)

    Farooq Ahmad

    2013-12-01

    Full Text Available In a paper [Appl. Math. Comput., 188 (2 (2007 1587--1591], authors have suggested and analyzed a method for solving nonlinear equations. In the present work, we modified this method by using the finite difference scheme, which has a quintic convergence. We have compared this modified Halley method with some other iterative of fifth-orders convergence methods, which shows that this new method having convergence of fourth order, is efficient.

  3. Domain decomposition method for solving the neutron diffusion equation

    International Nuclear Information System (INIS)

    Coulomb, F.

    1989-03-01

    The aim of this work is to study methods for solving the neutron diffusion equation; we are interested in methods based on a classical finite element discretization and well suited for use on parallel computers. Domain decomposition methods seem to answer this preoccupation. This study deals with a decomposition of the domain. A theoretical study is carried out for Lagrange finite elements and some examples are given; in the case of mixed dual finite elements, the study is based on examples [fr

  4. A Proposed Method for Solving Fuzzy System of Linear Equations

    Directory of Open Access Journals (Sweden)

    Reza Kargar

    2014-01-01

    Full Text Available This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m×n linear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.

  5. Guiding brine shrimp through mazes by solving reaction diffusion equations

    Science.gov (United States)

    Singal, Krishma; Fenton, Flavio

    Excitable systems driven by reaction diffusion equations have been shown to not only find solutions to mazes but to also to find the shortest path between the beginning and the end of the maze. In this talk we describe how we can use the Fitzhugh-Nagumo model, a generic model for excitable media, to solve a maze by varying the basin of attraction of its two fixed points. We demonstrate how two dimensional mazes are solved numerically using a Java Applet and then accelerated to run in real time by using graphic processors (GPUs). An application of this work is shown by guiding phototactic brine shrimp through a maze solved by the algorithm. Once the path is obtained, an Arduino directs the shrimp through the maze using lights from LEDs placed at the floor of the Maze. This method running in real time could be eventually used for guiding robots and cars through traffic.

  6. Isotope decay equations solved by means of a recursive method

    International Nuclear Information System (INIS)

    Grant, Carlos

    2009-01-01

    The isotope decay equations have been solved using forward finite differences taking small time steps, among other methods. This is the case of the cell code WIMS, where it is assumed that concentrations of all fissionable isotopes remain constant during the integration interval among other simplifications. Even when the problem could be solved running through a logical tree, all algorithms used for resolution of these equations used an iterative programming formulation. That happened because nearly all computer languages used up to a recent past by the scientific programmers did not support recursion, such as the case of the old versions of FORTRAN or BASIC. Nowadays also an integral form of the depletion equations is used in Monte Carlo simulation. In this paper we propose another programming solution using a recursive algorithm, running through all descendants of each isotope and adding their contributions to all isotopes in each generation. The only assumption made for this solution is that fluxes remain constant during the whole time step. Recursive process is interrupted when a stable isotope was attained or the calculated contributions are smaller than a given precision. These algorithms can be solved by means an exact analytic method that can have some problems when circular loops appear for isotopes with alpha decay, and a more general polynomial method. Both methods are shown. (author)

  7. Taylor's series method for solving the nonlinear point kinetics equations

    International Nuclear Information System (INIS)

    Nahla, Abdallah A.

    2011-01-01

    Highlights: → Taylor's series method for nonlinear point kinetics equations is applied. → The general order of derivatives are derived for this system. → Stability of Taylor's series method is studied. → Taylor's series method is A-stable for negative reactivity. → Taylor's series method is an accurate computational technique. - Abstract: Taylor's series method for solving the point reactor kinetics equations with multi-group of delayed neutrons in the presence of Newtonian temperature feedback reactivity is applied and programmed by FORTRAN. This system is the couples of the stiff nonlinear ordinary differential equations. This numerical method is based on the different order derivatives of the neutron density, the precursor concentrations of i-group of delayed neutrons and the reactivity. The r th order of derivatives are derived. The stability of Taylor's series method is discussed. Three sets of applications: step, ramp and temperature feedback reactivities are computed. Taylor's series method is an accurate computational technique and stable for negative step, negative ramp and temperature feedback reactivities. This method is useful than the traditional methods for solving the nonlinear point kinetics equations.

  8. A modular spherical harmonics approach to the neutron transport equation

    International Nuclear Information System (INIS)

    Inanc, F.; Rohach, A.F.

    1989-01-01

    A modular nodal method was developed for solving the neutron transport equation in 2-D xy coordinates. The spherical harmonic expansion was used for approximating the second-order even-parity form of the neutron transport equation. The boundary conditions of the spherical harmonics approximation were derived in a form to have forms analogous to the partial currents in the neutron diffusion equation. Relations were developed for generating both the second-order spherical harmonic equations and the boundary conditions in an automated computational algorithm. Nodes using different orders of the spherical harmonics approximation to the transport equation were interfaced through mixed-type boundary conditions. The determination of spherical harmonic orders implemented in the nodes were determined by the scheme in an automated manner. Results of the method compared favorably to benchmark problems. (author)

  9. Mathematics Literacy of Secondary Students in Solving Simultanenous Linear Equations

    Science.gov (United States)

    Sitompul, R. S. I.; Budayasa, I. K.; Masriyah

    2018-01-01

    This study examines the profile of secondary students’ mathematical literacy in solving simultanenous linear equations problems in terms of cognitive style of visualizer and verbalizer. This research is a descriptive research with qualitative approach. The subjects in this research consist of one student with cognitive style of visualizer and one student with cognitive style of verbalizer. The main instrument in this research is the researcher herself and supporting instruments are cognitive style tests, mathematics skills tests, problem-solving tests and interview guidelines. Research was begun by determining the cognitive style test and mathematics skill test. The subjects chosen were given problem-solving test about simultaneous linear equations and continued with interview. To ensure the validity of the data, the researcher conducted data triangulation; the steps of data reduction, data presentation, data interpretation, and conclusion drawing. The results show that there is a similarity of visualizer and verbalizer-cognitive style in identifying and understanding the mathematical structure in the process of formulating. There are differences in how to represent problems in the process of implementing, there are differences in designing strategies and in the process of interpreting, and there are differences in explaining the logical reasons.

  10. Solving Partial Differential Equations Using a New Differential Evolution Algorithm

    Directory of Open Access Journals (Sweden)

    Natee Panagant

    2014-01-01

    Full Text Available This paper proposes an alternative meshless approach to solve partial differential equations (PDEs. With a global approximate function being defined, a partial differential equation problem is converted into an optimisation problem with equality constraints from PDE boundary conditions. An evolutionary algorithm (EA is employed to search for the optimum solution. For this approach, the most difficult task is the low convergence rate of EA which consequently results in poor PDE solution approximation. However, its attractiveness remains due to the nature of a soft computing technique in EA. The algorithm can be used to tackle almost any kind of optimisation problem with simple evolutionary operation, which means it is mathematically simpler to use. A new efficient differential evolution (DE is presented and used to solve a number of the partial differential equations. The results obtained are illustrated and compared with exact solutions. It is shown that the proposed method has a potential to be a future meshless tool provided that the search performance of EA is greatly enhanced.

  11. Unconditionally stable diffusion-acceleration of the transport equation

    International Nuclear Information System (INIS)

    Larson, E.W.

    1982-01-01

    The standard iterative procedure for solving fixed-source discrete-ordinates problems converges very slowly for problems in optically thick regions with scattering ratios c near unity. The diffusion-synthetic acceleration method has been proposed to make use of the fact that for this class of problems, the diffusion equation is often an accurate approximation to the transport equation. However, stability difficulties have historically hampered the implementation of this method for general transport differencing schemes. In this article we discuss a recently developed procedure for obtaining unconditionally stable diffusion-synthetic acceleration methods for various transport differencing schemes. We motivate the analysis by first discussing the exact transport equation; then we illustrate the procedure by deriving a new stable acceleration method for the linear discontinuous transport differencing scheme. We also provide some numerical results

  12. Unconditionally stable diffusion-acceleration of the transport equation

    International Nuclear Information System (INIS)

    Larsen, E.W.

    1982-01-01

    The standard iterative procedure for solving fixed-source discrete-ordinates problems converges very slowly for problems in optically large regions with scattering ratios c near unity. The diffusion-synthetic acceleration method has been proposed to make use of the fact that for this class of problems the diffusion equation is often an accurate approximation to the transport equation. However, stability difficulties have historically hampered the implementation of this method for general transport differencing schemes. In this article we discuss a recently developed procedure for obtaining unconditionally stable diffusion-synthetic acceleration methods for various transport differencing schemes. We motivate the analysis by first discussing the exact transport equation; then we illustrate the procedure by deriving a new stable acceleration method for the linear discontinuous transport differencing scheme. We also provide some numerical results

  13. A novel method to solve functional differential equations

    International Nuclear Information System (INIS)

    Tapia, V.

    1990-01-01

    A method to solve differential equations containing the variational operator as the derivation operation is presented. They are called variational differential equations (VDE). The solution to a VDE should be a function containing the derivatives, with respect to the base space coordinates, of the fields up to a generic order s: a s-th-order function. The variational operator doubles the order of the function on which it acts. Therefore, in order to make compatible the orders of the different terms appearing in a VDE, the solution should be a function containing the derivatives of the fields at all orders. But this takes us again back to the functional methods. In order to avoid this, one must restrict the considerations, in the case of second-order VDEs, to the space of s-th-order functions on which the variational operator acts transitively. These functions have been characterized for a one-dimensional base space for the first- and second-order cases. These functions turn out to be polynomial in the highest-order derivatives of the fields with functions of the lower-order derivatives as coefficients. Then VDEs reduce to a system of coupled partial differential equations for the coefficients above mentioned. The importance of the method lies on the fact that the solutions to VDEs are in a one-to-one correspondence with the solutions of functional differential equations. The previous method finds direct applications in quantum field theory, where the Schroedinger equation plays a central role. Since the Schroedinger equation is reduced to a system of coupled partial differential equations, this provides a nonperturbative scheme for quantum field theory. As an example, the massless scalar field is considered

  14. Development of a set of benchmark problems to verify numerical methods for solving burnup equations

    International Nuclear Information System (INIS)

    Lago, Daniel; Rahnema, Farzad

    2017-01-01

    Highlights: • Description transmutation chain benchmark problems. • Problems for validating numerical methods for solving burnup equations. • Analytical solutions for the burnup equations. • Numerical solutions for the burnup equations. - Abstract: A comprehensive set of transmutation chain benchmark problems for numerically validating methods for solving burnup equations was created. These benchmark problems were designed to challenge both traditional and modern numerical methods used to solve the complex set of ordinary differential equations used for tracking the change in nuclide concentrations over time due to nuclear phenomena. Given the development of most burnup solvers is done for the purpose of coupling with an established transport solution method, these problems provide a useful resource in testing and validating the burnup equation solver before coupling for use in a lattice or core depletion code. All the relevant parameters for each benchmark problem are described. Results are also provided in the form of reference solutions generated by the Mathematica tool, as well as additional numerical results from MATLAB.

  15. Neural network error correction for solving coupled ordinary differential equations

    Science.gov (United States)

    Shelton, R. O.; Darsey, J. A.; Sumpter, B. G.; Noid, D. W.

    1992-01-01

    A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

  16. A rational function based scheme for solving advection equation

    International Nuclear Information System (INIS)

    Xiao, Feng; Yabe, Takashi.

    1995-07-01

    A numerical scheme for solving advection equations is presented. The scheme is derived from a rational interpolation function. Some properties of the scheme with respect to convex-concave preserving and monotone preserving are discussed. We find that the scheme is attractive in surpressinging overshoots and undershoots even in the vicinities of discontinuity. The scheme can also be easily swicthed as the CIP (Cubic interpolated Pseudo-Particle) method to get a third-order accuracy in smooth region. Numbers of numerical tests are carried out to show the non-oscillatory and less diffusive nature of the scheme. (author)

  17. Gabor Wave Packet Method to Solve Plasma Wave Equations

    International Nuclear Information System (INIS)

    Pletzer, A.; Phillips, C.K.; Smithe, D.N.

    2003-01-01

    A numerical method for solving plasma wave equations arising in the context of mode conversion between the fast magnetosonic and the slow (e.g ion Bernstein) wave is presented. The numerical algorithm relies on the expansion of the solution in Gaussian wave packets known as Gabor functions, which have good resolution properties in both real and Fourier space. The wave packets are ideally suited to capture both the large and small wavelength features that characterize mode conversion problems. The accuracy of the scheme is compared with a standard finite element approach

  18. A simple derivation of Kepler's laws without solving differential equations

    International Nuclear Information System (INIS)

    Provost, J-P; Bracco, C

    2009-01-01

    Proceeding like Newton with a discrete time approach of motion and a geometrical representation of velocity and acceleration, we obtain Kepler's laws without solving differential equations. The difficult part of Newton's work, when it calls for non-trivial properties of ellipses, is avoided by the introduction of polar coordinates. Then a simple reconsideration of Newton's figure naturally leads to an explicit expression of the velocity and to the equation of the trajectory. This derivation, which can be fully apprehended by undergraduates or by secondary school teachers (who might use it with their pupils), can be considered as a first application of mechanical concepts to a physical problem of great historical and pedagogical interest

  19. The 'generalized Balescu-Lenard' transport equations

    International Nuclear Information System (INIS)

    Mynick, H.E.

    1990-01-01

    The transport equations arising from the 'generalized Balescu-Lenard' collision operator are obtained and some of their properties examined. The equations contain neoclassical and turbulent transport as two special cases having the same structure. The resultant theory offers a possible explanation for a number of results not well understood, including the anomalous pinch, observed ratios of Q/ΓT on TFTR, and numerical reproduction of ASDEX profiles by a model for turbulent transport invoked without derivation, but by analogy with neoclassical theory. The general equations are specialized to consideration of a number of particular transport mechanisms of interest. (author). Letter-to-the-editor. 10 refs

  20. The gBL transport equations

    International Nuclear Information System (INIS)

    Mynick, H.E.

    1989-05-01

    The transport equations arising from the ''generalized Balescu- Lenard'' (gBL) collision operator are obtained, and some of their properties examined. The equations contain neoclassical and turbulent transport as two special cases, having the same structure. The resultant theory offers potential explanation for a number of results not well understood, including the anomalous pinch, observed ratios of Q/ΓT on TFTR, and numerical reproduction of ASDEX profiles by a model for turbulent transport invoked without derivation, but by analogy to neoclassical theory. The general equations are specialized to consideration of a number of particular transport mechanisms of interest. 10 refs

  1. Integrator Performance Analysis In Solving Stiff Differential Equation System

    International Nuclear Information System (INIS)

    B, Alhadi; Basaruddin, T.

    2001-01-01

    In this paper we discuss the four-stage index-2 singly diagonally implicit Runge-Kutta method, which is used to solve stiff ordinary differential equations (SODE). Stiff problems require a method where step size is not restricted by the method's stability. We desire SDIRK to be A-stable that has no stability restrictions when solving y'= λy with Reλ>0 and h>0, so by choosing suitable stability function we can determine appropriate constant g) to formulate SDIRK integrator to solve SODE. We select the second stage of the internal stage as embedded method to perform low order estimate for error predictor. The strategy for choosing the step size is adopted from the strategy proposed by Hall(1996:6). And the algorithm that is developed in this paper is implemented using MATLAB 5.3, which is running on Window's 95 environment. Our performance measurement's local truncation error accuracy, and efficiency were evaluated by statistical results of sum of steps, sum of calling functions, average of Newton iterations and elapsed times.As the results, our numerical experiment show that SDIRK is unconditionally stable. By using Hall's step size strategy, the method can be implemented efficiently, provided that suitable parameters are used

  2. Nodal collocation approximation for the multidimensional PL equations applied to transport source problems

    International Nuclear Information System (INIS)

    Verdu, G.; Capilla, M.; Talavera, C. F.; Ginestar, D.

    2012-01-01

    PL equations are classical high order approximations to the transport equations which are based on the expansion of the angular dependence of the angular neutron flux and the nuclear cross sections in terms of spherical harmonics. A nodal collocation method is used to discretize the PL equations associated with a neutron source transport problem. The performance of the method is tested solving two 1D problems with analytical solution for the transport equation and a classical 2D problem. (authors)

  3. Nodal collocation approximation for the multidimensional PL equations applied to transport source problems

    Energy Technology Data Exchange (ETDEWEB)

    Verdu, G. [Departamento de Ingenieria Quimica Y Nuclear, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain); Capilla, M.; Talavera, C. F.; Ginestar, D. [Dept. of Nuclear Engineering, Departamento de Matematica Aplicada, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain)

    2012-07-01

    PL equations are classical high order approximations to the transport equations which are based on the expansion of the angular dependence of the angular neutron flux and the nuclear cross sections in terms of spherical harmonics. A nodal collocation method is used to discretize the PL equations associated with a neutron source transport problem. The performance of the method is tested solving two 1D problems with analytical solution for the transport equation and a classical 2D problem. (authors)

  4. [Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (2)].

    Science.gov (United States)

    Murase, Kenya

    2015-01-01

    In this issue, symbolic methods for solving differential equations were firstly introduced. Of the symbolic methods, Laplace transform method was also introduced together with some examples, in which this method was applied to solving the differential equations derived from a two-compartment kinetic model and an equivalent circuit model for membrane potential. Second, series expansion methods for solving differential equations were introduced together with some examples, in which these methods were used to solve Bessel's and Legendre's differential equations. In the next issue, simultaneous differential equations and various methods for solving these differential equations will be introduced together with some examples in medical physics.

  5. [Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (1)].

    Science.gov (United States)

    Murase, Kenya

    2014-01-01

    Utilization of differential equations and methods for solving them in medical physics are presented. First, the basic concept and the kinds of differential equations were overviewed. Second, separable differential equations and well-known first-order and second-order differential equations were introduced, and the methods for solving them were described together with several examples. In the next issue, the symbolic and series expansion methods for solving differential equations will be mainly introduced.

  6. An inherently parallel method for solving discretized diffusion equations

    International Nuclear Information System (INIS)

    Eccleston, B.R.; Palmer, T.S.

    1999-01-01

    A Monte Carlo approach to solving linear systems of equations is being investigated in the context of the solution of discretized diffusion equations. While the technique was originally devised decades ago, changes in computer architectures (namely, massively parallel machines) have driven the authors to revisit this technique. There are a number of potential advantages to this approach: (1) Analog Monte Carlo techniques are inherently parallel; this is not necessarily true to today's more advanced linear equation solvers (multigrid, conjugate gradient, etc.); (2) Some forms of this technique are adaptive in that they allow the user to specify locations in the problem where resolution is of particular importance and to concentrate the work at those locations; and (3) These techniques permit the solution of very large systems of equations in that matrix elements need not be stored. The user could trade calculational speed for storage if elements of the matrix are calculated on the fly. The goal of this study is to compare the parallel performance of Monte Carlo linear solvers to that of a more traditional parallelized linear solver. The authors observe the linear speedup that they expect from the Monte Carlo algorithm, given that there is no domain decomposition to cause significant communication overhead. Overall, PETSc outperforms the Monte Carlo solver for the test problem. The PETSc parallel performance improves with larger numbers of unknowns for a given number of processors. Parallel performance of the Monte Carlo technique is independent of the size of the matrix and the number of processes. They are investigating modifications to the scheme to accommodate matrix problems with positive off-diagonal elements. They are also currently coding an on-the-fly version of the algorithm to investigate the solution of very large linear systems

  7. Solving the RPA eigenvalue equation in real-space

    CERN Document Server

    Muta, A; Hashimoto, Y; Yabana, K

    2002-01-01

    We present a computational method to solve the RPA eigenvalue equation employing a uniform grid representation in three-dimensional Cartesian coordinates. The conjugate gradient method is used for this purpose as an interactive method for a generalized eigenvalue problem. No construction of unoccupied orbitals is required in the procedure. We expect this method to be useful for systems lacking spatial symmetry to calculate accurate eigenvalues and transition matrix elements of a few low-lying excitations. Some applications are presented to demonstrate the feasibility of the method, considering the simplified mean-field model as an example of a nuclear physics system and the electronic excitations in molecules with time-dependent density functional theory as an example of an electronic system. (author)

  8. Solving Fully Fuzzy Linear System of Equations in General Form

    Directory of Open Access Journals (Sweden)

    A. Yousefzadeh

    2012-06-01

    Full Text Available In this work, we propose an approach for computing the positive solution of a fully fuzzy linear system where the coefficient matrix is a fuzzy $nimes n$ matrix. To do this, we use arithmetic operations on fuzzy numbers that introduced by Kaffman in and convert the fully fuzzy linear system into two $nimes n$ and $2nimes 2n$ crisp linear systems. If the solutions of these linear systems don't satisfy in positive fuzzy solution condition, we introduce the constrained least squares problem to obtain optimal fuzzy vector solution by applying the ranking function in given fully fuzzy linear system. Using our proposed method, the fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.

  9. Development of interfacial area transport equation

    International Nuclear Information System (INIS)

    Kim, Seung Jin; Ishii, Mamoru; Kelly, Joseph

    2005-01-01

    The interfacial area transport equation dynamically models the changes in interfacial structures along the flow field by mechanistically modeling the creation and destruction of dispersed phase. Hence, when employed in the numerical thermal-hydraulic system analysis codes, it eliminates artificial bifurcations stemming from the use of the static flow regime transition criteria. Accounting for the substantial differences in the transport mechanism for various sizes of bubbles, the transport equation is formulated for two characteristic groups of bubbles. The group 1 equation describes the transport of small-dispersed bubbles, whereas the group 2 equation describes the transport of large cap, slug or churn-turbulent bubbles. To evaluate the feasibility and reliability of interfacial area transport equation available at present, it is benchmarked by an extensive database established in various two-phase flow configurations spanning from bubbly to churn-turbulent flow regimes. The geometrical effect in interfacial area transport is examined by the data acquired in vertical air-water two-phase flow through round pipes of various sizes and a confined flow duct, and by those acquired in vertical co-current downward air-water two-phase flow through round pipes of two different sizes

  10. Two-scale approach to oscillatory singularly perturbed transport equations

    CERN Document Server

    Frénod, Emmanuel

    2017-01-01

    This book presents the classical results of the two-scale convergence theory and explains – using several figures – why it works. It then shows how to use this theory to homogenize ordinary differential equations with oscillating coefficients as well as oscillatory singularly perturbed ordinary differential equations. In addition, it explores the homogenization of hyperbolic partial differential equations with oscillating coefficients and linear oscillatory singularly perturbed hyperbolic partial differential equations. Further, it introduces readers to the two-scale numerical methods that can be built from the previous approaches to solve oscillatory singularly perturbed transport equations (ODE and hyperbolic PDE) and demonstrates how they can be used efficiently. This book appeals to master’s and PhD students interested in homogenization and numerics, as well as to the Iter community.

  11. Solving (2 + 1)-dimensional sine-Poisson equation by a modified variable separated ordinary differential equation method

    International Nuclear Information System (INIS)

    Ka-Lin, Su; Yuan-Xi, Xie

    2010-01-01

    By introducing a more general auxiliary ordinary differential equation (ODE), a modified variable separated ordinary differential equation method is presented for solving the (2 + 1)-dimensional sine-Poisson equation. As a result, many explicit and exact solutions of the (2 + 1)-dimensional sine-Poisson equation are derived in a simple manner by this technique. (general)

  12. Simulation of transport equations with Monte Carlo

    International Nuclear Information System (INIS)

    Matthes, W.

    1975-09-01

    The main purpose of the report is to explain the relation between the transport equation and the Monte Carlo game used for its solution. The introduction of artificial particles carrying a weight provides one with high flexibility in constructing many different games for the solution of the same equation. This flexibility opens a way to construct a Monte Carlo game for the solution of the adjoint transport equation. Emphasis is laid mostly on giving a clear understanding of what to do and not on the details of how to do a specific game

  13. Numerical solution of the transport equation describing the radon transport from subsurface soil to buildings

    International Nuclear Information System (INIS)

    Savovic, S.; Djordjevich, A.; Ristic, G.

    2012-01-01

    A theoretical evaluation of the properties and processes affecting the radon transport from subsurface soil into buildings is presented in this work. The solution of the relevant transport equation is obtained using the explicit finite difference method (EFDM). Results are compared with analytical steady-state solution reported in the literature. Good agreement is found. It is shown that EFDM is effective and accurate for solving the equation that describes radon diffusion, advection and decay during its transport from subsurface to buildings, which is especially important when arbitrary initial and boundary conditions are required. (authors)

  14. Numerical Integration of the Transport Equation For Infinite Homogeneous Media

    Energy Technology Data Exchange (ETDEWEB)

    Haakansson, Rune

    1962-01-15

    The transport equation for neutrons in infinite homogeneous media is solved by direct numerical integration. Accounts are taken to the anisotropy and the inelastic scattering. The integration has been performed by means of the trapezoidal rule and the length of the energy intervals are constant in lethargy scale. The machine used is a Ferranti Mercury computer. Results are given for water, heavy water, aluminium water mixture and iron-aluminium-water mixture.

  15. Comparison of neutronic transport equation resolution nodal methods

    International Nuclear Information System (INIS)

    Zamonsky, O.M.; Gho, C.J.

    1990-01-01

    In this work, some transport equation resolution nodal methods are comparatively studied: the constant-constant (CC), linear-nodal (LN) and the constant-quadratic (CQ). A nodal scheme equivalent to finite differences has been used for its programming, permitting its inclusion in existing codes. Some bidimensional problems have been solved, showing that linear-nodal (LN) are, in general, obtained with accuracy in CPU shorter times. (Author) [es

  16. ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations

    Science.gov (United States)

    Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil

    2018-04-01

    In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.

  17. A matrix formalism to solve interface condition equations in a reactor system

    Energy Technology Data Exchange (ETDEWEB)

    Matausek, M V [Boris Kidric Institute of Nuclear Sciences Vinca, Beograd (Yugoslavia)

    1970-05-15

    When a nuclear reactor or a reactor lattice cell is treated by an approximate procedure to solve the neutron transport equation, as the last computational step often appears a problem of solving systems of algebraic equations stating the interface and boundary conditions for the neutron flux moments. These systems have usually the coefficient matrices of the block-bi diagonal type, containing thus a large number of zero elements. In the present report it is shown how such a system can be solved efficiently accounting for all the zero elements both in the coefficient matrix and in the free term vector. The procedure is presented here for the case of multigroup P{sub 3} calculation of neutron flux distribution in a cylindrical reactor lattice cell. Compared with the standard gaussian elimination method, this procedure is more advantageous both in respect to the number of operations needed to solve a given problem and in respect to the computer memory storage requirements. A similar formalism can also be applied for other approximate methods, for instance for multigroup diffusion treatment of a multi zone reactor. (author)

  18. Variational formulation and projectional methods for the second order transport equation

    International Nuclear Information System (INIS)

    Borysiewicz, M.; Stankiewicz, R.

    1979-01-01

    Herein the variational problem for a second-order boundary value problem for the neutron transport equation is formulated. The projectional methods solving the problem are examined. The approach is compared with that based on the original untransformed form of the neutron transport equation

  19. Improved algorithm for solving nonlinear parabolized stability equations

    Science.gov (United States)

    Zhao, Lei; Zhang, Cun-bo; Liu, Jian-xin; Luo, Ji-sheng

    2016-08-01

    Due to its high computational efficiency and ability to consider nonparallel and nonlinear effects, nonlinear parabolized stability equations (NPSE) approach has been widely used to study the stability and transition mechanisms. However, it often diverges in hypersonic boundary layers when the amplitude of disturbance reaches a certain level. In this study, an improved algorithm for solving NPSE is developed. In this algorithm, the mean flow distortion is included into the linear operator instead of into the nonlinear forcing terms in NPSE. An under-relaxation factor for computing the nonlinear terms is introduced during the iteration process to guarantee the robustness of the algorithm. Two case studies, the nonlinear development of stationary crossflow vortices and the fundamental resonance of the second mode disturbance in hypersonic boundary layers, are presented to validate the proposed algorithm for NPSE. Results from direct numerical simulation (DNS) are regarded as the baseline for comparison. Good agreement can be found between the proposed algorithm and DNS, which indicates the great potential of the proposed method on studying the crossflow and streamwise instability in hypersonic boundary layers. Project supported by the National Natural Science Foundation of China (Grant Nos. 11332007 and 11402167).

  20. Improved algorithm for solving nonlinear parabolized stability equations

    International Nuclear Information System (INIS)

    Zhao Lei; Zhang Cun-bo; Liu Jian-xin; Luo Ji-sheng

    2016-01-01

    Due to its high computational efficiency and ability to consider nonparallel and nonlinear effects, nonlinear parabolized stability equations (NPSE) approach has been widely used to study the stability and transition mechanisms. However, it often diverges in hypersonic boundary layers when the amplitude of disturbance reaches a certain level. In this study, an improved algorithm for solving NPSE is developed. In this algorithm, the mean flow distortion is included into the linear operator instead of into the nonlinear forcing terms in NPSE. An under-relaxation factor for computing the nonlinear terms is introduced during the iteration process to guarantee the robustness of the algorithm. Two case studies, the nonlinear development of stationary crossflow vortices and the fundamental resonance of the second mode disturbance in hypersonic boundary layers, are presented to validate the proposed algorithm for NPSE. Results from direct numerical simulation (DNS) are regarded as the baseline for comparison. Good agreement can be found between the proposed algorithm and DNS, which indicates the great potential of the proposed method on studying the crossflow and streamwise instability in hypersonic boundary layers. (paper)

  1. Solution of linear transport equation using Chebyshev polynomials and Laplace transform

    International Nuclear Information System (INIS)

    Cardona, A.V.; Vilhena, M.T.M.B. de

    1994-01-01

    The Chebyshev polynomials and the Laplace transform are combined to solve, analytically, the linear transport equation in planar geometry, considering isotropic scattering and the one-group model. Numerical simulation is presented. (author)

  2. A control volume based finite difference method for solving the equilibrium equations in terms of displacements

    DEFF Research Database (Denmark)

    Hattel, Jesper; Hansen, Preben

    1995-01-01

    This paper presents a novel control volume based FD method for solving the equilibrium equations in terms of displacements, i.e. the generalized Navier equations. The method is based on the widely used cv-FDM solution of heat conduction and fluid flow problems involving a staggered grid formulati....... The resulting linear algebraic equations are solved by line-Gauss-Seidel....

  3. On method of solving third-order ordinary differential equations directly using Bernstein polynomials

    Science.gov (United States)

    Khataybeh, S. N.; Hashim, I.

    2018-04-01

    In this paper, we propose for the first time a method based on Bernstein polynomials for solving directly a class of third-order ordinary differential equations (ODEs). This method gives a numerical solution by converting the equation into a system of algebraic equations which is solved directly. Some numerical examples are given to show the applicability of the method.

  4. A general analytical approach to the one-group, one-dimensional transport equation

    International Nuclear Information System (INIS)

    Barichello, L.B.; Vilhena, M.T.

    1993-01-01

    The main feature of the presented approach to solve the neutron transport equation consists in the application of the Laplace transform to the discrete ordinates equations, which yields a linear system of order N to be solved (LTS N method). In this paper this system is solved analytically and the inversion is performed using the Heaviside expansion technique. The general formulation achieved by this procedure is then applied to homogeneous and heterogeneous one-group slab-geometry problems. (orig.) [de

  5. On the Boltzmann Equation of Thermal Transport for Interacting Phonons and Electrons

    Directory of Open Access Journals (Sweden)

    Amelia Carolina Sparavigna

    2016-05-01

    Full Text Available The thermal transport in a solid can be determined by means of the Boltzmann equations regarding its distributions of phonons and electrons, when the solid is subjected to a thermal gradient. After solving the coupled equations, the related thermal conductivities can be obtained. Here we show how to determine the coupled equations for phonons and electrons.

  6. Fuzzy linear programming approach for solving transportation

    Indian Academy of Sciences (India)

    Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at ...

  7. An efficient numerical method for solving the Boltzmann equation in multidimensions

    Science.gov (United States)

    Dimarco, Giacomo; Loubère, Raphaël; Narski, Jacek; Rey, Thomas

    2018-01-01

    In this paper we deal with the extension of the Fast Kinetic Scheme (FKS) (Dimarco and Loubère, 2013 [26]) originally constructed for solving the BGK equation, to the more challenging case of the Boltzmann equation. The scheme combines a robust and fast method for treating the transport part based on an innovative Lagrangian technique supplemented with conservative fast spectral schemes to treat the collisional operator by means of an operator splitting approach. This approach along with several implementation features related to the parallelization of the algorithm permits to construct an efficient simulation tool which is numerically tested against exact and reference solutions on classical problems arising in rarefied gas dynamic. We present results up to the 3 D × 3 D case for unsteady flows for the Variable Hard Sphere model which may serve as benchmark for future comparisons between different numerical methods for solving the multidimensional Boltzmann equation. For this reason, we also provide for each problem studied details on the computational cost and memory consumption as well as comparisons with the BGK model or the limit model of compressible Euler equations.

  8. Evaluation of finite difference and FFT-based solutions of the transport of intensity equation.

    Science.gov (United States)

    Zhang, Hongbo; Zhou, Wen-Jing; Liu, Ying; Leber, Donald; Banerjee, Partha; Basunia, Mahmudunnabi; Poon, Ting-Chung

    2018-01-01

    A finite difference method is proposed for solving the transport of intensity equation. Simulation results show that although slower than fast Fourier transform (FFT)-based methods, finite difference methods are able to reconstruct the phase with better accuracy due to relaxed assumptions for solving the transport of intensity equation relative to FFT methods. Finite difference methods are also more flexible than FFT methods in dealing with different boundary conditions.

  9. Numerical evaluation of the intensity transport equation for well-known wavefronts and intensity distributions

    Science.gov (United States)

    Campos-García, Manuel; Granados-Agustín, Fermín.; Cornejo-Rodríguez, Alejandro; Estrada-Molina, Amilcar; Avendaño-Alejo, Maximino; Moreno-Oliva, Víctor Iván.

    2013-11-01

    In order to obtain a clearer interpretation of the Intensity Transport Equation (ITE), in this work, we propose an algorithm to solve it for some particular wavefronts and its corresponding intensity distributions. By simulating intensity distributions in some planes, the ITE is turns into a Poisson equation with Neumann boundary conditions. The Poisson equation is solved by means of the iterative algorithm SOR (Simultaneous Over-Relaxation).

  10. Fuzzy linear programming approach for solving transportation ...

    Indian Academy of Sciences (India)

    ALI EBRAHIMNEJAD

    Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran e-mail: ..... est grade of membership at x are μ ˜AL (x) and μ ˜AU (x), respectively. ..... trapezoidal fuzzy numbers transportation problem (12) are.

  11. Unbiased minimum variance estimator of a matrix exponential function. Application to Boltzmann/Bateman coupled equations solving

    International Nuclear Information System (INIS)

    Dumonteil, E.; Diop, C. M.

    2009-01-01

    This paper derives an unbiased minimum variance estimator (UMVE) of a matrix exponential function of a normal wean. The result is then used to propose a reference scheme to solve Boltzmann/Bateman coupled equations, thanks to Monte Carlo transport codes. The last section will present numerical results on a simple example. (authors)

  12. Adaptive integral equation methods in transport theory

    International Nuclear Information System (INIS)

    Kelley, C.T.

    1992-01-01

    In this paper, an adaptive multilevel algorithm for integral equations is described that has been developed with the Chandrasekhar H equation and its generalizations in mind. The algorithm maintains good performance when the Frechet derivative of the nonlinear map is singular at the solution, as happens in radiative transfer with conservative scattering and in critical neutron transport. Numerical examples that demonstrate the algorithm's effectiveness are presented

  13. General particle transport equation. Final report

    International Nuclear Information System (INIS)

    Lafi, A.Y.; Reyes, J.N. Jr.

    1994-12-01

    The general objectives of this research are as follows: (1) To develop fundamental models for fluid particle coalescence and breakage rates for incorporation into statistically based (Population Balance Approach or Monte Carlo Approach) two-phase thermal hydraulics codes. (2) To develop fundamental models for flow structure transitions based on stability theory and fluid particle interaction rates. This report details the derivation of the mass, momentum and energy conservation equations for a distribution of spherical, chemically non-reacting fluid particles of variable size and velocity. To study the effects of fluid particle interactions on interfacial transfer and flow structure requires detailed particulate flow conservation equations. The equations are derived using a particle continuity equation analogous to Boltzmann's transport equation. When coupled with the appropriate closure equations, the conservation equations can be used to model nonequilibrium, two-phase, dispersed, fluid flow behavior. Unlike the Eulerian volume and time averaged conservation equations, the statistically averaged conservation equations contain additional terms that take into account the change due to fluid particle interfacial acceleration and fluid particle dynamics. Two types of particle dynamics are considered; coalescence and breakage. Therefore, the rate of change due to particle dynamics will consider the gain and loss involved in these processes and implement phenomenological models for fluid particle breakage and coalescence

  14. Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

    Science.gov (United States)

    Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

    2018-02-01

    In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

  15. Using packaged software for solving two differential equation problems that arise in plasma physics

    International Nuclear Information System (INIS)

    Gaffney, P.W.

    1980-01-01

    Experience in using packaged numerical software for solving two related problems that arise in Plasma physics is described. These problems are (i) the solution of the reduced resistive MHD equations and (ii) the solution of the Grad-Shafranov equation

  16. Method of mechanical quadratures for solving singular integral equations of various types

    Science.gov (United States)

    Sahakyan, A. V.; Amirjanyan, H. A.

    2018-04-01

    The method of mechanical quadratures is proposed as a common approach intended for solving the integral equations defined on finite intervals and containing Cauchy-type singular integrals. This method can be used to solve singular integral equations of the first and second kind, equations with generalized kernel, weakly singular equations, and integro-differential equations. The quadrature rules for several different integrals represented through the same coefficients are presented. This allows one to reduce the integral equations containing integrals of different types to a system of linear algebraic equations.

  17. A novel approach for solving fractional Fisher equation using

    Indian Academy of Sciences (India)

    Differential transform method; fractional Fisher equation. ... confirmed by applying this method on different forms of functional equations. Author Affiliations. MIRZAZADEH M1. Department of Engineering Sciences, Faculty of Technology and ...

  18. Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (3).

    Science.gov (United States)

    Murase, Kenya

    2016-01-01

    In this issue, simultaneous differential equations were introduced. These differential equations are often used in the field of medical physics. The methods for solving them were also introduced, which include Laplace transform and matrix methods. Some examples were also introduced, in which Laplace transform and matrix methods were applied to solving simultaneous differential equations derived from a three-compartment kinetic model for analyzing the glucose metabolism in tissues and Bloch equations for describing the behavior of the macroscopic magnetization in magnetic resonance imaging.In the next (final) issue, partial differential equations and various methods for solving them will be introduced together with some examples in medical physics.

  19. The modified simple equation method for solving some fractional ...

    Indian Academy of Sciences (India)

    ... and processes in various areas of natural science. Thus, many effective and powerful methods have been established and improved. In this study, we establish exact solutions of the time fractional biological population model equation and nonlinearfractional Klein–Gordon equation by using the modified simple equation ...

  20. Solving eigenvalue response matrix equations with nonlinear techniques

    International Nuclear Information System (INIS)

    Roberts, Jeremy A.; Forget, Benoit

    2014-01-01

    Highlights: • High performance solvers were applied within ERMM for the first time. • Accelerated fixed-point methods were developed that reduce computational times by 2–3. • A nonlinear, Newton-based ERMM led to similar improvement and more robustness. • A 3-D, SN-based ERMM shows how ERMM can apply fine-mesh methods to full-core analysis. - Abstract: This paper presents new algorithms for use in the eigenvalue response matrix method (ERMM) for reactor eigenvalue problems. ERMM spatially decomposes a domain into independent nodes linked via boundary conditions approximated as truncated orthogonal expansions, the coefficients of which are response functions. In its simplest form, ERMM consists of a two-level eigenproblem: an outer Picard iteration updates the k-eigenvalue via balance, while the inner λ-eigenproblem imposes neutron balance between nodes. Efficient methods are developed for solving the inner λ-eigenvalue problem within the outer Picard iteration. Based on results from several diffusion and transport benchmark models, it was found that the Krylov–Schur method applied to the λ-eigenvalue problem reduces Picard solver times (excluding response generation) by a factor of 2–5. Furthermore, alternative methods, including Picard acceleration schemes, Steffensen’s method, and Newton’s method, are developed in this paper. These approaches often yield faster k-convergence and a need for fewer k-dependent response function evaluations, which is important because response generation is often the primary cost for problems using responses computed online (i.e., not from a precomputed database). Accelerated Picard iteration was found to reduce total computational times by 2–3 compared to the unaccelerated case for problems dominated by response generation. In addition, Newton’s method was found to provide nearly the same performance with improved robustness

  1. Equations of motion of test particles for solving the spin-dependent Boltzmann–Vlasov equation

    Energy Technology Data Exchange (ETDEWEB)

    Xia, Yin [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China); University of Chinese Academy of Science, Beijing 100049 (China); Xu, Jun, E-mail: xujun@sinap.ac.cn [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China); Li, Bao-An [Department of Physics and Astronomy, Texas A& M University-Commerce, Commerce, TX 75429-3011 (United States); Department of Applied Physics, Xi' an Jiao Tong University, Xi' an 710049 (China); Shen, Wen-Qing [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China)

    2016-08-10

    A consistent derivation of the equations of motion (EOMs) of test particles for solving the spin-dependent Boltzmann–Vlasov equation is presented. The resulting EOMs in phase space are similar to the canonical equations in Hamiltonian dynamics, and the EOM of spin is the same as that in the Heisenburg picture of quantum mechanics. Considering further the quantum nature of spin and choosing the direction of total angular momentum in heavy-ion reactions as a reference of measuring nucleon spin, the EOMs of spin-up and spin-down nucleons are given separately. The key elements affecting the spin dynamics in heavy-ion collisions are identified. The resulting EOMs provide a solid foundation for using the test-particle approach in studying spin dynamics in heavy-ion collisions at intermediate energies. Future comparisons of model simulations with experimental data will help to constrain the poorly known in-medium nucleon spin–orbit coupling relevant for understanding properties of rare isotopes and their astrophysical impacts.

  2. Alternative formulation of the monokinetic transport equation

    International Nuclear Information System (INIS)

    Coppa, G.; Ravetto, P.; Sumini, M.

    1985-01-01

    After recalling a technique already exploited in stationary neutron transport, the dynamic linear monokinetic equation for general geometry is cast into an integro-differential form where a second order space Laplace operator and both a second and first time derivatives appear. The introduced unknowns are given a physical interpretation for plane geometry and their relations with the total flux and current are derived

  3. The transport equation in general geometry

    International Nuclear Information System (INIS)

    Pomraning, G.C.

    1990-01-01

    As stated in the introduction to the paper, the motivation for this work was to obtain an explicit form for the streaming operator in the transport equation, which could be used to compute curvature effects in an asymptotic analysis leading to diffusion theory. This sign error was discovered while performing this analysis

  4. Swarm analysis by using transport equations, 1

    International Nuclear Information System (INIS)

    Dote, Toshihiko; Shimada, Masatoshi

    1980-01-01

    By evolving Maxwell-Boltzmann transport equations, various quantities on swarm of charged particles have been analyzed. Although this treatment is properly general, and common transport equations for charged particles ought to be given, in particular, equations only for electrons were presented here. The relation between the random energy and the drift energy was first derived and the general expression of the electron velocity was deduced too. For a simple example, one dimensional steady-state electron swarm in a uniform medium was treated. Electron swarm characteristics numerically calculated in He, Ne or Ar exhibited some interesting properties, which were physically clearly elucidated. These results were also compared with several data already published. Agreements between them were qualitatively rather well in detailed structures. (author)

  5. Application of Monte Carlo method to solving boundary value problem of differential equations

    International Nuclear Information System (INIS)

    Zuo Yinghong; Wang Jianguo

    2012-01-01

    This paper introduces the foundation of the Monte Carlo method and the way how to generate the random numbers. Based on the basic thought of the Monte Carlo method and finite differential method, the stochastic model for solving the boundary value problem of differential equations is built. To investigate the application of the Monte Carlo method to solving the boundary value problem of differential equations, the model is used to solve Laplace's equations with the first boundary condition and the unsteady heat transfer equation with initial values and boundary conditions. The results show that the boundary value problem of differential equations can be effectively solved with the Monte Carlo method, and the differential equations with initial condition can also be calculated by using a stochastic probability model which is based on the time-domain finite differential equations. Both the simulation results and theoretical analyses show that the errors of numerical results are lowered as the number of simulation particles is increased. (authors)

  6. Diffusive limits for linear transport equations

    International Nuclear Information System (INIS)

    Pomraning, G.C.

    1992-01-01

    The authors show that the Hibert and Chapman-Enskog asymptotic treatments that reduce the nonlinear Boltzmann equation to the Euler and Navier-Stokes fluid equations have analogs in linear transport theory. In this linear setting, these fluid limits are described by diffusion equations, involving familiar and less familiar diffusion coefficients. Because of the linearity extant, one can carry out explicitly the initial and boundary layer analyses required to obtain asymptotically consistent initial and boundary conditions for the diffusion equations. In particular, the effects of boundary curvature and boundary condition variation along the surface can be included in the boundary layer analysis. A brief review of heuristic (nonasymptotic) diffusion description derivations is also included in our discussion

  7. Exp-function method for solving fractional partial differential equations.

    Science.gov (United States)

    Zheng, Bin

    2013-01-01

    We extend the Exp-function method to fractional partial differential equations in the sense of modified Riemann-Liouville derivative based on nonlinear fractional complex transformation. For illustrating the validity of this method, we apply it to the space-time fractional Fokas equation and the nonlinear fractional Sharma-Tasso-Olver (STO) equation. As a result, some new exact solutions for them are successfully established.

  8. Transport equations in an enzymatic glucose fuel cell

    Science.gov (United States)

    Jariwala, Soham; Krishnamurthy, Balaji

    2018-01-01

    A mathematical model is developed to study the effects of convective flux and operating temperature on the performance of an enzymatic glucose fuel cell with a membrane. The model assumes isothermal operating conditions and constant feed rate of glucose. The glucose fuel cell domain is divided into five sections, with governing equations describing transport characteristics in each region, namely - anode diffusion layer, anode catalyst layer (enzyme layer), membrane, cathode catalyst layer and cathode diffusion layer. The mass transport is assumed to be one-dimensional and the governing equations are solved numerically. The effects flow rate of glucose feed on the performance of the fuel cell are studied as it contributes significantly to the convective flux. The effects of operating temperature on the performance of a glucose fuel cell are also modeled. The cell performances are compared using cell polarization curves, which were found compliant with experimental observations.

  9. Sufficient Descent Conjugate Gradient Methods for Solving Convex Constrained Nonlinear Monotone Equations

    Directory of Open Access Journals (Sweden)

    San-Yang Liu

    2014-01-01

    Full Text Available Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.

  10. A Python Program for Solving Schro¨dinger's Equation in Undergraduate Physical Chemistry

    Science.gov (United States)

    Srnec, Matthew N.; Upadhyay, Shiv; Madura, Jeffry D.

    2017-01-01

    In undergraduate physical chemistry, Schrödinger's equation is solved for a variety of cases. In doing so, the energies and wave functions of the system can be interpreted to provide connections with the physical system being studied. Solving this equation by hand for a one-dimensional system is a manageable task, but it becomes time-consuming…

  11. Distributed Graphs for Solving Co-modal Transport Problems

    OpenAIRE

    Karama , Jeribi; Hinda , Mejri; Hayfa , Zgaya; Slim , Hammadi

    2011-01-01

    International audience; The paper presents a new approach based on a special distributed graphs in order to solve co-modal transport problems. The co-modal transport system consists on combining different transport modes effectively in terms of economic, environmental, service and financial efficiency, etc. However, the problem is that these systems must deal with different distributed information sources stored in different locations and provided by different public and private companies. In...

  12. Solving fully fuzzy transportation problem using pentagonal fuzzy numbers

    Science.gov (United States)

    Maheswari, P. Uma; Ganesan, K.

    2018-04-01

    In this paper, we propose a simple approach for the solution of fuzzy transportation problem under fuzzy environment in which the transportation costs, supplies at sources and demands at destinations are represented by pentagonal fuzzy numbers. The fuzzy transportation problem is solved without converting to its equivalent crisp form using a robust ranking technique and a new fuzzy arithmetic on pentagonal fuzzy numbers. To illustrate the proposed approach a numerical example is provided.

  13. Semiconductor device simulation by a new method of solving poisson, Laplace and Schrodinger equations

    International Nuclear Information System (INIS)

    Sharifi, M. J.; Adibi, A.

    2000-01-01

    In this paper, we have extended and completed our previous work, that was introducing a new method for finite differentiation. We show the applicability of the method for solving a wide variety of equations such as poisson, Laplace and Schrodinger. These equations are fundamental to the most semiconductor device simulators. In a section, we solve the Shordinger equation by this method in several cases including the problem of finding electron concentration profile in the channel of a HEMT. In another section, we solve the Poisson equation by this method, choosing the problem of SBD as an example. Finally we solve the Laplace equation in two dimensions and as an example, we focus on the VED. In this paper, we have shown that, the method can get stable and precise results in solving all of these problems. Also the programs which have been written based on this method become considerably faster, more clear, and more abstract

  14. Variable-mesh method of solving differential equations

    Science.gov (United States)

    Van Wyk, R.

    1969-01-01

    Multistep predictor-corrector method for numerical solution of ordinary differential equations retains high local accuracy and convergence properties. In addition, the method was developed in a form conducive to the generation of effective criteria for the selection of subsequent step sizes in step-by-step solution of differential equations.

  15. Programmable calculator programs to solve softwood volume and value equations.

    Science.gov (United States)

    Janet K. Ayer. Sachet

    1982-01-01

    This paper presents product value and product volume equations as programs for handheld calculators. These tree equations are for inland Douglas-fir, young-growth Douglas-fir, western white pine, ponderosa pine, and western larch. Operating instructions and an example are included.

  16. Application of the trial equation method for solving some nonlinear ...

    Indian Academy of Sciences (India)

    Therefore, our aim is just to find the function F. Liu has obtained a number of exact solutions to many nonlinear differential equations when F(u) is a polynomial or a rational function. ... In this study, we apply the trial equation method to seek exact solutions of the ... twice and setting the integration constant to zero, we have.

  17. On an improved method for solving evolution equations of higher ...

    African Journals Online (AJOL)

    In this paper we introduce a new algebraic procedure to compute new classes of solutions of (1+1)-nonlinear partial differential equations (nPDEs) both of physical and technical relevance. The basic assumption is that the unknown solution(s) of the nPDE under consideration satisfy an ordinary differential equation (ODE) of ...

  18. A stochastic solution of the advective transport equation with uncertainty

    International Nuclear Information System (INIS)

    Williams, M.M.R.

    1991-01-01

    A model has been developed for calculating the transport of water-borne radionuclides through layers of porous materials, such as rock or clay. The model is based upon a purely advective transport equation, in which the fluid velocity is a random variable, thereby simulating dispersion in a more realistic manner than the ad hoc introduction of a dispersivity. In addition to a random velocity field, which is an observable physical phenomenon, allowance is made for uncertainty in our knowledge of the parameters which enter the equation, e.g. the retardation coefficient. This too, is assumed to be a random variable and contributes to the stochasticity of the resulting partial differential equation of transport. The stochastic differential equation can be solved analytically and then ensemble averages taken over the associated probability distribution of velocity and retardation coefficient. A method based upon a novel form of the central limit theorem of statistics is employed to obtain tractable solutions of a system consisting of many serial legs of varying properties. One interesting conclusion is that the total flux out of a medium is significantly underestimated by using the deterministic solution with an average transit time compared with that from the stochastically averaged solution. The theory is illustrated numerically for a number of physically relevant cases. (author) 8 figs., 4 tabs., 7 refs

  19. A Model for Solving the Maxwell Quasi Stationary Equations in a 3-Phase Electric Reduction Furnace

    Directory of Open Access Journals (Sweden)

    S. Ekrann

    1982-10-01

    Full Text Available A computer code has been developed for the approximate computation of electric and magnetic fields within an electric reduction furnace. The paper describes the numerical methods used to solve Maxwell's quasi-stationary equations, which are the governing equations for this problem. The equations are discretized by a staggered grid finite difference technique. The resulting algebraic equations are solved by iterating between computations of electric and magnetic quantities. This 'outer' iteration converges only when the skin depth is larger or of about the same magnitude as the linear dimensions of the computational domain. In solving for electric quantities with magnetic quantities being regarded as known, and vice versa, the central computational task is the solution of a Poisson equation for a scalar potential. These equations are solved by line successive overrelaxation combined with a rebalancing technique.

  20. Solution and study of nodal neutron transport equation applying the LTSN-DiagExp method

    International Nuclear Information System (INIS)

    Hauser, Eliete Biasotto; Pazos, Ruben Panta; Vilhena, Marco Tullio de; Barros, Ricardo Carvalho de

    2003-01-01

    In this paper we report advances about the three-dimensional nodal discrete-ordinates approximations of neutron transport equation for Cartesian geometry. We use the combined collocation method of the angular variables and nodal approach for the spatial variables. By nodal approach we mean the iterated transverse integration of the S N equations. This procedure leads to the set of one-dimensional averages angular fluxes in each spatial variable. The resulting system of equations is solved with the LTS N method, first applying the Laplace transform to the set of the nodal S N equations and then obtained the solution by symbolic computation. We include the LTS N method by diagonalization to solve the nodal neutron transport equation and then we outline the convergence of these nodal-LTS N approximations with the help of a norm associated to the quadrature formula used to approximate the integral term of the neutron transport equation. (author)

  1. Nonlinear Projective-Iteration Methods for Solving Transport Problems on Regular and Unstructured Grids

    International Nuclear Information System (INIS)

    Dmitriy Y. Anistratov; Adrian Constantinescu; Loren Roberts; William Wieselquist

    2007-01-01

    This is a project in the field of fundamental research on numerical methods for solving the particle transport equation. Numerous practical problems require to use unstructured meshes, for example, detailed nuclear reactor assembly-level calculations, large-scale reactor core calculations, radiative hydrodynamics problems, where the mesh is determined by hydrodynamic processes, and well-logging problems in which the media structure has very complicated geometry. Currently this is an area of very active research in numerical transport theory. main issues in developing numerical methods for solving the transport equation are the accuracy of the numerical solution and effectiveness of iteration procedure. The problem in case of unstructured grids is that it is very difficult to derive an iteration algorithm that will be unconditionally stable

  2. Deferred correction approach on generic transport equation

    International Nuclear Information System (INIS)

    Shah, I.A.; Ali, M.

    2004-01-01

    In this study, a two dimensional Steady Convection-Diffusion was solved, using Deferred correction approach, and results were compared with standard spatial discretization schemes. Numerical investigations were carried out based on the velocity and flow direction, for various diffusivity coefficients covering a range from diffusive to convective flows. The results show that the Deferred Ted Correction Approach gives more accurate and stable results in relation to UDS and CDs discretization of convective terms. Deferred Correction Approach caters for the wiggles for convective flows in case of central difference discretization of the equation and also caters for the dissipative error generated by the first order upwind discretization of convective fluxes. (author)

  3. Multivariate Padé Approximation for Solving Nonlinear Partial Differential Equations of Fractional Order

    Directory of Open Access Journals (Sweden)

    Veyis Turut

    2013-01-01

    Full Text Available Two tecHniques were implemented, the Adomian decomposition method (ADM and multivariate Padé approximation (MPA, for solving nonlinear partial differential equations of fractional order. The fractional derivatives are described in Caputo sense. First, the fractional differential equation has been solved and converted to power series by Adomian decomposition method (ADM, then power series solution of fractional differential equation was put into multivariate Padé series. Finally, numerical results were compared and presented in tables and figures.

  4. Exp-function method for solving Fisher's equation

    Energy Technology Data Exchange (ETDEWEB)

    Zhou, X-W [Department of Mathematics, Kunming Teacher' s College, Kunming, Yunnan 650031 (China)], E-mail: km_xwzhou@163.com

    2008-02-15

    There are many methods to solve Fisher's equation, but each method can only lead to a special solution. In this paper, a new method, namely the exp-function method, is employed to solve the Fisher's equation. The obtained result includes all solutions in open literature as special cases, and the generalized solution with some free parameters might imply some fascinating meanings hidden in the Fisher's equation.

  5. Integral transform method for solving time fractional systems and fractional heat equation

    Directory of Open Access Journals (Sweden)

    Arman Aghili

    2014-01-01

    Full Text Available In the present paper, time fractional partial differential equation is considered, where the fractional derivative is defined in the Caputo sense. Laplace transform method has been applied to obtain an exact solution. The authors solved certain homogeneous and nonhomogeneous time fractional heat equations using integral transform. Transform method is a powerful tool for solving fractional singular Integro - differential equations and PDEs. The result reveals that the transform method is very convenient and effective.

  6. A novel approach for solving fractional Fisher equation using ...

    Indian Academy of Sciences (India)

    Department of Engineering Sciences, Faculty of Technology and Engineering, East of ... The reliability, simplicity and cost-effectiveness of the method are confirmed by applying this ... Differential transform method; fractional Fisher equation.

  7. Exact solution of the neutron transport equation in spherical geometry

    Energy Technology Data Exchange (ETDEWEB)

    Anli, Fikret; Akkurt, Abdullah; Yildirim, Hueseyin; Ates, Kemal [Kahramanmaras Suetcue Imam Univ. (Turkey). Faculty of Sciences and Letters

    2017-03-15

    Solution of the neutron transport equation in one dimensional slab geometry construct a basis for the solution of neutron transport equation in a curvilinear geometry. Therefore, in this work, we attempt to derive an exact analytical benchmark solution for both neutron transport equations in slab and spherical medium by using P{sub N} approximation which is widely used in neutron transport theory.

  8. An uncoupling strategy for numerically solving the dynamic thermoelasticity equations

    International Nuclear Information System (INIS)

    Moura, C.A. de; Feijoo, R.A.

    1981-01-01

    The dynamic equations of coupled linear thermoelasticity are presented. A numerical algorithm which combines finite-element space approximation with a two-step time discretization in such a way as to reach significant computational savings is presented: It features a strategy for independently calculating the displacement and temperature fields through equations that nevertheless remain coupled. The scheme convergence was shown to be optimal and its machine performance, as ilustrated by some examples, fairly satisfactory. (Author) [pt

  9. Weighted particle method for solving the Boltzmann equation

    International Nuclear Information System (INIS)

    Tohyama, M.; Suraud, E.

    1990-01-01

    We propose a new, deterministic, method of solution of the nuclear Boltzmann equation. In this Weighted Particle Method two-body collisions are treated by a Master equation for an occupation probability of each numerical particle. We apply the method to the quadrupole motion of 12 C. A comparison with usual stochastic methods is made. Advantages and disadvantages of the Weighted Particle Method are discussed

  10. A Green function of neutron transport equation

    International Nuclear Information System (INIS)

    Simovic, R.

    1993-01-01

    In this paper the angularly dependent Green function of the neutron transport equation is derived analytically and approximately. By applying the analytical FDPN approximation up to eighth order, numerical values of the Green functions are obtained with the accuracy of six significant figures in the whole range of parameter c, angle cosine μ and distances x up to the ten optical lengths from the neutron source. (author)

  11. Solving Differential Equations Analytically. Elementary Differential Equations. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Unit 335.

    Science.gov (United States)

    Goldston, J. W.

    This unit introduces analytic solutions of ordinary differential equations. The objective is to enable the student to decide whether a given function solves a given differential equation. Examples of problems from biology and chemistry are covered. Problem sets, quizzes, and a model exam are included, and answers to all items are provided. The…

  12. Solving the Helmholtz equation in conformal mapped ARROWstructures using homotopy perturbation method

    DEFF Research Database (Denmark)

    Reck, Kasper; Thomsen, Erik Vilain; Hansen, Ole

    2011-01-01

    . The solution of the mapped Helmholtz equation is found by solving an infinite series of Poisson equations using two dimensional Fourier series. The solution is entirely based on analytical expressions and is not mesh dependent. The analytical results are compared to a numerical (finite element method) solution......The scalar wave equation, or Helmholtz equation, describes within a certain approximation the electromagnetic field distribution in a given system. In this paper we show how to solve the Helmholtz equation in complex geometries using conformal mapping and the homotopy perturbation method...

  13. Matrix form of Legendre polynomials for solving linear integro-differential equations of high order

    Science.gov (United States)

    Kammuji, M.; Eshkuvatov, Z. K.; Yunus, Arif A. M.

    2017-04-01

    This paper presents an effective approximate solution of high order of Fredholm-Volterra integro-differential equations (FVIDEs) with boundary condition. Legendre truncated series is used as a basis functions to estimate the unknown function. Matrix operation of Legendre polynomials is used to transform FVIDEs with boundary conditions into matrix equation of Fredholm-Volterra type. Gauss Legendre quadrature formula and collocation method are applied to transfer the matrix equation into system of linear algebraic equations. The latter equation is solved by Gauss elimination method. The accuracy and validity of this method are discussed by solving two numerical examples and comparisons with wavelet and methods.

  14. On choosing a nonlinear initial iterate for solving the 2-D 3-T heat conduction equations

    International Nuclear Information System (INIS)

    An Hengbin; Mo Zeyao; Xu Xiaowen; Liu Xu

    2009-01-01

    The 2-D 3-T heat conduction equations can be used to approximately describe the energy broadcast in materials and the energy swapping between electron and photon or ion. To solve the equations, a fully implicit finite volume scheme is often used as the discretization method. Because the energy diffusion and swapping coefficients have a strongly nonlinear dependence on the temperature, and some physical parameters are discontinuous across the interfaces between the materials, it is a challenge to solve the discretized nonlinear algebraic equations. Particularly, as time advances, the temperature varies so greatly in the front of energy that it is difficult to choose an effective initial iterate when the nonlinear algebraic equations are solved by an iterative method. In this paper, a method of choosing a nonlinear initial iterate is proposed for iterative solving this kind of nonlinear algebraic equations. Numerical results show the proposed initial iterate can improve the computational efficiency, and also the convergence behavior of the nonlinear iteration.

  15. New Numerical Treatment for Solving the KDV Equation

    Directory of Open Access Journals (Sweden)

    khalid ali

    2017-01-01

    Full Text Available In the present article, a numerical method is proposed for the numerical solution of the KdV equation by using collocation method with the modified exponential cubic B-spline. In this paper we convert the KdV equation to system of two equations. The method is shown to be unconditionally stable using von-Neumann technique. To test accuracy the error norms2L, ?L are computed. Three invariants of motion are predestined to determine the preservation properties of the problem, and the numerical scheme leads to careful and active results. Furthermore, interaction of two and three solitary waves is shown. These results show that the technique introduced here is easy to apply.

  16. High-order quantum algorithm for solving linear differential equations

    International Nuclear Information System (INIS)

    Berry, Dominic W

    2014-01-01

    Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods (where the error over a time step is a high power of the size of the time step) to improve the efficiency. These provide scaling close to Δt 2 in the evolution time Δt. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution. (paper)

  17. Solving the Linear 1D Thermoelasticity Equations with Pure Delay

    Directory of Open Access Journals (Sweden)

    Denys Ya. Khusainov

    2015-01-01

    Full Text Available We propose a system of partial differential equations with a single constant delay τ>0 describing the behavior of a one-dimensional thermoelastic solid occupying a bounded interval of R1. For an initial-boundary value problem associated with this system, we prove a well-posedness result in a certain topology under appropriate regularity conditions on the data. Further, we show the solution of our delayed model to converge to the solution of the classical equations of thermoelasticity as τ→0. Finally, we deduce an explicit solution representation for the delay problem.

  18. Matrix Methods for Solving Hartree-Fock Equations in Atomic Structure Calculations and Line Broadening

    Directory of Open Access Journals (Sweden)

    Thomas Gomez

    2018-04-01

    Full Text Available Atomic structure of N-electron atoms is often determined by solving the Hartree-Fock equations, which are a set of integro-differential equations. The integral part of the Hartree-Fock equations treats electron exchange, but the Hartree-Fock equations are not often treated as an integro-differential equation. The exchange term is often approximated as an inhomogeneous or an effective potential so that the Hartree-Fock equations become a set of ordinary differential equations (which can be solved using the usual shooting methods. Because the Hartree-Fock equations are an iterative-refinement method, the inhomogeneous term relies on the previous guess of the wavefunction. In addition, there are numerical complications associated with solving inhomogeneous differential equations. This work uses matrix methods to solve the Hartree-Fock equations as an integro-differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using linear-algebra packages. The integral (exchange part of the Hartree-Fock equation can be approximated as a sum and written as a matrix. The Hartree-Fock equations can be solved as a matrix that is the sum of the differential and integral matrices. We compare calculations using this method against experiment and standard atomic structure calculations. This matrix method can also be used to solve for free-electron wavefunctions, thus improving how the atoms and free electrons interact. This technique is important for spectral line broadening in two ways: it improves the atomic structure calculations, and it improves the motion of the plasma electrons that collide with the atom.

  19. Wavelet Methods for Solving Fractional Order Differential Equations

    OpenAIRE

    A. K. Gupta; S. Saha Ray

    2014-01-01

    Fractional calculus is a field of applied mathematics which deals with derivatives and integrals of arbitrary orders. The fractional calculus has gained considerable importance during the past decades mainly due to its application in diverse fields of science and engineering such as viscoelasticity, diffusion of biological population, signal processing, electromagnetism, fluid mechanics, electrochemistry, and many more. In this paper, we review different wavelet methods for solving both linea...

  20. Solving Multi-variate Polynomial Equations in a Finite Field

    Science.gov (United States)

    2013-06-01

    hardware to encrypt and decrypt messages. Many of the AES predecessors use this Feistel structure (i.e. DES, Lucifer , Blowfish). However, AES does not...However, then it is very effective . The interesting aspect about the agreeing algorithm is that it can gain momentum to solve the system once RHSs are...columns from Lh can now be removed. This can create a ‘cascade effect ’ on the system and the system quickly reduces its size and complexity. Agreeing

  1. Fibonacci-regularization method for solving Cauchy integral equations of the first kind

    Directory of Open Access Journals (Sweden)

    Mohammad Ali Fariborzi Araghi

    2017-09-01

    Full Text Available In this paper, a novel scheme is proposed to solve the first kind Cauchy integral equation over a finite interval. For this purpose, the regularization method is considered. Then, the collocation method with Fibonacci base function is applied to solve the obtained second kind singular integral equation. Also, the error estimate of the proposed scheme is discussed. Finally, some sample Cauchy integral equations stem from the theory of airfoils in fluid mechanics are presented and solved to illustrate the importance and applicability of the given algorithm. The tables in the examples show the efficiency of the method.

  2. Projection-iteration methods for solving nonlinear operator equations

    International Nuclear Information System (INIS)

    Nguyen Minh Chuong; Tran thi Lan Anh; Tran Quoc Binh

    1989-09-01

    In this paper, the authors investigate a nonlinear operator equation in uniformly convex Banach spaces as in metric spaces by using stationary and nonstationary generalized projection-iteration methods. Convergence theorems in the strong and weak sense were established. (author). 7 refs

  3. Augmented Lagrangian methods to solve Navier-Stokes equations for a Bingham fluid flow

    International Nuclear Information System (INIS)

    Boscardin, Laetitia

    1999-01-01

    The objective of this research thesis is to develop one or more methods for the numerical resolution of equations of movement obtained for a Bingham fluid. The resolution of Navier-Stokes equations is processed by splitting elliptic and hyperbolic operators (Galerkin transport). In this purpose, the author first studied the Stokes problem, and then addressed issues of stability and consistency of the global scheme. The variational formulation of the Stokes problem can be expressed under the form of a minimisation problem under the constraint of non linear and non differentiable functions. Then, the author proposes a discretization of the Stokes problem based on a hybrid finite element method. Then he extends the demonstrations of stability and consistency of the Galerkin-transport scheme which have been established for a Newtonian fluid, to the case of a Bingham fluid. A relaxation algorithm and a Newton-GMRES algorithm are developed to solve the problem, and their convergence is studied. To ensure this convergence, some constraints must be verified. In order to do so, a specific speed element has been developed [fr

  4. Lagrange-Noether method for solving second-order differential equations

    Institute of Scientific and Technical Information of China (English)

    Wu Hui-Bin; Wu Run-Heng

    2009-01-01

    The purpose of this paper is to provide a new method called the Lagrange-Noether method for solving second-order differential equations. The method is,firstly,to write the second-order differential equations completely or partially in the form of Lagrange equations,and secondly,to obtain the integrals of the equations by using the Noether theory of the Lagrange system. An example is given to illustrate the application of the result.

  5. Numerical treatments for solving nonlinear mixed integral equation

    Directory of Open Access Journals (Sweden)

    M.A. Abdou

    2016-12-01

    Full Text Available We consider a mixed type of nonlinear integral equation (MNLIE of the second kind in the space C[0,T]×L2(Ω,T<1. The Volterra integral terms (VITs are considered in time with continuous kernels, while the Fredholm integral term (FIT is considered in position with singular general kernel. Using the quadratic method and separation of variables method, we obtain a nonlinear system of Fredholm integral equations (NLSFIEs with singular kernel. A Toeplitz matrix method, in each case, is then used to obtain a nonlinear algebraic system. Numerical results are calculated when the kernels take a logarithmic form or Carleman function. Moreover, the error estimates, in each case, are then computed.

  6. Algorithm for solving polynomial algebraic Riccati equations and its application

    Czech Academy of Sciences Publication Activity Database

    Augusta, Petr; Augustová, Petra

    2012-01-01

    Roč. 1, č. 4 (2012), s. 237-242 ISSN 2223-7038 R&D Projects: GA ČR GPP103/12/P494 Institutional support: RVO:67985556 Keywords : Numerical algorithms * algebraic Riccati equation * spatially distributed systems * optimal control Subject RIV: BC - Control Systems Theory http://lib.physcon.ru/doc?id=8b4876d6a57d

  7. Solving singular convolution equations using the inverse fast Fourier transform

    Czech Academy of Sciences Publication Activity Database

    Krajník, E.; Montesinos, V.; Zizler, P.; Zizler, Václav

    2012-01-01

    Roč. 57, č. 5 (2012), s. 543-550 ISSN 0862-7940 R&D Projects: GA AV ČR IAA100190901 Institutional research plan: CEZ:AV0Z10190503 Keywords : singular convolution equations * fast Fourier transform * tempered distribution Subject RIV: BA - General Mathematics Impact factor: 0.222, year: 2012 http://www.springerlink.com/content/m8437t3563214048/

  8. HEXAN - a hexagonal nodal code for solving the diffusion equation

    International Nuclear Information System (INIS)

    Makai, M.

    1982-07-01

    This report describes the theory of and provides a user's manual for the HEXAN program, which is a nodal program for the solution of the few-group diffusion equation in hexagonal geometry. Based upon symmetry considerations, the theory provides an analytical solution in a homogeneous node. WWER and HTGR test problem solutions are presented. The equivalence of the finite-difference scheme and the response matrix method is proven. The properties of a symmetric node's response matrix are investigated. (author)

  9. Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (4).

    Science.gov (United States)

    Murase, Kenya

    2016-01-01

    Partial differential equations are often used in the field of medical physics. In this (final) issue, the methods for solving the partial differential equations were introduced, which include separation of variables, integral transform (Fourier and Fourier-sine transforms), Green's function, and series expansion methods. Some examples were also introduced, in which the integral transform and Green's function methods were applied to solving Pennes' bioheat transfer equation and the Fourier series expansion method was applied to Navier-Stokes equation for analyzing the wall shear stress in blood vessels.Finally, the author hopes that this series will be helpful for people who engage in medical physics.

  10. Solving the Schroedinger equation using the finite difference time domain method

    International Nuclear Information System (INIS)

    Sudiarta, I Wayan; Geldart, D J Wallace

    2007-01-01

    In this paper, we solve the Schroedinger equation using the finite difference time domain (FDTD) method to determine energies and eigenfunctions. In order to apply the FDTD method, the Schroedinger equation is first transformed into a diffusion equation by the imaginary time transformation. The resulting time-domain diffusion equation is then solved numerically by the FDTD method. The theory and an algorithm are provided for the procedure. Numerical results are given for illustrative examples in one, two and three dimensions. It is shown that the FDTD method accurately determines eigenfunctions and energies of these systems

  11. A predictor-corrector scheme for solving the Volterra integral equation

    KAUST Repository

    Al Jarro, Ahmed; Bagci, Hakan

    2011-01-01

    The occurrence of late time instabilities is a common problem of almost all time marching methods developed for solving time domain integral equations. Implicit marching algorithms are now considered stable with various efforts that have been

  12. MPFA algorithm for solving stokes-brinkman equations on quadrilateral grids

    KAUST Repository

    Iliev, Oleg; Kirsch, Ralf; Lakdawala, Zahra; Printsypar, Galina

    2014-01-01

    This work is concerned with the development of a robust and accurate numerical method for solving the Stokes-Brinkman system of equations, which describes a free fluid flow coupled with a flow in porous media. Quadrilateral boundary fitted grid

  13. TLC scheme for numerical solution of the transport equation on equilateral triangular meshes

    International Nuclear Information System (INIS)

    Walters, W.F.

    1983-01-01

    A new triangular linear characteristic TLC scheme for numerically solving the transport equation on equilateral triangular meshes has been developed. This scheme uses the analytic solution of the transport equation in the triangle as its basis. The data on edges of the triangle are assumed linear as is the source representation. A characteristic approach or nodal approach is used to obtain the analytic solution. Test problems indicate that the new TLC is superior to the widely used DITRI scheme for accuracy

  14. An improved computational version of the LTSN method to solve transport problems in a slab

    International Nuclear Information System (INIS)

    Cardona, Augusto V.; Oliveira, Jose Vanderlei P. de; Vilhena, Marco Tullio de; Segatto, Cynthia F.

    2008-01-01

    In this work, we present an improved computational version of the LTS N method to solve transport problems in a slab. The key feature relies on the reordering of the set of S N equations. This procedure reduces by a factor of two the task of evaluating the eigenvalues of the matrix associated to SN approximations. We present numerical simulations and comparisons with the ones of the classical LTS N approach. (author)

  15. Solving the interval type-2 fuzzy polynomial equation using the ranking method

    Science.gov (United States)

    Rahman, Nurhakimah Ab.; Abdullah, Lazim

    2014-07-01

    Polynomial equations with trapezoidal and triangular fuzzy numbers have attracted some interest among researchers in mathematics, engineering and social sciences. There are some methods that have been developed in order to solve these equations. In this study we are interested in introducing the interval type-2 fuzzy polynomial equation and solving it using the ranking method of fuzzy numbers. The ranking method concept was firstly proposed to find real roots of fuzzy polynomial equation. Therefore, the ranking method is applied to find real roots of the interval type-2 fuzzy polynomial equation. We transform the interval type-2 fuzzy polynomial equation to a system of crisp interval type-2 fuzzy polynomial equation. This transformation is performed using the ranking method of fuzzy numbers based on three parameters, namely value, ambiguity and fuzziness. Finally, we illustrate our approach by numerical example.

  16. Solving differential–algebraic equation systems by means of index reduction methodology

    DEFF Research Database (Denmark)

    Sørensen, Kim; Houbak, Niels; Condra, Thomas

    2006-01-01

    of a number of differential equations and algebraic equations — a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODEs and index 1 DAEs by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of ordinary differential equations — ODEs....

  17. Solving differential-algebraic equation systems by means of index reduction methodology

    DEFF Research Database (Denmark)

    Sørensen, Kim; Houbak, Niels; Condra, Thomas Joseph

    2006-01-01

    of a number of differential equations and algebraic equations - a so called DAE system. Two of the DAE systems are of index 1 and they can be solved by means of standard DAE-solvers. For the actual application, the equation systems are integrated by means of MATLAB’s solver: ode23t, that solves moderately...... stiff ODE’s and index 1 DAE’s by means of the trapezoidal rule. The last sub-model that models the boilers steam drum consist of two differential and three algebraic equations. The index of this model is greater than 1, which means that ode23t cannot integrate this equation system. In this paper......, it is shown how the equation system, by means of an index reduction methodology, can be reduced to a system of Ordinary- Differential-Equations - ODE’s....

  18. Finite element method with quadratic quadrilateral unit for solving two dimensional incompressible N-S equation

    International Nuclear Information System (INIS)

    Tao Ganqiang; Yu Qing; Xiao Xiao

    2011-01-01

    Viscous and incompressible fluid flow is important for numerous engineering mechanics problems. Because of high non linear and incompressibility for Navier-Stokes equation, it is very difficult to solve Navier-Stokes equation by numerical method. According to its characters of Navier-Stokes equation, quartic derivation controlling equation of the two dimensional incompressible Navier-Stokes equation is set up firstly. The method solves the problem for dealing with vorticity boundary and automatically meets incompressibility condition. Then Finite Element equation for Navier-Stokes equation is proposed by using quadratic quadrilateral unit with 8 nodes in which the unit function is quadratic and non linear.-Based on it, the Finite Element program of quadratic quadrilateral unit with 8 nodes is developed. Lastly, numerical experiment proves the accuracy and dependability of the method and also shows the method has good application prospect in computational fluid mechanics. (authors)

  19. An Algorithm for Solving the Absolute Value Equation

    Czech Academy of Sciences Publication Activity Database

    Rohn, Jiří

    2009-01-01

    Roč. 18, - (2009), s. 589-599 E-ISSN 1081-3810 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : absolute value equation * algorithm * regularity * singularity * theorem of the alternatives Subject RIV: BA - General Mathematics Impact factor: 0.892, year: 2009 http://www.math.technion.ac.il/iic/ ela / ela -articles/articles/vol18_pp589-599.pdf

  20. Optimal Homotopy Asymptotic Method for Solving the Linear Fredholm Integral Equations of the First Kind

    Directory of Open Access Journals (Sweden)

    Mohammad Almousa

    2013-01-01

    Full Text Available The aim of this study is to present the use of a semi analytical method called the optimal homotopy asymptotic method (OHAM for solving the linear Fredholm integral equations of the first kind. Three examples are discussed to show the ability of the method to solve the linear Fredholm integral equations of the first kind. The results indicated that the method is very effective and simple.

  1. Solving Linear Equations by Classical Jacobi-SR Based Hybrid Evolutionary Algorithm with Uniform Adaptation Technique

    OpenAIRE

    Jamali, R. M. Jalal Uddin; Hashem, M. M. A.; Hasan, M. Mahfuz; Rahman, Md. Bazlar

    2013-01-01

    Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is sparse. The rate of convergence of iteration method is increased by using Successive Relaxation (SR) technique. But SR technique is very much sensitive to relaxation factor, {\\omega}. Recently, hybridization of classical Gauss-Seidel based successive relaxation t...

  2. The Convergence Study of the Homotopy Analysis Method for Solving Nonlinear Volterra-Fredholm Integrodifferential Equations

    Directory of Open Access Journals (Sweden)

    Behzad Ghanbari

    2014-01-01

    Full Text Available We aim to study the convergence of the homotopy analysis method (HAM in short for solving special nonlinear Volterra-Fredholm integrodifferential equations. The sufficient condition for the convergence of the method is briefly addressed. Some illustrative examples are also presented to demonstrate the validity and applicability of the technique. Comparison of the obtained results HAM with exact solution shows that the method is reliable and capable of providing analytic treatment for solving such equations.

  3. Neutron transport equation - indications on homogenization and neutron diffusion

    International Nuclear Information System (INIS)

    Argaud, J.P.

    1992-06-01

    In PWR nuclear reactor, the practical study of the neutrons in the core uses diffusion equation to describe the problem. On the other hand, the most correct method to describe these neutrons is to use the Boltzmann equation, or neutron transport equation. In this paper, we give some theoretical indications to obtain a diffusion equation from the general transport equation, with some simplifying hypothesis. The work is organised as follows: (a) the most general formulations of the transport equation are presented: integro-differential equation and integral equation; (b) the theoretical approximation of this Boltzmann equation by a diffusion equation is introduced, by the way of asymptotic developments; (c) practical homogenization methods of transport equation is then presented. In particular, the relationships with some general and useful methods in neutronic are shown, and some homogenization methods in energy and space are indicated. A lot of other points of view or complements are detailed in the text or the remarks

  4. Approximate solutions for the two-dimensional integral transport equation. The critically mixed methods of resolution

    International Nuclear Information System (INIS)

    Sanchez, Richard.

    1980-11-01

    This work is divided into two part the first part (note CEA-N-2165) deals with the solution of complex two-dimensional transport problems, the second one treats the critically mixed methods of resolution. These methods are applied for one-dimensional geometries with highly anisotropic scattering. In order to simplify the set of integral equation provided by the integral transport equation, the integro-differential equation is used to obtain relations that allow to lower the number of integral equation to solve; a general mathematical and numerical study is presented [fr

  5. Solving Langevin equation with the stochastic algebraically correlated noise

    International Nuclear Information System (INIS)

    Ploszajczak, M.; Srokowski, T.

    1996-01-01

    Long time tail in the velocity and force autocorrelation function has been found recently in the molecular dynamics simulations of the peripheral collisions of ions. Simulation of those slowly decaying correlations in the stochastic transport theory requires the development of new methods of generating stochastic force of arbitrarily long correlation times. The Markovian process and the multidimensional Kangaroo process which permit describing various algebraic correlated stochastic processes are proposed. (author)

  6. From baking a cake to solving the diffusion equation

    Science.gov (United States)

    Olszewski, Edward A.

    2006-06-01

    We explain how modifying a cake recipe by changing either the dimensions of the cake or the amount of cake batter alters the baking time. We restrict our consideration to the génoise and obtain a semiempirical relation for the baking time as a function of oven temperature, initial temperature of the cake batter, and dimensions of the unbaked cake. The relation, which is based on the diffusion equation, has three parameters whose values are estimated from data obtained by baking cakes in cylindrical pans of various diameters. The relation takes into account the evaporation of moisture at the top surface of the cake, which is the dominant factor affecting the baking time of a cake.

  7. A generalized trial solution method for solving the aerosol equation

    International Nuclear Information System (INIS)

    Simons, S.; Simpson, D.R.

    1988-01-01

    It is shown how the introduction of orthogonal functions together with a time-dependent scaling factor may be used to develop a generalized trial solution method for tackling the aerosol equation. The approach is worked out in detail for the case where the initial particle size spectrum follows a γ-distribution, and it is shown to be a viable technique as long as the initial volume fraction of particulate material is not too large. The method is applied to several situations of interest, and is shown to give more accurate results (with marginally shorter computing times) than are given by the three-parameter log-normal or γ distribution trial functions. (author)

  8. Extensions of the auxiliary field method to solve Schroedinger equations

    International Nuclear Information System (INIS)

    Silvestre-Brac, Bernard; Semay, Claude; Buisseret, Fabien

    2008-01-01

    It has recently been shown that the auxiliary field method is an interesting tool to compute approximate analytical solutions of the Schroedinger equation. This technique can generate the spectrum associated with an arbitrary potential V(r) starting from the analytically known spectrum of a particular potential P(r). In the present work, general important properties of the auxiliary field method are proved, such as scaling laws and independence of the results on the choice of P(r). The method is extended in order to find accurate analytical energy formulae for radial potentials of the form aP(r) + V(r), and several explicit examples are studied. Connections existing between the perturbation theory and the auxiliary field method are also discussed

  9. Extensions of the auxiliary field method to solve Schroedinger equations

    Energy Technology Data Exchange (ETDEWEB)

    Silvestre-Brac, Bernard [LPSC Universite Joseph Fourier, Grenoble 1, CNRS/IN2P3, Institut Polytechnique de Grenoble, Avenue des Martyrs 53, F-38026 Grenoble-Cedex (France); Semay, Claude; Buisseret, Fabien [Groupe de Physique Nucleaire Theorique, Universite de Mons-Hainaut, Academie universitaire Wallonie-Bruxelles, Place du Parc 20, B-7000 Mons (Belgium)], E-mail: silvestre@lpsc.in2p3.fr, E-mail: claude.semay@umh.ac.be, E-mail: fabien.buisseret@umh.ac.be

    2008-10-24

    It has recently been shown that the auxiliary field method is an interesting tool to compute approximate analytical solutions of the Schroedinger equation. This technique can generate the spectrum associated with an arbitrary potential V(r) starting from the analytically known spectrum of a particular potential P(r). In the present work, general important properties of the auxiliary field method are proved, such as scaling laws and independence of the results on the choice of P(r). The method is extended in order to find accurate analytical energy formulae for radial potentials of the form aP(r) + V(r), and several explicit examples are studied. Connections existing between the perturbation theory and the auxiliary field method are also discussed.

  10. Parallel computation for solving the tridiagonal linear system of equations

    International Nuclear Information System (INIS)

    Ishiguro, Misako; Harada, Hiroo; Fujii, Minoru; Fujimura, Toichiro; Nakamura, Yasuhiro; Nanba, Katsumi.

    1981-09-01

    Recently, applications of parallel computation for scientific calculations have increased from the need of the high speed calculation of large scale programs. At the JAERI computing center, an array processor FACOM 230-75 APU has installed to study the applicability of parallel computation for nuclear codes. We made some numerical experiments by using the APU on the methods of solution of tridiagonal linear equation which is an important problem in scientific calculations. Referring to the recent papers with parallel methods, we investigate eight ones. These are Gauss elimination method, Parallel Gauss method, Accelerated parallel Gauss method, Jacobi method, Recursive doubling method, Cyclic reduction method, Chebyshev iteration method, and Conjugate gradient method. The computing time and accuracy were compared among the methods on the basis of the numerical experiments. As the result, it is found that the Cyclic reduction method is best both in computing time and accuracy and the Gauss elimination method is the second one. (author)

  11. Maximal stochastic transport in the Lorenz equations

    Energy Technology Data Exchange (ETDEWEB)

    Agarwal, Sahil, E-mail: sahil.agarwal@yale.edu [Program in Applied Mathematics, Yale University, New Haven (United States); Wettlaufer, J.S., E-mail: john.wettlaufer@yale.edu [Program in Applied Mathematics, Yale University, New Haven (United States); Departments of Geology & Geophysics, Mathematics and Physics, Yale University, New Haven (United States); Mathematical Institute, University of Oxford, Oxford (United Kingdom); Nordita, Royal Institute of Technology and Stockholm University, Stockholm (Sweden)

    2016-01-08

    We calculate the stochastic upper bounds for the Lorenz equations using an extension of the background method. In analogy with Rayleigh–Bénard convection the upper bounds are for heat transport versus Rayleigh number. As might be expected, the stochastic upper bounds are larger than the deterministic counterpart of Souza and Doering [1], but their variation with noise amplitude exhibits interesting behavior. Below the transition to chaotic dynamics the upper bounds increase monotonically with noise amplitude. However, in the chaotic regime this monotonicity depends on the number of realizations in the ensemble; at a particular Rayleigh number the bound may increase or decrease with noise amplitude. The origin of this behavior is the coupling between the noise and unstable periodic orbits, the degree of which depends on the degree to which the ensemble represents the ergodic set. This is confirmed by examining the close returns plots of the full solutions to the stochastic equations and the numerical convergence of the noise correlations. The numerical convergence of both the ensemble and time averages of the noise correlations is sufficiently slow that it is the limiting aspect of the realization of these bounds. Finally, we note that the full solutions of the stochastic equations demonstrate that the effect of noise is equivalent to the effect of chaos.

  12. Multi-level methods for solving multigroup transport eigenvalue problems in 1D slab geometry

    International Nuclear Information System (INIS)

    Anistratov, D. Y.; Gol'din, V. Y.

    2009-01-01

    A methodology for solving eigenvalue problems for the multigroup neutron transport equation in 1D slab geometry is presented. In this paper we formulate and compare different variants of nonlinear multi-level iteration methods. They are defined by means of multigroup and effective one-group low-order quasi diffusion (LOQD) equations. We analyze the effects of utilization of the effective one-group LOQD problem for estimating the eigenvalue. We present numerical results to demonstrate the performance of the iteration algorithms in different types of reactor-physics problems. (authors)

  13. Transport methods: general. 8. Formulation of Transport Equation in a Split Form

    International Nuclear Information System (INIS)

    Stancic, V.

    2001-01-01

    The singular eigenfunction expansion method has enabled the application of functional analysis methods in transport theory. However, when applying it, the users were discouraged, since in most problems, including slab problems, an extra problem has occurred. It appears necessary to solve the Fredholm integral equation in order to determine the expansion coefficients. There are several reasons for this difficulty. One reason might be the use of the full-range expansion techniques even in the regions where the function is singular. Such an example is the free boundary condition that requires the distribution to be equal to zero. Moreover, at μ = 0, the transport equation becomes an integral one. Both reasons motivated us to redefine the transport equation in a more natural way. Similar to scattering theory, here we define the flux distribution as a direct sum of forward- and backward-directed neutrons, e.g., μ ≥ 0 and μ < 0, respectively. As a result, the plane geometry transport equation is being split into coupled-pair equations. Further, using an appropriate transformation, this pair of equations reduces to a self-adjoint one having the same form as the known full-range single flux. It is interesting that all the methods of full-range theory are applicable here provided the flux as well as the transformed transport operator are two-dimensional matrices. Applying this to the slab problem, we find explicit expressions for reflected and transmitted particles caused by an arbitrary plane source. That is the news in this paper. Because of space constraints, only fundamentals of this approach will be presented here. We assume that the reader is familiar with this field; therefore, the applications are noted only at the end. (author)

  14. Application of Local Fractional Series Expansion Method to Solve Klein-Gordon Equations on Cantor Sets

    Directory of Open Access Journals (Sweden)

    Ai-Min Yang

    2014-01-01

    Full Text Available We use the local fractional series expansion method to solve the Klein-Gordon equations on Cantor sets within the local fractional derivatives. The analytical solutions within the nondifferential terms are discussed. The obtained results show the simplicity and efficiency of the present technique with application to the problems of the liner differential equations on Cantor sets.

  15. Local Fractional Series Expansion Method for Solving Wave and Diffusion Equations on Cantor Sets

    Directory of Open Access Journals (Sweden)

    Ai-Min Yang

    2013-01-01

    Full Text Available We proposed a local fractional series expansion method to solve the wave and diffusion equations on Cantor sets. Some examples are given to illustrate the efficiency and accuracy of the proposed method to obtain analytical solutions to differential equations within the local fractional derivatives.

  16. Solving Fokker-Planck Equations on Cantor Sets Using Local Fractional Decomposition Method

    Directory of Open Access Journals (Sweden)

    Shao-Hong Yan

    2014-01-01

    Full Text Available The local fractional decomposition method is applied to approximate the solutions for Fokker-Planck equations on Cantor sets with local fractional derivative. The obtained results give the present method that is very effective and simple for solving the differential equations on Cantor set.

  17. New approach to solve fully fuzzy system of linear equations using ...

    Indian Academy of Sciences (India)

    This paper proposes two new methods to solve fully fuzzy system of linear equations. The fuzzy system has been converted to a crisp system of linear equations by using single and double parametric form of fuzzy numbers to obtain the non-negative solution. Double parametric form of fuzzy numbers is defined and applied ...

  18. On the Efficiency of Algorithms for Solving Hartree–Fock and Kohn–Sham Response Equations

    DEFF Research Database (Denmark)

    Kauczor, Joanna; Jørgensen, Poul; Norman, Patrick

    2011-01-01

    The response equations as occurring in the Hartree–Fock, multiconfigurational self-consistent field, and Kohn–Sham density functional theory have identical matrix structures. The algorithms that are used for solving these equations are discussed, and new algorithms are proposed where trial vectors...

  19. Performance and Difficulties of Students in Formulating and Solving Quadratic Equations with One Unknown

    Science.gov (United States)

    Didis, Makbule Gozde; Erbas, Ayhan Kursat

    2015-01-01

    This study attempts to investigate the performance of tenth-grade students in solving quadratic equations with one unknown, using symbolic equation and word-problem representations. The participants were 217 tenth-grade students, from three different public high schools. Data was collected through an open-ended questionnaire comprising eight…

  20. Dielectric metasurfaces solve differential and integro-differential equations.

    Science.gov (United States)

    Abdollahramezani, Sajjad; Chizari, Ata; Dorche, Ali Eshaghian; Jamali, Mohammad Vahid; Salehi, Jawad A

    2017-04-01

    Leveraging subwavelength resonant nanostructures, plasmonic metasurfaces have recently attracted much attention as a breakthrough concept for engineering optical waves both spatially and spectrally. However, inherent ohmic losses concomitant with low coupling efficiencies pose fundamental impediments over their practical applications. Not only can all-dielectric metasurfaces tackle such substantial drawbacks, but also their CMOS-compatible configurations support both Mie resonances that are invariant to the incident angle. Here, we report on a transmittive metasurface comprising arrayed silicon nanodisks embedded in a homogeneous dielectric medium to manipulate phase and amplitude of incident light locally and almost independently. By taking advantage of the interplay between the electric/magnetic resonances and employing general concepts of spatial Fourier transformation, a highly efficient metadevice is proposed to perform mathematical operations including solution of ordinary differential and integro-differential equations with constant coefficients. Our findings further substantiate dielectric metasurfaces as promising candidates for miniaturized, two-dimensional, and planar optical analog computing systems that are much thinner than their conventional lens-based counterparts.

  1. Computer programs for solving systems of nonlinear equations

    International Nuclear Information System (INIS)

    Asaoka, Takumi

    1978-03-01

    Computer programs to find a solution, usually the one closest to some guess, of a system of simultaneous nonlinear equations are provided for real functions of the real arguments. These are based on quasi-Newton methods or projection methods, which are briefly reviewed in the present report. Benchmark tests were performed on these subroutines to grasp their characteristics. As the program not requiring analytical forms of the derivatives of the Jacobian matrix, we have dealt with NS01A of Powell, NS03A of Reid for a system with the sparse Jacobian and NONLIN of Brown. Of these three subroutines of quasi-Newton methods, NONLIN is shown to be the most useful because of its stable algorithm and short computation time. On the other hand, as the subroutine for which the derivatives of the Jacobian are to be supplied analytically, we have tested INTECH of a quasi-Newton method based on the Boggs' algorithm, PROJA of Georg and Keller based on the projection method and an option of NS03A. The results have shown that INTECH, treating variables which appear only linearly in the functions separately, takes the shortest computation time, on the whole, while the projection method requires further research to find an optimal algorithm. (auth.)

  2. Numerical simulation for fractional order stationary neutron transport equation using Haar wavelet collocation method

    Energy Technology Data Exchange (ETDEWEB)

    Saha Ray, S., E-mail: santanusaharay@yahoo.com; Patra, A.

    2014-10-15

    Highlights: • A stationary transport equation has been solved using the technique of Haar wavelet collocation method. • This paper intends to provide the great utility of Haar wavelets to nuclear science problem. • In the present paper, two-dimensional Haar wavelets are applied. • The proposed method is mathematically very simple, easy and fast. - Abstract: In this paper the numerical solution for the fractional order stationary neutron transport equation is presented using Haar wavelet Collocation Method (HWCM). Haar wavelet collocation method is efficient and powerful in solving wide class of linear and nonlinear differential equations. This paper intends to provide an application of Haar wavelets to nuclear science problems. This paper describes the application of Haar wavelets for the numerical solution of fractional order stationary neutron transport equation in homogeneous medium with isotropic scattering. The proposed method is mathematically very simple, easy and fast. To demonstrate about the efficiency and applicability of the method, two test problems are discussed.

  3. Accelerated procedure to solve kinetic equation for neutral atoms in a hot plasma

    Science.gov (United States)

    Tokar, Mikhail Z.

    2017-12-01

    The recombination of plasma charged components, electrons and ions of hydrogen isotopes, on the wall of a fusion reactor is a source of neutral molecules and atoms, recycling back into the plasma volume. Here neutral species participate, in particular, in charge-exchange (c-x) collisions with the plasma ions and, as a result, atoms of high energies with chaotically directed velocities are generated. Some fraction of these hot atoms hit the wall. Statistical Monte Carlo methods normally used to model c-x atoms are too time consuming for reasonably small level of accident errors and extensive parameter studies are problematic. By applying pass method to evaluate integrals from functions, including the ion velocity distribution, an iteration approach to solve one-dimensional kinetic equation [1], being alternative to Monte Carlo procedure, has been tremendously accelerated, at least by a factor of 30-50 [2]. Here this approach is developed further to solve the 2-D kinetic equation, applied to model the transport of c-x atoms in the vicinity of an opening in the wall, e.g., the entrance of the duct guiding to a diagnostic installation. This is necessary to determine firmly the energy spectrum of c-x atoms penetrating into the duct and to assess the erosion of the installation there. The results of kinetic modeling are compared with those obtained with the diffusion description for c-x atoms, being strictly relevant under plasma conditions of low temperature and high density, where the mean free path length between c-x collisions is much smaller than that till the atom ionization by electrons. It is demonstrated that the previous calculations [3], done with the diffusion approximation for c-x atoms, overestimate the erosion rate of Mo mirrors in a reactor by a factor of 3 compared to the result of the present kinetic study.

  4. Set of difference spitting schemes for solving the Navier-Stokes incompressible equations in natural variables

    International Nuclear Information System (INIS)

    Koleshko, S.B.

    1989-01-01

    A three-parametric set of difference schemes is suggested to solve Navier-Stokes equations with the use of the relaxation form of the continuity equation. The initial equations are stated for time increments. Use is made of splitting the operator into one-dimensional forms that reduce calculations to scalar factorizations. Calculated results for steady- and unsteady-state flows in a cavity are presented

  5. Numerical method for solving linear Fredholm fuzzy integral equations of the second kind

    Energy Technology Data Exchange (ETDEWEB)

    Abbasbandy, S. [Department of Mathematics, Imam Khomeini International University, P.O. Box 288, Ghazvin 34194 (Iran, Islamic Republic of)]. E-mail: saeid@abbasbandy.com; Babolian, E. [Faculty of Mathematical Sciences and Computer Engineering, Teacher Training University, Tehran 15618 (Iran, Islamic Republic of); Alavi, M. [Department of Mathematics, Arak Branch, Islamic Azad University, Arak 38135 (Iran, Islamic Republic of)

    2007-01-15

    In this paper we use parametric form of fuzzy number and convert a linear fuzzy Fredholm integral equation to two linear system of integral equation of the second kind in crisp case. We can use one of the numerical method such as Nystrom and find the approximation solution of the system and hence obtain an approximation for fuzzy solution of the linear fuzzy Fredholm integral equations of the second kind. The proposed method is illustrated by solving some numerical examples.

  6. Solving the discrete KdV equation with homotopy analysis method

    International Nuclear Information System (INIS)

    Zou, L.; Zong, Z.; Wang, Z.; He, L.

    2007-01-01

    In this Letter, we apply the homotopy analysis method to differential-difference equations. We take the discrete KdV equation as an example, and successfully obtain double periodic wave solutions and solitary wave solutions. It illustrates the validity and the great potential of the homotopy analysis method in solving discrete KdV equation. Comparisons are made between the results of the proposed method and exact solutions. The results reveal that the proposed method is very effective and convenient

  7. Non-standard finite difference and Chebyshev collocation methods for solving fractional diffusion equation

    Science.gov (United States)

    Agarwal, P.; El-Sayed, A. A.

    2018-06-01

    In this paper, a new numerical technique for solving the fractional order diffusion equation is introduced. This technique basically depends on the Non-Standard finite difference method (NSFD) and Chebyshev collocation method, where the fractional derivatives are described in terms of the Caputo sense. The Chebyshev collocation method with the (NSFD) method is used to convert the problem into a system of algebraic equations. These equations solved numerically using Newton's iteration method. The applicability, reliability, and efficiency of the presented technique are demonstrated through some given numerical examples.

  8. Effective methods of solving of model equations of certain class of thermal systems

    International Nuclear Information System (INIS)

    Lach, J.

    1985-01-01

    A number of topics connected with solving of model equations of certain class of thermal systems by the method of successive approximations is touched. A system of partial differential equations of the first degree, appearing most frequently in practical applications of heat and mass transfer theory is reduced to an equivalent system of Volterra integral equations of the second kind. Among a few sample applications the thermal processes appearing in the fuel channel of nuclear reactor are solved. The theoretical analysis is illustrated by the results of numerical calculations given in tables and diagrams. 111 refs., 17 figs., 16 tabs. (author)

  9. A parallel algorithm for solving the multidimensional within-group discrete ordinates equations with spatial domain decomposition - 104

    International Nuclear Information System (INIS)

    Zerr, R.J.; Azmy, Y.Y.

    2010-01-01

    A spatial domain decomposition with a parallel block Jacobi solution algorithm has been developed based on the integral transport matrix formulation of the discrete ordinates approximation for solving the within-group transport equation. The new methodology abandons the typical source iteration scheme and solves directly for the fully converged scalar flux. Four matrix operators are constructed based upon the integral form of the discrete ordinates equations. A single differential mesh sweep is performed to construct these operators. The method is parallelized by decomposing the problem domain into several smaller sub-domains, each treated as an independent problem. The scalar flux of each sub-domain is solved exactly given incoming angular flux boundary conditions. Sub-domain boundary conditions are updated iteratively, and convergence is achieved when the scalar flux error in all cells meets a pre-specified convergence criterion. The method has been implemented in a computer code that was then employed for strong scaling studies of the algorithm's parallel performance via a fixed-size problem in tests ranging from one domain up to one cell per sub-domain. Results indicate that the best parallel performance compared to source iterations occurs for optically thick, highly scattering problems, the variety that is most difficult for the traditional SI scheme to solve. Moreover, the minimum execution time occurs when each sub-domain contains a total of four cells. (authors)

  10. Numerical solution of the radionuclide transport equation

    International Nuclear Information System (INIS)

    Hadermann, J.; Roesel, F.

    1983-11-01

    A numerical solution of the one-dimensional geospheric radionuclide chain transport equation based on the pseudospectral method is developed. The advantages of this approach are flexibility in incorporating space and time dependent migration parameters, arbitrary boundary conditions and solute rock interactions as well as efficiency and reliability. As an application the authors investigate the impact of non-linear sorption isotherms on migration in crystalline rock. It is shown that non-linear sorption, in the present case a Freundlich isotherm, may reduce concentration at the geosphere outlet by orders of magnitude provided the migration time is comparable or larger than the half-life of the nuclide in question. The importance of fixing dispersivity within the continuum approach is stressed. (Auth.)

  11. Analysis of space and energy homogenization techniques for the solving of the neutron transport equation in nuclear reactor; Analyse des techniques d'homogeneisation spatiale et energetique dans la resolution de l'equation du transport des neutrons dans les reacteurs nucleaires

    Energy Technology Data Exchange (ETDEWEB)

    Magat, Ph

    1997-04-01

    Today neutron transport in PWR's core is routinely computed through the transport-diffusion(2 groups) scheme. This method gives satisfactory results for reactors operating in normal conditions but the 2 group diffusion approximation is unable to take into account interface effects or anisotropy. The improvement of this scheme is logically possible through the use of a simplified P{sub N} method (SP{sub N}) for the modeling of the core. The comparison between S{sub N} calculations and SP{sub N} calculations shows an excellent agreement on eigenvalues as well as on power maps. We can notice that: -) it is no use extending the development beyond P{sub 3}, there is no effect; -) the P{sub 1} development is adequate; and -) the P{sub 0} development is totally inappropriate. Calculations performed on the N4 core of the Chooz power plant have enabled us to compare diffusion operators with transport operators (SP{sub 1}, SP{sub 3}, SP{sub 5} and SP{sub 7}). These calculations show that the implementation of the SP{sub N} method is feasible but the extra-costs in computation times and memory are important. We recommend: SP{sub 5}P{sub 1} calculations for heterogeneous 2-dimension geometry and SP{sub 3}P{sub 1} calculations for the homogeneous 3-dimension geometry. (A.C.)

  12. Analysis of space and energy homogenization techniques for the solving of the neutron transport equation in nuclear reactor; Analyse des techniques d'homogeneisation spatiale et energetique dans la resolution de l'equation du transport des neutrons dans les reacteurs nucleaires

    Energy Technology Data Exchange (ETDEWEB)

    Magat, Ph

    1997-04-01

    Today neutron transport in PWR's core is routinely computed through the transport-diffusion(2 groups) scheme. This method gives satisfactory results for reactors operating in normal conditions but the 2 group diffusion approximation is unable to take into account interface effects or anisotropy. The improvement of this scheme is logically possible through the use of a simplified P{sub N} method (SP{sub N}) for the modeling of the core. The comparison between S{sub N} calculations and SP{sub N} calculations shows an excellent agreement on eigenvalues as well as on power maps. We can notice that: -) it is no use extending the development beyond P{sub 3}, there is no effect; -) the P{sub 1} development is adequate; and -) the P{sub 0} development is totally inappropriate. Calculations performed on the N4 core of the Chooz power plant have enabled us to compare diffusion operators with transport operators (SP{sub 1}, SP{sub 3}, SP{sub 5} and SP{sub 7}). These calculations show that the implementation of the SP{sub N} method is feasible but the extra-costs in computation times and memory are important. We recommend: SP{sub 5}P{sub 1} calculations for heterogeneous 2-dimension geometry and SP{sub 3}P{sub 1} calculations for the homogeneous 3-dimension geometry. (A.C.)

  13. Diffusion equation and spin drag in spin-polarized transport

    DEFF Research Database (Denmark)

    Flensberg, Karsten; Jensen, Thomas Stibius; Mortensen, Asger

    2001-01-01

    We study the role of electron-electron interactions for spin-polarized transport using the Boltzmann equation, and derive a set of coupled transport equations. For spin-polarized transport the electron-electron interactions are important, because they tend to equilibrate the momentum of the two-s...

  14. Will learning to solve one-step equations pose a challenge to 8th grade students?

    Science.gov (United States)

    Ngu, Bing Hiong; Phan, Huy P.

    2017-08-01

    Assimilating multiple interactive elements simultaneously in working memory to allow understanding to occur, while solving an equation, would impose a high cognitive load. Element interactivity arises from the interaction between elements within and across operational and relational lines. Moreover, operating with special features (e.g. negative pronumeral) poses additional challenge to master equation solving skills. In an experiment, 41 8th grade students (girls = 16, boys = 25) sat for a pre-test, attended a session about equation solving, completed an acquisition phase which constituted the main intervention and were tested again in a post-test. The results showed that at post-test, students performed better on one-step equations tapping low rather than high element interactivity knowledge. In addition, students performed better on those one-step equations that contained no special features. Thus, both the degree of element interactivity and the operation with special features affect the challenge posed to 8th grade students on learning how to solve one-step equations.

  15. Direct method of solving finite difference nonlinear equations for multicomponent diffusion in a gas centrifuge

    International Nuclear Information System (INIS)

    Potemki, Valeri G.; Borisevich, Valentine D.; Yupatov, Sergei V.

    1996-01-01

    This paper describes the the next evolution step in development of the direct method for solving systems of Nonlinear Algebraic Equations (SNAE). These equations arise from the finite difference approximation of original nonlinear partial differential equations (PDE). This method has been extended on the SNAE with three variables. The solving SNAE bases on Reiterating General Singular Value Decomposition of rectangular matrix pencils (RGSVD-algorithm). In contrast to the computer algebra algorithm in integer arithmetic based on the reduction to the Groebner's basis that algorithm is working in floating point arithmetic and realizes the reduction to the Kronecker's form. The possibilities of the method are illustrated on the example of solving the one-dimensional diffusion equation for 3-component model isotope mixture in a ga centrifuge. The implicit scheme for the finite difference equations without simplifying the nonlinear properties of the original equations is realized. The technique offered provides convergence to the solution for the single run. The Toolbox SNAE is developed in the framework of the high performance numeric computation and visualization software MATLAB. It includes more than 30 modules in MATLAB language for solving SNAE with two and three variables. (author)

  16. An algorithm for solving an arbitrary triangular fully fuzzy Sylvester matrix equations

    Science.gov (United States)

    Daud, Wan Suhana Wan; Ahmad, Nazihah; Malkawi, Ghassan

    2017-11-01

    Sylvester matrix equations played a prominent role in various areas including control theory. Considering to any un-certainty problems that can be occurred at any time, the Sylvester matrix equation has to be adapted to the fuzzy environment. Therefore, in this study, an algorithm for solving an arbitrary triangular fully fuzzy Sylvester matrix equation is constructed. The construction of the algorithm is based on the max-min arithmetic multiplication operation. Besides that, an associated arbitrary matrix equation is modified in obtaining the final solution. Finally, some numerical examples are presented to illustrate the proposed algorithm.

  17. A meshless method for solving two-dimensional variable-order time fractional advection-diffusion equation

    Science.gov (United States)

    Tayebi, A.; Shekari, Y.; Heydari, M. H.

    2017-07-01

    Several physical phenomena such as transformation of pollutants, energy, particles and many others can be described by the well-known convection-diffusion equation which is a combination of the diffusion and advection equations. In this paper, this equation is generalized with the concept of variable-order fractional derivatives. The generalized equation is called variable-order time fractional advection-diffusion equation (V-OTFA-DE). An accurate and robust meshless method based on the moving least squares (MLS) approximation and the finite difference scheme is proposed for its numerical solution on two-dimensional (2-D) arbitrary domains. In the time domain, the finite difference technique with a θ-weighted scheme and in the space domain, the MLS approximation are employed to obtain appropriate semi-discrete solutions. Since the newly developed method is a meshless approach, it does not require any background mesh structure to obtain semi-discrete solutions of the problem under consideration, and the numerical solutions are constructed entirely based on a set of scattered nodes. The proposed method is validated in solving three different examples including two benchmark problems and an applied problem of pollutant distribution in the atmosphere. In all such cases, the obtained results show that the proposed method is very accurate and robust. Moreover, a remarkable property so-called positive scheme for the proposed method is observed in solving concentration transport phenomena.

  18. The transportation management division institutional program: Networking and problem solving

    International Nuclear Information System (INIS)

    McGinnis, K.A.; Peterson, J.M.

    1989-06-01

    The US Department of Energy (DOE) has several programs related to transportation. While these programs may have differing missions and legislative authority, the required activities are frequently similar. To ensure a DOE-wide perspective in developing transportation policies and procedures, a DOE Transportation Institutional Task Force (Task Force) has been formed, which is the primary focus of this paper. The Task Force, composed of representatives from each of the major DOE transportation programs, meets periodically to exchange experiences and insights on institutional issues related to Departmental shipping. The primary purpose of the group is to identify opportunities for productive interactions with the transportation community, including interested and affected members of the public. This paper will also focus sharply on the networking of DOE with the State, Tribal, and local officials in fostering better understanding and in solving problems. An example of such activity is the DOE's cooperative agreement with the Energy Task Force of the Urban Consortium. A major effort is to encourage cooperative action in identifying, addressing, and resolving issues that could impede the transportation of radioactive materials

  19. Heat conduction in multifunctional nanotrusses studied using Boltzmann transport equation

    International Nuclear Information System (INIS)

    Dou, Nicholas G.; Minnich, Austin J.

    2016-01-01

    Materials that possess low density, low thermal conductivity, and high stiffness are desirable for engineering applications, but most materials cannot realize these properties simultaneously due to the coupling between them. Nanotrusses, which consist of hollow nanoscale beams architected into a periodic truss structure, can potentially break these couplings due to their lattice architecture and nanoscale features. In this work, we study heat conduction in the exact nanotruss geometry by solving the frequency-dependent Boltzmann transport equation using a variance-reduced Monte Carlo algorithm. We show that their thermal conductivity can be described with only two parameters, solid fraction and wall thickness. Our simulations predict that nanotrusses can realize unique combinations of mechanical and thermal properties that are challenging to achieve in typical materials

  20. On the Solution of the Neutron Transport Equation

    Energy Technology Data Exchange (ETDEWEB)

    Depken, S

    1962-12-15

    The neutron transport equation has occupied the attention of many authors since Placzek, Wick and others made their first attempts to solve it, Even in the simple case of energy independent cross-sections, and disregarding the motion of the scattering nucleons, it is difficult to find a solution in an analytical form which is easily surveyable and fitted for numerical calculations. In Part I of this paper some new viewpoints will be introduced which enable the solution to be presented in its simplest possible form. Part II is devoted to an investigation of some functions introduced in Part I. In Part III the results are applied to the case of large energy lethargy, and the validity of derived formulas is discussed.

  1. Methods and Algorithms for Solving Inverse Problems for Fractional Advection-Dispersion Equations

    KAUST Repository

    Aldoghaither, Abeer

    2015-11-12

    Fractional calculus has been introduced as an e cient tool for modeling physical phenomena, thanks to its memory and hereditary properties. For example, fractional models have been successfully used to describe anomalous di↵usion processes such as contaminant transport in soil, oil flow in porous media, and groundwater flow. These models capture important features of particle transport such as particles with velocity variations and long-rest periods. Mathematical modeling of physical phenomena requires the identification of pa- rameters and variables from available measurements. This is referred to as an inverse problem. In this work, we are interested in studying theoretically and numerically inverse problems for space Fractional Advection-Dispersion Equation (FADE), which is used to model solute transport in porous media. Identifying parameters for such an equa- tion is important to understand how chemical or biological contaminants are trans- ported throughout surface aquifer systems. For instance, an estimate of the di↵eren- tiation order in groundwater contaminant transport model can provide information about soil properties, such as the heterogeneity of the medium. Our main contribution is to propose a novel e cient algorithm based on modulat-ing functions to estimate the coe cients and the di↵erentiation order for space FADE, which can be extended to general fractional Partial Di↵erential Equation (PDE). We also show how the method can be applied to the source inverse problem. This work is divided into two parts: In part I, the proposed method is described and studied through an extensive numerical analysis. The local convergence of the proposed two-stage algorithm is proven for 1D space FADE. The properties of this method are studied along with its limitations. Then, the algorithm is generalized to the 2D FADE. In part II, we analyze direct and inverse source problems for a space FADE. The problem consists of recovering the source term using final

  2. DIAGRAM SOLVE THE USE OF SIMULINK BLOCK DIAGRAM TO SOLVE MATHEMA THEMATICAL CONTROL EQU MATHEMATICAL MODELS AND CONTROL EQUATIONS

    Directory of Open Access Journals (Sweden)

    N.M. Ghasem

    2003-12-01

    Full Text Available In this paper, the simulink block diagram is used to solve a model consists of a set of ordinary differential and algebraic equations to control the temperature inside a simple stirred tank heater. The flexibility of simulink block diagram gives students a better understanding of the control systems. The simulink also allows solution of mathematical models and easy visualization of the system variables. A polyethylene fluidized bed reactor is considered as an industrial example and the effect of the Proportional, Integral and Derivative control policy is presented for comparison.

  3. Solving inverse problems for biological models using the collage method for differential equations.

    Science.gov (United States)

    Capasso, V; Kunze, H E; La Torre, D; Vrscay, E R

    2013-07-01

    In the first part of this paper we show how inverse problems for differential equations can be solved using the so-called collage method. Inverse problems can be solved by minimizing the collage distance in an appropriate metric space. We then provide several numerical examples in mathematical biology. We consider applications of this approach to the following areas: population dynamics, mRNA and protein concentration, bacteria and amoeba cells interaction, tumor growth.

  4. A Fortran program (RELAX3D) to solve the 3 dimensional Poisson (Laplace) equation

    International Nuclear Information System (INIS)

    Houtman, H.; Kost, C.J.

    1983-09-01

    RELAX3D is an efficient, user friendly, interactive FORTRAN program which solves the Poisson (Laplace) equation Λ 2 =p for a general 3 dimensional geometry consisting of Dirichlet and Neumann boundaries approximated to lie on a regular 3 dimensional mesh. The finite difference equations at these nodes are solved using a successive point-iterative over-relaxation method. A menu of commands, supplemented by HELP facility, controls the dynamic loading of the subroutine describing the problem case, the iterations to converge to a solution, and the contour plotting of any desired slices, etc

  5. A predictor-corrector scheme for solving the Volterra integral equation

    KAUST Repository

    Al Jarro, Ahmed

    2011-08-01

    The occurrence of late time instabilities is a common problem of almost all time marching methods developed for solving time domain integral equations. Implicit marching algorithms are now considered stable with various efforts that have been developed for removing low and high frequency instabilities. On the other hand, literature on stabilizing explicit schemes, which might be considered more efficient since they do not require a matrix inversion at each time step, is practically non-existent. In this work, a stable but still explicit predictor-corrector scheme is proposed for solving the Volterra integral equation and its efficacy is verified numerically. © 2011 IEEE.

  6. A New Numerical Technique for Solving Systems Of Nonlinear Fractional Partial Differential Equations

    Directory of Open Access Journals (Sweden)

    Mountassir Hamdi Cherif

    2017-11-01

    Full Text Available In this paper, we apply an efficient method called the Aboodh decomposition method to solve systems of nonlinear fractional partial differential equations. This method is a combined form of Aboodh transform with Adomian decomposition method. The theoretical analysis of this investigated for systems of nonlinear fractional partial differential equations is calculated in the explicit form of a power series with easily computable terms. Some examples are given to shows that this method is very efficient and accurate. This method can be applied to solve others nonlinear systems problems.

  7. A homotopy method for solving Riccati equations on a shared memory parallel computer

    International Nuclear Information System (INIS)

    Zigic, D.; Watson, L.T.; Collins, E.G. Jr.; Davis, L.D.

    1993-01-01

    Although there are numerous algorithms for solving Riccati equations, there still remains a need for algorithms which can operate efficiently on large problems and on parallel machines. This paper gives a new homotopy-based algorithm for solving Riccati equations on a shared memory parallel computer. The central part of the algorithm is the computation of the kernel of the Jacobian matrix, which is essential for the corrector iterations along the homotopy zero curve. Using a Schur decomposition the tensor product structure of various matrices can be efficiently exploited. The algorithm allows for efficient parallelization on shared memory machines

  8. Nonlinear evolution equations and solving algebraic systems: the importance of computer algebra

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Kostov, N.A.

    1989-01-01

    In the present paper we study the application of computer algebra to solve the nonlinear polynomial systems which arise in investigation of nonlinear evolution equations. We consider several systems which are obtained in classification of integrable nonlinear evolution equations with uniform rank. Other polynomial systems are related with the finding of algebraic curves for finite-gap elliptic potentials of Lame type and generalizations. All systems under consideration are solved using the method based on construction of the Groebner basis for corresponding polynomial ideals. The computations have been carried out using computer algebra systems. 20 refs

  9. Second order time evolution of the multigroup diffusion and P1 equations for radiation transport

    International Nuclear Information System (INIS)

    Olson, Gordon L.

    2011-01-01

    Highlights: → An existing multigroup transport algorithm is extended to be second-order in time. → A new algorithm is presented that does not require a grey acceleration solution. → The two algorithms are tested with 2D, multi-material problems. → The two algorithms have comparable computational requirements. - Abstract: An existing solution method for solving the multigroup radiation equations, linear multifrequency-grey acceleration, is here extended to be second order in time. This method works for simple diffusion and for flux-limited diffusion, with or without material conduction. A new method is developed that does not require the solution of an averaged grey transport equation. It is effective solving both the diffusion and P 1 forms of the transport equation. Two dimensional, multi-material test problems are used to compare the solution methods.

  10. A highly accurate finite-difference method with minimum dispersion error for solving the Helmholtz equation

    KAUST Repository

    Wu, Zedong

    2018-04-05

    Numerical simulation of the acoustic wave equation in either isotropic or anisotropic media is crucial to seismic modeling, imaging and inversion. Actually, it represents the core computation cost of these highly advanced seismic processing methods. However, the conventional finite-difference method suffers from severe numerical dispersion errors and S-wave artifacts when solving the acoustic wave equation for anisotropic media. We propose a method to obtain the finite-difference coefficients by comparing its numerical dispersion with the exact form. We find the optimal finite difference coefficients that share the dispersion characteristics of the exact equation with minimal dispersion error. The method is extended to solve the acoustic wave equation in transversely isotropic (TI) media without S-wave artifacts. Numerical examples show that the method is is highly accurate and efficient.

  11. Intuitive physics knowledge, physics problem solving and the role of mathematical equations

    Directory of Open Access Journals (Sweden)

    Laura Buteler

    2012-09-01

    Full Text Available The present work explores the role that mathematical equations play in modifying students’ physical intuition (diSessa, 1993. The work is carried out assuming that students achieve a great deal of the refinement in their physical intuitions during problem solving (Sherin, 2006. The study is guided by the question of how the use of mathematical equations contributes to this refinement. The authors aim at expanding on Sherin´s (2006 hypothesis, suggesting a more bounding relation between physical intuitions and mathematics. In this scenario, intuitions play a more compelling role in “deciding” which equations are acceptable and which are not. Our hypothesis is constructed on the basis of three cases: the first published by Sherin (2006 and two more from registries of our own. The three cases are compared and analyzed in relation to the role of mathematical equations in refining – or not – the intuitive knowledge students bring to play during problem solving.

  12. Solving Some Special Cases of Monomial Ratio Equations Appearing Frequently in Physical and Engineering Problems

    Directory of Open Access Journals (Sweden)

    Enrique Castillo

    2016-01-01

    Full Text Available We first show that monomial ratio equations are not only very common in Physics and Engineering, but the natural type of equations in many practical problems. More precisely, in the case of models involving scale variables if the used formulas are not of this type they are not physically valid. The consequence is that when estimating the model parameters we are faced with systems of monomial ratio equations that are nonlinear and difficult to solve. In this paper, we provide an original algorithm to obtain the unique solutions of systems of equations made of linear combinations of monomial ratios whose coefficient matrix has a proper null space with low dimension that permits solving the problem in a simple way. Finally, we illustrate the proposed methods by their application to two practical problems from the hydraulic and structural fields.

  13. Improved method for solving the neutron transport problem by discretization of space and energy variables

    International Nuclear Information System (INIS)

    Bosevski, T.

    1971-01-01

    The polynomial interpolation of neutron flux between the chosen space and energy variables enabled transformation of the integral transport equation into a system of linear equations with constant coefficients. Solutions of this system are the needed values of flux for chosen values of space and energy variables. The proposed improved method for solving the neutron transport problem including the mathematical formalism is simple and efficient since the number of needed input data is decreased both in treating the spatial and energy variables. Mathematical method based on this approach gives more stable solutions with significantly decreased probability of numerical errors. Computer code based on the proposed method was used for calculations of one heavy water and one light water reactor cell, and the results were compared to results of other very precise calculations. The proposed method was better concerning convergence rate, decreased computing time and needed computer memory. Discretization of variables enabled direct comparison of theoretical and experimental results

  14. Steady-state transport equation resolution by particle methods, and numerical results

    International Nuclear Information System (INIS)

    Mercier, B.

    1985-10-01

    A method to solve steady-state transport equation has been given. Principles of the method are given. The method is studied in two different cases; estimations given by the theory are compared to numerical results. Results got in 1-D (spherical geometry) and in 2-D (axisymmetric geometry) are given [fr

  15. A method for solving the KDV equation and some numerical experiments

    International Nuclear Information System (INIS)

    Chang Jinjiang.

    1993-01-01

    In this paper, by means of difference method for discretization of space partial derivatives of KDV equation, an initial value problem in ordinary differential equations of large dimensions is produced. By using this ordinary differential equations the existence and the uniqueness of the solution of the KDV equation and the conservation of scheme are proved. This ordinary differential equation can be solved by using implicit Runge-Kutta methods, so a new method for finding the numerical solution of the KDV equation is presented. Numerical experiments not only describe in detail the procedure of two solitons collision, soliton reflex and soliton produce, but also show that this method is very effective. (author). 7 refs, 3 figs

  16. On a numereeical method for solving the Faddv integral equation without deformation of contour

    International Nuclear Information System (INIS)

    Belyaev, V.O.; Moller, K.

    1976-01-01

    A numerical method is proposed for solving the Faddeev equation for separable potentials at positive total energy. The method is based on the fact that after applying a simple interpolation procedure the logarithmic singularities in the kernel of the integral equation can be extracted in the same way as usually the pole singularity is extracted. The method has been applied to calculate the eigenvalues of the Faddeev kernel

  17. The ATOMFT integrator - Using Taylor series to solve ordinary differential equations

    Science.gov (United States)

    Berryman, Kenneth W.; Stanford, Richard H.; Breckheimer, Peter J.

    1988-01-01

    This paper discusses the application of ATOMFT, an integration package based on Taylor series solution with a sophisticated user interface. ATOMFT has the capabilities to allow the implementation of user defined functions and the solution of stiff and algebraic equations. Detailed examples, including the solutions to several astrodynamics problems, are presented. Comparisons with its predecessor ATOMCC and other modern integrators indicate that ATOMFT is a fast, accurate, and easy method to use to solve many differential equation problems.

  18. Solving nonlinear, High-order partial differential equations using a high-performance isogeometric analysis framework

    KAUST Repository

    Cortes, Adriano Mauricio; Vignal, Philippe; Sarmiento, Adel; Garcí a, Daniel O.; Collier, Nathan; Dalcin, Lisandro; Calo, Victor M.

    2014-01-01

    In this paper we present PetIGA, a high-performance implementation of Isogeometric Analysis built on top of PETSc. We show its use in solving nonlinear and time-dependent problems, such as phase-field models, by taking advantage of the high-continuity of the basis functions granted by the isogeometric framework. In this work, we focus on the Cahn-Hilliard equation and the phase-field crystal equation.

  19. Advantages and Disadvantages of Using MATLAB/ode45 for Solving Differential Equations in Engineering Applications

    OpenAIRE

    Waleed K. Ahmed

    2013-01-01

    The present paper demonstrates the route used for solving differential equations for the engineering applications at UAEU. Usually students at the Engineering Requirements Unit (ERU) stage of the Faculty of Engineering at the UAEU must enroll in a course of Differential Equations and Engineering Applications (MATH 2210) as a prerequisite for the subsequent stages of their study. Mainly, one of the objectives of this course is that the students practice MATLAB software package during the cours...

  20. New Approaches for Solving Fokker Planck Equation on Cantor Sets within Local Fractional Operators

    Directory of Open Access Journals (Sweden)

    Hassan Kamil Jassim

    2015-01-01

    Full Text Available We discuss new approaches to handling Fokker Planck equation on Cantor sets within local fractional operators by using the local fractional Laplace decomposition and Laplace variational iteration methods based on the local fractional calculus. The new approaches maintain the efficiency and accuracy of the analytical methods for solving local fractional differential equations. Illustrative examples are given to show the accuracy and reliable results.

  1. Numerical methods for solving the governing equations for a seriated continuum

    International Nuclear Information System (INIS)

    Narum, R.E.; Noble, C.; Mortensen, G.A.; McFadden, J.H.

    1976-09-01

    A desire to more accurately predict the behavior of transient two-phase flows has resulted in an investigation of the feasibility of computing unequal phase velocities and unequal phase temperatures. The finite difference forms of a set of equations governing a seriated continuum are presented along with two methods developed for solving the resulting systems of simultaneous nonlinear equations. Results from a one-dimensional computer code are presented to illustrate the capabilities of one of the solution methods

  2. A Regularized Approach for Solving Magnetic Differential Equations and a Revised Iterative Equilibrium Algorithm

    International Nuclear Information System (INIS)

    Hudson, S.R.

    2010-01-01

    A method for approximately solving magnetic differential equations is described. The approach is to include a small diffusion term to the equation, which regularizes the linear operator to be inverted. The extra term allows a 'source-correction' term to be defined, which is generally required in order to satisfy the solvability conditions. The approach is described in the context of computing the pressure and parallel currents in the iterative approach for computing magnetohydrodynamic equilibria.

  3. An efficient computer based wavelets approximation method to solve Fuzzy boundary value differential equations

    Science.gov (United States)

    Alam Khan, Najeeb; Razzaq, Oyoon Abdul

    2016-03-01

    In the present work a wavelets approximation method is employed to solve fuzzy boundary value differential equations (FBVDEs). Essentially, a truncated Legendre wavelets series together with the Legendre wavelets operational matrix of derivative are utilized to convert FB- VDE into a simple computational problem by reducing it into a system of fuzzy algebraic linear equations. The capability of scheme is investigated on second order FB- VDE considered under generalized H-differentiability. Solutions are represented graphically showing competency and accuracy of this method.

  4. Application of the Generalized Differential Quadrature Method in Solving Burgers' Equations

    International Nuclear Information System (INIS)

    Mokhtari, R.; Toodar, A. Samadi; Chegini, N.G.

    2011-01-01

    The aim of this paper is to obtain numerical solutions of the one-dimensional, two-dimensional and coupled Burgers' equations through the generalized differential quadrature method (GDQM). The polynomial-based differential quadrature (PDQ) method is employed and the obtained system of ordinary differential equations is solved via the total variation diminishing Runge-Kutta (TVD-RK) method. The numerical solutions are satisfactorily coincident with the exact solutions. The method can compete against the methods applied in the literature. (general)

  5. Nonlinearly Activated Neural Network for Solving Time-Varying Complex Sylvester Equation.

    Science.gov (United States)

    Li, Shuai; Li, Yangming

    2013-10-28

    The Sylvester equation is often encountered in mathematics and control theory. For the general time-invariant Sylvester equation problem, which is defined in the domain of complex numbers, the Bartels-Stewart algorithm and its extensions are effective and widely used with an O(n³) time complexity. When applied to solving the time-varying Sylvester equation, the computation burden increases intensively with the decrease of sampling period and cannot satisfy continuous realtime calculation requirements. For the special case of the general Sylvester equation problem defined in the domain of real numbers, gradient-based recurrent neural networks are able to solve the time-varying Sylvester equation in real time, but there always exists an estimation error while a recently proposed recurrent neural network by Zhang et al [this type of neural network is called Zhang neural network (ZNN)] converges to the solution ideally. The advancements in complex-valued neural networks cast light to extend the existing real-valued ZNN for solving the time-varying real-valued Sylvester equation to its counterpart in the domain of complex numbers. In this paper, a complex-valued ZNN for solving the complex-valued Sylvester equation problem is investigated and the global convergence of the neural network is proven with the proposed nonlinear complex-valued activation functions. Moreover, a special type of activation function with a core function, called sign-bi-power function, is proven to enable the ZNN to converge in finite time, which further enhances its advantage in online processing. In this case, the upper bound of the convergence time is also derived analytically. Simulations are performed to evaluate and compare the performance of the neural network with different parameters and activation functions. Both theoretical analysis and numerical simulations validate the effectiveness of the proposed method.

  6. Imaginary Time Step Method to Solve the Dirac Equation with Nonlocal Potential

    International Nuclear Information System (INIS)

    Zhang Ying; Liang Haozhao; Meng Jie

    2009-01-01

    The imaginary time step (ITS) method is applied to solve the Dirac equation with nonlocal potentials in coordinate space. Taking the nucleus 12 C as an example, even with nonlocal potentials, the direct ITS evolution for the Dirac equation still meets the disaster of the Dirac sea. However, following the recipe in our former investigation, the disaster can be avoided by the ITS evolution for the corresponding Schroedinger-like equation without localization, which gives the convergent results exactly the same with those obtained iteratively by the shooting method with localized effective potentials.

  7. Derivation of the physical equations solved in the inertial confinement stability code DOC. Informal report

    International Nuclear Information System (INIS)

    Scannapieco, A.J.; Cranfill, C.W.

    1978-11-01

    There now exists an inertial confinement stability code called DOC, which runs as a postprocessor. DOC (a code that has evolved from a previous code, PANSY) is a spherical harmonic linear stability code that integrates, in time, a set of Lagrangian perturbation equations. Effects due to real equations of state, asymmetric energy deposition, thermal conduction, shock propagation, and a time-dependent zeroth-order state are handled in the code. We present here a detailed derivation of the physical equations that are solved in the code

  8. Solving the KPI wave equation with a moving adaptive FEM grid

    Directory of Open Access Journals (Sweden)

    Granville Sewell

    2013-04-01

    Full Text Available The Kadomtsev-Petviashvili I (KPI equation is the difficult nonlinear wave equation $U_{xt} + 6U_x^2 + 6UU_{xx} + U_{xxxx} = 3U_{yy}.$ We solve this equation using PDE2D (www.pde2d.com with initial conditions consisting of two lump solitons, which collide and reseparate. Since the solution has steep, moving, peaks, an adaptive finite element grid is used with a grading which moves with the peaks.

  9. Derivation of the physical equations solved in the inertial confinement stability code DOC. Informal report

    Energy Technology Data Exchange (ETDEWEB)

    Scannapieco, A.J.; Cranfill, C.W.

    1978-11-01

    There now exists an inertial confinement stability code called DOC, which runs as a postprocessor. DOC (a code that has evolved from a previous code, PANSY) is a spherical harmonic linear stability code that integrates, in time, a set of Lagrangian perturbation equations. Effects due to real equations of state, asymmetric energy deposition, thermal conduction, shock propagation, and a time-dependent zeroth-order state are handled in the code. We present here a detailed derivation of the physical equations that are solved in the code.

  10. A hybrid Eulerian–Lagrangian numerical scheme for solving prognostic equations in fluid dynamics

    Directory of Open Access Journals (Sweden)

    E. Kaas

    2013-11-01

    Full Text Available A new hybrid Eulerian–Lagrangian numerical scheme (HEL for solving prognostic equations in fluid dynamics is proposed. The basic idea is to use an Eulerian as well as a fully Lagrangian representation of all prognostic variables. The time step in Lagrangian space is obtained as a translation of irregularly spaced Lagrangian parcels along downstream trajectories. Tendencies due to other physical processes than advection are calculated in Eulerian space, interpolated, and added to the Lagrangian parcel values. A directionally biased mixing amongst neighboring Lagrangian parcels is introduced. The rate of mixing is proportional to the local deformation rate of the flow. The time stepping in Eulerian representation is achieved in two steps: first a mass-conserving Eulerian or semi-Lagrangian scheme is used to obtain a provisional forecast. This forecast is then nudged towards target values defined from the irregularly spaced Lagrangian parcel values. The nudging procedure is defined in such a way that mass conservation and shape preservation is ensured in Eulerian space. The HEL scheme has been designed to be accurate, multi-tracer efficient, mass conserving, and shape preserving. In Lagrangian space only physically based mixing takes place; i.e., the problem of artificial numerical mixing is avoided. This property is desirable in atmospheric chemical transport models since spurious numerical mixing can impact chemical concentrations severely. The properties of HEL are here verified in two-dimensional tests. These include deformational passive transport on the sphere, and simulations with a semi-implicit shallow water model including topography.

  11. Local Fractional Laplace Variational Iteration Method for Solving Linear Partial Differential Equations with Local Fractional Derivative

    Directory of Open Access Journals (Sweden)

    Ai-Min Yang

    2014-01-01

    Full Text Available The local fractional Laplace variational iteration method was applied to solve the linear local fractional partial differential equations. The local fractional Laplace variational iteration method is coupled by the local fractional variational iteration method and Laplace transform. The nondifferentiable approximate solutions are obtained and their graphs are also shown.

  12. Solving Nonlinear Fractional Differential Equation by Generalized Mittag-Leffler Function Method

    Science.gov (United States)

    Arafa, A. A. M.; Rida, S. Z.; Mohammadein, A. A.; Ali, H. M.

    2013-06-01

    In this paper, we use Mittag—Leffler function method for solving some nonlinear fractional differential equations. A new solution is constructed in power series. The fractional derivatives are described by Caputo's sense. To illustrate the reliability of the method, some examples are provided.

  13. Optimal Homotopy Asymptotic Method for Solving System of Fredholm Integral Equations

    Directory of Open Access Journals (Sweden)

    Bahman Ghazanfari

    2013-08-01

    Full Text Available In this paper, optimal homotopy asymptotic method (OHAM is applied to solve system of Fredholm integral equations. The effectiveness of optimal homotopy asymptotic method is presented. This method provides easy tools to control the convergence region of approximating solution series wherever necessary. The results of OHAM are compared with homotopy perturbation method (HPM and Taylor series expansion method (TSEM.

  14. He's homotopy perturbation method for solving systems of Volterra integral equations of the second kind

    International Nuclear Information System (INIS)

    Biazar, J.; Ghazvini, H.

    2009-01-01

    In this paper, the He's homotopy perturbation method is applied to solve systems of Volterra integral equations of the second kind. Some examples are presented to illustrate the ability of the method for linear and non-linear such systems. The results reveal that the method is very effective and simple.

  15. Who Solved the Bernoulli Differential Equation and How Did They Do It?

    Science.gov (United States)

    Parker, Adam E.

    2013-01-01

    The Bernoulli brothers, Jacob and Johann, and Leibniz: Any of these might have been first to solve what is called the Bernoulli differential equation. We explore their ideas and the chronology of their work, finding out, among other things, that variation of parameters was used in 1697, 78 years before 1775, when Lagrange introduced it in general.

  16. Formulae of differentiation for solving differential equations with complex-valued random coefficients

    International Nuclear Information System (INIS)

    Kim, Ki Hong; Lee, Dong Hun

    1999-01-01

    Generalizing the work of Shapiro and Loginov, we derive new formulae of differentiation useful for solving differential equations with complex-valued random coefficients. We apply the formulae to the quantum-mechanical problem of noninteracting electrons moving in a correlated random potential in one dimension

  17. SOLVING NONLINEAR KLEIN-GORDON EQUATION WITH A QUADRATIC NONLINEAR TERM USING HOMOTOPY ANALYSIS METHOD

    Directory of Open Access Journals (Sweden)

    H. Jafari

    2010-07-01

    Full Text Available In this paper, nonlinear Klein-Gordon equation with quadratic term is solved by means of an analytic technique, namely the Homotopy analysis method (HAM.Comparisons are made between the Adomian decomposition method (ADM, the exact solution and homotopy analysis method. The results reveal that the proposed method is very effective and simple.

  18. Construction of Interval Wavelet Based on Restricted Variational Principle and Its Application for Solving Differential Equations

    OpenAIRE

    Mei, Shu-Li; Lv, Hong-Liang; Ma, Qin

    2008-01-01

    Based on restricted variational principle, a novel method for interval wavelet construction is proposed. For the excellent local property of quasi-Shannon wavelet, its interval wavelet is constructed, and then applied to solve ordinary differential equations. Parameter choices for the interval wavelet method are discussed and its numerical performance is demonstrated.

  19. Modifying a numerical algorithm for solving the matrix equation X + AX T B = C

    Science.gov (United States)

    Vorontsov, Yu. O.

    2013-06-01

    Certain modifications are proposed for a numerical algorithm solving the matrix equation X + AX T B = C. By keeping the intermediate results in storage and repeatedly using them, it is possible to reduce the total complexity of the algorithm from O( n 4) to O( n 3) arithmetic operations.

  20. Solving Second-Order Ordinary Differential Equations without Using Complex Numbers

    Science.gov (United States)

    Kougias, Ioannis E.

    2009-01-01

    Ordinary differential equations (ODEs) is a subject with a wide range of applications and the need of introducing it to students often arises in the last year of high school, as well as in the early stages of tertiary education. The usual methods of solving second-order ODEs with constant coefficients, among others, rely upon the use of complex…

  1. Theory of Perturbed Equilibria for Solving the Grad-Shafranov Equation

    International Nuclear Information System (INIS)

    Pletzer, A.; Zakharov, L.E.

    1999-01-01

    The theory of perturbed magnetohydrodynamic equilibria is presented for different formulations of the tokamak equilibrium problem. For numerical codes, it gives an explicit Newton scheme for solving the Grad-Shafranov equation subject to different constraints. The problem of stability of axisymmetric modes is shown to be a particular case of the equilibrium perturbation theory

  2. Predicting Eight Grade Students' Equation Solving Performances via Concepts of Variable and Equality

    Science.gov (United States)

    Ertekin, Erhan

    2017-01-01

    This study focused on how two algebraic concepts- equality and variable- predicted 8th grade students' equation solving performance. In this study, predictive design as a correlational research design was used. Randomly selected 407 eight-grade students who were from the central districts of a city in the central region of Turkey participated in…

  3. Development of C++ Application Program for Solving Quadratic Equation in Elementary School in Nigeria

    Science.gov (United States)

    Bandele, Samuel Oye; Adekunle, Adeyemi Suraju

    2015-01-01

    The study was conducted to design, develop and test a c++ application program CAP-QUAD for solving quadratic equation in elementary school in Nigeria. The package was developed in c++ using object-oriented programming language, other computer program that were also utilized during the development process is DevC++ compiler, it was used for…

  4. An Equation-Type Approach for the Numerical Solution of the Partial Differential Equations Governing Transport Phenomena in Porous Media

    KAUST Repository

    Sun, Shuyu; Salama, Amgad; El-Amin, Mohamed

    2012-01-01

    A new technique for the numerical solution of the partial differential equations governing transport phenomena in porous media is introduced. In this technique, the governing equations as depicted from the physics of the problem are used without extra manipulations. In other words, there is no need to reduce the number of governing equations by some sort of mathematical manipulations. This technique enables the separation of the physics part of the problem and the solver part, which makes coding more robust and could be used in several other applications with little or no modifications (e.g., multi-phase flow in porous media). In this method, one abandons the need to construct the coefficient matrix for the pressure equation. Alternatively, the coefficients are automatically generated within the solver routine. We show examples of using this technique to solving several flow problems in porous media.

  5. An Equation-Type Approach for the Numerical Solution of the Partial Differential Equations Governing Transport Phenomena in Porous Media

    KAUST Repository

    Sun, Shuyu

    2012-06-02

    A new technique for the numerical solution of the partial differential equations governing transport phenomena in porous media is introduced. In this technique, the governing equations as depicted from the physics of the problem are used without extra manipulations. In other words, there is no need to reduce the number of governing equations by some sort of mathematical manipulations. This technique enables the separation of the physics part of the problem and the solver part, which makes coding more robust and could be used in several other applications with little or no modifications (e.g., multi-phase flow in porous media). In this method, one abandons the need to construct the coefficient matrix for the pressure equation. Alternatively, the coefficients are automatically generated within the solver routine. We show examples of using this technique to solving several flow problems in porous media.

  6. Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations

    Science.gov (United States)

    Mamat, M.; Dauda, M. K.; Mohamed, M. A. bin; Waziri, M. Y.; Mohamad, F. S.; Abdullah, H.

    2018-03-01

    Research from the work of engineers, economist, modelling, industry, computing, and scientist are mostly nonlinear equations in nature. Numerical solution to such systems is widely applied in those areas of mathematics. Over the years, there has been significant theoretical study to develop methods for solving such systems, despite these efforts, unfortunately the methods developed do have deficiency. In a contribution to solve systems of the form F(x) = 0, x ∈ Rn , a derivative free method via the classical Davidon-Fletcher-Powell (DFP) update is presented. This is achieved by simply approximating the inverse Hessian matrix with {Q}k+1-1 to θkI. The modified method satisfied the descent condition and possess local superlinear convergence properties. Interestingly, without computing any derivative, the proposed method never fail to converge throughout the numerical experiments. The output is based on number of iterations and CPU time, different initial starting points were used on a solve 40 benchmark test problems. With the aid of the squared norm merit function and derivative-free line search technique, the approach yield a method of solving symmetric systems of nonlinear equations that is capable of significantly reducing the CPU time and number of iteration, as compared to its counterparts. A comparison between the proposed method and classical DFP update were made and found that the proposed methodis the top performer and outperformed the existing method in almost all the cases. In terms of number of iterations, out of the 40 problems solved, the proposed method solved 38 successfully, (95%) while classical DFP solved 2 problems (i.e. 05%). In terms of CPU time, the proposed method solved 29 out of the 40 problems given, (i.e.72.5%) successfully whereas classical DFP solves 11 (27.5%). The method is valid in terms of derivation, reliable in terms of number of iterations and accurate in terms of CPU time. Thus, suitable and achived the objective.

  7. An efficient numerical technique for solving navier-stokes equations for rotating flows

    International Nuclear Information System (INIS)

    Haroon, T.; Shah, T.M.

    2000-01-01

    This paper simulates an industrial problem by solving compressible Navier-Stokes equations. The time-consuming tri-angularization process of a large-banded matrix, performed by memory economical Frontal Technique. This scheme successfully reduces the time for I/O operations even for as large as (40, 000 x 40, 000) matrix. Previously, this industrial problem can solved by using modified Newton's method with Gaussian elimination technique for the large matrix. In the present paper, the proposed Frontal Technique is successfully used, together with Newton's method, to solve compressible Navier-Stokes equations for rotating cylinders. By using the Frontal Technique, the method gives the solution within reasonably acceptance computational time. Results are compared with the earlier works done, and found computationally very efficient. Some features of the solution are reported here for the rotating machines. (author)

  8. An Efficient Numerical Approach for Solving Nonlinear Coupled Hyperbolic Partial Differential Equations with Nonlocal Conditions

    Directory of Open Access Journals (Sweden)

    A. H. Bhrawy

    2014-01-01

    Full Text Available One of the most important advantages of collocation method is the possibility of dealing with nonlinear partial differential equations (PDEs as well as PDEs with variable coefficients. A numerical solution based on a Jacobi collocation method is extended to solve nonlinear coupled hyperbolic PDEs with variable coefficients subject to initial-boundary nonlocal conservation conditions. This approach, based on Jacobi polynomials and Gauss-Lobatto quadrature integration, reduces solving the nonlinear coupled hyperbolic PDEs with variable coefficients to a system of nonlinear ordinary differential equation which is far easier to solve. In fact, we deal with initial-boundary coupled hyperbolic PDEs with variable coefficients as well as initial-nonlocal conditions. Using triangular, soliton, and exponential-triangular solutions as exact solutions, the obtained results show that the proposed numerical algorithm is efficient and very accurate.

  9. Fundaments of transport equation splitting and the eigenvalue problem

    International Nuclear Information System (INIS)

    Stancic, V.

    2000-01-01

    In order to remove some singularities concerning the boundary conditions of one dimensional transport equation, a split form of transport equation describing the forward i.e. μ≥0, and a backward μ<0 directed neutrons is being proposed here. The eigenvalue problem has also been considered here (author)

  10. Hot electrons in superlattices: quantum transport versus Boltzmann equation

    DEFF Research Database (Denmark)

    Wacker, Andreas; Jauho, Antti-Pekka; Rott, S.

    1999-01-01

    A self-consistent solution of the transport equation is presented for semiconductor superlattices within different approaches: (i) a full quantum transport model based on nonequilibrium Green functions, (ii) the semiclassical Boltzmann equation for electrons in a miniband, and (iii) Boltzmann...

  11. On some examples of pollutant transport problems solved numerically using the boundary element method

    Science.gov (United States)

    Azis, Moh. Ivan; Kasbawati; Haddade, Amiruddin; Astuti Thamrin, Sri

    2018-03-01

    A boundary element method (BEM) is obtained for solving a boundary value problem of homogeneous anisotropic media governed by diffusion-convection equation. The application of the BEM is shown for two particular pollutant transport problems of Tello river and Unhas lake in Makassar Indonesia. For the two particular problems a variety of the coefficients of diffusion and the velocity components are taken. The results show that the solutions vary as the parameters change. And this suggests that one has to be careful in measuring or determining the values of the parameters.

  12. New numerical approximation for solving fractional delay differential equations of variable order using artificial neural networks

    Science.gov (United States)

    Zúñiga-Aguilar, C. J.; Coronel-Escamilla, A.; Gómez-Aguilar, J. F.; Alvarado-Martínez, V. M.; Romero-Ugalde, H. M.

    2018-02-01

    In this paper, we approximate the solution of fractional differential equations with delay using a new approach based on artificial neural networks. We consider fractional differential equations of variable order with the Mittag-Leffler kernel in the Liouville-Caputo sense. With this new neural network approach, an approximate solution of the fractional delay differential equation is obtained. Synaptic weights are optimized using the Levenberg-Marquardt algorithm. The neural network effectiveness and applicability were validated by solving different types of fractional delay differential equations, linear systems with delay, nonlinear systems with delay and a system of differential equations, for instance, the Newton-Leipnik oscillator. The solution of the neural network was compared with the analytical solutions and the numerical simulations obtained through the Adams-Bashforth-Moulton method. To show the effectiveness of the proposed neural network, different performance indices were calculated.

  13. Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations

    KAUST Repository

    Southern, J.A.; Plank, G.; Vigmond, E.J.; Whiteley, J.P.

    2009-01-01

    The bidomain equations are frequently used to model the propagation of cardiac action potentials across cardiac tissue. At the whole organ level, the size of the computational mesh required makes their solution a significant computational challenge. As the accuracy of the numerical solution cannot be compromised, efficiency of the solution technique is important to ensure that the results of the simulation can be obtained in a reasonable time while still encapsulating the complexities of the system. In an attempt to increase efficiency of the solver, the bidomain equations are often decoupled into one parabolic equation that is computationally very cheap to solve and an elliptic equation that is much more expensive to solve. In this study, the performance of this uncoupled solution method is compared with an alternative strategy in which the bidomain equations are solved as a coupled system. This seems counterintuitive as the alternative method requires the solution of a much larger linear system at each time step. However, in tests on two 3-D rabbit ventricle benchmarks, it is shown that the coupled method is up to 80% faster than the conventional uncoupled method-and that parallel performance is better for the larger coupled problem.

  14. Solving the Coupled System Improves Computational Efficiency of the Bidomain Equations

    KAUST Repository

    Southern, J.A.

    2009-10-01

    The bidomain equations are frequently used to model the propagation of cardiac action potentials across cardiac tissue. At the whole organ level, the size of the computational mesh required makes their solution a significant computational challenge. As the accuracy of the numerical solution cannot be compromised, efficiency of the solution technique is important to ensure that the results of the simulation can be obtained in a reasonable time while still encapsulating the complexities of the system. In an attempt to increase efficiency of the solver, the bidomain equations are often decoupled into one parabolic equation that is computationally very cheap to solve and an elliptic equation that is much more expensive to solve. In this study, the performance of this uncoupled solution method is compared with an alternative strategy in which the bidomain equations are solved as a coupled system. This seems counterintuitive as the alternative method requires the solution of a much larger linear system at each time step. However, in tests on two 3-D rabbit ventricle benchmarks, it is shown that the coupled method is up to 80% faster than the conventional uncoupled method-and that parallel performance is better for the larger coupled problem.

  15. A New Approach and Solution Technique to Solve Time Fractional Nonlinear Reaction-Diffusion Equations

    Directory of Open Access Journals (Sweden)

    Inci Cilingir Sungu

    2015-01-01

    Full Text Available A new application of the hybrid generalized differential transform and finite difference method is proposed by solving time fractional nonlinear reaction-diffusion equations. This method is a combination of the multi-time-stepping temporal generalized differential transform and the spatial finite difference methods. The procedure first converts the time-evolutionary equations into Poisson equations which are then solved using the central difference method. The temporal differential transform method as used in the paper takes care of stability and the finite difference method on the resulting equation results in a system of diagonally dominant linear algebraic equations. The Gauss-Seidel iterative procedure then used to solve the linear system thus has assured convergence. To have optimized convergence rate, numerical experiments were done by using a combination of factors involving multi-time-stepping, spatial step size, and degree of the polynomial fit in time. It is shown that the hybrid technique is reliable, accurate, and easy to apply.

  16. Solving large sets of coupled equations iteratively by vector processing on the CYBER 205 computer

    International Nuclear Information System (INIS)

    Tolsma, L.D.

    1985-01-01

    The set of coupled linear second-order differential equations which has to be solved for the quantum-mechanical description of inelastic scattering of atomic and nuclear particles can be rewritten as an equivalent set of coupled integral equations. When some type of functions is used as piecewise analytic reference solutions, the integrals that arise in this set can be evaluated analytically. The set of integral equations can be solved iteratively. For the results mentioned an inward-outward iteration scheme has been applied. A concept of vectorization of coupled-channel Fortran programs, based on this integral method, is presented for the use on the Cyber 205 computer. It turns out that, for two heavy ion nuclear scattering test cases, this vector algorithm gives an overall speed-up of about a factor of 2 to 3 compared to a highly optimized scalar algorithm for a one vector pipeline computer

  17. A parallel algorithm for solving the integral form of the discrete ordinates equations

    International Nuclear Information System (INIS)

    Zerr, R. J.; Azmy, Y. Y.

    2009-01-01

    The integral form of the discrete ordinates equations involves a system of equations that has a large, dense coefficient matrix. The serial construction methodology is presented and properties that affect the execution times to construct and solve the system are evaluated. Two approaches for massively parallel implementation of the solution algorithm are proposed and the current results of one of these are presented. The system of equations May be solved using two parallel solvers-block Jacobi and conjugate gradient. Results indicate that both methods can reduce overall wall-clock time for execution. The conjugate gradient solver exhibits better performance to compete with the traditional source iteration technique in terms of execution time and scalability. The parallel conjugate gradient method is synchronous, hence it does not increase the number of iterations for convergence compared to serial execution, and the efficiency of the algorithm demonstrates an apparent asymptotic decline. (authors)

  18. Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

    International Nuclear Information System (INIS)

    Hernandez-Walls, R; Martín-Atienza, B; Salinas-Matus, M; Castillo, J

    2017-01-01

    When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations. (paper)

  19. Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

    Science.gov (United States)

    Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.

    2017-11-01

    When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.

  20. Parallel computing solution of Boltzmann neutron transport equation

    International Nuclear Information System (INIS)

    Ansah-Narh, T.

    2010-01-01

    The focus of the research was on developing parallel computing algorithm for solving Eigen-values of the Boltzmam Neutron Transport Equation (BNTE) in a slab geometry using multi-grid approach. In response to the problem of slow execution of serial computing when solving large problems, such as BNTE, the study was focused on the design of parallel computing systems which was an evolution of serial computing that used multiple processing elements simultaneously to solve complex physical and mathematical problems. Finite element method (FEM) was used for the spatial discretization scheme, while angular discretization was accomplished by expanding the angular dependence in terms of Legendre polynomials. The eigenvalues representing the multiplication factors in the BNTE were determined by the power method. MATLAB Compiler Version 4.1 (R2009a) was used to compile the MATLAB codes of BNTE. The implemented parallel algorithms were enabled with matlabpool, a Parallel Computing Toolbox function. The option UseParallel was set to 'always' and the default value of the option was 'never'. When those conditions held, the solvers computed estimated gradients in parallel. The parallel computing system was used to handle all the bottlenecks in the matrix generated from the finite element scheme and each domain of the power method generated. The parallel algorithm was implemented on a Symmetric Multi Processor (SMP) cluster machine, which had Intel 32 bit quad-core x 86 processors. Convergence rates and timings for the algorithm on the SMP cluster machine were obtained. Numerical experiments indicated the designed parallel algorithm could reach perfect speedup and had good stability and scalability. (au)

  1. Unified implicit kinetic scheme for steady multiscale heat transfer based on the phonon Boltzmann transport equation

    Science.gov (United States)

    Zhang, Chuang; Guo, Zhaoli; Chen, Songze

    2017-12-01

    An implicit kinetic scheme is proposed to solve the stationary phonon Boltzmann transport equation (BTE) for multiscale heat transfer problem. Compared to the conventional discrete ordinate method, the present method employs a macroscopic equation to accelerate the convergence in the diffusive regime. The macroscopic equation can be taken as a moment equation for phonon BTE. The heat flux in the macroscopic equation is evaluated from the nonequilibrium distribution function in the BTE, while the equilibrium state in BTE is determined by the macroscopic equation. These two processes exchange information from different scales, such that the method is applicable to the problems with a wide range of Knudsen numbers. Implicit discretization is implemented to solve both the macroscopic equation and the BTE. In addition, a memory reduction technique, which is originally developed for the stationary kinetic equation, is also extended to phonon BTE. Numerical comparisons show that the present scheme can predict reasonable results both in ballistic and diffusive regimes with high efficiency, while the memory requirement is on the same order as solving the Fourier law of heat conduction. The excellent agreement with benchmark and the rapid converging history prove that the proposed macro-micro coupling is a feasible solution to multiscale heat transfer problems.

  2. Solving ordinary differential equations by electrical analogy: a multidisciplinary teaching tool

    Science.gov (United States)

    Sanchez Perez, J. F.; Conesa, M.; Alhama, I.

    2016-11-01

    Ordinary differential equations are the mathematical formulation for a great variety of problems in science and engineering, and frequently, two different problems are equivalent from a mathematical point of view when they are formulated by the same equations. Students acquire the knowledge of how to solve these equations (at least some types of them) using protocols and strict algorithms of mathematical calculation without thinking about the meaning of the equation. The aim of this work is that students learn to design network models or circuits in this way; with simple knowledge of them, students can establish the association of electric circuits and differential equations and their equivalences, from a formal point of view, that allows them to associate knowledge of two disciplines and promote the use of this interdisciplinary approach to address complex problems. Therefore, they learn to use a multidisciplinary tool that allows them to solve these kinds of equations, even students of first course of engineering, whatever the order, grade or type of non-linearity. This methodology has been implemented in numerous final degree projects in engineering and science, e.g., chemical engineering, building engineering, industrial engineering, mechanical engineering, architecture, etc. Applications are presented to illustrate the subject of this manuscript.

  3. A Method for Solving the Voltage and Torque Equations of the Split-Phase Induction Machines

    Directory of Open Access Journals (Sweden)

    G. A. Olarinoye

    2013-06-01

    Full Text Available Single phase induction machines have been the subject of many researches in recent times. The voltage and torque equations which describe the dynamic characteristics of these machines have been quoted in many papers, including the papers that present the simulation results of these model equations. The way and manner in which these equations are solved is not common in literature. This paper presents a detailed procedure of how these equations are to be solved with respect to the splitphase induction machine which is one of the different types of the single phase induction machines available in the market. In addition, these equations have been used to simulate the start-up response of the split phase induction motor on no-load. The free acceleration characteristics of the motor voltages, currents and electromagnetic torque have been plotted and discussed. The simulation results presented include the instantaneous torque-speed characteristics of the Split phase Induction machine. A block diagram of the method for the solution of the machine equations has also been presented.

  4. Solution and Study of the Two-Dimensional Nodal Neutron Transport Equation

    International Nuclear Information System (INIS)

    Panta Pazos, Ruben; Biasotto Hauser, Eliete; Tullio de Vilhena, Marco

    2002-01-01

    In the last decade Vilhena and coworkers reported an analytical solution to the two-dimensional nodal discrete-ordinates approximations of the neutron transport equation in a convex domain. The key feature of these works was the application of the combined collocation method of the angular variable and nodal approach in the spatial variables. By nodal approach we mean the transverse integration of the SN equations. This procedure leads to a set of one-dimensional S N equations for the average angular fluxes in the variables x and y. These equations were solved by the old version of the LTS N method, which consists in the application of the Laplace transform to the set of nodal S N equations and solution of the resulting linear system by symbolic computation. It is important to recall that this procedure allow us to increase N the order of S N up to 16. To overcome this drawback we step forward performing a spectral painstaking analysis of the nodal S N equations for N up to 16 and we begin the convergence of the S N nodal equations defining an error for the angular flux and estimating the error in terms of the truncation error of the quadrature approximations of the integral term. Furthermore, we compare numerical results of this approach with those of other techniques used to solve the two-dimensional discrete approximations of the neutron transport equation. (authors)

  5. Hermite Functional Link Neural Network for Solving the Van der Pol-Duffing Oscillator Equation.

    Science.gov (United States)

    Mall, Susmita; Chakraverty, S

    2016-08-01

    Hermite polynomial-based functional link artificial neural network (FLANN) is proposed here to solve the Van der Pol-Duffing oscillator equation. A single-layer hermite neural network (HeNN) model is used, where a hidden layer is replaced by expansion block of input pattern using Hermite orthogonal polynomials. A feedforward neural network model with the unsupervised error backpropagation principle is used for modifying the network parameters and minimizing the computed error function. The Van der Pol-Duffing and Duffing oscillator equations may not be solved exactly. Here, approximate solutions of these types of equations have been obtained by applying the HeNN model for the first time. Three mathematical example problems and two real-life application problems of Van der Pol-Duffing oscillator equation, extracting the features of early mechanical failure signal and weak signal detection problems, are solved using the proposed HeNN method. HeNN approximate solutions have been compared with results obtained by the well known Runge-Kutta method. Computed results are depicted in term of graphs. After training the HeNN model, we may use it as a black box to get numerical results at any arbitrary point in the domain. Thus, the proposed HeNN method is efficient. The results reveal that this method is reliable and can be applied to other nonlinear problems too.

  6. Recent advances in marching-on-in-time schemes for solving time domain volume integral equations

    KAUST Repository

    Sayed, Sadeed Bin; Ulku, Huseyin Arda; Bagci, Hakan

    2015-01-01

    Transient electromagnetic field interactions on inhomogeneous penetrable scatterers can be analyzed by solving time domain volume integral equations (TDVIEs). TDVIEs are constructed by setting the summation of the incident and scattered field intensities to the total field intensity on the volumetric support of the scatterer. The unknown can be the field intensity or flux/current density. Representing the total field intensity in terms of the unknown using the relevant constitutive relation and the scattered field intensity in terms of the spatiotemporal convolution of the unknown with the Green function yield the final form of the TDVIE. The unknown is expanded in terms of local spatial and temporal basis functions. Inserting this expansion into the TDVIE and testing the resulting equation at discrete times yield a system of equations that is solved by the marching on-in-time (MOT) scheme. At each time step, a smaller system of equations, termed MOT system is solved for the coefficients of the expansion. The right-hand side of this system consists of the tested incident field and discretized spatio-temporal convolution of the unknown samples computed at the previous time steps with the Green function.

  7. An Accurate Approximate-Analytical Technique for Solving Time-Fractional Partial Differential Equations

    Directory of Open Access Journals (Sweden)

    M. Bishehniasar

    2017-01-01

    Full Text Available The demand of many scientific areas for the usage of fractional partial differential equations (FPDEs to explain their real-world systems has been broadly identified. The solutions may portray dynamical behaviors of various particles such as chemicals and cells. The desire of obtaining approximate solutions to treat these equations aims to overcome the mathematical complexity of modeling the relevant phenomena in nature. This research proposes a promising approximate-analytical scheme that is an accurate technique for solving a variety of noninteger partial differential equations (PDEs. The proposed strategy is based on approximating the derivative of fractional-order and reducing the problem to the corresponding partial differential equation (PDE. Afterwards, the approximating PDE is solved by using a separation-variables technique. The method can be simply applied to nonhomogeneous problems and is proficient to diminish the span of computational cost as well as achieving an approximate-analytical solution that is in excellent concurrence with the exact solution of the original problem. In addition and to demonstrate the efficiency of the method, it compares with two finite difference methods including a nonstandard finite difference (NSFD method and standard finite difference (SFD technique, which are popular in the literature for solving engineering problems.

  8. Recent advances in marching-on-in-time schemes for solving time domain volume integral equations

    KAUST Repository

    Sayed, Sadeed Bin

    2015-05-16

    Transient electromagnetic field interactions on inhomogeneous penetrable scatterers can be analyzed by solving time domain volume integral equations (TDVIEs). TDVIEs are constructed by setting the summation of the incident and scattered field intensities to the total field intensity on the volumetric support of the scatterer. The unknown can be the field intensity or flux/current density. Representing the total field intensity in terms of the unknown using the relevant constitutive relation and the scattered field intensity in terms of the spatiotemporal convolution of the unknown with the Green function yield the final form of the TDVIE. The unknown is expanded in terms of local spatial and temporal basis functions. Inserting this expansion into the TDVIE and testing the resulting equation at discrete times yield a system of equations that is solved by the marching on-in-time (MOT) scheme. At each time step, a smaller system of equations, termed MOT system is solved for the coefficients of the expansion. The right-hand side of this system consists of the tested incident field and discretized spatio-temporal convolution of the unknown samples computed at the previous time steps with the Green function.

  9. A fast semi-discrete Kansa method to solve the two-dimensional spatiotemporal fractional diffusion equation

    Science.gov (United States)

    Sun, HongGuang; Liu, Xiaoting; Zhang, Yong; Pang, Guofei; Garrard, Rhiannon

    2017-09-01

    Fractional-order diffusion equations (FDEs) extend classical diffusion equations by quantifying anomalous diffusion frequently observed in heterogeneous media. Real-world diffusion can be multi-dimensional, requiring efficient numerical solvers that can handle long-term memory embedded in mass transport. To address this challenge, a semi-discrete Kansa method is developed to approximate the two-dimensional spatiotemporal FDE, where the Kansa approach first discretizes the FDE, then the Gauss-Jacobi quadrature rule solves the corresponding matrix, and finally the Mittag-Leffler function provides an analytical solution for the resultant time-fractional ordinary differential equation. Numerical experiments are then conducted to check how the accuracy and convergence rate of the numerical solution are affected by the distribution mode and number of spatial discretization nodes. Applications further show that the numerical method can efficiently solve two-dimensional spatiotemporal FDE models with either a continuous or discrete mixing measure. Hence this study provides an efficient and fast computational method for modeling super-diffusive, sub-diffusive, and mixed diffusive processes in large, two-dimensional domains with irregular shapes.

  10. Effective quadrature formula in solving linear integro-differential equations of order two

    Science.gov (United States)

    Eshkuvatov, Z. K.; Kammuji, M.; Long, N. M. A. Nik; Yunus, Arif A. M.

    2017-08-01

    In this note, we solve general form of Fredholm-Volterra integro-differential equations (IDEs) of order 2 with boundary condition approximately and show that proposed method is effective and reliable. Initially, IDEs is reduced into integral equation of the third kind by using standard integration techniques and identity between multiple and single integrals then truncated Legendre series are used to estimate the unknown function. For the kernel integrals, we have applied Gauss-Legendre quadrature formula and collocation points are chosen as the roots of the Legendre polynomials. Finally, reduce the integral equations of the third kind into the system of algebraic equations and Gaussian elimination method is applied to get approximate solutions. Numerical examples and comparisons with other methods reveal that the proposed method is very effective and dominated others in many cases. General theory of existence of the solution is also discussed.

  11. Discontinuous Galerkin for the Radiative Transport Equation

    KAUST Repository

    Guermond, Jean-Luc; Kanschat, Guido; Ragusa, Jean C.

    2013-01-01

    This note presents some recent results regarding the approximation of the linear radiative transfer equation using discontinuous Galerkin methods. The locking effect occurring in the diffusion limit with the upwind numerical flux is investigated and a correction technique is proposed.

  12. Discontinuous Galerkin for the Radiative Transport Equation

    KAUST Repository

    Guermond, Jean-Luc

    2013-10-11

    This note presents some recent results regarding the approximation of the linear radiative transfer equation using discontinuous Galerkin methods. The locking effect occurring in the diffusion limit with the upwind numerical flux is investigated and a correction technique is proposed.

  13. Perceptual support promotes strategy generation: Evidence from equation solving.

    Science.gov (United States)

    Alibali, Martha W; Crooks, Noelle M; McNeil, Nicole M

    2017-08-30

    Over time, children shift from using less optimal strategies for solving mathematics problems to using better ones. But why do children generate new strategies? We argue that they do so when they begin to encode problems more accurately; therefore, we hypothesized that perceptual support for correct encoding would foster strategy generation. Fourth-grade students solved mathematical equivalence problems (e.g., 3 + 4 + 5 = 3 + __) in a pre-test. They were then randomly assigned to one of three perceptual support conditions or to a Control condition. Participants in all conditions completed three mathematical equivalence problems with feedback about correctness. Participants in the experimental conditions received perceptual support (i.e., highlighting in red ink) for accurately encoding the equal sign, the right side of the equation, or the numbers that could be added to obtain the correct solution. Following this intervention, participants completed a problem-solving post-test. Among participants who solved the problems incorrectly at pre-test, those who received perceptual support for correctly encoding the equal sign were more likely to generate new, correct strategies for solving the problems than were those who received feedback only. Thus, perceptual support for accurate encoding of a key problem feature promoted generation of new, correct strategies. Statement of Contribution What is already known on this subject? With age and experience, children shift to using more effective strategies for solving math problems. Problem encoding also improves with age and experience. What the present study adds? Support for encoding the equal sign led children to generate correct strategies for solving equations. Improvements in problem encoding are one source of new strategies. © 2017 The British Psychological Society.

  14. Advances in the solution of three-dimensional nodal neutron transport equation

    International Nuclear Information System (INIS)

    Pazos, Ruben Panta; Hauser, Eliete Biasotto; Vilhena, Marco Tullio de

    2003-01-01

    In this paper we study the three-dimensional nodal discrete-ordinates approximations of neutron transport equation in a convex domain with piecewise smooth boundaries. We use the combined collocation method of the angular variables and nodal approach for the spatial variables. By nodal approach we mean the iterated transverse integration of the S N equations. This procedure leads to the set of one-dimensional averages angular fluxes in each spatial variable. The resulting system of equations is solved with the LTS N method, first applying the Laplace transform to the set of the nodal S N equations and then obtaining the solution by symbolic computation. We include the LTS N method by diagonalization to solve the nodal neutron transport equation and then we outline the convergence of these nodal-LTS N approximations with the help of a norm associated to the quadrature formula used to approximate the integral term of the neutron transport equation. We give numerical results obtained with an algebraic computer system (for N up to 8) and with a code for higher values of N. We compare our results for the geometry of a box with a source in a vertex and a leakage zone in the opposite with others techniques used in this problem. (author)

  15. A Compact Numerical Implementation for Solving Stokes Equations Using Matrix-vector Operations

    KAUST Repository

    Zhang, Tao; Salama, Amgad; Sun, Shuyu; Zhong, Hua

    2015-01-01

    In this work, a numerical scheme is implemented to solve Stokes equations based on cell-centered finite difference over staggered grid. In this scheme, all the difference operations have been vectorized thereby eliminating loops. This is particularly important when using programming languages that require interpretations, e.g., MATLAB and Python. Using this scheme, the execution time becomes significantly smaller compared with non-vectorized operations and also become comparable with those languages that require no repeated interpretations like FORTRAN, C, etc. This technique has also been applied to Navier-Stokes equations under laminar flow conditions.

  16. A Compact Numerical Implementation for Solving Stokes Equations Using Matrix-vector Operations

    KAUST Repository

    Zhang, Tao

    2015-06-01

    In this work, a numerical scheme is implemented to solve Stokes equations based on cell-centered finite difference over staggered grid. In this scheme, all the difference operations have been vectorized thereby eliminating loops. This is particularly important when using programming languages that require interpretations, e.g., MATLAB and Python. Using this scheme, the execution time becomes significantly smaller compared with non-vectorized operations and also become comparable with those languages that require no repeated interpretations like FORTRAN, C, etc. This technique has also been applied to Navier-Stokes equations under laminar flow conditions.

  17. GPELab, a Matlab toolbox to solve Gross-Pitaevskii equations II: Dynamics and stochastic simulations

    Science.gov (United States)

    Antoine, Xavier; Duboscq, Romain

    2015-08-01

    GPELab is a free Matlab toolbox for modeling and numerically solving large classes of systems of Gross-Pitaevskii equations that arise in the physics of Bose-Einstein condensates. The aim of this second paper, which follows (Antoine and Duboscq, 2014), is to first present the various pseudospectral schemes available in GPELab for computing the deterministic and stochastic nonlinear dynamics of Gross-Pitaevskii equations (Antoine, et al., 2013). Next, the corresponding GPELab functions are explained in detail. Finally, some numerical examples are provided to show how the code works for the complex dynamics of BEC problems.

  18. A boundary value approach for solving three-dimensional elliptic and hyperbolic partial differential equations.

    Science.gov (United States)

    Biala, T A; Jator, S N

    2015-01-01

    In this article, the boundary value method is applied to solve three dimensional elliptic and hyperbolic partial differential equations. The partial derivatives with respect to two of the spatial variables (y, z) are discretized using finite difference approximations to obtain a large system of ordinary differential equations (ODEs) in the third spatial variable (x). Using interpolation and collocation techniques, a continuous scheme is developed and used to obtain discrete methods which are applied via the Block unification approach to obtain approximations to the resulting large system of ODEs. Several test problems are investigated to elucidate the solution process.

  19. The Use of Generalized Laguerre Polynomials in Spectral Methods for Solving Fractional Delay Differential Equations.

    Science.gov (United States)

    Khader, M M

    2013-10-01

    In this paper, an efficient numerical method for solving the fractional delay differential equations (FDDEs) is considered. The fractional derivative is described in the Caputo sense. The proposed method is based on the derived approximate formula of the Laguerre polynomials. The properties of Laguerre polynomials are utilized to reduce FDDEs to a linear or nonlinear system of algebraic equations. Special attention is given to study the error and the convergence analysis of the proposed method. Several numerical examples are provided to confirm that the proposed method is in excellent agreement with the exact solution.

  20. An Adaptive Observer-Based Algorithm for Solving Inverse Source Problem for the Wave Equation

    KAUST Repository

    Asiri, Sharefa M.; Zayane, Chadia; Laleg-Kirati, Taous-Meriem

    2015-01-01

    Observers are well known in control theory. Originally designed to estimate the hidden states of dynamical systems given some measurements, the observers scope has been recently extended to the estimation of some unknowns, for systems governed by partial differential equations. In this paper, observers are used to solve inverse source problem for a one-dimensional wave equation. An adaptive observer is designed to estimate the state and source components for a fully discretized system. The effectiveness of the algorithm is emphasized in noise-free and noisy cases and an insight on the impact of measurements’ size and location is provided.

  1. An Adaptive Observer-Based Algorithm for Solving Inverse Source Problem for the Wave Equation

    KAUST Repository

    Asiri, Sharefa M.

    2015-08-31

    Observers are well known in control theory. Originally designed to estimate the hidden states of dynamical systems given some measurements, the observers scope has been recently extended to the estimation of some unknowns, for systems governed by partial differential equations. In this paper, observers are used to solve inverse source problem for a one-dimensional wave equation. An adaptive observer is designed to estimate the state and source components for a fully discretized system. The effectiveness of the algorithm is emphasized in noise-free and noisy cases and an insight on the impact of measurements’ size and location is provided.

  2. MPFA algorithm for solving stokes-brinkman equations on quadrilateral grids

    KAUST Repository

    Iliev, Oleg

    2014-01-01

    This work is concerned with the development of a robust and accurate numerical method for solving the Stokes-Brinkman system of equations, which describes a free fluid flow coupled with a flow in porous media. Quadrilateral boundary fitted grid with a sophisticated finite volume method, namely MPFA O-method, is used to discretize the system of equations. Numerical results for two examples are presented, namely, channel flow and flow in a ring with a rolled porous medium. © Springer International Publishing Switzerland 2014.

  3. Performance of a parallel algorithm for solving the neutron diffusion equation on the hypercube

    International Nuclear Information System (INIS)

    Kirk, B.L.; Azmy, Y.Y.

    1989-01-01

    The one-group, steady state neutron diffusion equation in two- dimensional Cartesian geometry is solved using the nodal method technique. By decoupling sets of equations representing the neutron current continuity along the length of rows and columns of computational cells a new iterative algorithm is derived that is more suitable to solving large practical problems. This algorithm is highly parallelizable and is implemented on the Intel iPSC/2 hypercube in three versions which differ essentially in the total size of communicated data. Even though speedup was achieved, the efficiency is very low when many processors are used leading to the conclusion that the hypercube is not as well suited for this algorithm as shared memory machines. 10 refs., 1 fig., 3 tabs

  4. Space-time spectral collocation algorithm for solving time-fractional Tricomi-type equations

    Directory of Open Access Journals (Sweden)

    Abdelkawy M.A.

    2016-01-01

    Full Text Available We introduce a new numerical algorithm for solving one-dimensional time-fractional Tricomi-type equations (T-FTTEs. We used the shifted Jacobi polynomials as basis functions and the derivatives of fractional is evaluated by the Caputo definition. The shifted Jacobi Gauss-Lobatt algorithm is used for the spatial discretization, while the shifted Jacobi Gauss-Radau algorithmis applied for temporal approximation. Substituting these approximations in the problem leads to a system of algebraic equations that greatly simplifies the problem. The proposed algorithm is successfully extended to solve the two-dimensional T-FTTEs. Extensive numerical tests illustrate the capability and high accuracy of the proposed methodologies.

  5. Method for the Direct Solve of the Many-Body Schrödinger Wave Equation

    Science.gov (United States)

    Jerke, Jonathan; Tymczak, C. J.; Poirier, Bill

    We report on theoretical and computational developments towards a computationally efficient direct solve of the many-body Schrödinger wave equation for electronic systems. This methodology relies on two recent developments pioneered by the authors: 1) the development of a Cardinal Sine basis for electronic structure calculations; and 2) the development of a highly efficient and compact representation of multidimensional functions using the Canonical tensor rank representation developed by Belykin et. al. which we have adapted to electronic structure problems. We then show several relevant examples of the utility and accuracy of this methodology, scaling with system size, and relevant convergence issues of the methodology. Method for the Direct Solve of the Many-Body Schrödinger Wave Equation.

  6. The spectral transform as a tool for solving nonlinear discrete evolution equations

    International Nuclear Information System (INIS)

    Levi, D.

    1979-01-01

    In this contribution we study nonlinear differential difference equations which became important to the description of an increasing number of problems in natural science. Difference equations arise for instance in the study of electrical networks, in statistical problems, in queueing problems, in ecological problems, as computer models for differential equations and as models for wave excitation in plasma or vibrations of particles in an anharmonic lattice. We shall first review the passages necessary to solve linear discrete evolution equations by the discrete Fourier transfrom, then, starting from the Zakharov-Shabat discretized eigenvalue, problem, we shall introduce the spectral transform. In the following part we obtain the correlation between the evolution of the potentials and scattering data through the Wronskian technique, giving at the same time many other properties as, for example, the Baecklund transformations. Finally we recover some of the important equations belonging to this class of nonlinear discrete evolution equations and extend the method to equations with n-dependent coefficients. (HJ)

  7. Improving Teaching Quality and Problem Solving Ability through Contextual Teaching and Learning in Differential Equations: A Lesson Study Approach

    Science.gov (United States)

    Khotimah, Rita Pramujiyanti; Masduki

    2016-01-01

    Differential equations is a branch of mathematics which is closely related to mathematical modeling that arises in real-world problems. Problem solving ability is an essential component to solve contextual problem of differential equations properly. The purposes of this study are to describe contextual teaching and learning (CTL) model in…

  8. Factors Affecting Differential Equation Problem Solving Ability of Students at Pre-University Level: A Conceptual Model

    Science.gov (United States)

    Aisha, Bibi; Zamri, Sharifa NorulAkmar Syed; Abdallah, Nabeel; Abedalaziz, Mohammad; Ahmad, Mushtaq; Satti, Umbreen

    2017-01-01

    In this study, different factors affecting students' differential equations (DEs) solving abilities were explored at pre university level. To explore main factors affecting students' differential equations problem solving ability, articles for a 19-year period, from 1996 to 2015, were critically reviewed and analyzed. It was revealed that…

  9. The Adomian decomposition method for solving partial differential equations of fractal order in finite domains

    Energy Technology Data Exchange (ETDEWEB)

    El-Sayed, A.M.A. [Faculty of Science University of Alexandria (Egypt)]. E-mail: amasyed@hotmail.com; Gaber, M. [Faculty of Education Al-Arish, Suez Canal University (Egypt)]. E-mail: mghf408@hotmail.com

    2006-11-20

    The Adomian decomposition method has been successively used to find the explicit and numerical solutions of the time fractional partial differential equations. A different examples of special interest with fractional time and space derivatives of order {alpha}, 0<{alpha}=<1 are considered and solved by means of Adomian decomposition method. The behaviour of Adomian solutions and the effects of different values of {alpha} are shown graphically for some examples.

  10. T-Stability of the Heun Method and Balanced Method for Solving Stochastic Differential Delay Equations

    Directory of Open Access Journals (Sweden)

    Xiaolin Zhu

    2014-01-01

    Full Text Available This paper studies the T-stability of the Heun method and balanced method for solving stochastic differential delay equations (SDDEs. Two T-stable conditions of the Heun method are obtained for two kinds of linear SDDEs. Moreover, two conditions under which the balanced method is T-stable are obtained for two kinds of linear SDDEs. Some numerical examples verify the theoretical results proposed.

  11. A semi-analytical approach for solving of nonlinear systems of functional differential equations with delay

    Science.gov (United States)

    Rebenda, Josef; Šmarda, Zdeněk

    2017-07-01

    In the paper, we propose a correct and efficient semi-analytical approach to solve initial value problem for systems of functional differential equations with delay. The idea is to combine the method of steps and differential transformation method (DTM). In the latter, formulas for proportional arguments and nonlinear terms are used. An example of using this technique for a system with constant and proportional delays is presented.

  12. Fibonacci collocation method with a residual error Function to solve linear Volterra integro differential equations

    Directory of Open Access Journals (Sweden)

    Salih Yalcinbas

    2016-01-01

    Full Text Available In this paper, a new collocation method based on the Fibonacci polynomials is introduced to solve the high-order linear Volterra integro-differential equations under the conditions. Numerical examples are included to demonstrate the applicability and validity of the proposed method and comparisons are made with the existing results. In addition, an error estimation based on the residual functions is presented for this method. The approximate solutions are improved by using this error estimation.

  13. On Newton-Kantorovich Method for Solving the Nonlinear Operator Equation

    Directory of Open Access Journals (Sweden)

    Hameed Husam Hameed

    2015-01-01

    Full Text Available We develop the Newton-Kantorovich method to solve the system of 2×2 nonlinear Volterra integral equations where the unknown function is in logarithmic form. A new majorant function is introduced which leads to the increment of the convergence interval. The existence and uniqueness of approximate solution are proved and a numerical example is provided to show the validation of the method.

  14. Finite element method for solving Kohn-Sham equations based on self-adaptive tetrahedral mesh

    International Nuclear Information System (INIS)

    Zhang Dier; Shen Lihua; Zhou Aihui; Gong Xingao

    2008-01-01

    A finite element (FE) method with self-adaptive mesh-refinement technique is developed for solving the density functional Kohn-Sham equations. The FE method adopts local piecewise polynomials basis functions, which produces sparsely structured matrices of Hamiltonian. The method is well suitable for parallel implementation without using Fourier transform. In addition, the self-adaptive mesh-refinement technique can control the computational accuracy and efficiency with optimal mesh density in different regions

  15. Comparison of numerical approaches to solve a Poincare-covariant Faddeev equation

    International Nuclear Information System (INIS)

    Alkofer, R.; Eichmann, G.; Krassnigg, A.; Schwinzerl, M.

    2006-01-01

    Full text: The quark core of Baryons can be described with the help of the numerical solution of the Poincare-Faddeev equation. Hereby the used elements, as e.g. the quark propagator are taken from non-perturbative studies of Landau gauge QCD. Different numerical approaches to solve in this way the relativistic three quark problem are compared and benchmarked results for the efficiency of different algorithms are presented. (author)

  16. A Generalized FDM for solving the Poisson's Equation on 3D Irregular Domains

    Directory of Open Access Journals (Sweden)

    J. Izadian

    2014-01-01

    Full Text Available In this paper a new method for solving the Poisson's equation with Dirichlet conditions on irregular domains is presented. For this purpose a generalized finite differences method is applied for numerical differentiation on irregular meshes. Three examples on cylindrical and spherical domains are considered. The numerical results are compared with analytical solution. These results show the performance and efficiency of the proposed method.

  17. Modified two-fluid model for the two-group interfacial area transport equation

    International Nuclear Information System (INIS)

    Sun Xiaodong; Ishii, Mamoru; Kelly, Joseph M.

    2003-01-01

    This paper presents a modified two-fluid model that is ready to be applied in the approach of the two-group interfacial area transport equation. The two-group interfacial area transport equation was developed to provide a mechanistic constitutive relation for the interfacial area concentration in the two-fluid model. In the two-group transport equation, bubbles are categorized into two groups: spherical/distorted bubbles as Group 1 while cap/slug/churn-turbulent bubbles as Group 2. Therefore, this transport equation can be employed in the flow regimes spanning from bubbly, cap bubbly, slug to churn-turbulent flows. However, the introduction of the two groups of bubbles requires two gas velocity fields. Yet it is not practical to solve two momentum equations for the gas phase alone. In the current modified two-fluid model, a simplified approach is proposed. The momentum equation for the averaged velocity of both Group-1 and Group-2 bubbles is retained. By doing so, the velocity difference between Group-1 and Group-2 bubbles needs to be determined. This may be made either based on simplified momentum equations for both Group-1 and Group-2 bubbles or by a modified drift-flux model

  18. Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

    International Nuclear Information System (INIS)

    Gene Golub; Kwok Ko

    2009-01-01

    The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

  19. Highly efficient parallel direct solver for solving dense complex matrix equations from method of moments

    Directory of Open Access Journals (Sweden)

    Yan Chen

    2017-03-01

    Full Text Available Based on the vectorised and cache optimised kernel, a parallel lower upper decomposition with a novel communication avoiding pivoting scheme is developed to solve dense complex matrix equations generated by the method of moments. The fine-grain data rearrangement and assembler instructions are adopted to reduce memory accessing times and improve CPU cache utilisation, which also facilitate vectorisation of the code. Through grouping processes in a binary tree, a parallel pivoting scheme is designed to optimise the communication pattern and thus reduces the solving time of the proposed solver. Two large electromagnetic radiation problems are solved on two supercomputers, respectively, and the numerical results demonstrate that the proposed method outperforms those in open source and commercial libraries.

  20. Dynamic modeling of interfacial structures via interfacial area transport equation

    International Nuclear Information System (INIS)

    Seungjin, Kim; Mamoru, Ishii

    2005-01-01

    The interfacial area transport equation dynamically models the two-phase flow regime transitions and predicts continuous change of the interfacial area concentration along the flow field. Hence, when employed in the numerical thermal-hydraulic system analysis codes, it eliminates artificial bifurcations stemming from the use of the static flow regime transition criteria. Accounting for the substantial differences in the transport phenomena of various sizes of bubbles, the two-group interfacial area transport equations have been developed. The group 1 equation describes the transport of small-dispersed bubbles that are either distorted or spherical in shapes, and the group 2 equation describes the transport of large cap, slug or churn-turbulent bubbles. The source and sink terms in the right-hand-side of the transport equations have been established by mechanistically modeling the creation and destruction of bubbles due to major bubble interaction mechanisms. In the present paper, the interfacial area transport equations currently available are reviewed to address the feasibility and reliability of the model along with extensive experimental results. These include the data from adiabatic upward air-water two-phase flow in round tubes of various sizes, from a rectangular duct, and from adiabatic co-current downward air-water two-phase flow in round pipes of two sizes. (authors)

  1. Transport equations, Level Set and Eulerian mechanics. Application to fluid-structure coupling

    International Nuclear Information System (INIS)

    Maitre, E.

    2008-11-01

    My works were devoted to numerical analysis of non-linear elliptic-parabolic equations, to neutron transport equation and to the simulation of fabrics draping. More recently I developed an Eulerian method based on a level set formulation of the immersed boundary method to deal with fluid-structure coupling problems arising in bio-mechanics. Some of the more efficient algorithms to solve the neutron transport equation make use of the splitting of the transport operator taking into account its characteristics. In the present work we introduced a new algorithm based on this splitting and an adaptation of minimal residual methods to infinite dimensional case. We present the case where the velocity space is of dimension 1 (slab geometry) and 2 (plane geometry) because the splitting is simpler in the former

  2. Comparison of preconditioned generalized conjugate gradient methods to two-dimensional neutron and photon transport equation

    International Nuclear Information System (INIS)

    Chen, G.S.

    1997-01-01

    We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used. TFQMR (transpose free quasi-minimal residual algorithm), CGS (conjuage gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These sub-routines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. (author)

  3. Relativistic transport equation for a discontinuity wave of multiplicity one

    Energy Technology Data Exchange (ETDEWEB)

    Giambo, S; Palumbo, A [Istituto di Matematica, Universita degli Studi, Messina (Italy)

    1980-04-14

    In the framework of the theory of the singular hypersurfaces, the transport equation for the amplitude of a discontinuity wave, corresponding to a simple characteristic of a quasi-linear hyperbolic system, is established in the context of special relativity.

  4. Analytical solution to the hybrid diffusion-transport equation

    International Nuclear Information System (INIS)

    Nanneh, M.M.; Williams, M.M.R.

    1986-01-01

    A special integral equation was derived in previous work using a hybrid diffusion-transport theory method for calculating the flux distribution in slab lattices. In this paper an analytical solution of this equation has been carried out on a finite reactor lattice. The analytical results of disadvantage factors are shown to be accurate in comparison with the numerical results and accurate transport theory calculations. (author)

  5. Solving the Fluid Pressure Poisson Equation Using Multigrid-Evaluation and Improvements.

    Science.gov (United States)

    Dick, Christian; Rogowsky, Marcus; Westermann, Rudiger

    2016-11-01

    In many numerical simulations of fluids governed by the incompressible Navier-Stokes equations, the pressure Poisson equation needs to be solved to enforce mass conservation. Multigrid solvers show excellent convergence in simple scenarios, yet they can converge slowly in domains where physically separated regions are combined at coarser scales. Moreover, existing multigrid solvers are tailored to specific discretizations of the pressure Poisson equation, and they cannot easily be adapted to other discretizations. In this paper we analyze the convergence properties of existing multigrid solvers for the pressure Poisson equation in different simulation domains, and we show how to further improve the multigrid convergence rate by using a graph-based extension to determine the coarse grid hierarchy. The proposed multigrid solver is generic in that it can be applied to different kinds of discretizations of the pressure Poisson equation, by using solely the specification of the simulation domain and pre-assembled computational stencils. We analyze the proposed solver in combination with finite difference and finite volume discretizations of the pressure Poisson equation. Our evaluations show that, despite the common assumption, multigrid schemes can exploit their potential even in the most complicated simulation scenarios, yet this behavior is obtained at the price of higher memory consumption.

  6. Solving the neutron diffusion equation on combinatorial geometry computational cells for reactor physics calculations

    International Nuclear Information System (INIS)

    Azmy, Y. Y.

    2004-01-01

    An approach is developed for solving the neutron diffusion equation on combinatorial geometry computational cells, that is computational cells composed by combinatorial operations involving simple-shaped component cells. The only constraint on the component cells from which the combinatorial cells are assembled is that they possess a legitimate discretization of the underlying diffusion equation. We use the Finite Difference (FD) approximation of the x, y-geometry diffusion equation in this work. Performing the same combinatorial operations involved in composing the combinatorial cell on these discrete-variable equations yields equations that employ new discrete variables defined only on the combinatorial cell's volume and faces. The only approximation involved in this process, beyond the truncation error committed in discretizing the diffusion equation over each component cell, is a consistent-order Legendre series expansion. Preliminary results for simple configurations establish the accuracy of the solution to the combinatorial geometry solution compared to straight FD as the system dimensions decrease. Furthermore numerical results validate the consistent Legendre-series expansion order by illustrating the second order accuracy of the combinatorial geometry solution, the same as standard FD. Nevertheless the magnitude of the error for the new approach is larger than FD's since it incorporates the additional truncated series approximation. (authors)

  7. Application of the finite element method to the neutron transport equation

    International Nuclear Information System (INIS)

    Martin, W.R.

    1976-01-01

    This paper examines the theoretical and practical application of the finite element method to the neutron transport equation. It is shown that in principle the system of equations obtained by application of the finite element method can be solved with certain physical restrictions concerning the criticality of the medium. The convergence of this approximate solution to the exact solution with mesh refinement is examined, and a non-optical estimate of the convergence rate is obtained analytically. It is noted that the numerical results indicate a faster convergence rate and several approaches to obtain this result analytically are outlined. The practical application of the finite element method involved the development of a computer code capable of solving the neutron transport equation in 1-D plane geometry. Vacuum, reflecting, or specified incoming boundary conditions may be analyzed, and all are treated as natural boundary conditions. The time-dependent transport equation is also examined and it is shown that the application of the finite element method in conjunction with the Crank-Nicholson time discretization method results in a system of algebraic equations which is readily solved. Numerical results are given for several critical slab eigenvalue problems, including anisotropic scattering, and the results compare extremely well with benchmark results. It is seen that the finite element code is more efficient than a standard discrete ordinates code for certain problems. A problem with severe heterogeneities is considered and it is shown that the use of discontinuous spatial and angular elements results in a marked improvement in the results. Finally, time-dependent problems are examined and it is seen that the phenomenon of angular mode separation makes the numerical treatment of the transport equation in slab geometry a considerable challenge, with the result that the angular mesh has a dominant effect on obtaining acceptable solutions

  8. The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem.

    Science.gov (United States)

    Narayanamoorthy, S; Kalyani, S

    2015-01-01

    An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

  9. The Intelligence of Dual Simplex Method to Solve Linear Fractional Fuzzy Transportation Problem

    Directory of Open Access Journals (Sweden)

    S. Narayanamoorthy

    2015-01-01

    Full Text Available An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

  10. Solving the Vlasov equation in two spatial dimensions with the Schrödinger method

    Science.gov (United States)

    Kopp, Michael; Vattis, Kyriakos; Skordis, Constantinos

    2017-12-01

    We demonstrate that the Vlasov equation describing collisionless self-gravitating matter may be solved with the so-called Schrödinger method (ScM). With the ScM, one solves the Schrödinger-Poisson system of equations for a complex wave function in d dimensions, rather than the Vlasov equation for a 2 d -dimensional phase space density. The ScM also allows calculating the d -dimensional cumulants directly through quasilocal manipulations of the wave function, avoiding the complexity of 2 d -dimensional phase space. We perform for the first time a quantitative comparison of the ScM and a conventional Vlasov solver in d =2 dimensions. Our numerical tests were carried out using two types of cold cosmological initial conditions: the classic collapse of a sine wave and those of a Gaussian random field as commonly used in cosmological cold dark matter N-body simulations. We compare the first three cumulants, that is, the density, velocity and velocity dispersion, to those obtained by solving the Vlasov equation using the publicly available code ColDICE. We find excellent qualitative and quantitative agreement between these codes, demonstrating the feasibility and advantages of the ScM as an alternative to N-body simulations. We discuss, the emergence of effective vorticity in the ScM through the winding number around the points where the wave function vanishes. As an application we evaluate the background pressure induced by the non-linearity of large scale structure formation, thereby estimating the magnitude of cosmological backreaction. We find that it is negligibly small and has time dependence and magnitude compatible with expectations from the effective field theory of large scale structure.

  11. A toolbox to solve coupled systems of differential and difference equations

    International Nuclear Information System (INIS)

    Ablinger, Jakob; Schneider, Carsten; Bluemlein, Johannes; Freitas, Abilio de

    2016-01-01

    We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do not request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter ε (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t. ε and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package SolveCoupledSystem which is based on the packages Sigma, HarmonicSums and OreSys. In all applications the representation in x-space is obtained as an iterated integral representation over general alphabets, generalizing Poincare iterated integrals.

  12. A toolbox to solve coupled systems of differential and difference equations

    Energy Technology Data Exchange (ETDEWEB)

    Ablinger, Jakob; Schneider, Carsten [Linz Univ. (Austria). Research Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Freitas, Abilio de [DESY Zeuthen (Germany)

    2016-01-15

    We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do not request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter ε (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t. ε and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package SolveCoupledSystem which is based on the packages Sigma, HarmonicSums and OreSys. In all applications the representation in x-space is obtained as an iterated integral representation over general alphabets, generalizing Poincare iterated integrals.

  13. Numerical solution of the time dependent neutron transport equation by the method of the characteristics

    International Nuclear Information System (INIS)

    Talamo, Alberto

    2013-01-01

    This study presents three numerical algorithms to solve the time dependent neutron transport equation by the method of the characteristics. The algorithms have been developed taking into account delayed neutrons and they have been implemented into the novel MCART code, which solves the neutron transport equation for two-dimensional geometry and an arbitrary number of energy groups. The MCART code uses regular mesh for the representation of the spatial domain, it models up-scattering, and takes advantage of OPENMP and OPENGL algorithms for parallel computing and plotting, respectively. The code has been benchmarked with the multiplication factor results of a Boiling Water Reactor, with the analytical results for a prompt jump transient in an infinite medium, and with PARTISN and TDTORT results for cross section and source transients. The numerical simulations have shown that only two numerical algorithms are stable for small time steps

  14. Numerical solution of the time dependent neutron transport equation by the method of the characteristics

    Energy Technology Data Exchange (ETDEWEB)

    Talamo, Alberto, E-mail: alby@anl.gov [Nuclear Engineering Division, Argonne National Laboratory, 9700 South Cass Avenue, Lemont, IL 60439 (United States)

    2013-05-01

    This study presents three numerical algorithms to solve the time dependent neutron transport equation by the method of the characteristics. The algorithms have been developed taking into account delayed neutrons and they have been implemented into the novel MCART code, which solves the neutron transport equation for two-dimensional geometry and an arbitrary number of energy groups. The MCART code uses regular mesh for the representation of the spatial domain, it models up-scattering, and takes advantage of OPENMP and OPENGL algorithms for parallel computing and plotting, respectively. The code has been benchmarked with the multiplication factor results of a Boiling Water Reactor, with the analytical results for a prompt jump transient in an infinite medium, and with PARTISN and TDTORT results for cross section and source transients. The numerical simulations have shown that only two numerical algorithms are stable for small time steps.

  15. Different seeds to solve the equations of stochastic point kinetics using the Euler-Maruyama method

    International Nuclear Information System (INIS)

    Suescun D, D.; Oviedo T, M.

    2017-09-01

    In this paper, a numerical study of stochastic differential equations that describe the kinetics in a nuclear reactor is presented. These equations, known as the stochastic equations of punctual kinetics they model temporal variations in neutron population density and concentrations of deferred neutron precursors. Because these equations are probabilistic in nature (since random oscillations in the neutrons and population of precursors were considered to be approximately normally distributed, and these equations also possess strong coupling and stiffness properties) the proposed method for the numerical simulations is the Euler-Maruyama scheme that provides very good approximations for calculating the neutron population and concentrations of deferred neutron precursors. The method proposed for this work was computationally tested for different seeds, initial conditions, experimental data and forms of reactivity for a group of precursors and then for six groups of deferred neutron precursors at each time step with 5000 Brownian movements per seed. In a paper reported in the literature, the Euler-Maruyama method was proposed, but there are many doubts about the reported values, in addition to not reporting the seed used, so in this work is expected to rectify the reported values. After taking the average of the different seeds used to generate the pseudo-random numbers the results provided by the Euler-Maruyama scheme will be compared in mean and standard deviation with other methods reported in the literature and results of the deterministic model of the equations of the punctual kinetics. This comparison confirms in particular that the Euler-Maruyama scheme is an efficient method to solve the equations of stochastic point kinetics but different from the values found and reported by another author. The Euler-Maruyama method is simple and easy to implement, provides acceptable results for neutron population density and concentration of deferred neutron precursors and

  16. Integral transform method for solving neutron transport problems with general anisotropic scattering in a cylinder of finite height

    International Nuclear Information System (INIS)

    Kumar, V.; Sahni, D.C.

    1983-01-01

    In this paper, the authors present the mathematical techniques that were developed for solving the integral transport equation for the criticality of a homogeneous cylinder of finite height with general anisotropic scattering. They present the integral transport equations for the Fourier transformed spherical harmonic moments of the angular flux. These moments are also represented by a series of products of spherical Bessel functions. The criticality problem is, then, posed by the matrix eigenvalue problem whose eigenvector is composed of the expansion coefficients mentioned above. An methodology of calculating the general matrix element is discussed by using the recursion relations derived in this paper. Finally, for the one-group criticality of finite cylinders, the benchmark results are generated when scattering is linearly anisotropic. Also, these benchmarks are solved and compared with the S/sub N/ method of TWOTRAN

  17. A scalar flux - oriented method for the transport equation in slab geometry

    International Nuclear Information System (INIS)

    Budd, C.

    1981-01-01

    A new method for solving the neutron transport equation is described. An unusual feature of this method is that it deals principally with scalar fluxes rather than angular fluxes. An alternative approach in slab geometry promises to be cheaper to run and does not suffer from many of the problems of the discrete ordinates method. It also appears possible to extend the method to several dimensions and this is discussed. (U.K.)

  18. A parallel version of a multigrid algorithm for isotropic transport equations

    International Nuclear Information System (INIS)

    Manteuffel, T.; McCormick, S.; Yang, G.; Morel, J.; Oliveira, S.

    1994-01-01

    The focus of this paper is on a parallel algorithm for solving the transport equations in a slab geometry using multigrid. The spatial discretization scheme used is a finite element method called the modified linear discontinuous (MLD) scheme. The MLD scheme represents a lumped version of the standard linear discontinuous (LD) scheme. The parallel algorithm was implemented on the Connection Machine 2 (CM2). Convergence rates and timings for this algorithm on the CM2 and Cray-YMP are shown

  19. Performance prediction of gas turbines by solving a system of non-linear equations

    Energy Technology Data Exchange (ETDEWEB)

    Kaikko, J

    1998-09-01

    This study presents a novel method for implementing the performance prediction of gas turbines from the component models. It is based on solving the non-linear set of equations that corresponds to the process equations, and the mass and energy balances for the engine. General models have been presented for determining the steady state operation of single components. Single and multiple shad arrangements have been examined with consideration also being given to heat regeneration and intercooling. Emphasis has been placed upon axial gas turbines of an industrial scale. Applying the models requires no information of the structural dimensions of the gas turbines. On comparison with the commonly applied component matching procedures, this method incorporates several advantages. The application of the models for providing results is facilitated as less attention needs to be paid to calculation sequences and routines. Solving the set of equations is based on zeroing co-ordinate functions that are directly derived from the modelling equations. Therefore, controlling the accuracy of the results is easy. This method gives more freedom for the selection of the modelling parameters since, unlike for the matching procedures, exchanging these criteria does not itself affect the algorithms. Implicit relationships between the variables are of no significance, thus increasing the freedom for the modelling equations as well. The mathematical models developed in this thesis will provide facilities to optimise the operation of any major gas turbine configuration with respect to the desired process parameters. The computational methods used in this study may also be adapted to any other modelling problems arising in industry. (orig.) 36 refs.

  20. Solving the Einstein constraint equations on multi-block triangulations using finite element methods

    Energy Technology Data Exchange (ETDEWEB)

    Korobkin, Oleg; Pazos, Enrique [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, LA 70803 (United States); Aksoylu, Burak [Center for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803 (United States); Holst, Michael [Department of Mathematics, University of California at San Diego 9500 Gilman Drive La Jolla, CA 92093-0112 (United States); Tiglio, Manuel [Department of Physics, University of Maryland, College Park, MD 20742 (United States)

    2009-07-21

    In order to generate initial data for nonlinear relativistic simulations, one needs to solve the Einstein constraints, which can be cast into a coupled set of nonlinear elliptic equations. Here we present an approach for solving these equations on three-dimensional multi-block domains using finite element methods. We illustrate our approach on a simple example of Brill wave initial data, with the constraints reducing to a single linear elliptic equation for the conformal factor psi. We use quadratic Lagrange elements on semi-structured simplicial meshes, obtained by triangulation of multi-block grids. In the case of uniform refinement the scheme is superconvergent at most mesh vertices, due to local symmetry of the finite element basis with respect to local spatial inversions. We show that in the superconvergent case subsequent unstructured mesh refinements do not improve the quality of our initial data. As proof of concept that this approach is feasible for generating multi-block initial data in three dimensions, after constructing the initial data we evolve them in time using a high-order finite-differencing multi-block approach and extract the gravitational waves from the numerical solution.

  1. Solving the Einstein constraint equations on multi-block triangulations using finite element methods

    International Nuclear Information System (INIS)

    Korobkin, Oleg; Pazos, Enrique; Aksoylu, Burak; Holst, Michael; Tiglio, Manuel

    2009-01-01

    In order to generate initial data for nonlinear relativistic simulations, one needs to solve the Einstein constraints, which can be cast into a coupled set of nonlinear elliptic equations. Here we present an approach for solving these equations on three-dimensional multi-block domains using finite element methods. We illustrate our approach on a simple example of Brill wave initial data, with the constraints reducing to a single linear elliptic equation for the conformal factor ψ. We use quadratic Lagrange elements on semi-structured simplicial meshes, obtained by triangulation of multi-block grids. In the case of uniform refinement the scheme is superconvergent at most mesh vertices, due to local symmetry of the finite element basis with respect to local spatial inversions. We show that in the superconvergent case subsequent unstructured mesh refinements do not improve the quality of our initial data. As proof of concept that this approach is feasible for generating multi-block initial data in three dimensions, after constructing the initial data we evolve them in time using a high-order finite-differencing multi-block approach and extract the gravitational waves from the numerical solution.

  2. An iterative algorithm for solving the multidimensional neutron diffusion nodal method equations on parallel computers

    International Nuclear Information System (INIS)

    Kirk, B.L.; Azmy, Y.Y.

    1992-01-01

    In this paper the one-group, steady-state neutron diffusion equation in two-dimensional Cartesian geometry is solved using the nodal integral method. The discrete variable equations comprise loosely coupled sets of equations representing the nodal balance of neutrons, as well as neutron current continuity along rows or columns of computational cells. An iterative algorithm that is more suitable for solving large problems concurrently is derived based on the decomposition of the spatial domain and is accelerated using successive overrelaxation. This algorithm is very well suited for parallel computers, especially since the spatial domain decomposition occurs naturally, so that the number of iterations required for convergence does not depend on the number of processors participating in the calculation. Implementation of the authors' algorithm on the Intel iPSC/2 hypercube and Sequent Balance 8000 parallel computer is presented, and measured speedup and efficiency for test problems are reported. The results suggest that the efficiency of the hypercube quickly deteriorates when many processors are used, while the Sequent Balance retains very high efficiency for a comparable number of participating processors. This leads to the conjecture that message-passing parallel computers are not as well suited for this algorithm as shared-memory machines

  3. Time-Dependent Heat Conduction Problems Solved by an Integral-Equation Approach

    International Nuclear Information System (INIS)

    Oberaigner, E.R.; Leindl, M.; Antretter, T.

    2010-01-01

    Full text: A classical task of mathematical physics is the formulation and solution of a time dependent thermoelastic problem. In this work we develop an algorithm for solving the time-dependent heat conduction equation c p ρ∂ t T-kT, ii =0 in an analytical, exact fashion for a two-component domain. By the Green's function approach the formal solution of the problem is obtained. As an intermediate result an integral-equation for the temperature history at the domain interface is formulated which can be solved analytically. This method is applied to a classical engineering problem, i.e. to a special case of a Stefan-Problem. The Green's function approach in conjunction with the integral-equation method is very useful in cases were strong discontinuities or jumps occur. The initial conditions and the system parameters of the investigated problem give rise to two jumps in the temperature field. Purely numerical solutions are obtained by using the FEM (finite element method) and the FDM (finite difference method) and compared with the analytical approach. At the domain boundary the analytical solution and the FEM-solution are in good agreement, but the FDM results show a signicant smearing effect. (author)

  4. Solving Coupled Gross--Pitaevskii Equations on a Cluster of PlayStation 3 Computers

    Science.gov (United States)

    Edwards, Mark; Heward, Jeffrey; Clark, C. W.

    2009-05-01

    At Georgia Southern University we have constructed an 8+1--node cluster of Sony PlayStation 3 (PS3) computers with the intention of using this computing resource to solve problems related to the behavior of ultra--cold atoms in general with a particular emphasis on studying bose--bose and bose--fermi mixtures confined in optical lattices. As a first project that uses this computing resource, we have implemented a parallel solver of the coupled time--dependent, one--dimensional Gross--Pitaevskii (TDGP) equations. These equations govern the behavior of dual-- species bosonic mixtures. We chose the split--operator/FFT to solve the coupled 1D TDGP equations. The fast Fourier transform component of this solver can be readily parallelized on the PS3 cpu known as the Cell Broadband Engine (CellBE). Each CellBE chip contains a single 64--bit PowerPC Processor Element known as the PPE and eight ``Synergistic Processor Element'' identified as the SPE's. We report on this algorithm and compare its performance to a non--parallel solver as applied to modeling evaporative cooling in dual--species bosonic mixtures.

  5. Application of Central Upwind Scheme for Solving Special Relativistic Hydrodynamic Equations

    Science.gov (United States)

    Yousaf, Muhammad; Ghaffar, Tayabia; Qamar, Shamsul

    2015-01-01

    The accurate modeling of various features in high energy astrophysical scenarios requires the solution of the Einstein equations together with those of special relativistic hydrodynamics (SRHD). Such models are more complicated than the non-relativistic ones due to the nonlinear relations between the conserved and state variables. A high-resolution shock-capturing central upwind scheme is implemented to solve the given set of equations. The proposed technique uses the precise information of local propagation speeds to avoid the excessive numerical diffusion. The second order accuracy of the scheme is obtained with the use of MUSCL-type initial reconstruction and Runge-Kutta time stepping method. After a discussion of the equations solved and of the techniques employed, a series of one and two-dimensional test problems are carried out. To validate the method and assess its accuracy, the staggered central and the kinetic flux-vector splitting schemes are also applied to the same model. The scheme is robust and efficient. Its results are comparable to those obtained from the sophisticated algorithms, even in the case of highly relativistic two-dimensional test problems. PMID:26070067

  6. Dynamic modeling of interfacial structures via interfacial area transport equation

    International Nuclear Information System (INIS)

    Seungjin, Kim; Mamoru, Ishii

    2004-01-01

    Full text of publication follows:In the current thermal-hydraulic system analysis codes using the two-fluid model, the empirical correlations that are based on the two-phase flow regimes and regime transition criteria are being employed as closure relations for the interfacial transfer terms. Due to its inherent shortcomings, however, such static correlations are inaccurate and present serious problems in the numerical analysis. In view of this, a new dynamic approach employing the interfacial area transport equation has been studied. The interfacial area transport equation dynamically models the two-phase flow regime transitions and predicts continuous change of the interfacial area concentration along the flow field. Hence, when employed in the thermal-hydraulic system analysis codes, it eliminates artificial bifurcations stemming from the use of the static flow regime transition criteria. Therefore, the interfacial area transport equation can make a leapfrog improvement in the current capability of the two-fluid model from both scientific and practical point of view. Accounting for the substantial differences in the transport phenomena of various sizes of bubbles, the two-group interfacial area transport equations have been developed. The group 1 equation describes the transport of small-dispersed bubbles that are either distorted or spherical in shapes, and the group 2 equation describes the transport of large cap, slug or churn-turbulent bubbles. The source and sink terms in the right hand-side of the transport equations have been established by mechanistically modeling the creation and destruction of bubbles due to major bubble interaction mechanisms. The coalescence mechanisms include the random collision driven by turbulence, and the entrainment of trailing bubbles in the wake region of the preceding bubble. The disintegration mechanisms include the break-up by turbulence impact, shearing-off at the rim of large cap bubbles and the break-up of large cap

  7. Some results on the neutron transport and the coupling of equations; Quelques resultats sur le transport neutronique et le couplage d`equations

    Energy Technology Data Exchange (ETDEWEB)

    Bal, G. [Electricite de France (EDF), Direction des Etudes et Recherches, 92 - Clamart (France)

    1997-12-31

    Neutron transport in nuclear reactors is well modeled by the linear Boltzmann transport equation. Its resolution is relatively easy but very expensive. To achieve whole core calculations, one has to consider simpler models, such as diffusion or homogeneous transport equations. However, the solutions may become inaccurate in particular situations (as accidents for instance). That is the reason why we wish to solve the equations on small area accurately and more coarsely on the remaining part of the core. It is than necessary to introduce some links between different discretizations or modelizations. In this note, we give some results on the coupling of different discretizations of all degrees of freedom of the integral-differential neutron transport equation (two degrees for the angular variable, on for the energy component, and two or three degrees for spatial position respectively in 2D (cylindrical symmetry) and 3D). Two chapters are devoted to the coupling of discrete ordinates methods (for angular discretization). The first one is theoretical and shows the well posing of the coupled problem, whereas the second one deals with numerical applications of practical interest (the results have been obtained from the neutron transport code developed at the R and D, which has been modified for introducing the coupling). Next, we present the nodal scheme RTN0, used for the spatial discretization. We show well posing results for the non-coupled and the coupled problems. At the end, we deal with the coupling of energy discretizations for the multigroup equations obtained by homogenization. Some theoretical results of the discretization of the velocity variable (well-posing of problems), which do not deal directly with the purposes of coupling, are presented in the annexes. (author). 34 refs.

  8. Improved Quasi-Newton method via PSB update for solving systems of nonlinear equations

    Science.gov (United States)

    Mamat, Mustafa; Dauda, M. K.; Waziri, M. Y.; Ahmad, Fadhilah; Mohamad, Fatma Susilawati

    2016-10-01

    The Newton method has some shortcomings which includes computation of the Jacobian matrix which may be difficult or even impossible to compute and solving the Newton system in every iteration. Also, the common setback with some quasi-Newton methods is that they need to compute and store an n × n matrix at each iteration, this is computationally costly for large scale problems. To overcome such drawbacks, an improved Method for solving systems of nonlinear equations via PSB (Powell-Symmetric-Broyden) update is proposed. In the proposed method, the approximate Jacobian inverse Hk of PSB is updated and its efficiency has improved thereby require low memory storage, hence the main aim of this paper. The preliminary numerical results show that the proposed method is practically efficient when applied on some benchmark problems.

  9. Analyses of glass transition phenomena by solving differential equation with delay effect

    International Nuclear Information System (INIS)

    Takeuchi, A.; Inoue, A.

    2007-01-01

    A linear differential equation for the analyses of glass transition phenomena has been proposed by taking into account the delay effect due to the change in transportation of atoms near the glass transition temperature (T g ). Under the condition maintaining the order of the differential equation as the second, the non-linear differential equation proposed by Van Den Beukel and Sietsma is modified to obtain the analytic solution for a linear equation by introducing the following points: the delay effect which is described with a term of Mackey-Glass model, a concept of effective free volume (x fe eff ) and its concentration expression (C fe eff ) which correspond to the equilibrium, and an additional term associated with C fe eff . In analyzing the linear equation, Doyle's p-function was used for the integral of reaction rate with respect to temperature (T). It is found that the linear equation proposed in the present study can describe the changes in free volume (x) with increasing temperature in the dx/dT-T chart, the sharp increase in free volume at T g , and over shooting phenomena of free volume slightly above the T g , as experimentally in thermal analyses for metallic glasses. The linear solution obtained in the present study is of great importance for the analyses of the glass transition because the change in free volume with increasing temperature on heating is described with fundamental functions

  10. Resolution of the steady state transport equation for Lagrangian geometry with cylindrical symmetry

    International Nuclear Information System (INIS)

    Samba, G.

    1983-05-01

    The purpose of this work is to solve the steady state transport equation for (r, z) geometries given by hydrodynamics calculations. The discontinuous finite element method for the space variables (r, z) provides a stable scheme which satisfies the particle balance equation. We are able to sweep cells for each direction over the mesh to have an explicit scheme. The graph theory provides a very efficient algorithm to compute this ordering array. Previously, we must divide all the quadrilaterals into two triangles to get only convex cells. Thus, we get a fast, vectorized calculation which gives a good accuracy on very distorted meshes [fr

  11. EDEF: a program for solving the neutron diffusion equation using microcomputers

    International Nuclear Information System (INIS)

    Fernandes, A.; Maiorino, J.R.

    1990-01-01

    This work presents the development of a program to solve the two-group two-dimensional diffusion equation (with a buckling option to simulate axial leakage) applying the finite element method. It has been developed to microcomputers compatibles to the IBM-PC. Among the facilities of the program, we can mention the simplicity to represent two-dimensional complex domains, the input through a pre-processor and the output in which the fluxes are presented graphically. The program also calculates the multiplication factor, the peaking factor and the power distribution. (author) [pt

  12. Numerical methods to solve the two-dimensional heat conduction equation

    International Nuclear Information System (INIS)

    Santos, R.S. dos.

    1981-09-01

    A class of numerical methods, called 'Hopscotch Algorithms', was used to solve the heat conduction equation in cylindrical geometry. Using a time dependent heat source, the temperature versus time behaviour of cylindric rod was analysed. Numerical simulation was used to study the stability and the convergence of each different method. Another test had the temperature specified on the outer surface as boundary condition. The various Hopscotch methods analysed exhibit differing degrees of accuracy, few of them being so accurate as the ADE method, but requiring more computational operations than the later, were observed. Finally, compared with the so called ODD-EVEN method, two other Hopscotch methods, are more time consuming. (Author) [pt

  13. An introduction to the history of algebra solving equations from Mesopotamian times to the Renaissance

    CERN Document Server

    Sesiano, Jacques

    2009-01-01

    This text should not be viewed as a comprehensive history of algebra before 1600, but as a basic introduction to the types of problems that illustrate the earliest forms of algebra. It would be particularly useful for an instructor who is looking for examples to help enliven a course on elementary algebra with problems drawn from actual historical texts. -Warren Van Egmond about the French edition for MathSciNet This book does not aim to give an exhaustive survey of the history of algebra up to early modern times but merely to present some significant steps in solving equations and, wherever

  14. A theory of solving TAP equations for Ising models with general invariant random matrices

    DEFF Research Database (Denmark)

    Opper, Manfred; Çakmak, Burak; Winther, Ole

    2016-01-01

    We consider the problem of solving TAP mean field equations by iteration for Ising models with coupling matrices that are drawn at random from general invariant ensembles. We develop an analysis of iterative algorithms using a dynamical functional approach that in the thermodynamic limit yields...... the iteration dependent on a Gaussian distributed field only. The TAP magnetizations are stable fixed points if a de Almeida–Thouless stability criterion is fulfilled. We illustrate our method explicitly for coupling matrices drawn from the random orthogonal ensemble....

  15. Numerical method for solving the three-dimensional time-dependent neutron diffusion equation

    International Nuclear Information System (INIS)

    Khaled, S.M.; Szatmary, Z.

    2005-01-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)

  16. Development and adjustment of programs for solving systems of linear equations

    International Nuclear Information System (INIS)

    Fujimura, Toichiro

    1978-03-01

    Programs for solving the systems of linear equations have been adjusted and developed in expanding the scientific subroutine library SSL. The principal programs adjusted are based on the congruent method, method of product form of the inverse, orthogonal method, Crout's method for sparse system, and acceleration of iterative methods. The programs developed are based on the escalator method, direct parallel residue method and block tridiagonal method for band system. Described are usage of the programs developed and their future improvement. FORTRAN lists with simple examples in tests of the programs are also given. (auth.)

  17. A numerical technique for solving fractional optimal control problems and fractional Riccati differential equations

    Directory of Open Access Journals (Sweden)

    F. Ghomanjani

    2016-10-01

    Full Text Available In the present paper, we apply the Bezier curves method for solving fractional optimal control problems (OCPs and fractional Riccati differential equations. The main advantage of this method is that it can reduce the error of the approximate solutions. Hence, the solutions obtained using the Bezier curve method give good approximations. Some numerical examples are provided to confirm the accuracy of the proposed method. All of the numerical computations have been performed on a PC using several programs written in MAPLE 13.

  18. Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations

    Directory of Open Access Journals (Sweden)

    Huiping Cao

    2014-01-01

    Full Text Available Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method. In particular, Schubert’s method has been proved to be locally and q-superlinearly convergent. In this paper, we globalize Schubert’s method by using a nonmonotone line search. Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly. Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.

  19. Modeling digital pulse waveforms by solving one-dimensional Navier-stokes equations.

    Science.gov (United States)

    Fedotov, Aleksandr A; Akulova, Anna S; Akulov, Sergey A

    2016-08-01

    Mathematical modeling for composition distal arterial pulse wave in the blood vessels of the upper limbs was considered. Formation of distal arterial pulse wave is represented as a composition of forward and reflected pulse waves propagating along the arterial vessels. The formal analogy between pulse waves propagation along the human arterial system and the propagation of electrical oscillations in electrical transmission lines with distributed parameters was proposed. Dependencies of pulse wave propagation along the human arterial system were obtained by solving the one-dimensional Navier-Stokes equations for a few special cases.

  20. Solving the Telegraph and Oscillatory Differential Equations by a Block Hybrid Trigonometrically Fitted Algorithm

    Directory of Open Access Journals (Sweden)

    F. F. Ngwane

    2015-01-01

    Full Text Available We propose a block hybrid trigonometrically fitted (BHT method, whose coefficients are functions of the frequency and the step-size for directly solving general second-order initial value problems (IVPs, including systems arising from the semidiscretization of hyperbolic Partial Differential Equations (PDEs, such as the Telegraph equation. The BHT is formulated from eight discrete hybrid formulas which are provided by a continuous two-step hybrid trigonometrically fitted method with two off-grid points. The BHT is implemented in a block-by-block fashion; in this way, the method does not suffer from the disadvantages of requiring starting values and predictors which are inherent in predictor-corrector methods. The stability property of the BHT is discussed and the performance of the method is demonstrated on some numerical examples to show accuracy and efficiency advantages.

  1. Recent symbolic summation methods to solve coupled systems of differential and difference equations

    International Nuclear Information System (INIS)

    Schneider, Carsten; Bluemlein, Johannes; Freitas, Abilio de

    2014-07-01

    We outline a new algorithm to solve coupled systems of differential equations in one continuous variable x (resp. coupled difference equations in one discrete variable N) depending on a small parameter ε: given such a system and given sufficiently many initial values, we can determine the first coefficients of the Laurent-series solutions in ε if they are expressible in terms of indefinite nested sums and products. This systematic approach is based on symbolic summation algorithms in the context of difference rings/fields and uncoupling algorithms. The proposed method gives rise to new interesting applications in connection with integration by parts (IBP) methods. As an illustrative example, we will demonstrate how one can calculate the ε-expansion of a ladder graph with 6 massive fermion lines.

  2. An optimal iterative algorithm to solve Cauchy problem for Laplace equation

    KAUST Repository

    Majeed, Muhammad Usman

    2015-05-25

    An optimal mean square error minimizer algorithm is developed to solve severely ill-posed Cauchy problem for Laplace equation on an annulus domain. The mathematical problem is presented as a first order state space-like system and an optimal iterative algorithm is developed that minimizes the mean square error in states. Finite difference discretization schemes are used to discretize first order system. After numerical discretization algorithm equations are derived taking inspiration from Kalman filter however using one of the space variables as a time-like variable. Given Dirichlet and Neumann boundary conditions are used on the Cauchy data boundary and fictitious points are introduced on the unknown solution boundary. The algorithm is run for a number of iterations using the solution of previous iteration as a guess for the next one. The method developed happens to be highly robust to noise in Cauchy data and numerically efficient results are illustrated.

  3. Solving differential equations with unknown constitutive relations as recurrent neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Hagge, Tobias J.; Stinis, Panagiotis; Yeung, Enoch H.; Tartakovsky, Alexandre M.

    2017-12-08

    We solve a system of ordinary differential equations with an unknown functional form of a sink (reaction rate) term. We assume that the measurements (time series) of state variables are partially available, and use a recurrent neural network to “learn” the reaction rate from this data. This is achieved by including discretized ordinary differential equations as part of a recurrent neural network training problem. We extend TensorFlow’s recurrent neural network architecture to create a simple but scalable and effective solver for the unknown functions, and apply it to a fedbatch bioreactor simulation problem. Use of techniques from recent deep learning literature enables training of functions with behavior manifesting over thousands of time steps. Our networks are structurally similar to recurrent neural networks, but differ in purpose, and require modified training strategies.

  4. Solving the master equation without kinetic Monte Carlo: Tensor train approximations for a CO oxidation model

    International Nuclear Information System (INIS)

    Gelß, Patrick; Matera, Sebastian; Schütte, Christof

    2016-01-01

    In multiscale modeling of heterogeneous catalytic processes, one crucial point is the solution of a Markovian master equation describing the stochastic reaction kinetics. Usually, this is too high-dimensional to be solved with standard numerical techniques and one has to rely on sampling approaches based on the kinetic Monte Carlo method. In this study we break the curse of dimensionality for the direct solution of the Markovian master equation by exploiting the Tensor Train Format for this purpose. The performance of the approach is demonstrated on a first principles based, reduced model for the CO oxidation on the RuO 2 (110) surface. We investigate the complexity for increasing system size and for various reaction conditions. The advantage over the stochastic simulation approach is illustrated by a problem with increased stiffness.

  5. Solving differential equations for Feynman integrals by expansions near singular points

    Science.gov (United States)

    Lee, Roman N.; Smirnov, Alexander V.; Smirnov, Vladimir A.

    2018-03-01

    We describe a strategy to solve differential equations for Feynman integrals by powers series expansions near singular points and to obtain high precision results for the corresponding master integrals. We consider Feynman integrals with two scales, i.e. non-trivially depending on one variable. The corresponding algorithm is oriented at situations where canonical form of the differential equations is impossible. We provide a computer code constructed with the help of our algorithm for a simple example of four-loop generalized sunset integrals with three equal non-zero masses and two zero masses. Our code gives values of the master integrals at any given point on the real axis with a required accuracy and a given order of expansion in the regularization parameter ɛ.

  6. Results of numerically solving an integral equation for a two-fermion system

    International Nuclear Information System (INIS)

    Skachkov, N.B.; Solov'eva, T.M.

    2003-01-01

    A two-particle system is described by integral equations whose kernels are dependent on the total energy of the system. Such equations can be reduced to an eigenvalue problem featuring an eigenvalue-dependent operator. This nonlinear eigenvalue problem is solved by means of an iterative procedure developed by the present authors. The energy spectra of a two-fermion system formed by particles of identical masses are obtained for two cases, that where the total spin of the system is equal to zero and that where the total spin of the system is equal to unity. The splitting of the ground-state levels of positronium and dimuonium, the frequency of the transition from the ground state of orthopositronium to its first excited state, and the probabilities of parapositronium and paradimuonium decays are computed. The results obtained in this way are found to be in good agreement with experimental data

  7. Newton's method for solving a quadratic matrix equation with special coefficient matrices

    International Nuclear Information System (INIS)

    Seo, Sang-Hyup; Seo, Jong Hyun; Kim, Hyun-Min

    2014-01-01

    We consider the iterative method for solving a quadratic matrix equation with special coefficient matrices which arises in the quasi-birth-death problem. In this paper, we show that the elementwise minimal positive solvents to quadratic matrix equations can be obtained using Newton's method. We also prove that the convergence rate of the Newton iteration is quadratic if the Fréchet derivative at the elementwise minimal positive solvent is nonsingular. However, if the Fréchet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.(This is summarized a paper which is to appear in Honam Mathematical Journal.)

  8. Solving the master equation without kinetic Monte Carlo: Tensor train approximations for a CO oxidation model

    Science.gov (United States)

    Gelß, Patrick; Matera, Sebastian; Schütte, Christof

    2016-06-01

    In multiscale modeling of heterogeneous catalytic processes, one crucial point is the solution of a Markovian master equation describing the stochastic reaction kinetics. Usually, this is too high-dimensional to be solved with standard numerical techniques and one has to rely on sampling approaches based on the kinetic Monte Carlo method. In this study we break the curse of dimensionality for the direct solution of the Markovian master equation by exploiting the Tensor Train Format for this purpose. The performance of the approach is demonstrated on a first principles based, reduced model for the CO oxidation on the RuO2(110) surface. We investigate the complexity for increasing system size and for various reaction conditions. The advantage over the stochastic simulation approach is illustrated by a problem with increased stiffness.

  9. Solving the master equation without kinetic Monte Carlo: Tensor train approximations for a CO oxidation model

    Energy Technology Data Exchange (ETDEWEB)

    Gelß, Patrick, E-mail: p.gelss@fu-berlin.de; Matera, Sebastian, E-mail: matera@math.fu-berlin.de; Schütte, Christof, E-mail: schuette@mi.fu-berlin.de

    2016-06-01

    In multiscale modeling of heterogeneous catalytic processes, one crucial point is the solution of a Markovian master equation describing the stochastic reaction kinetics. Usually, this is too high-dimensional to be solved with standard numerical techniques and one has to rely on sampling approaches based on the kinetic Monte Carlo method. In this study we break the curse of dimensionality for the direct solution of the Markovian master equation by exploiting the Tensor Train Format for this purpose. The performance of the approach is demonstrated on a first principles based, reduced model for the CO oxidation on the RuO{sub 2}(110) surface. We investigate the complexity for increasing system size and for various reaction conditions. The advantage over the stochastic simulation approach is illustrated by a problem with increased stiffness.

  10. Recent symbolic summation methods to solve coupled systems of differential and difference equations

    Energy Technology Data Exchange (ETDEWEB)

    Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Freitas, Abilio de [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)

    2014-07-15

    We outline a new algorithm to solve coupled systems of differential equations in one continuous variable x (resp. coupled difference equations in one discrete variable N) depending on a small parameter ε: given such a system and given sufficiently many initial values, we can determine the first coefficients of the Laurent-series solutions in ε if they are expressible in terms of indefinite nested sums and products. This systematic approach is based on symbolic summation algorithms in the context of difference rings/fields and uncoupling algorithms. The proposed method gives rise to new interesting applications in connection with integration by parts (IBP) methods. As an illustrative example, we will demonstrate how one can calculate the ε-expansion of a ladder graph with 6 massive fermion lines.

  11. A numerical solution of the coupled proton-H atom transport equations for the proton aurora

    International Nuclear Information System (INIS)

    Basu, B.; Jasperse, J.R.; Grossbard, N.J.

    1990-01-01

    A numerical code has been developed to solve the coupled proton-H atom linear transport equations for the proton aurora. The transport equations have been simplified by using plane-parallel geometry and the forward-scattering approximations only. Otherwise, the equations and their numerical solutions are exact. Results are presented for the particle fluxes and the energy deposition rates, and they are compared with the previous analytical results that were obtained by using additional simplifying approximations. It is found that although the analytical solutions for the particle fluxes differ somewhat from the numerical solutions, the energy deposition rates calculated by the two methods agree to within a few percent. The accurate particle fluxes given by the numerical code are useful for accurate calculation of the characteristic quantities of the proton aurora, such as the ionization rates and the emission rates

  12. Self-Adjoint Angular Flux Equation for Coupled Electron-Photon Transport

    International Nuclear Information System (INIS)

    Liscum-Powell, J.L.; Lorence, L.J. Jr.; Morel, J.E.; Prinja, A.K.

    1999-01-01

    Recently, Morel and McGhee described an alternate second-order form of the transport equation called the self adjoint angular flux (SAAF) equation that has the angular flux as its unknown. The SAAF formulation has all the advantages of the traditional even- and odd-parity self-adjoint equations, with the added advantages that it yields the full angular flux when it is numerically solved, it is significantly easier to implement reflective and reflective-like boundary conditions, and in the appropriate form it can be solved in void regions. The SAAF equation has the disadvantage that the angular domain is the full unit sphere and, like the even- and odd- parity form, S n source iteration cannot be implemented using the standard sweeping algorithm. Also, problems arise in pure scattering media. Morel and McGhee demonstrated the efficacy of the SAAF formulation for neutral particle transport. Here we apply the SAAF formulation to coupled electron-photon transport problems using multigroup cross-sections from the CEPXS code and S n discretization

  13. Self-adjoint angular flux equation for coupled electron-photon transport

    International Nuclear Information System (INIS)

    Liscum-Powell, J.L.; Prinja, A.K.; Morel, J.E.; Lorence, L.J. Jr.

    1999-01-01

    Recently, Morel and McGhee described an alternate second-order form of the transport equation called the self-adjoint angular flux (SAAF) equation that has the angular flux as its unknown. The SAAF formulation has all the advantages of the traditional even- and odd-parity self-adjoint equations, with the added advantages that it yields the full angular flux when it is numerically solved, it is significantly easier to implement reflective and reflective-like boundary conditions, and in the appropriate form it can be solved in void regions. The SAAF equation has the disadvantage that the angular domain is the full unit sphere, and, like the even- and odd-parity form, S n source iteration cannot be implemented using the standard sweeping algorithm. Also, problems arise in pure scattering media. Morel and McGhee demonstrated the efficacy of the SAAF formulation for neutral particle transport. Here, the authors apply the SAAF formulation to coupled electron-photon transport problems using multigroup cross sections from the CEPXS code and S n discretization

  14. A novel algebraic procedure for solving non-linear evolution equations of higher order

    International Nuclear Information System (INIS)

    Huber, Alfred

    2007-01-01

    We report here a systematic approach that can easily be used for solving non-linear partial differential equations (nPDE), especially of higher order. We restrict the analysis to the so called evolution equations describing any wave propagation. The proposed new algebraic approach leads us to traveling wave solutions and moreover, new class of solution can be obtained. The crucial step of our method is the basic assumption that the solutions satisfy an ordinary differential equation (ODE) of first order that can be easily integrated. The validity and reliability of the method is tested by its application to some non-linear evolution equations. The important aspect of this paper however is the fact that we are able to calculate distinctive class of solutions which cannot be found in the current literature. In other words, using this new algebraic method the solution manifold is augmented to new class of solution functions. Simultaneously we would like to stress the necessity of such sophisticated methods since a general theory of nPDE does not exist. Otherwise, for practical use the algebraic construction of new class of solutions is of fundamental interest

  15. On the adequacy of message-passing parallel supercomputers for solving neutron transport problems

    International Nuclear Information System (INIS)

    Azmy, Y.Y.

    1990-01-01

    A coarse-grained, static-scheduling parallelization of the standard iterative scheme used for solving the discrete-ordinates approximation of the neutron transport equation is described. The parallel algorithm is based on a decomposition of the angular domain along the discrete ordinates, thus naturally producing a set of completely uncoupled systems of equations in each iteration. Implementation of the parallel code on Intcl's iPSC/2 hypercube, and solutions to test problems are presented as evidence of the high speedup and efficiency of the parallel code. The performance of the parallel code on the iPSC/2 is analyzed, and a model for the CPU time as a function of the problem size (order of angular quadrature) and the number of participating processors is developed and validated against measured CPU times. The performance model is used to speculate on the potential of massively parallel computers for significantly speeding up real-life transport calculations at acceptable efficiencies. We conclude that parallel computers with a few hundred processors are capable of producing large speedups at very high efficiencies in very large three-dimensional problems. 10 refs., 8 figs

  16. NUMERICAL TECHNIQUES TO SOLVE CONDENSATIONAL AND DISSOLUTIONAL GROWTH EQUATIONS WHEN GROWTH IS COUPLED TO REVERSIBLE REACTIONS (R823186)

    Science.gov (United States)

    Noniterative, unconditionally stable numerical techniques for solving condensational anddissolutional growth equations are given. Growth solutions are compared to Gear-code solutions forthree cases when growth is coupled to reversible equilibrium chemistry. In all cases, ...

  17. Generalized heat-transport equations: parabolic and hyperbolic models

    Science.gov (United States)

    Rogolino, Patrizia; Kovács, Robert; Ván, Peter; Cimmelli, Vito Antonio

    2018-03-01

    We derive two different generalized heat-transport equations: the most general one, of the first order in time and second order in space, encompasses some well-known heat equations and describes the hyperbolic regime in the absence of nonlocal effects. Another, less general, of the second order in time and fourth order in space, is able to describe hyperbolic heat conduction also in the presence of nonlocal effects. We investigate the thermodynamic compatibility of both models by applying some generalizations of the classical Liu and Coleman-Noll procedures. In both cases, constitutive equations for the entropy and for the entropy flux are obtained. For the second model, we consider a heat-transport equation which includes nonlocal terms and study the resulting set of balance laws, proving that the corresponding thermal perturbations propagate with finite speed.

  18. Homogenization of the critically spectral equation in neutron transport

    Energy Technology Data Exchange (ETDEWEB)

    Allaire, G. [CEA Saclay, 91 - Gif-sur-Yvette (France). Dept. de Mecanique et de Technologie]|[Paris-6 Univ., 75 (France). Lab. d' Analyse Numerique; Bal, G. [Electricite de France (EDF), 92 - Clamart (France). Direction des Etudes et Recherches

    1998-07-01

    We address the homogenization of an eigenvalue problem for the neutron transport equation in a periodic heterogeneous domain, modeling the criticality study of nuclear reactor cores. We prove that the neutron flux, corresponding to the first and unique positive eigenvector, can be factorized in the product of two terms, up to a remainder which goes strongly to zero with the period. On terms is the first eigenvector of the transport equation in the periodicity cell. The other term is the first eigenvector of a diffusion equation in the homogenized domain. Furthermore, the corresponding eigenvalue gives a second order corrector for the eigenvalue of the heterogeneous transport problem. This result justifies and improves the engineering procedure used in practice for nuclear reactor cores computations. (author)

  19. Homogenization of the critically spectral equation in neutron transport

    International Nuclear Information System (INIS)

    Allaire, G.; Paris-6 Univ., 75; Bal, G.

    1998-01-01

    We address the homogenization of an eigenvalue problem for the neutron transport equation in a periodic heterogeneous domain, modeling the criticality study of nuclear reactor cores. We prove that the neutron flux, corresponding to the first and unique positive eigenvector, can be factorized in the product of two terms, up to a remainder which goes strongly to zero with the period. On terms is the first eigenvector of the transport equation in the periodicity cell. The other term is the first eigenvector of a diffusion equation in the homogenized domain. Furthermore, the corresponding eigenvalue gives a second order corrector for the eigenvalue of the heterogeneous transport problem. This result justifies and improves the engineering procedure used in practice for nuclear reactor cores computations. (author)

  20. Exponentially-convergent Monte Carlo for the 1-D transport equation

    International Nuclear Information System (INIS)

    Peterson, J. R.; Morel, J. E.; Ragusa, J. C.

    2013-01-01

    We define a new exponentially-convergent Monte Carlo method for solving the one-speed 1-D slab-geometry transport equation. This method is based upon the use of a linear discontinuous finite-element trial space in space and direction to represent the transport solution. A space-direction h-adaptive algorithm is employed to restore exponential convergence after stagnation occurs due to inadequate trial-space resolution. This methods uses jumps in the solution at cell interfaces as an error indicator. Computational results are presented demonstrating the efficacy of the new approach. (authors)

  1. A parallel algorithm for solving linear equations arising from one-dimensional network problems

    International Nuclear Information System (INIS)

    Mesina, G.L.

    1991-01-01

    One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs

  2. Parallel algorithms for solving the diffusion equation by finite elements methods and by nodal methods

    International Nuclear Information System (INIS)

    Coulomb, F.

    1989-06-01

    The aim of this work is to study methods for solving the diffusion equation, based on a primal or mixed-dual finite elements discretization and well suited for use on multiprocessors computers; domain decomposition methods are the subject of the main part of this study, the linear systems being solved by the block-Jacobi method. The origin of the diffusion equation is explained in short, and various variational formulations are reminded. A survey of iterative methods is given. The elemination of the flux or current is treated in the case of a mixed method. Numerical tests are performed on two examples of reactors, in order to compare mixed elements and Lagrange elements. A theoretical study of domain decomposition is led in the case of Lagrange finite elements, and convergence conditions for the block-Jacobi method are derived; the dissection decomposition is previously the purpose of a particular numerical analysis. In the case of mixed-dual finite elements, a study is led on examples and is confirmed by numerical tests performed for the dissection decomposition; furthermore, after being justified, decompositions along axes of symmetry are numerically tested. In the case of a decomposition into two subdomains, the dissection decomposition and the decomposition with an integrated interface are compared. Alternative directions methods are defined; the convergence of those relative to Lagrange elements is shown; in the case of mixed elements, convergence conditions are found [fr

  3. A pertinent approach to solve nonlinear fuzzy integro-differential equations.

    Science.gov (United States)

    Narayanamoorthy, S; Sathiyapriya, S P

    2016-01-01

    Fuzzy integro-differential equations is one of the important parts of fuzzy analysis theory that holds theoretical as well as applicable values in analytical dynamics and so an appropriate computational algorithm to solve them is in essence. In this article, we use parametric forms of fuzzy numbers and suggest an applicable approach for solving nonlinear fuzzy integro-differential equations using homotopy perturbation method. A clear and detailed description of the proposed method is provided. Our main objective is to illustrate that the construction of appropriate convex homotopy in a proper way leads to highly accurate solutions with less computational work. The efficiency of the approximation technique is expressed via stability and convergence analysis so as to guarantee the efficiency and performance of the methodology. Numerical examples are demonstrated to verify the convergence and it reveals the validity of the presented numerical technique. Numerical results are tabulated and examined by comparing the obtained approximate solutions with the known exact solutions. Graphical representations of the exact and acquired approximate fuzzy solutions clarify the accuracy of the approach.

  4. Solving delay differential equations in S-ADAPT by method of steps.

    Science.gov (United States)

    Bauer, Robert J; Mo, Gary; Krzyzanski, Wojciech

    2013-09-01

    S-ADAPT is a version of the ADAPT program that contains additional simulation and optimization abilities such as parametric population analysis. S-ADAPT utilizes LSODA to solve ordinary differential equations (ODEs), an algorithm designed for large dimension non-stiff and stiff problems. However, S-ADAPT does not have a solver for delay differential equations (DDEs). Our objective was to implement in S-ADAPT a DDE solver using the methods of steps. The method of steps allows one to solve virtually any DDE system by transforming it to an ODE system. The solver was validated for scalar linear DDEs with one delay and bolus and infusion inputs for which explicit analytic solutions were derived. Solutions of nonlinear DDE problems coded in S-ADAPT were validated by comparing them with ones obtained by the MATLAB DDE solver dde23. The estimation of parameters was tested on the MATLB simulated population pharmacodynamics data. The comparison of S-ADAPT generated solutions for DDE problems with the explicit solutions as well as MATLAB produced solutions which agreed to at least 7 significant digits. The population parameter estimates from using importance sampling expectation-maximization in S-ADAPT agreed with ones used to generate the data. Published by Elsevier Ireland Ltd.

  5. Killing vector fields in three dimensions: a method to solve massive gravity field equations

    Energy Technology Data Exchange (ETDEWEB)

    Guerses, Metin, E-mail: gurses@fen.bilkent.edu.t [Department of Mathematics, Faculty of Sciences, Bilkent University, 06800 Ankara (Turkey)

    2010-10-21

    Killing vector fields in three dimensions play an important role in the construction of the related spacetime geometry. In this work we show that when a three-dimensional geometry admits a Killing vector field then the Ricci tensor of the geometry is determined in terms of the Killing vector field and its scalars. In this way we can generate all products and covariant derivatives at any order of the Ricci tensor. Using this property we give ways to solve the field equations of topologically massive gravity (TMG) and new massive gravity (NMG) introduced recently. In particular when the scalars of the Killing vector field (timelike, spacelike and null cases) are constants then all three-dimensional symmetric tensors of the geometry, the Ricci and Einstein tensors, their covariant derivatives at all orders, and their products of all orders are completely determined by the Killing vector field and the metric. Hence, the corresponding three-dimensional metrics are strong candidates for solving all higher derivative gravitational field equations in three dimensions.

  6. Propel: A Discontinuous-Galerkin Finite Element Code for Solving the Reacting Navier-Stokes Equations

    Science.gov (United States)

    Johnson, Ryan; Kercher, Andrew; Schwer, Douglas; Corrigan, Andrew; Kailasanath, Kazhikathra

    2017-11-01

    This presentation focuses on the development of a Discontinuous Galerkin (DG) method for application to chemically reacting flows. The in-house code, called Propel, was developed by the Laboratory of Computational Physics and Fluid Dynamics at the Naval Research Laboratory. It was designed specifically for developing advanced multi-dimensional algorithms to run efficiently on new and innovative architectures such as GPUs. For these results, Propel solves for convection and diffusion simultaneously with detailed transport and thermodynamics. Chemistry is currently solved in a time-split approach using Strang-splitting with finite element DG time integration of chemical source terms. Results presented here show canonical unsteady reacting flow cases, such as co-flow and splitter plate, and we report performance for higher order DG on CPU and GPUs.

  7. Stable solutions of nonlocal electron heat transport equations

    International Nuclear Information System (INIS)

    Prasad, M.K.; Kershaw, D.S.

    1991-01-01

    Electron heat transport equations with a nonlocal heat flux are in general ill-posed and intrinsically unstable, as proved by the present authors [Phys. Fluids B 1, 2430 (1989)]. A straightforward numerical solution of these equations will therefore lead to absurd results. It is shown here that by imposing a minimal set of constraints on the problem it is possible to arrive at a globally stable, consistent, and energy conserving numerical solution

  8. Algorithms to solve coupled systems of differential equations in terms of power series

    International Nuclear Information System (INIS)

    Ablinger, Jakob; Schneider, Carsten

    2016-08-01

    Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations, and that sufficiently many initial values of the integrals are given. Then there exist algorithms that decide constructively if the coefficients of their power series representations can be given within the class of nested sums over hypergeometric products. In this article we work out the calculation steps that solve this problem. First, we present a successful tactic that has been applied recently to challenging problems coming from massive 3-loop Feynman integrals. Here our main tool is to solve scalar linear recurrences within the class of nested sums over hypergeometric products. Second, we will present a new variation of this tactic which relies on more involved summation technologies but succeeds in reducing the problem to solve scalar recurrences with lower recurrence orders. The article works out the different challenges of this new tactic and demonstrates how they can be treated efficiently with our existing summation technologies.

  9. Solving variational problems and partial differential equations that map between manifolds via the closest point method

    Science.gov (United States)

    King, Nathan D.; Ruuth, Steven J.

    2017-05-01

    Maps from a source manifold M to a target manifold N appear in liquid crystals, color image enhancement, texture mapping, brain mapping, and many other areas. A numerical framework to solve variational problems and partial differential equations (PDEs) that map between manifolds is introduced within this paper. Our approach, the closest point method for manifold mapping, reduces the problem of solving a constrained PDE between manifolds M and N to the simpler problems of solving a PDE on M and projecting to the closest points on N. In our approach, an embedding PDE is formulated in the embedding space using closest point representations of M and N. This enables the use of standard Cartesian numerics for general manifolds that are open or closed, with or without orientation, and of any codimension. An algorithm is presented for the important example of harmonic maps and generalized to a broader class of PDEs, which includes p-harmonic maps. Improved efficiency and robustness are observed in convergence studies relative to the level set embedding methods. Harmonic and p-harmonic maps are computed for a variety of numerical examples. In these examples, we denoise texture maps, diffuse random maps between general manifolds, and enhance color images.

  10. A new modified conjugate gradient coefficient for solving system of linear equations

    Science.gov (United States)

    Hajar, N.; ‘Aini, N.; Shapiee, N.; Abidin, Z. Z.; Khadijah, W.; Rivaie, M.; Mamat, M.

    2017-09-01

    Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations

  11. A Time Marching Scheme for Solving Volume Integral Equations on Nonlinear Scatterers

    KAUST Repository

    Bagci, Hakan

    2015-01-01

    Transient electromagnetic field interactions on inhomogeneous penetrable scatterers can be analyzed by solving time domain volume integral equations (TDVIEs). TDVIEs are oftentimes solved using marchingon-in-time (MOT) schemes. Unlike finite difference and finite element schemes, MOT-TDVIE solvers require discretization of only the scatterers, do not call for artificial absorbing boundary conditions, and are more robust to numerical phase dispersion. On the other hand, their computational cost is high, they suffer from late-time instabilities, and their implicit nature makes incorporation of nonlinear constitutive relations more difficult. Development of plane-wave time-domain (PWTD) and FFT-based schemes has significantly reduced the computational cost of the MOT-TDVIE solvers. Additionally, latetime instability problem has been alleviated for all practical purposes with the development of accurate integration schemes and specially designed temporal basis functions. Addressing the third challenge is the topic of this presentation. I will talk about an explicit MOT scheme developed for solving the TDVIE on scatterers with nonlinear material properties. The proposed scheme separately discretizes the TDVIE and the nonlinear constitutive relation between electric field intensity and flux density. The unknown field intensity and flux density are expanded using half and full Schaubert-Wilton-Glisson (SWG) basis functions in space and polynomial temporal interpolators in time. The resulting coupled system of the discretized TDVIE and constitutive relation is integrated in time using an explicit P E(CE) m scheme to yield the unknown expansion coefficients. Explicitness of time marching allows for straightforward incorporation of the nonlinearity as a function evaluation on the right hand side of the coupled system of equations. Consequently, the resulting MOT scheme does not call for a Newton-like nonlinear solver. Numerical examples, which demonstrate the applicability

  12. A Time Marching Scheme for Solving Volume Integral Equations on Nonlinear Scatterers

    KAUST Repository

    Bagci, Hakan

    2015-01-07

    Transient electromagnetic field interactions on inhomogeneous penetrable scatterers can be analyzed by solving time domain volume integral equations (TDVIEs). TDVIEs are oftentimes solved using marchingon-in-time (MOT) schemes. Unlike finite difference and finite element schemes, MOT-TDVIE solvers require discretization of only the scatterers, do not call for artificial absorbing boundary conditions, and are more robust to numerical phase dispersion. On the other hand, their computational cost is high, they suffer from late-time instabilities, and their implicit nature makes incorporation of nonlinear constitutive relations more difficult. Development of plane-wave time-domain (PWTD) and FFT-based schemes has significantly reduced the computational cost of the MOT-TDVIE solvers. Additionally, latetime instability problem has been alleviated for all practical purposes with the development of accurate integration schemes and specially designed temporal basis functions. Addressing the third challenge is the topic of this presentation. I will talk about an explicit MOT scheme developed for solving the TDVIE on scatterers with nonlinear material properties. The proposed scheme separately discretizes the TDVIE and the nonlinear constitutive relation between electric field intensity and flux density. The unknown field intensity and flux density are expanded using half and full Schaubert-Wilton-Glisson (SWG) basis functions in space and polynomial temporal interpolators in time. The resulting coupled system of the discretized TDVIE and constitutive relation is integrated in time using an explicit P E(CE) m scheme to yield the unknown expansion coefficients. Explicitness of time marching allows for straightforward incorporation of the nonlinearity as a function evaluation on the right hand side of the coupled system of equations. Consequently, the resulting MOT scheme does not call for a Newton-like nonlinear solver. Numerical examples, which demonstrate the applicability

  13. Solution of the transport equation with account for inelastic collisions

    International Nuclear Information System (INIS)

    Kalashnikov, N.P.; Remizovich, V.S.; Ryazanov, M.I.

    1980-01-01

    The theory of charged particle scattering in a matter with account for inelastic collisions is considered. In ''directly-forward'' approximation the transport equation at the absence of elastic collisions is obtained. The solution of the transport equation is made without and with account for fluctuation of energy losses. Formulas for path-energy relation are given. Energy spectrum and distribution of fast charged particles with respect to paths are studied. The problem of quantum mechanical approach to the theory of multiple scattering of fast charged particles in a matter is discussed briefly

  14. Quantum Non-Markovian Langevin Equations and Transport Coefficients

    International Nuclear Information System (INIS)

    Sargsyan, V.V.; Antonenko, N.V.; Kanokov, Z.; Adamian, G.G.

    2005-01-01

    Quantum diffusion equations featuring explicitly time-dependent transport coefficients are derived from generalized non-Markovian Langevin equations. Generalized fluctuation-dissipation relations and analytic expressions for calculating the friction and diffusion coefficients in nuclear processes are obtained. The asymptotic behavior of the transport coefficients and correlation functions for a damped harmonic oscillator that is linearly coupled in momentum to a heat bath is studied. The coupling to a heat bath in momentum is responsible for the appearance of the diffusion coefficient in coordinate. The problem of regression of correlations in quantum dissipative systems is analyzed

  15. Finite-difference solution of the space-angle-lethargy-dependent slowing-down transport equation

    Energy Technology Data Exchange (ETDEWEB)

    Matausek, M V [Boris Kidric Vinca Institute of Nuclear Sciences, Vinca, Belgrade (Yugoslavia)

    1972-07-01

    A procedure has been developed for solving the slowing-down transport equation for a cylindrically symmetric reactor system. The anisotropy of the resonance neutron flux is treated by the spherical harmonics formalism, which reduces the space-angle-Iethargy-dependent transport equation to a matrix integro-differential equation in space and lethargy. Replacing further the lethargy transfer integral by a finite-difference form, a set of matrix ordinary differential equations is obtained, with lethargy-and space dependent coefficients. If the lethargy pivotal points are chosen dense enough so that the difference correction term can be ignored, this set assumes a lower block triangular form and can be solved directly by forward block substitution. As in each step of the finite-difference procedure a boundary value problem has to be solved for a non-homogeneous system of ordinary differential equations with space-dependent coefficients, application of any standard numerical procedure, for example, the finite-difference method or the method of adjoint equations, is too cumbersome and would make the whole procedure practically inapplicable. A simple and efficient approximation is proposed here, allowing analytical solution for the space dependence of the spherical-harmonics flux moments, and hence the derivation of the recurrence relations between the flux moments at successive lethargy pivotal points. According to the procedure indicated above a computer code has been developed for the CDC -3600 computer, which uses the KEDAK nuclear data file. The space and lethargy distribution of the resonance neutrons can be computed in such a detailed fashion as the neutron cross-sections are known for the reactor materials considered. The computing time is relatively short so that the code can be efficiently used, either autonomously, or as part of some complex modular scheme. Typical results will be presented and discussed in order to prove and illustrate the applicability of the

  16. ADI as a preconditioning for solving the convection-diffusion equation

    International Nuclear Information System (INIS)

    Chin, R.C.Y.; Manteuffel, T.A.; De Pillis, J.

    1984-01-01

    The authors examine a splitting of the operator obtained from a steady convection-diffusion equation with variable coefficients in which the convection term dominates. The operator is split into a dominant and subdominant parts consistent with the inherent directional property of the partial differential equation. The equations involving the dominant parts should be easily solved. The authors accelerate the convergence of this splitting or the outer iteration by a Chebyshev semi-iterative method. When the dominant part has constant coefficients, it can be easily solved using alternating direction implicit (ADI) methods. This is called the inner iteration. The optimal parameters for a stationary two-parameter ADI method are obtained when the eigenvalues become complex. This corresponds to either the horizontal or the vertical half-grid Reynolds number larger than unity. The Chebyshev semi-iterative method is used to accelerate the convergence of the inner ADI iteration. A two-fold increase in speed is obtained when the ADI iteration matrix has real eigenvalues, and the increase is less significant when the eigenvalues are complex. If either the horizontal or the vertical half-grid Reynolds number is equal to one, the spectral radius of the optimal ADI iterative matrix is zero. However, a high degree of nilpotency impairs rapid convergence. This problem is removed by introducing a more implicit iterative method called ADI/Gauss-Seidel (ADI/GS). ADI/GS resolves the nilpotency and, thus, converges more rapidly for half-grid Reynolds number near 1. Finally, these methods are compared with several well-known schemes on test problems. 23 references, 5 figures

  17. Solving the Sea-Level Equation in an Explicit Time Differencing Scheme

    Science.gov (United States)

    Klemann, V.; Hagedoorn, J. M.; Thomas, M.

    2016-12-01

    In preparation of coupling the solid-earth to an ice-sheet compartment in an earth-system model, the dependency of initial topography on the ice-sheet history and viscosity structure has to be analysed. In this study, we discuss this dependency and how it influences the reconstruction of former sea level during a glacial cycle. The modelling is based on the VILMA code in which the field equations are solved in the time domain applying an explicit time-differencing scheme. The sea-level equation is solved simultaneously in the same explicit scheme as the viscoleastic field equations (Hagedoorn et al., 2007). With the assumption of only small changes, we neglect the iterative solution at each time step as suggested by e.g. Kendall et al. (2005). Nevertheless, the prediction of the initial paleo topography in case of moving coastlines remains to be iterated by repeated integration of the whole load history. The sensitivity study sketched at the beginning is accordingly motivated by the question if the iteration of the paleo topography can be replaced by a predefined one. This study is part of the German paleoclimate modelling initiative PalMod. Lit:Hagedoorn JM, Wolf D, Martinec Z, 2007. An estimate of global mean sea-level rise inferred from tide-gauge measurements using glacial-isostatic models consistent with the relative sea-level record. Pure appl. Geophys. 164: 791-818, doi:10.1007/s00024-007-0186-7Kendall RA, Mitrovica JX, Milne GA, 2005. On post-glacial sea level - II. Numerical formulation and comparative reesults on spherically symmetric models. Geophys. J. Int., 161: 679-706, doi:10.1111/j.365-246.X.2005.02553.x

  18. Numerical solution of the Neutron Transport Equation using discontinuous nodal methods at X-Y geometry

    International Nuclear Information System (INIS)

    Delfin L, A.

    1996-01-01

    The purpose of this work is to solve the neutron transport equation in discrete-ordinates and X-Y geometry by developing and using the strong discontinuous and strong modified discontinuous nodal finite element schemes. The strong discontinuous and modified strong discontinuous nodal finite element schemes go from two to ten interpolation parameters per cell. They are describing giving a set D c and polynomial space S c corresponding for each scheme BDMO, RTO, BL, BDM1, HdV, BDFM1, RT1, BQ and BDM2. The solution is obtained solving the neutron transport equation moments for each nodal scheme by developing the basis functions defined by Pascal triangle and the Legendre moments giving in the polynomial space S c and, finally, looking for the non singularity of the resulting linear system. The linear system is numerically solved using a computer program for each scheme mentioned . It uses the LU method and forward and backward substitution and makes a partition of the domain in cells. The source terms and angular flux are calculated, using the directions and weights associated to the S N approximation and solving the angular flux moments to find the effective multiplication constant. The programs are written in Fortran language, using the dynamic allocation of memory to increase efficiently the available memory of the computing equipment. (Author)

  19. Finite difference method and algebraic polynomial interpolation for numerically solving Poisson's equation over arbitrary domains

    Directory of Open Access Journals (Sweden)

    Tsugio Fukuchi

    2014-06-01

    Full Text Available The finite difference method (FDM based on Cartesian coordinate systems can be applied to numerical analyses over any complex domain. A complex domain is usually taken to mean that the geometry of an immersed body in a fluid is complex; here, it means simply an analytical domain of arbitrary configuration. In such an approach, we do not need to treat the outer and inner boundaries differently in numerical calculations; both are treated in the same way. Using a method that adopts algebraic polynomial interpolations in the calculation around near-wall elements, all the calculations over irregular domains reduce to those over regular domains. Discretization of the space differential in the FDM is usually derived using the Taylor series expansion; however, if we use the polynomial interpolation systematically, exceptional advantages are gained in deriving high-order differences. In using the polynomial interpolations, we can numerically solve the Poisson equation freely over any complex domain. Only a particular type of partial differential equation, Poisson's equations, is treated; however, the arguments put forward have wider generality in numerical calculations using the FDM.

  20. Exactly averaged equations for flow and transport in random media

    International Nuclear Information System (INIS)

    Shvidler, Mark; Karasaki, Kenzi

    2001-01-01

    It is well known that exact averaging of the equations of flow and transport in random porous media can be realized only for a small number of special, occasionally exotic, fields. On the other hand, the properties of approximate averaging methods are not yet fully understood. For example, the convergence behavior and the accuracy of truncated perturbation series. Furthermore, the calculation of the high-order perturbations is very complicated. These problems for a long time have stimulated attempts to find the answer for the question: Are there in existence some exact general and sufficiently universal forms of averaged equations? If the answer is positive, there arises the problem of the construction of these equations and analyzing them. There exist many publications related to these problems and oriented on different applications: hydrodynamics, flow and transport in porous media, theory of elasticity, acoustic and electromagnetic waves in random fields, etc. We present a method of finding the general form of exactly averaged equations for flow and transport in random fields by using (1) an assumption of the existence of Green's functions for appropriate stochastic problems, (2) some general properties of the Green's functions, and (3) the some basic information about the random fields of the conductivity, porosity and flow velocity. We present a general form of the exactly averaged non-local equations for the following cases. 1. Steady-state flow with sources in porous media with random conductivity. 2. Transient flow with sources in compressible media with random conductivity and porosity. 3. Non-reactive solute transport in random porous media. We discuss the problem of uniqueness and the properties of the non-local averaged equations, for the cases with some types of symmetry (isotropic, transversal isotropic, orthotropic) and we analyze the hypothesis of the structure non-local equations in general case of stochastically homogeneous fields. (author)

  1. An Implementation of Interfacial Transport Equation into the CUPID code

    Energy Technology Data Exchange (ETDEWEB)

    Park, Ik Kyu; Cho, Heong Kyu; Yoon, Han Young; Jeong, Jae Jun

    2009-11-15

    A component scale thermal hydraulic analysis code, CUPID (Component Unstructured Program for Interfacial Dynamics), is being developed for the analysis of components for a nuclear reactor, such as reactor vessel, steam generator, containment, etc. It adopted a three-dimensional, transient, two phase and three-field model. In order to develop the numerical schemes for the three-field model, various numerical schemes have been examined including the SMAS, semi-implicit ICE, SIMPLE. The governing equations for a 2-phase flow are composed of mass, momentum, and energy conservation equations for each phase. These equation sets are closed by the interfacial transfer rate of mass, momentum, and energy. The interfacial transfer of mass, momentum, and energy occurs through the interfacial area, and this area plays an important role in the transfer rate. The flow regime based correlations are used for calculating the interracial area in the traditional style 2-phase flow model. This is dependent upon the flow regime and is limited to the fully developed 2-phase flow region. Its application to the multi-dimensional 2-phase flow has some limitation because it adopts the measured results of 2-phase flow in the 1-dimensional tube. The interfacial area concentration transport equation had been suggested in order to calculate the interfacial area without the interfacial area correlations. The source terms to close the interfacial area transport equation should be further developed for a wide ranger usage of it. In this study, the one group interfacial area concentration transport equation has been implemented into the CUPID code. This interfacial area concentration transport equation can be used instead of the interfacial area concentration correlations for the bubbly flow region.

  2. An Implementation of Interfacial Transport Equation into the CUPID code

    International Nuclear Information System (INIS)

    Park, Ik Kyu; Cho, Heong Kyu; Yoon, Han Young; Jeong, Jae Jun

    2009-11-01

    A component scale thermal hydraulic analysis code, CUPID (Component Unstructured Program for Interfacial Dynamics), is being developed for the analysis of components for a nuclear reactor, such as reactor vessel, steam generator, containment, etc. It adopted a three-dimensional, transient, two phase and three-field model. In order to develop the numerical schemes for the three-field model, various numerical schemes have been examined including the SMAS, semi-implicit ICE, SIMPLE. The governing equations for a 2-phase flow are composed of mass, momentum, and energy conservation equations for each phase. These equation sets are closed by the interfacial transfer rate of mass, momentum, and energy. The interfacial transfer of mass, momentum, and energy occurs through the interfacial area, and this area plays an important role in the transfer rate. The flow regime based correlations are used for calculating the interracial area in the traditional style 2-phase flow model. This is dependent upon the flow regime and is limited to the fully developed 2-phase flow region. Its application to the multi-dimensional 2-phase flow has some limitation because it adopts the measured results of 2-phase flow in the 1-dimensional tube. The interfacial area concentration transport equation had been suggested in order to calculate the interfacial area without the interfacial area correlations. The source terms to close the interfacial area transport equation should be further developed for a wide ranger usage of it. In this study, the one group interfacial area concentration transport equation has been implemented into the CUPID code. This interfacial area concentration transport equation can be used instead of the interfacial area concentration correlations for the bubbly flow region

  3. Analysis of discrete reaction-diffusion equations for autocatalysis and continuum diffusion equations for transport

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Chi-Jen [Iowa State Univ., Ames, IA (United States)

    2013-01-01

    In this thesis, we analyze both the spatiotemporal behavior of: (A) non-linear “reaction” models utilizing (discrete) reaction-diffusion equations; and (B) spatial transport problems on surfaces and in nanopores utilizing the relevant (continuum) diffusion or Fokker-Planck equations. Thus, there are some common themes in these studies, as they all involve partial differential equations or their discrete analogues which incorporate a description of diffusion-type processes. However, there are also some qualitative differences, as shall be discussed below.

  4. Markovian Monte Carlo program EvolFMC v.2 for solving QCD evolution equations

    Science.gov (United States)

    Jadach, S.; Płaczek, W.; Skrzypek, M.; Stokłosa, P.

    2010-02-01

    We present the program EvolFMC v.2 that solves the evolution equations in QCD for the parton momentum distributions by means of the Monte Carlo technique based on the Markovian process. The program solves the DGLAP-type evolution as well as modified-DGLAP ones. In both cases the evolution can be performed in the LO or NLO approximation. The quarks are treated as massless. The overall technical precision of the code has been established at 5×10. This way, for the first time ever, we demonstrate that with the Monte Carlo method one can solve the evolution equations with precision comparable to the other numerical methods. New version program summaryProgram title: EvolFMC v.2 Catalogue identifier: AEFN_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFN_v1_0.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 binary test data, etc.: 66 456 (7407 lines of C++ code) No. of bytes in distributed program, including test data, etc.: 412 752 Distribution format: tar.gz Programming language: C++ Computer: PC, Mac Operating system: Linux, Mac OS X RAM: Less than 256 MB Classification: 11.5 External routines: ROOT ( http://root.cern.ch/drupal/) Nature of problem: Solution of the QCD evolution equations for the parton momentum distributions of the DGLAP- and modified-DGLAP-type in the LO and NLO approximations. Solution method: Monte Carlo simulation of the Markovian process of a multiple emission of partons. Restrictions:Limited to the case of massless partons. Implemented in the LO and NLO approximations only. Weighted events only. Unusual features: Modified-DGLAP evolutions included up to the NLO level. Additional comments: Technical precision established at 5×10. Running time: For the 10 6 events at 100 GeV: DGLAP NLO: 27s; C-type modified DGLAP NLO: 150s (MacBook Pro with Mac OS X v.10

  5. Analytical solution for the transport equation for neutral particles in cylindrical and Cartesian geometry

    International Nuclear Information System (INIS)

    Goncalves, Glenio Aguiar

    2003-01-01

    In this work, we are reported analytical solutions for the transport equation for neutral particles in cylindrical and cartesian geometry. For the cylindrical geometry, it is applied the Hankel transform of order zero in the S N approximation of the one-dimensional cylindrical transport equation, assuming azimuthal symmetry and isotropic scattering. This procedure is coined HTSN method. The anisotropic problem is handled using the decomposition method, generating a recursive approach, which the HTSN solution is used as initial condition. For cartesian geometry, the one and two dimensional transport equation is derived in the angular variable as many time as the degree of the anisotropic scattering. This procedure leads to set of integro-differential plus one differential equation that can be really solved by the variable separation method. Following this procedure, it was possible to come out with the Case solution for the one-dimensional problem. Numerical simulations are reported for the cylindrical transport problem both isotropic and anisotropic case of quadratic degree. (author)

  6. Method for the determination of the dominant eigenvalue of the neutron transport equation in a slab using fractional derivative

    International Nuclear Information System (INIS)

    Sperotto, Fabiola Aiub; Segatto, Cynthia Feijo; Zabadal, Jorge

    2002-01-01

    In this work, we determine the dominant eigenvalue of the one-dimensional neutron transport equation in a slab constructing an integral form for the neutron transport equation which is the expressed in terms of fractional derivative of the angular flux. Equating the fractional derivative of the angular flux to the integrate equation, we determine the unknown order of the fractional derivative comparing the kernel of the integral equation with the one of Riemann-Liouville definition of fractional derivative. Once known the angular flux the dominant eigenvalue is calculated solving a transcendental equation resulting from the application of the boundary conditions. We report the methodology applied, for comparison with available results in literature. (author)

  7. Correction of the wavefront using the irradiance transport equation

    Science.gov (United States)

    García, M.; Granados, F.; Cornejo, A.

    2008-07-01

    The correction of the wavefront in optical systems implies the use of wavefront sensors, software, and auxiliary optical systems. We propose evaluated the wavefront using the fact that the wavefront and its intensity are related in the mathematical expression the irradiance transport equation (ITE)

  8. Nodal approximations of varying order by energy group for solving the diffusion equation

    International Nuclear Information System (INIS)

    Broda, J.T.

    1992-02-01

    The neutron flux across the nuclear reactor core is of interest to reactor designers and others. The diffusion equation, an integro-differential equation in space and energy, is commonly used to determine the flux level. However, the solution of a simplified version of this equation when automated is very time consuming. Since the flux level changes with time, in general, this calculation must be made repeatedly. Therefore solution techniques that speed the calculation while maintaining accuracy are desirable. One factor that contributes to the solution time is the spatial flux shape approximation used. It is common practice to use the same order flux shape approximation in each energy group even though this method may not be the most efficient. The one-dimensional, two-energy group diffusion equation was solved, for the node average flux and core k-effective, using two sets of spatial shape approximations for each of three reactor types. A fourth-order approximation in both energy groups forms the first set of approximations used. The second set used combines a second-order approximation with a fourth-order approximation in energy group two. Comparison of the results from the two approximation sets show that the use of a different order spatial flux shape approximation results in considerable loss in accuracy for the pressurized water reactor modeled. However, the loss in accuracy is small for the heavy water and graphite reactors modeled. The use of different order approximations in each energy group produces mixed results. Further investigation into the accuracy and computing time is required before any quantitative advantage of the use of the second-order approximation in energy group one and the fourth-order approximation in energy group two can be determined

  9. Biases and statistical errors in Monte Carlo burnup calculations: an unbiased stochastic scheme to solve Boltzmann/Bateman coupled equations

    International Nuclear Information System (INIS)

    Dumonteil, E.; Diop, C.M.

    2011-01-01

    External linking scripts between Monte Carlo transport codes and burnup codes, and complete integration of burnup capability into Monte Carlo transport codes, have been or are currently being developed. Monte Carlo linked burnup methodologies may serve as an excellent benchmark for new deterministic burnup codes used for advanced systems; however, there are some instances where deterministic methodologies break down (i.e., heavily angularly biased systems containing exotic materials without proper group structure) and Monte Carlo burn up may serve as an actual design tool. Therefore, researchers are also developing these capabilities in order to examine complex, three-dimensional exotic material systems that do not contain benchmark data. Providing a reference scheme implies being able to associate statistical errors to any neutronic value of interest like k(eff), reaction rates, fluxes, etc. Usually in Monte Carlo, standard deviations are associated with a particular value by performing different independent and identical simulations (also referred to as 'cycles', 'batches', or 'replicas'), but this is only valid if the calculation itself is not biased. And, as will be shown in this paper, there is a bias in the methodology that consists of coupling transport and depletion codes because Bateman equations are not linear functions of the fluxes or of the reaction rates (those quantities being always measured with an uncertainty). Therefore, we have to quantify and correct this bias. This will be achieved by deriving an unbiased minimum variance estimator of a matrix exponential function of a normal mean. The result is then used to propose a reference scheme to solve Boltzmann/Bateman coupled equations, thanks to Monte Carlo transport codes. Numerical tests will be performed with an ad hoc Monte Carlo code on a very simple depletion case and will be compared to the theoretical results obtained with the reference scheme. Finally, the statistical error propagation

  10. A Fibonacci collocation method for solving a class of Fredholm–Volterra integral equations in two-dimensional spaces

    Directory of Open Access Journals (Sweden)

    Farshid Mirzaee

    2014-06-01

    Full Text Available In this paper, we present a numerical method for solving two-dimensional Fredholm–Volterra integral equations (F-VIE. The method reduces the solution of these integral equations to the solution of a linear system of algebraic equations. The existence and uniqueness of the solution and error analysis of proposed method are discussed. The method is computationally very simple and attractive. Finally, numerical examples illustrate the efficiency and accuracy of the method.

  11. From statistic mechanic outside equilibrium to transport equations

    International Nuclear Information System (INIS)

    Balian, R.

    1995-01-01

    This lecture notes give a synthetic view on the foundations of non-equilibrium statistical mechanics. The purpose is to establish the transport equations satisfied by the relevant variables, starting from the microscopic dynamics. The Liouville representation is introduced, and a projection associates with any density operator , for given choice of relevant observables, a reduced density operator. An exact integral-differential equation for the relevant variables is thereby derived. A short-memory approximation then yields the transport equations. A relevant entropy which characterizes the coarseness of the description is associated with each level of description. As an illustration, the classical gas, with its three levels of description and with the Chapman-Enskog method, is discussed. (author). 3 figs., 5 refs

  12. Solving wood chip transport problems with computer simulation.

    Science.gov (United States)

    Dennis P. Bradley; Sharon A. Winsauer

    1976-01-01

    Efficient chip transport operations are difficult to achieve due to frequent and often unpredictable changes in distance to market, chipping rate, time spent at the mill, and equipment costs. This paper describes a computer simulation model that allows a logger to design an efficient transport system in response to these changing factors.

  13. An accurate anisotropic adaptation method for solving the level set advection equation

    International Nuclear Information System (INIS)

    Bui, C.; Dapogny, C.; Frey, P.

    2012-01-01

    In the present paper, a mesh adaptation process for solving the advection equation on a fully unstructured computational mesh is introduced, with a particular interest in the case it implicitly describes an evolving surface. This process mainly relies on a numerical scheme based on the method of characteristics. However, low order, this scheme lends itself to a thorough analysis on the theoretical side. It gives rise to an anisotropic error estimate which enjoys a very natural interpretation in terms of the Hausdorff distance between the exact and approximated surfaces. The computational mesh is then adapted according to the metric supplied by this estimate. The whole process enjoys a good accuracy as far as the interface resolution is concerned. Some numerical features are discussed and several classical examples are presented and commented in two or three dimensions. (authors)

  14. Polynomial approach method to solve the neutron point kinetics equations with use of the analytic continuation

    Energy Technology Data Exchange (ETDEWEB)

    Tumelero, Fernanda; Petersen, Claudio Zen; Goncalves, Glenio Aguiar [Universidade Federal de Pelotas, Capao do Leao, RS (Brazil). Programa de Pos Graduacao em Modelagem Matematica; Schramm, Marcelo [Universidade Federal do Rio Grande do Sul, Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica

    2016-12-15

    In this work, we report a solution to solve the Neutron Point Kinetics Equations applying the Polynomial Approach Method. The main idea is to expand the neutron density and delayed neutron precursors as a power series considering the reactivity as an arbitrary function of the time in a relatively short time interval around an ordinary point. In the first interval one applies the initial conditions and the analytical continuation is used to determine the solutions of the next intervals. A genuine error control is developed based on an analogy with the Rest Theorem. For illustration, we also report simulations for different approaches types (linear, quadratic and cubic). The results obtained by numerical simulations for linear approximation are compared with results in the literature.

  15. The fast algorithm solving the one-dimensional time-dependent Schroedinger equation for teaching purposes

    International Nuclear Information System (INIS)

    Skoczen, A.; Machowski, W.; Kaprzyk, S.

    1990-07-01

    Computer program aiming at application in quantum mechanics didactics has been proposed. This program can generate the moving pictures of one-dimensional quantum mechanics scattering phenomena. Constructions of this program provide two options. In the first option the wave packet is generated in infinite one-dimensional well which has walls on the borders of graphic window. In the second option the square potential barrier is located in this well and transmission and reflection of wave packet are shown. We have selected a Gaussian wave packet to represent the initial state of the particle. The wave equation is solved numerically by a method discussed in detail. Solutions for the succesive time moments are graphically presented on the monitor screen. In this way observer can watch whole time-development of physical system. Graphically presented results are physically realistic when program parameters satisfy conditions discussed in this paper. (author)

  16. A dynamical regularization algorithm for solving inverse source problems of elliptic partial differential equations

    Science.gov (United States)

    Zhang, Ye; Gong, Rongfang; Cheng, Xiaoliang; Gulliksson, Mårten

    2018-06-01

    This study considers the inverse source problem for elliptic partial differential equations with both Dirichlet and Neumann boundary data. The unknown source term is to be determined by additional boundary conditions. Unlike the existing methods found in the literature, which usually employ the first-order in time gradient-like system (such as the steepest descent methods) for numerically solving the regularized optimization problem with a fixed regularization parameter, we propose a novel method with a second-order in time dissipative gradient-like system and a dynamical selected regularization parameter. A damped symplectic scheme is proposed for the numerical solution. Theoretical analysis is given for both the continuous model and the numerical algorithm. Several numerical examples are provided to show the robustness of the proposed algorithm.

  17. Solving QCD evolution equations in rapidity space with Markovian Monte Carlo

    CERN Document Server

    Golec-Biernat, K; Placzek, W; Skrzypek, M

    2009-01-01

    This work covers methodology of solving QCD evolution equation of the parton distribution using Markovian Monte Carlo (MMC) algorithms in a class of models ranging from DGLAP to CCFM. One of the purposes of the above MMCs is to test the other more sophisticated Monte Carlo programs, the so-called Constrained Monte Carlo (CMC) programs, which will be used as a building block in the parton shower MC. This is why the mapping of the evolution variables (eikonal variable and evolution time) into four-momenta is also defined and tested. The evolution time is identified with the rapidity variable of the emitted parton. The presented MMCs are tested independently, with ~0.1% precision, against the non-MC program APCheb especially devised for this purpose.

  18. New extended (G'/G)-expansion method to solve nonlinear evolution equation: the (3 + 1)-dimensional potential-YTSF equation.

    Science.gov (United States)

    Roshid, Harun-Or-; Akbar, M Ali; Alam, Md Nur; Hoque, Md Fazlul; Rahman, Nizhum

    2014-01-01

    In this article, a new extended (G'/G) -expansion method has been proposed for constructing more general exact traveling wave solutions of nonlinear evolution equations with the aid of symbolic computation. In order to illustrate the validity and effectiveness of the method, we pick the (3 + 1)-dimensional potential-YTSF equation. As a result, abundant new and more general exact solutions have been achieved of this equation. It has been shown that the proposed method provides a powerful mathematical tool for solving nonlinear wave equations in applied mathematics, engineering and mathematical physics.

  19. Spatially adaptive hp refinement approach for PN neutron transport equation using spectral element method

    International Nuclear Information System (INIS)

    Nahavandi, N.; Minuchehr, A.; Zolfaghari, A.; Abbasi, M.

    2015-01-01

    Highlights: • Powerful hp-SEM refinement approach for P N neutron transport equation has been presented. • The method provides great geometrical flexibility and lower computational cost. • There is a capability of using arbitrary high order and non uniform meshes. • Both posteriori and priori local error estimation approaches have been employed. • High accurate results are compared against other common adaptive and uniform grids. - Abstract: In this work we presented the adaptive hp-SEM approach which is obtained from the incorporation of Spectral Element Method (SEM) and adaptive hp refinement. The SEM nodal discretization and hp adaptive grid-refinement for even-parity Boltzmann neutron transport equation creates powerful grid refinement approach with high accuracy solutions. In this regard a computer code has been developed to solve multi-group neutron transport equation in one-dimensional geometry using even-parity transport theory. The spatial dependence of flux has been developed via SEM method with Lobatto orthogonal polynomial. Two commonly error estimation approaches, the posteriori and the priori has been implemented. The incorporation of SEM nodal discretization method and adaptive hp grid refinement leads to high accurate solutions. Coarser meshes efficiency and significant reduction of computer program runtime in comparison with other common refining methods and uniform meshing approaches is tested along several well-known transport benchmarks

  20. Modified homotopy perturbation method for solving hypersingular integral equations of the first kind.

    Science.gov (United States)

    Eshkuvatov, Z K; Zulkarnain, F S; Nik Long, N M A; Muminov, Z

    2016-01-01

    Modified homotopy perturbation method (HPM) was used to solve the hypersingular integral equations (HSIEs) of the first kind on the interval [-1,1] with the assumption that the kernel of the hypersingular integral is constant on the diagonal of the domain. Existence of inverse of hypersingular integral operator leads to the convergence of HPM in certain cases. Modified HPM and its norm convergence are obtained in Hilbert space. Comparisons between modified HPM, standard HPM, Bernstein polynomials approach Mandal and Bhattacharya (Appl Math Comput 190:1707-1716, 2007), Chebyshev expansion method Mahiub et al. (Int J Pure Appl Math 69(3):265-274, 2011) and reproducing kernel Chen and Zhou (Appl Math Lett 24:636-641, 2011) are made by solving five examples. Theoretical and practical examples revealed that the modified HPM dominates the standard HPM and others. Finally, it is found that the modified HPM is exact, if the solution of the problem is a product of weights and polynomial functions. For rational solution the absolute error decreases very fast by increasing the number of collocation points.

  1. Expert Strategies in Solving Algebraic Structure Sense Problems: The Case of Quadratic Equations

    Science.gov (United States)

    Jupri, Al; Sispiyati, R.

    2017-02-01

    Structure sense, an intuitive ability towards symbolic expressions, including skills to interpret, to manipulate, and to perceive symbols in different roles, is considered as a key success in learning algebra. In this article, we report results of three phases of a case study on solving algebraic structure sense problems aiming at testing the appropriateness of algebraic structure sense tasks and at investigating expert strategies dealing with the tasks. First, we developed three tasks on quadratic equations based on the characteristics of structure sense for high school algebra. Next, we validated the tasks to seven experts. In the validation process, we requested these experts to solve each task using two different strategies. Finally, we analyzing expert solution strategies in the light of structure sense characteristics. We found that even if eventual expert strategies are in line with the characteristics of structure sense; some of their initial solution strategies used standard procedures which might pay less attention to algebraic structures. This finding suggests that experts have reconsidered their procedural work and have provided more efficient solution strategies. For further investigation, we consider to test the tasks to high school algebra students and to see whether they produce similar results as experts.

  2. Numerical solution of neutron transport equations in discrete ordinates and slab geometry

    International Nuclear Information System (INIS)

    Serrano Pedraza, F.

    1985-01-01

    An unified formalism to solve numerically, between other equation, the neutron transport in discrete ordinates, slab geometry, several energy groups and independents of time, has been developed recently. Such a formalism cover some of the conventional schemes as diamond difference, (WDD) characteristic step (SC) lineal characteristic (LC), quadratic characteristic (QC) and lineal discontinuous. Unified formation gives before hand the convergence order of the previously selected scheme. In fact it allows besides to generate a big amount of numerical schemes, with which is also possible to solve numerical equations as soon as neutron transport. The essential purpose of this work was to solve the neutron transport equations in slab geometry and discrete ordinates considering several energy groups without to take under advisement time dependence based in the above mentioned unified formalism. To reach this purpose it was necesary to design a computer code with the name TNOD1 (Neutron transport in discrete ordinates and 1 dimension) which includes each one of the schemes already pointed out. there exist two numerical schemes, also recently developed, quadratic continuous (QC) and cubic continuous (CN), although covered by unified formalism, it has been possible to include them inside this computer code without make substantial changes in its structure. In chapter I, derivative of neutron transport equation independent of time is taken, for angular flux, including boundary conditions and discontinuity. In chapter II the neutron transport equations are obtained in multigroups, independents of time, for approximation of discrete ordinates. Description of theory related with unified formalism and its relationship with mentioned discretization schemes is presented in chapter III. Chapter IV describes the computer code developed and finally, in chapter V different numerical results obtained with TNOD1 program are shown. In Appendix A theorems and mathematical arguments used

  3. CACTUS, a characteristics solution to the neutron transport equations in complicated geometries

    International Nuclear Information System (INIS)

    Halsall, M.J.

    1980-04-01

    CACTUS has been written to solve the multigroup neutron transport equation in a general two-dimensional geometry. The method is based upon a characteristics formulation for the problem in which the transport equation is integrated explicitly along straight line tracks that are suitably distributed throughout the problem. Source distributions and scattering are assumed to be isotropic, but the only restriction on geometry is that the outer boundary should be rectangular. Within this rectangular boundary the user is free to build his problem geometry using any combination of intersecting straight lines and circular arcs. The theory of the method is described, followed by some details of a coding, a sensitivity study on the number of tracks required to integrate fluxes in a particular problem, a user's guide, and a few test cases. (author)

  4. Transport casks help solve spent fuel interim storage problems

    International Nuclear Information System (INIS)

    Dierkes, P.; Janberg, K.; Baatz, H.; Weinhold, G.

    1980-01-01

    Transport casks can be used as storage modules, combining the inherent safety of passive cooling with the absence of secondary radioactive waste and the flexibility to build up storage capacity according to actual requirements. In the Federal Republic of Germany, transport casks are being developed as a solution to its interim storage problems. Criteria for their design and licensing are outlined. Details are given of the casks and the storage facility. Tests are illustrated. (U.K.)

  5. A simple method for solving the Bussian equation for electrical conduction in rocks

    Directory of Open Access Journals (Sweden)

    P. W. J. Glover

    2010-09-01

    Full Text Available One of the most general and effective models for calculating the complex electrical conductivity and relative dielectric permittivity of rocks saturated with pore fluids is that of Bussian. Unlike most models, it is non-linear and cannot be solved algebraically. Consequently, researchers use reiterating numerical routines to obtain a solution of the equation, and then only for the real part of the solution. Here we present a different approach to the solution that uses conformal mapping in the complex plane, and implements it within MapleTM. The method is simple and elegant in that it requires, for example, only 3 lines of code in MapleTM 11 and little programming experience. The approach has been shown to be as precise as using the classical reiterating bisection method for real data implemented in C++ on an ordinary desktop computer to within a probability over 1 in 109. However, the conformal mapping approach is 52 times as fast. We show once more that the Bussian equation breaks down for low fluid conductivities, but recommend it (with the modified Archie's law for use with rocks saturated with high salinity fluids when the matrix is conductive.

  6. Scilab software as an alternative low-cost computing in solving the linear equations problem

    Science.gov (United States)

    Agus, Fahrul; Haviluddin

    2017-02-01

    Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited.

  7. On an adaptive time stepping strategy for solving nonlinear diffusion equations

    International Nuclear Information System (INIS)

    Chen, K.; Baines, M.J.; Sweby, P.K.

    1993-01-01

    A new time step selection procedure is proposed for solving non- linear diffusion equations. It has been implemented in the ASWR finite element code of Lorenz and Svoboda [10] for 2D semiconductor process modelling diffusion equations. The strategy is based on equi-distributing the local truncation errors of the numerical scheme. The use of B-splines for interpolation (as well as for the trial space) results in a banded and diagonally dominant matrix. The approximate inverse of such a matrix can be provided to a high degree of accuracy by another banded matrix, which in turn can be used to work out the approximate finite difference scheme corresponding to the ASWR finite element method, and further to calculate estimates of the local truncation errors of the numerical scheme. Numerical experiments on six full simulation problems arising in semiconductor process modelling have been carried out. Results show that our proposed strategy is more efficient and better conserves the total mass. 18 refs., 6 figs., 2 tabs

  8. Convergence properties of iterative algorithms for solving the nodal diffusion equations

    International Nuclear Information System (INIS)

    Azmy, Y.Y.; Kirk, B.L.

    1990-01-01

    We drive the five point form of the nodal diffusion equations in two-dimensional Cartesian geometry and develop three iterative schemes to solve the discrete-variable equations: the unaccelerated, partial Successive Over Relaxation (SOR), and the full SOR methods. By decomposing the iteration error into its Fourier modes, we determine the spectral radius of each method for infinite medium, uniform model problems, and for the unaccelerated and partial SOR methods for finite medium, uniform model problems. Also for the two variants of the SOR method we determine the optimal relaxation factor that results in the smallest number of iterations required for convergence. Our results indicate that the number of iterations for the unaccelerated and partial SOR methods is second order in the number of nodes per dimension, while, for the full SOR this behavior is first order, resulting in much faster convergence for very large problems. We successfully verify the results of the spectral analysis against those of numerical experiments, and we show that for the full SOR method the linear dependence of the number of iterations on the number of nodes per dimension is relatively insensitive to the value of the relaxation parameter, and that it remains linear even for heterogenous problems. 14 refs., 1 fig

  9. Solving the Bateman equations in CASMO5 using implicit ode numerical methods for stiff systems

    International Nuclear Information System (INIS)

    Hykes, J. M.; Ferrer, R. M.

    2013-01-01

    The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is 98 Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)

  10. Solving the radiation diffusion and energy balance equations using pseudo-transient continuation

    International Nuclear Information System (INIS)

    Shestakov, A.I.; Greenough, J.A.; Howell, L.H.

    2005-01-01

    We develop a scheme for the system coupling the radiation diffusion and matter energy balance equations. The method is based on fully implicit, first-order, backward Euler differencing; Picard-Newton iterations solve the nonlinear system. We show that iterating on the radiation energy density and the emission source is more robust. Since the Picard-Newton scheme may not converge for all initial conditions and time steps, pseudo-transient continuation (Ψtc) is introduced. The combined Ψtc-Picard-Newton scheme is analyzed. We derive conditions on the Ψtc parameter that guarantee physically meaningful iterates, e.g., positive energies. Successive Ψtc iterates are bounded and the radiation energy density and emission source tend to equilibrate. The scheme is incorporated into a multiply dimensioned, massively parallel, Eulerian, radiation-hydrodynamic computer program with automatic mesh refinement (AMR). Three examples are presented that exemplify the scheme's performance. (1) The Pomraning test problem that models radiation flow into cold matter. (2) A similar, but more realistic problem simulating the propagation of an ionization front into tenuous hydrogen gas with a Saha model for the equation-of-state. (3) A 2D axisymmetric (R,Z) simulation with real materials featuring jetting, radiatively driven, interacting shocks

  11. Exact solutions of the population balance equation including particle transport, using group analysis

    Science.gov (United States)

    Lin, Fubiao; Meleshko, Sergey V.; Flood, Adrian E.

    2018-06-01

    The population balance equation (PBE) has received an unprecedented amount of attention in recent years from both academics and industrial practitioners because of its long history, widespread use in engineering, and applicability to a wide variety of particulate and discrete-phase processes. However it is typically impossible to obtain analytical solutions, although in almost every case a numerical solution of the PBEs can be obtained. In this article, the symmetries of PBEs with homogeneous coagulation kernels involving aggregation, breakage and growth processes and particle transport in one dimension are found by direct solving the determining equations. Using the optimal system of one and two-dimensional subalgebras, all invariant solutions and reduced equations are obtained. In particular, an explicit analytical physical solution is also presented.

  12. An Explicit Upwind Algorithm for Solving the Parabolized Navier-Stokes Equations

    Science.gov (United States)

    Korte, John J.

    1991-01-01

    An explicit, upwind algorithm was developed for the direct (noniterative) integration of the 3-D Parabolized Navier-Stokes (PNS) equations in a generalized coordinate system. The new algorithm uses upwind approximations of the numerical fluxes for the pressure and convection terms obtained by combining flux difference splittings (FDS) formed from the solution of an approximate Riemann (RP). The approximate RP is solved using an extension of the method developed by Roe for steady supersonic flow of an ideal gas. Roe's method is extended for use with the 3-D PNS equations expressed in generalized coordinates and to include Vigneron's technique of splitting the streamwise pressure gradient. The difficulty associated with applying Roe's scheme in the subsonic region is overcome. The second-order upwind differencing of the flux derivatives are obtained by adding FDS to either an original forward or backward differencing of the flux derivative. This approach is used to modify an explicit MacCormack differencing scheme into an upwind differencing scheme. The second order upwind flux approximations, applied with flux limiters, provide a method for numerically capturing shocks without the need for additional artificial damping terms which require adjustment by the user. In addition, a cubic equation is derived for determining Vegneron's pressure splitting coefficient using the updated streamwise flux vector. Decoding the streamwise flux vector with the updated value of Vigneron's pressure splitting improves the stability of the scheme. The new algorithm is applied to 2-D and 3-D supersonic and hypersonic laminar flow test cases. Results are presented for the experimental studies of Holden and of Tracy. In addition, a flow field solution is presented for a generic hypersonic aircraft at a Mach number of 24.5 and angle of attack of 1 degree. The computed results compare well to both experimental data and numerical results from other algorithms. Computational times required

  13. A new scheme for solving inhomogeneous Boltzmann equation for electrons in weakly ionised gases

    International Nuclear Information System (INIS)

    Mahmoud, M.O.M.; Yousfi, M.

    1995-01-01

    In the case of weakly ionized gases, the numerical treatment of non-hydrodynamic regime involving spatial variation of distribution function due to boundaries (walls, electrodes, electron source, etc hor-ellipsis) by using direct Boltzmann equation always constitute a challenge if the main collisional processes occurring in non thermal plasmas are to be considered (elastic, inelastic and super-elastic collisions, Penning ionisation, Coulomb interactions, etc hor-ellipsis). In the non-thermal discharge modelling, the inhomogeneous electron Boltzmann equation is needed in order to be coupled for example to a fluid model to take into account the electron non-hydrodynamic effects. This is for example the case of filamentary discharge, in which the space charge electric field due to streamer propagation has a very sharp spatial profile thus leading to important space non-hydrodynamic effects. It is also the case of the cathodic zone of glow discharge where electric field has a rapid spatial decrease until the negative glow. In the present work, a new numerical scheme is proposed to solve the inhomogeneous Boltzmann equation for electrons in the framework of two-term approximation (TTA) taking into account elastic and inelastic processes. Such a method has the usual drawbacks associated with the TTA i.e. not an accurate enough at high E/N values or in presence of high inelastic processes. But the accuracy of this method is considered sufficient because in a next step it is destinated to be coupled to fluid model for charged particles and a chemical kinetic model where the accuracy is of the same order of magnitude or worse. However there are numerous advantages of this method concerning time computing, treatment of non-linear collision processes (Coulomb, Penning, etc hor-ellipsis)

  14. A rapid numerical method for solving Serre-Green-Naghdi equations describing long free surface gravity waves

    Science.gov (United States)

    Favrie, N.; Gavrilyuk, S.

    2017-07-01

    A new numerical method for solving the Serre-Green-Naghdi (SGN) equations describing dispersive waves on shallow water is proposed. From the mathematical point of view, the SGN equations are the Euler-Lagrange equations for a ‘master’ lagrangian submitted to a differential constraint which is the mass conservation law. One major numerical challenge in solving the SGN equations is the resolution of an elliptic problem at each time instant. This is the most time-consuming part of the numerical method. The idea is to replace the ‘master’ lagrangian by a one-parameter family of ‘augmented’ lagrangians, depending on a greater number of variables, for which the corresponding Euler-Lagrange equations are hyperbolic. In such an approach, the ‘master’ lagrangian is recovered by the augmented lagrangian in some limit (for example, when the corresponding parameter is large). The choice of such a family of augmented lagrangians is proposed and discussed. The corresponding hyperbolic system is numerically solved by a Godunov type method. Numerical solutions are compared with exact solutions to the SGN equations. It appears that the computational time in solving the hyperbolic system is much lower than in the case where the elliptic operator is inverted. The new method is applied, in particular, to the study of ‘Favre waves’ representing non-stationary undular bores produced after reflection of the fluid flow with a free surface at an immobile wall.

  15. Some results on the neutron transport and the coupling of equations

    International Nuclear Information System (INIS)

    Bal, G.

    1997-01-01

    Neutron transport in nuclear reactors is well modeled by the linear Boltzmann transport equation. Its resolution is relatively easy but very expensive. To achieve whole core calculations, one has to consider simpler models, such as diffusion or homogeneous transport equations. However, the solutions may become inaccurate in particular situations (as accidents for instance). That is the reason why we wish to solve the equations on small area accurately and more coarsely on the remaining part of the core. It is than necessary to introduce some links between different discretizations or modelizations. In this note, we give some results on the coupling of different discretizations of all degrees of freedom of the integral-differential neutron transport equation (two degrees for the angular variable, on for the energy component, and two or three degrees for spatial position respectively in 2D (cylindrical symmetry) and 3D). Two chapters are devoted to the coupling of discrete ordinates methods (for angular discretization). The first one is theoretical and shows the well posing of the coupled problem, whereas the second one deals with numerical applications of practical interest (the results have been obtained from the neutron transport code developed at the R and D, which has been modified for introducing the coupling). Next, we present the nodal scheme RTN0, used for the spatial discretization. We show well posing results for the non-coupled and the coupled problems. At the end, we deal with the coupling of energy discretizations for the multigroup equations obtained by homogenization. Some theoretical results of the discretization of the velocity variable (well-posing of problems), which do not deal directly with the purposes of coupling, are presented in the annexes. (author)

  16. From stochastic processes to numerical methods: A new scheme for solving reaction subdiffusion fractional partial differential equations

    Energy Technology Data Exchange (ETDEWEB)

    Angstmann, C.N.; Donnelly, I.C. [School of Mathematics and Statistics, UNSW Australia, Sydney NSW 2052 (Australia); Henry, B.I., E-mail: B.Henry@unsw.edu.au [School of Mathematics and Statistics, UNSW Australia, Sydney NSW 2052 (Australia); Jacobs, B.A. [School of Computer Science and Applied Mathematics, University of the Witwatersrand, Johannesburg, Private Bag 3, Wits 2050 (South Africa); DST–NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) (South Africa); Langlands, T.A.M. [Department of Mathematics and Computing, University of Southern Queensland, Toowoomba QLD 4350 (Australia); Nichols, J.A. [School of Mathematics and Statistics, UNSW Australia, Sydney NSW 2052 (Australia)

    2016-02-15

    We have introduced a new explicit numerical method, based on a discrete stochastic process, for solving a class of fractional partial differential equations that model reaction subdiffusion. The scheme is derived from the master equations for the evolution of the probability density of a sum of discrete time random walks. We show that the diffusion limit of the master equations recovers the fractional partial differential equation of interest. This limiting procedure guarantees the consistency of the numerical scheme. The positivity of the solution and stability results are simply obtained, provided that the underlying process is well posed. We also show that the method can be applied to standard reaction–diffusion equations. This work highlights the broader applicability of using discrete stochastic processes to provide numerical schemes for partial differential equations, including fractional partial differential equations.

  17. PSsolver: A Maple implementation to solve first order ordinary differential equations with Liouvillian solutions

    Science.gov (United States)

    Avellar, J.; Duarte, L. G. S.; da Mota, L. A. C. P.

    2012-10-01

    We present a set of software routines in Maple 14 for solving first order ordinary differential equations (FOODEs). The package implements the Prelle-Singer method in its original form together with its extension to include integrating factors in terms of elementary functions. The package also presents a theoretical extension to deal with all FOODEs presenting Liouvillian solutions. Applications to ODEs taken from standard references show that it solves ODEs which remain unsolved using Maple's standard ODE solution routines. New version program summary Program title: PSsolver Catalogue identifier: ADPR_v2_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADPR_v2_0.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.: 2302 No. of bytes in distributed program, including test data, etc.: 31962 Distribution format: tar.gz Programming language: Maple 14 (also tested using Maple 15 and 16). Computer: Intel Pentium Processor P6000, 1.86 GHz. Operating system: Windows 7. RAM: 4 GB DDR3 Memory Classification: 4.3. Catalogue identifier of previous version: ADPR_v1_0 Journal reference of previous version: Comput. Phys. Comm. 144 (2002) 46 Does the new version supersede the previous version?: Yes Nature of problem: Symbolic solution of first order differential equations via the Prelle-Singer method. Solution method: The method of solution is based on the standard Prelle-Singer method, with extensions for the cases when the FOODE contains elementary functions. Additionally, an extension of our own which solves FOODEs with Liouvillian solutions is included. Reasons for new version: The program was not running anymore due to changes in the latest versions of Maple. Additionally, we corrected/changed some bugs/details that were hampering the smoother functioning of the routines. Summary

  18. Solving vertical transport and chemistry in air pollution models

    NARCIS (Netherlands)

    Berkvens, P.J.F.; Bochev, M.A.; Krol, M.C.; Peters, W.; Verwer, J.G.; Chock, David P.; Carmichael, Gregory R.; Brick, Patricia

    2002-01-01

    For the time integration of stiff transport-chemistry problems from air pollution modelling, standard ODE solvers are not feasible due to the large number of species and the 3D nature. The popular alternative, standard operator splitting, introduces artificial transients for short-lived species.

  19. Solving Vertical Transport and Chemistry in Air Pollution Models

    NARCIS (Netherlands)

    Berkvens, P.J.F.; Bochev, M.A.; Verwer, J.G.; Krol, M.C.; Peters, W.

    For the time integration of stiff transport-chemistry problems from air pollution modelling, standard ODE solvers are not feasible due to the large number of species and the 3D nature. The popular alternative, standard operator splitting, introduces artificial transients for short-lived species.

  20. A nearly orthogonal 2D grid system in solving the shallow water equations in the head bay of Bengal

    International Nuclear Information System (INIS)

    Roy, G.D. . E.mail: roy_gd@hotmail.com; Hussain, Farzana . E.mail: farzana@sust.edu

    2001-11-01

    A typical nearly orthogonal grid system is considered to solve the shallow water equations along the head bay of Bengal. A pencil of straight lines at uniform angular distance through a suitable origin, O at the mean sea level (MSL), are considered as a system of grid lines. A system of concentric and uniformly distributed ellipses with center at O is considered as the other system of grid lines. In order to solve the shallow water equations numerically, a system of transformations is applied so that the grid system in the transformed domain becomes a rectangular one. Shallow water equations are solved using appropriate initial and boundary conditions to estimate the water level due to tide and surge. The typical grid system is found to be suitable in incorporating the bending of the coastline and the island boundaries accurately in the numerical scheme along the coast of Bangladesh. (author)