A Price-Based Demand Response Scheme for Discrete Manufacturing in Smart Grids

Directory of Open Access Journals (Sweden)

Zhe Luo

2016-08-01

Full Text Available Demand response (DR is a key technique in smart grid (SG technologies for reducing energy costs and maintaining the stability of electrical grids. Since manufacturing is one of the major consumers of electrical energy, implementing DR in factory energy management systems (FEMSs provides an effective way to manage energy in manufacturing processes. Although previous studies have investigated DR applications in process manufacturing, they were not conducted for discrete manufacturing. In this study, the state-task network (STN model is implemented to represent a discrete manufacturing system. On this basis, a DR scheme with a specific DR algorithm is applied to a typical discrete manufacturing—automobile manufacturing—and operational scenarios are established for the stamping process of the automobile production line. The DR scheme determines the optimal operating points for the stamping process using mixed integer linear programming (MILP. The results show that parts of the electricity demand can be shifted from peak to off-peak periods, reducing a significant overall energy costs without degrading production processes.

Spectral collocation method with a flexible angular discretization scheme for radiative transfer in multi-layer graded index medium

Science.gov (United States)

Wei, Linyang; Qi, Hong; Sun, Jianping; Ren, Yatao; Ruan, Liming

2017-05-01

The spectral collocation method (SCM) is employed to solve the radiative transfer in multi-layer semitransparent medium with graded index. A new flexible angular discretization scheme is employed to discretize the solid angle domain freely to overcome the limit of the number of discrete radiative direction when adopting traditional SN discrete ordinate scheme. Three radial basis function interpolation approaches, named as multi-quadric (MQ), inverse multi-quadric (IMQ) and inverse quadratic (IQ) interpolation, are employed to couple the radiative intensity at the interface between two adjacent layers and numerical experiments show that MQ interpolation has the highest accuracy and best stability. Variable radiative transfer problems in double-layer semitransparent media with different thermophysical properties are investigated and the influence of these thermophysical properties on the radiative transfer procedure in double-layer semitransparent media is also analyzed. All the simulated results show that the present SCM with the new angular discretization scheme can predict the radiative transfer in multi-layer semitransparent medium with graded index efficiently and accurately.

Discrete maximal regularity of time-stepping schemes for fractional evolution equations.

Science.gov (United States)

Jin, Bangti; Li, Buyang; Zhou, Zhi

2018-01-01

In this work, we establish the maximal [Formula: see text]-regularity for several time stepping schemes for a fractional evolution model, which involves a fractional derivative of order [Formula: see text], [Formula: see text], in time. These schemes include convolution quadratures generated by backward Euler method and second-order backward difference formula, the L1 scheme, explicit Euler method and a fractional variant of the Crank-Nicolson method. The main tools for the analysis include operator-valued Fourier multiplier theorem due to Weis (Math Ann 319:735-758, 2001. doi:10.1007/PL00004457) and its discrete analogue due to Blunck (Stud Math 146:157-176, 2001. doi:10.4064/sm146-2-3). These results generalize the corresponding results for parabolic problems.

Development of a discrete gas-kinetic scheme for simulation of two-dimensional viscous incompressible and compressible flows.

Science.gov (United States)

Yang, L M; Shu, C; Wang, Y

2016-03-01

In this work, a discrete gas-kinetic scheme (DGKS) is presented for simulation of two-dimensional viscous incompressible and compressible flows. This scheme is developed from the circular function-based GKS, which was recently proposed by Shu and his co-workers [L. M. Yang, C. Shu, and J. Wu, J. Comput. Phys. 274, 611 (2014)]. For the circular function-based GKS, the integrals for conservation forms of moments in the infinity domain for the Maxwellian function-based GKS are simplified to those integrals along the circle. As a result, the explicit formulations of conservative variables and fluxes are derived. However, these explicit formulations of circular function-based GKS for viscous flows are still complicated, which may not be easy for the application by new users. By using certain discrete points to represent the circle in the phase velocity space, the complicated formulations can be replaced by a simple solution process. The basic requirement is that the conservation forms of moments for the circular function-based GKS can be accurately satisfied by weighted summation of distribution functions at discrete points. In this work, it is shown that integral quadrature by four discrete points on the circle, which forms the D2Q4 discrete velocity model, can exactly match the integrals. Numerical results showed that the present scheme can provide accurate numerical results for incompressible and compressible viscous flows with roughly the same computational cost as that needed by the Roe scheme.

Fully discrete Galerkin schemes for the nonlinear and nonlocal Hartree equation

Directory of Open Access Journals (Sweden)

Walter H. Aschbacher

2009-01-01

Full Text Available We study the time dependent Hartree equation in the continuum, the semidiscrete, and the fully discrete setting. We prove existence-uniqueness, regularity, and approximation properties for the respective schemes, and set the stage for a controlled numerical computation of delicate nonlinear and nonlocal features of the Hartree dynamics in various physical applications.

Development of discrete gas kinetic scheme for simulation of 3D viscous incompressible and compressible flows

Science.gov (United States)

Yang, L. M.; Shu, C.; Wang, Y.; Sun, Y.

2016-08-01

The sphere function-based gas kinetic scheme (GKS), which was presented by Shu and his coworkers [23] for simulation of inviscid compressible flows, is extended to simulate 3D viscous incompressible and compressible flows in this work. Firstly, we use certain discrete points to represent the spherical surface in the phase velocity space. Then, integrals along the spherical surface for conservation forms of moments, which are needed to recover 3D Navier-Stokes equations, are approximated by integral quadrature. The basic requirement is that these conservation forms of moments can be exactly satisfied by weighted summation of distribution functions at discrete points. It was found that the integral quadrature by eight discrete points on the spherical surface, which forms the D3Q8 discrete velocity model, can exactly match the integral. In this way, the conservative variables and numerical fluxes can be computed by weighted summation of distribution functions at eight discrete points. That is, the application of complicated formulations resultant from integrals can be replaced by a simple solution process. Several numerical examples including laminar flat plate boundary layer, 3D lid-driven cavity flow, steady flow through a 90° bending square duct, transonic flow around DPW-W1 wing and supersonic flow around NACA0012 airfoil are chosen to validate the proposed scheme. Numerical results demonstrate that the present scheme can provide reasonable numerical results for 3D viscous flows.

Applications of high-resolution spatial discretization scheme and Jacobian-free Newton–Krylov method in two-phase flow problems

International Nuclear Information System (INIS)

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2015-01-01

Highlights: • Using high-resolution spatial scheme in solving two-phase flow problems. • Fully implicit time integrations scheme. • Jacobian-free Newton–Krylov method. • Analytical solution for two-phase water faucet problem. - Abstract: The majority of the existing reactor system analysis codes were developed using low-order numerical schemes in both space and time. In many nuclear thermal–hydraulics applications, it is desirable to use higher-order numerical schemes to reduce numerical errors. High-resolution spatial discretization schemes provide high order spatial accuracy in smooth regions and capture sharp spatial discontinuity without nonphysical spatial oscillations. In this work, we adapted an existing high-resolution spatial discretization scheme on staggered grids in two-phase flow applications. Fully implicit time integration schemes were also implemented to reduce numerical errors from operator-splitting types of time integration schemes. The resulting nonlinear system has been successfully solved using the Jacobian-free Newton–Krylov (JFNK) method. The high-resolution spatial discretization and high-order fully implicit time integration numerical schemes were tested and numerically verified for several two-phase test problems, including a two-phase advection problem, a two-phase advection with phase appearance/disappearance problem, and the water faucet problem. Numerical results clearly demonstrated the advantages of using such high-resolution spatial and high-order temporal numerical schemes to significantly reduce numerical diffusion and therefore improve accuracy. Our study also demonstrated that the JFNK method is stable and robust in solving two-phase flow problems, even when phase appearance/disappearance exists

Minimax approach problem with incomplete information for the two-level hierarchical discrete-time dynamical system

Energy Technology Data Exchange (ETDEWEB)

Shorikov, A. F. [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia and Institute of Mathematics and Mechanics, Ural Division of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)

2014-11-18

We consider a discrete-time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector linear or convex discrete-time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solution.

Finite volume schemes with equilibrium type discretization of source terms for scalar conservation laws

International Nuclear Information System (INIS)

Botchorishvili, Ramaz; Pironneau, Olivier

2003-01-01

We develop here a new class of finite volume schemes on unstructured meshes for scalar conservation laws with stiff source terms. The schemes are of equilibrium type, hence with uniform bounds on approximate solutions, valid in cell entropy inequalities and exact for some equilibrium states. Convergence is investigated in the framework of kinetic schemes. Numerical tests show high computational efficiency and a significant advantage over standard cell centered discretization of source terms. Equilibrium type schemes produce accurate results even on test problems for which the standard approach fails. For some numerical tests they exhibit exponential type convergence rate. In two of our numerical tests an equilibrium type scheme with 441 nodes on a triangular mesh is more accurate than a standard scheme with 5000 2 grid points

Improvements on nonlinear gyrokinetic particle simulations based on δf-discretization scheme

International Nuclear Information System (INIS)

Zorat, R.; Tessarotto, M.

1998-01-01

In this work various issues regarding the definition of improved theoretical models appropriate to describe the dynamics of confined magnetoplasmas by particle simulation methods are proposed. These concern in particular an improved non linear δf discretization scheme and the treatment of binary, i.e. Coulomb, and collective interactions. (orig.)

LevelScheme: A level scheme drawing and scientific figure preparation system for Mathematica

Science.gov (United States)

Caprio, M. A.

2005-09-01

LevelScheme is a scientific figure preparation system for Mathematica. The main emphasis is upon the construction of level schemes, or level energy diagrams, as used in nuclear, atomic, molecular, and hadronic physics. LevelScheme also provides a general infrastructure for the preparation of publication-quality figures, including support for multipanel and inset plotting, customizable tick mark generation, and various drawing and labeling tasks. Coupled with Mathematica's plotting functions and powerful programming language, LevelScheme provides a flexible system for the creation of figures combining diagrams, mathematical plots, and data plots. Program summaryTitle of program:LevelScheme Catalogue identifier:ADVZ Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVZ Operating systems:Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux Programming language used:Mathematica 4 Number of bytes in distributed program, including test and documentation:3 051 807 Distribution format:tar.gz Nature of problem:Creation of level scheme diagrams. Creation of publication-quality multipart figures incorporating diagrams and plots. Method of solution:A set of Mathematica packages has been developed, providing a library of level scheme drawing objects, tools for figure construction and labeling, and control code for producing the graphics.

New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes

International Nuclear Information System (INIS)

Karras, D A; Mertzios, G B

2009-01-01

A novel approach is presented in this paper for improving anisotropic diffusion PDE models, based on the Perona–Malik equation. A solution is proposed from an engineering perspective to adaptively estimate the parameters of the regularizing function in this equation. The goal of such a new adaptive diffusion scheme is to better preserve edges when the anisotropic diffusion PDE models are applied to image enhancement tasks. The proposed adaptive parameter estimation in the anisotropic diffusion PDE model involves self-organizing maps and Bayesian inference to define edge probabilities accurately. The proposed modifications attempt to capture not only simple edges but also difficult textural edges and incorporate their probability in the anisotropic diffusion model. In the context of the application of PDE models to image processing such adaptive schemes are closely related to the discrete image representation problem and the investigation of more suitable discretization algorithms using constraints derived from image processing theory. The proposed adaptive anisotropic diffusion model illustrates these concepts when it is numerically approximated by various discretization schemes in a database of magnetic resonance images (MRI), where it is shown to be efficient in image filtering and restoration applications

A novel two-level dynamic parallel data scheme for large 3-D SN calculations

International Nuclear Information System (INIS)

Sjoden, G.E.; Shedlock, D.; Haghighat, A.; Yi, C.

2005-01-01

We introduce a new dynamic parallel memory optimization scheme for executing large scale 3-D discrete ordinates (Sn) simulations on distributed memory parallel computers. In order for parallel transport codes to be truly scalable, they must use parallel data storage, where only the variables that are locally computed are locally stored. Even with parallel data storage for the angular variables, cumulative storage requirements for large discrete ordinates calculations can be prohibitive. To address this problem, Memory Tuning has been implemented into the PENTRAN 3-D parallel discrete ordinates code as an optimized, two-level ('large' array, 'small' array) parallel data storage scheme. Memory Tuning can be described as the process of parallel data memory optimization. Memory Tuning dynamically minimizes the amount of required parallel data in allocated memory on each processor using a statistical sampling algorithm. This algorithm is based on the integral average and standard deviation of the number of fine meshes contained in each coarse mesh in the global problem. Because PENTRAN only stores the locally computed problem phase space, optimal two-level memory assignments can be unique on each node, depending upon the parallel decomposition used (hybrid combinations of angular, energy, or spatial). As demonstrated in the two large discrete ordinates models presented (a storage cask and an OECD MOX Benchmark), Memory Tuning can save a substantial amount of memory per parallel processor, allowing one to accomplish very large scale Sn computations. (authors)

A fully discrete energy stable scheme for a phase filed moving contact line model with variable densities and viscosities

KAUST Repository

Zhu, Guangpu; Chen, Huangxin; Sun, Shuyu; Yao, Jun

2018-01-01

In this paper, a fully discrete scheme which considers temporal and spatial discretizations is presented for the coupled Cahn-Hilliard equation in conserved form with the dynamic contact line condition and the Navier-Stokes equation

Numerical schemes for explosion hazards

International Nuclear Information System (INIS)

Therme, Nicolas

2015-01-01

In nuclear facilities, internal or external explosions can cause confinement breaches and radioactive materials release in the environment. Hence, modeling such phenomena is crucial for safety matters. Blast waves resulting from explosions are modeled by the system of Euler equations for compressible flows, whereas Navier-Stokes equations with reactive source terms and level set techniques are used to simulate the propagation of flame front during the deflagration phase. The purpose of this thesis is to contribute to the creation of efficient numerical schemes to solve these complex models. The work presented here focuses on two major aspects: first, the development of consistent schemes for the Euler equations, then the buildup of reliable schemes for the front propagation. In both cases, explicit in time schemes are used, but we also introduce a pressure correction scheme for the Euler equations. Staggered discretization is used in space. It is based on the internal energy formulation of the Euler system, which insures its positivity and avoids tedious discretization of the total energy over staggered grids. A discrete kinetic energy balance is derived from the scheme and a source term is added in the discrete internal energy balance equation to preserve the exact total energy balance at the limit. High order methods of MUSCL type are used in the discrete convective operators, based solely on material velocity. They lead to positivity of density and internal energy under CFL conditions. This ensures that the total energy cannot grow and we can furthermore derive a discrete entropy inequality. Under stability assumptions of the discrete L8 and BV norms of the scheme's solutions one can prove that a sequence of converging discrete solutions necessarily converges towards the weak solution of the Euler system. Besides it satisfies a weak entropy inequality at the limit. Concerning the front propagation, we transform the flame front evolution equation (the so called

Conservative numerical schemes for Euler-Lagrange equations

Energy Technology Data Exchange (ETDEWEB)

Vazquez, L. [Universidad Complutense, Madrid (Spain). Dept. de Matematica Aplicada; Jimenez, S. [Universidad Alfonso X El Sabio, Madrid (Spain). Dept. de Matematica Aplicada

1999-05-01

As a preliminary step to study magnetic field lines, the authors seek numerical schemes that reproduce at discrete level the significant feature of the continuous model, based on an underling Lagrangian structure. The resulting scheme give discrete counterparts of the variation law for the energy as well of as the Euler-Lagrange equations and their symmetries.

An induced charge readout scheme incorporating image charge splitting on discrete pixels

International Nuclear Information System (INIS)

Kataria, D.O.; Lapington, J.S.

2003-01-01

Top hat electrostatic analysers used in space plasma instruments typically use microchannel plates (MCPs) followed by discrete pixel anode readout for the angular definition of the incoming particles. Better angular definition requires more pixels/readout electronics channels but with stringent mass and power budgets common in space applications, the number of channels is restricted. We describe here a technique that improves the angular definition using induced charge and an interleaved anode pattern. The technique adopts the readout philosophy used on the CRRES and CLUSTER I instruments but has the advantages of the induced charge scheme and significantly reduced capacitance. Charge from the MCP collected by an anode pixel is inductively split onto discrete pixels whose geometry can be tailored to suit the scientific requirements of the instrument. For our application, the charge is induced over two pixels. One of them is used for a coarse angular definition but is read out by a single channel of electronics, allowing a higher rate handling. The other provides a finer angular definition but is interleaved and hence carries the expense of lower rate handling. Using the technique and adding four channels of electronics, a four-fold increase in the angular resolution is obtained. Details of the scheme and performance results are presented

A Discrete Numerical Scheme of Modified Leslie-Gower With Harvesting Model

Directory of Open Access Journals (Sweden)

Riski Nur Istiqomah Dinnullah

2018-05-01

Full Text Available Recently, exploitation of biological resources and the harvesting of two populations or more are widely practiced, such as fishery or foresty. The simplest way to describe the interaction of two species is by using predator prey model, that is one species feeds on another. The Leslie-Gower predator prey model has been studied in many works. In this paper, we use Euler method to discretisize the modified Leslie-Gower with harvesting model. The model consists of two simultanious predator prey equations. We show numerically that this discrete numerical scheme model is dynamically consistent with its continuous model only for relatively small step-size. By using computer simulation software, we show that equlibrium points can be stable, saddles, and unstable. It is shown that the numerical simulations not only illustrate the results, but also show the rich dynamics behaviors of the discrete system.

Gamma spectrometry; level schemes

International Nuclear Information System (INIS)

Blachot, J.; Bocquet, J.P.; Monnand, E.; Schussler, F.

1977-01-01

The research presented dealt with: a new beta emitter, isomer of 131 Sn; the 136 I levels fed through the radioactive decay of 136 Te (20.9s); the A=145 chain (β decay of Ba, La and Ce, and level schemes for 145 La, 145 Ce, 145 Pr); the A=47 chain (La and Ce, β decay, and the level schemes of 147 Ce and 147 Pr) [fr

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.

2017-05-23

A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy otherwise. The mimetic character of many of the DEC operators provides exact conservation of both mass and vorticity, in addition to superior kinetic energy conservation. The employment of barycentric Hodge star allows the discretization to admit arbitrary simplicial meshes. The discretization scheme is presented along with various numerical test cases demonstrating its main characteristics.

Three-dimensional coupled Monte Carlo-discrete ordinates computational scheme for shielding calculations of large and complex nuclear facilities

International Nuclear Information System (INIS)

Chen, Y.; Fischer, U.

2005-01-01

Shielding calculations of advanced nuclear facilities such as accelerator based neutron sources or fusion devices of the tokamak type are complicated due to their complex geometries and their large dimensions, including bulk shields of several meters thickness. While the complexity of the geometry in the shielding calculation can be hardly handled by the discrete ordinates method, the deep penetration of radiation through bulk shields is a severe challenge for the Monte Carlo particle transport technique. This work proposes a dedicated computational scheme for coupled Monte Carlo-Discrete Ordinates transport calculations to handle this kind of shielding problems. The Monte Carlo technique is used to simulate the particle generation and transport in the target region with both complex geometry and reaction physics, and the discrete ordinates method is used to treat the deep penetration problem in the bulk shield. The coupling scheme has been implemented in a program system by loosely integrating the Monte Carlo transport code MCNP, the three-dimensional discrete ordinates code TORT and a newly developed coupling interface program for mapping process. Test calculations were performed with comparison to MCNP solutions. Satisfactory agreements were obtained between these two approaches. The program system has been chosen to treat the complicated shielding problem of the accelerator-based IFMIF neutron source. The successful application demonstrates that coupling scheme with the program system is a useful computational tool for the shielding analysis of complex and large nuclear facilities. (authors)

ON THE CONSTRUCTION OF PARTIAL DIFFERENCE SCHEMES II: DISCRETE VARIABLES AND SCHWARZIAN LATTICES

Directory of Open Access Journals (Sweden)

Decio Levi

2016-06-01

Full Text Available In the process of constructing invariant difference schemes which approximate partial differential equations we write down a procedure for discretizing a partial differential equation on an arbitrary lattice. An open problem is the meaning of a lattice which does not satisfy the Clairaut–Schwarz–Young theorem. To analyze it we apply the procedure on a simple example, the potential Burgers equation with two different lattices, an orthogonal lattice which is invariant under the symmetries of the equation and satisfies the commutativity of the partial difference operators and an exponential lattice which is not invariant and does not satisfy the Clairaut–Schwarz–Young theorem. A discussion on the numerical results is presented showing the different behavior of both schemes for two different exact solutions and their numerical approximations.

Discrete ellipsoidal statistical BGK model and Burnett equations

Science.gov (United States)

Zhang, Yu-Dong; Xu, Ai-Guo; Zhang, Guang-Cai; Chen, Zhi-Hua; Wang, Pei

2018-06-01

A new discrete Boltzmann model, the discrete ellipsoidal statistical Bhatnagar-Gross-Krook (ESBGK) model, is proposed to simulate nonequilibrium compressible flows. Compared with the original discrete BGK model, the discrete ES-BGK has a flexible Prandtl number. For the discrete ES-BGK model in the Burnett level, two kinds of discrete velocity model are introduced and the relations between nonequilibrium quantities and the viscous stress and heat flux in the Burnett level are established. The model is verified via four benchmark tests. In addition, a new idea is introduced to recover the actual distribution function through the macroscopic quantities and their space derivatives. The recovery scheme works not only for discrete Boltzmann simulation but also for hydrodynamic ones, for example, those based on the Navier-Stokes or the Burnett equations.

Discrete control systems

CERN Document Server

Okuyama, Yoshifumi

2014-01-01

Discrete Control Systems establishes a basis for the analysis and design of discretized/quantized control systemsfor continuous physical systems. Beginning with the necessary mathematical foundations and system-model descriptions, the text moves on to derive a robust stability condition. To keep a practical perspective on the uncertain physical systems considered, most of the methods treated are carried out in the frequency domain. As part of the design procedure, modified Nyquist–Hall and Nichols diagrams are presented and discretized proportional–integral–derivative control schemes are reconsidered. Schemes for model-reference feedback and discrete-type observers are proposed. Although single-loop feedback systems form the core of the text, some consideration is given to multiple loops and nonlinearities. The robust control performance and stability of interval systems (with multiple uncertainties) are outlined. Finally, the monograph describes the relationship between feedback-control and discrete ev...

A more accurate scheme for calculating Earth's skin temperature

Science.gov (United States)

Tsuang, Ben-Jei; Tu, Chia-Ying; Tsai, Jeng-Lin; Dracup, John A.; Arpe, Klaus; Meyers, Tilden

2009-02-01

The theoretical framework of the vertical discretization of a ground column for calculating Earth’s skin temperature is presented. The suggested discretization is derived from the evenly heat-content discretization with the optimal effective thickness for layer-temperature simulation. For the same level number, the suggested discretization is more accurate in skin temperature as well as surface ground heat flux simulations than those used in some state-of-the-art models. A proposed scheme (“op(3,2,0)”) can reduce the normalized root-mean-square error (or RMSE/STD ratio) of the calculated surface ground heat flux of a cropland site significantly to 2% (or 0.9 W m-2), from 11% (or 5 W m-2) by a 5-layer scheme used in ECMWF, from 19% (or 8 W m-2) by a 5-layer scheme used in ECHAM, and from 74% (or 32 W m-2) by a single-layer scheme used in the UCLA GCM. Better accuracy can be achieved by including more layers to the vertical discretization. Similar improvements are expected for other locations with different land types since the numerical error is inherited into the models for all the land types. The proposed scheme can be easily implemented into state-of-the-art climate models for the temperature simulation of snow, ice and soil.

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea; Kyza, Irene; Nochetto, Ricardo H.

2013-01-01

on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time

Ambiguity attacks on robust blind image watermarking scheme based on redundant discrete wavelet transform and singular value decomposition

Directory of Open Access Journals (Sweden)

Khaled Loukhaoukha

2017-12-01

Full Text Available Among emergent applications of digital watermarking are copyright protection and proof of ownership. Recently, Makbol and Khoo (2013 have proposed for these applications a new robust blind image watermarking scheme based on the redundant discrete wavelet transform (RDWT and the singular value decomposition (SVD. In this paper, we present two ambiguity attacks on this algorithm that have shown that this algorithm fails when used to provide robustness applications like owner identification, proof of ownership, and transaction tracking. Keywords: Ambiguity attack, Image watermarking, Singular value decomposition, Redundant discrete wavelet transform

Two-level schemes for the advection equation

Science.gov (United States)

Vabishchevich, Petr N.

2018-06-01

The advection equation is the basis for mathematical models of continuum mechanics. In the approximate solution of nonstationary problems it is necessary to inherit main properties of the conservatism and monotonicity of the solution. In this paper, the advection equation is written in the symmetric form, where the advection operator is the half-sum of advection operators in conservative (divergent) and non-conservative (characteristic) forms. The advection operator is skew-symmetric. Standard finite element approximations in space are used. The standard explicit two-level scheme for the advection equation is absolutely unstable. New conditionally stable regularized schemes are constructed, on the basis of the general theory of stability (well-posedness) of operator-difference schemes, the stability conditions of the explicit Lax-Wendroff scheme are established. Unconditionally stable and conservative schemes are implicit schemes of the second (Crank-Nicolson scheme) and fourth order. The conditionally stable implicit Lax-Wendroff scheme is constructed. The accuracy of the investigated explicit and implicit two-level schemes for an approximate solution of the advection equation is illustrated by the numerical results of a model two-dimensional problem.

Galerkin v. discrete-optimal projection in nonlinear model reduction

Energy Technology Data Exchange (ETDEWEB)

Carlberg, Kevin Thomas [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Barone, Matthew Franklin [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Antil, Harbir [George Mason Univ., Fairfax, VA (United States)

2015-04-01

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes. We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.

Integrable discretizations of the short pulse equation

International Nuclear Information System (INIS)

Feng Baofeng; Maruno, Ken-ichi; Ohta, Yasuhiro

2010-01-01

In this paper, we propose integrable semi-discrete and full-discrete analogues of the short pulse (SP) equation. The key construction is the bilinear form and determinant structure of solutions of the SP equation. We also give the determinant formulas of N-soliton solutions of the semi-discrete and full-discrete analogues of the SP equations, from which the multi-loop and multi-breather solutions can be generated. In the continuous limit, the full-discrete SP equation converges to the semi-discrete SP equation, and then to the continuous SP equation. Based on the semi-discrete SP equation, an integrable numerical scheme, i.e. a self-adaptive moving mesh scheme, is proposed and used for the numerical computation of the short pulse equation.

Statistical interpretation of low energy nuclear level schemes

Energy Technology Data Exchange (ETDEWEB)

Egidy, T von; Schmidt, H H; Behkami, A N

1988-01-01

Nuclear level schemes and neutron resonance spacings yield information on level densities and level spacing distributions. A total of 75 nuclear level schemes with 1761 levels and known spins and parities was investigated. The A-dependence of level density parameters is discussed. The spacing distributions of levels near the groundstate indicate transitional character between regular and chaotic properties while chaos dominates near the neutron binding energy.

Averaged multivalued solutions and time discretization for conservation laws

International Nuclear Information System (INIS)

Brenier, Y.

1985-01-01

It is noted that the correct shock solutions can be approximated by averaging in some sense the multivalued solution given by the method of characteristics for the nonlinear scalar conservation law (NSCL). A time discretization for the NSCL equation based on this principle is considered. An equivalent analytical formulation is shown to lead quite easily to a convergence result, and a third formulation is introduced which can be generalized for the systems of conservation laws. Various numerical schemes are constructed from the proposed time discretization. The first family of schemes is obtained by using a spatial grid and projecting the results of the time discretization. Many known schemes are then recognized (mainly schemes by Osher, Roe, and LeVeque). A second way to discretize leads to a particle scheme without space grid, which is very efficient (at least in the scalar case). Finally, a close relationship between the proposed method and the Boltzmann type schemes is established. 14 references

On 165Ho level scheme

International Nuclear Information System (INIS)

Ardisson, Claire; Ardisson, Gerard.

1976-01-01

A 165 Ho level scheme was constructed which led to the interpretation of sixty γ rays belonging to the decay of 165 Dy. A new 702.9keV level was identified to be the 5/2 - member of the 1/2 ) 7541{ Nilsson orbit. )] [fr

A coarse-mesh diffusion synthetic acceleration of the scattering source iteration scheme for one-speed slab-geometry discrete ordinates problems

International Nuclear Information System (INIS)

Santos, Frederico P.; Alves Filho, Hermes; Barros, Ricardo C.; Xavier, Vinicius S.

2011-01-01

The scattering source iterative (SI) scheme is traditionally applied to converge fine-mesh numerical solutions to fixed-source discrete ordinates (S N ) neutron transport problems. The SI scheme is very simple to implement under a computational viewpoint. However, the SI scheme may show very slow convergence rate, mainly for diffusive media (low absorption) with several mean free paths in extent. In this work we describe an acceleration technique based on an improved initial guess for the scattering source distribution within the slab. In other words, we use as initial guess for the fine-mesh scattering source, the coarse-mesh solution of the neutron diffusion equation with special boundary conditions to account for the classical S N prescribed boundary conditions, including vacuum boundary conditions. Therefore, we first implement a spectral nodal method that generates coarse-mesh diffusion solution that is completely free from spatial truncation errors, then we reconstruct this coarse-mesh solution within each spatial cell of the discretization grid, to further yield the initial guess for the fine-mesh scattering source in the first S N transport sweep (μm > 0 and μm < 0, m = 1:N) across the spatial grid. We consider a number of numerical experiments to illustrate the efficiency of the offered diffusion synthetic acceleration (DSA) technique. (author)

Pressure correction schemes for compressible flows

International Nuclear Information System (INIS)

Kheriji, W.

2011-01-01

This thesis is concerned with the development of semi-implicit fractional step schemes, for the compressible Navier-Stokes equations; these schemes are part of the class of the pressure correction methods. The chosen spatial discretization is staggered: non conforming mixed finite elements (Crouzeix-Raviart or Rannacher-Turek) or the classic MA C scheme. An upwind finite volume discretization of the mass balance guarantees the positivity of the density. The positivity of the internal energy is obtained by discretizing the internal energy balance by an upwind finite volume scheme and b y coupling the discrete internal energy balance with the pressure correction step. A special finite volume discretization on dual cells is performed for the convection term in the momentum balance equation, and a renormalisation step for the pressure is added to the algorithm; this ensures the control in time of the integral of the total energy over the domain. All these a priori estimates imply the existence of a discrete solution by a topological degree argument. The application of this scheme to Euler equations raises an additional difficulty. Indeed, obtaining correct shocks requires the scheme to be consistent with the total energy balance, property which we obtain as follows. First of all, a local discrete kinetic energy balance is established; it contains source terms winch we somehow compensate in the internal energy balance. The kinetic and internal energy equations are associated with the dual and primal meshes respectively, and thus cannot be added to obtain a total energy balance; its continuous counterpart is however recovered at the limit: if we suppose that a sequence of discrete solutions converges when the space and time steps tend to 0, we indeed show, in 1D at least, that the limit satisfies a weak form of the equation. These theoretical results are comforted by numerical tests. Similar results are obtained for the baro-tropic Navier-Stokes equations. (author)

Asynchronous Two-Level Checkpointing Scheme for Large-Scale Adjoints in the Spectral-Element Solver Nek5000

Energy Technology Data Exchange (ETDEWEB)

Schanen, Michel; Marin, Oana; Zhang, Hong; Anitescu, Mihai

2016-01-01

Adjoints are an important computational tool for large-scale sensitivity evaluation, uncertainty quantification, and derivative-based optimization. An essential component of their performance is the storage/recomputation balance in which efficient checkpointing methods play a key role. We introduce a novel asynchronous two-level adjoint checkpointing scheme for multistep numerical time discretizations targeted at large-scale numerical simulations. The checkpointing scheme combines bandwidth-limited disk checkpointing and binomial memory checkpointing. Based on assumptions about the target petascale systems, which we later demonstrate to be realistic on the IBM Blue Gene/Q system Mira, we create a model of the expected performance of our checkpointing approach and validate it using the highly scalable Navier-Stokes spectralelement solver Nek5000 on small to moderate subsystems of the Mira supercomputer. In turn, this allows us to predict optimal algorithmic choices when using all of Mira. We also demonstrate that two-level checkpointing is significantly superior to single-level checkpointing when adjoining a large number of time integration steps. To our knowledge, this is the first time two-level checkpointing had been designed, implemented, tuned, and demonstrated on fluid dynamics codes at large scale of 50k+ cores.

A parallel 3-D discrete wavelet transform architecture using pipelined lifting scheme approach for video coding

Science.gov (United States)

Hegde, Ganapathi; Vaya, Pukhraj

2013-10-01

This article presents a parallel architecture for 3-D discrete wavelet transform (3-DDWT). The proposed design is based on the 1-D pipelined lifting scheme. The architecture is fully scalable beyond the present coherent Daubechies filter bank (9, 7). This 3-DDWT architecture has advantages such as no group of pictures restriction and reduced memory referencing. It offers low power consumption, low latency and high throughput. The computing technique is based on the concept that lifting scheme minimises the storage requirement. The application specific integrated circuit implementation of the proposed architecture is done by synthesising it using 65 nm Taiwan Semiconductor Manufacturing Company standard cell library. It offers a speed of 486 MHz with a power consumption of 2.56 mW. This architecture is suitable for real-time video compression even with large frame dimensions.

Tightly Secure Signatures From Lossy Identification Schemes

OpenAIRE

Abdalla , Michel; Fouque , Pierre-Alain; Lyubashevsky , Vadim; Tibouchi , Mehdi

2015-01-01

International audience; In this paper, we present three digital signature schemes with tight security reductions in the random oracle model. Our first signature scheme is a particularly efficient version of the short exponent discrete log-based scheme of Girault et al. (J Cryptol 19(4):463–487, 2006). Our scheme has a tight reduction to the decisional short discrete logarithm problem, while still maintaining the non-tight reduction to the computational version of the problem upon which the or...

A coarse-mesh diffusion synthetic acceleration of the source iteration scheme for one-speed discrete ordinates transport calculations in Slab geometry

International Nuclear Information System (INIS)

Santos, Frederico P.; Xavier, Vinicius S.; Alves Filho, Hermes; Barros, Ricardo C.

2011-01-01

The scattering source iterative (SI) scheme is traditionally applied to converge fine-mesh numerical solutions to fixed-source discrete ordinates (S N ) neutron transport problems. The SI scheme is very simple to implement under a computational viewpoint. However, the SI scheme may show very slow convergence rate, mainly for diffusive media (low absorption) with several mean free paths in extent. In this work we describe an acceleration technique based on an improved initial guess for the scattering source distribution within the slab. In other words, we use as initial guess for the fine-mesh scattering source, the coarse-mesh solution of the neutron diffusion equation with special boundary conditions to account for the classical S N prescribed boundary conditions, including vacuum boundary conditions. Therefore, we first implement a spectral nodal method that generates coarse-mesh diffusion solution that is completely free from spatial truncation errors, then we reconstruct this coarse-mesh solution within each spatial cell of the discretization grid, to further yield the initial guess for the fine-mesh scattering source in the first S N transport sweep (μm > 0 and μm < 0, m = 1:N) across the spatial grid. We consider a number of numerical experiments to illustrate the efficiency of the offered diffusion synthetic acceleration (DSA) technique. (author)

Convergence of a semi-discretization scheme for the Hamilton-Jacobi equation: A new approach with the adjoint method

KAUST Repository

Cagnetti, Filippo; Gomes, Diogo A.; Tran, Hung Vinh

2013-01-01

We consider a numerical scheme for the one dimensional time dependent Hamilton-Jacobi equation in the periodic setting. This scheme consists in a semi-discretization using monotone approximations of the Hamiltonian in the spacial variable. From classical viscosity solution theory, these schemes are known to converge. In this paper we present a new approach to the study of the rate of convergence of the approximations based on the nonlinear adjoint method recently introduced by L.C. Evans. We estimate the rate of convergence for convex Hamiltonians and recover the O(h) convergence rate in terms of the L∞ norm and O(h) in terms of the L1 norm, where h is the size of the spacial grid. We discuss also possible generalizations to higher dimensional problems and present several other additional estimates. The special case of quadratic Hamiltonians is considered in detail in the end of the paper. © 2013 IMACS.

Convergence of a semi-discretization scheme for the Hamilton-Jacobi equation: A new approach with the adjoint method

KAUST Repository

Cagnetti, Filippo

2013-11-01

We consider a numerical scheme for the one dimensional time dependent Hamilton-Jacobi equation in the periodic setting. This scheme consists in a semi-discretization using monotone approximations of the Hamiltonian in the spacial variable. From classical viscosity solution theory, these schemes are known to converge. In this paper we present a new approach to the study of the rate of convergence of the approximations based on the nonlinear adjoint method recently introduced by L.C. Evans. We estimate the rate of convergence for convex Hamiltonians and recover the O(h) convergence rate in terms of the L∞ norm and O(h) in terms of the L1 norm, where h is the size of the spacial grid. We discuss also possible generalizations to higher dimensional problems and present several other additional estimates. The special case of quadratic Hamiltonians is considered in detail in the end of the paper. © 2013 IMACS.

Efficiency and Flexibility of Fingerprint Scheme Using Partial Encryption and Discrete Wavelet Transform to Verify User in Cloud Computing.

Science.gov (United States)

Yassin, Ali A

2014-01-01

Now, the security of digital images is considered more and more essential and fingerprint plays the main role in the world of image. Furthermore, fingerprint recognition is a scheme of biometric verification that applies pattern recognition techniques depending on image of fingerprint individually. In the cloud environment, an adversary has the ability to intercept information and must be secured from eavesdroppers. Unluckily, encryption and decryption functions are slow and they are often hard. Fingerprint techniques required extra hardware and software; it is masqueraded by artificial gummy fingers (spoof attacks). Additionally, when a large number of users are being verified at the same time, the mechanism will become slow. In this paper, we employed each of the partial encryptions of user's fingerprint and discrete wavelet transform to obtain a new scheme of fingerprint verification. Moreover, our proposed scheme can overcome those problems; it does not require cost, reduces the computational supplies for huge volumes of fingerprint images, and resists well-known attacks. In addition, experimental results illustrate that our proposed scheme has a good performance of user's fingerprint verification.

A modified symplectic PRK scheme for seismic wave modeling

Science.gov (United States)

Liu, Shaolin; Yang, Dinghui; Ma, Jian

2017-02-01

A new scheme for the temporal discretization of the seismic wave equation is constructed based on symplectic geometric theory and a modified strategy. The ordinary differential equation in terms of time, which is obtained after spatial discretization via the spectral-element method, is transformed into a Hamiltonian system. A symplectic partitioned Runge-Kutta (PRK) scheme is used to solve the Hamiltonian system. A term related to the multiplication of the spatial discretization operator with the seismic wave velocity vector is added into the symplectic PRK scheme to create a modified symplectic PRK scheme. The symplectic coefficients of the new scheme are determined via Taylor series expansion. The positive coefficients of the scheme indicate that its long-term computational capability is more powerful than that of conventional symplectic schemes. An exhaustive theoretical analysis reveals that the new scheme is highly stable and has low numerical dispersion. The results of three numerical experiments demonstrate the high efficiency of this method for seismic wave modeling.

Stepwise latent class models for explaining group-level putcomes using discrete individual-level predictors

NARCIS (Netherlands)

Bennink, Margot; Croon, M.A.; Vermunt, J.K.

2015-01-01

Explaining group-level outcomes from individual-level predictors requires aggregating the individual-level scores to the group level and correcting the group-level estimates for measurement errors in the aggregated scores. However, for discrete variables it is not clear how to perform the

Local bounds preserving stabilization for continuous Galerkin discretization of hyperbolic systems

Science.gov (United States)

Mabuza, Sibusiso; Shadid, John N.; Kuzmin, Dmitri

2018-05-01

The objective of this paper is to present a local bounds preserving stabilized finite element scheme for hyperbolic systems on unstructured meshes based on continuous Galerkin (CG) discretization in space. A CG semi-discrete scheme with low order artificial dissipation that satisfies the local extremum diminishing (LED) condition for systems is used to discretize a system of conservation equations in space. The low order artificial diffusion is based on approximate Riemann solvers for hyperbolic conservation laws. In this case we consider both Rusanov and Roe artificial diffusion operators. In the Rusanov case, two designs are considered, a nodal based diffusion operator and a local projection stabilization operator. The result is a discretization that is LED and has first order convergence behavior. To achieve high resolution, limited antidiffusion is added back to the semi-discrete form where the limiter is constructed from a linearity preserving local projection stabilization operator. The procedure follows the algebraic flux correction procedure usually used in flux corrected transport algorithms. To further deal with phase errors (or terracing) common in FCT type methods, high order background dissipation is added to the antidiffusive correction. The resulting stabilized semi-discrete scheme can be discretized in time using a wide variety of time integrators. Numerical examples involving nonlinear scalar Burgers equation, and several shock hydrodynamics simulations for the Euler system are considered to demonstrate the performance of the method. For time discretization, Crank-Nicolson scheme and backward Euler scheme are utilized.

Finite Volume Element (FVE) discretization and multilevel solution of the axisymmetric heat equation

Science.gov (United States)

Litaker, Eric T.

1994-12-01

The axisymmetric heat equation, resulting from a point-source of heat applied to a metal block, is solved numerically; both iterative and multilevel solutions are computed in order to compare the two processes. The continuum problem is discretized in two stages: finite differences are used to discretize the time derivatives, resulting is a fully implicit backward time-stepping scheme, and the Finite Volume Element (FVE) method is used to discretize the spatial derivatives. The application of the FVE method to a problem in cylindrical coordinates is new, and results in stencils which are analyzed extensively. Several iteration schemes are considered, including both Jacobi and Gauss-Seidel; a thorough analysis of these schemes is done, using both the spectral radii of the iteration matrices and local mode analysis. Using this discretization, a Gauss-Seidel relaxation scheme is used to solve the heat equation iteratively. A multilevel solution process is then constructed, including the development of intergrid transfer and coarse grid operators. Local mode analysis is performed on the components of the amplification matrix, resulting in the two-level convergence factors for various combinations of the operators. A multilevel solution process is implemented by using multigrid V-cycles; the iterative and multilevel results are compared and discussed in detail. The computational savings resulting from the multilevel process are then discussed.

Euler-Poincare reduction for discrete field theories

International Nuclear Information System (INIS)

Vankerschaver, Joris

2007-01-01

In this note, we develop a theory of Euler-Poincare reduction for discrete Lagrangian field theories. We introduce the concept of Euler-Poincare equations for discrete field theories, as well as a natural extension of the Moser-Veselov scheme, and show that both are equivalent. The resulting discrete field equations are interpreted in terms of discrete differential geometry. An application to the theory of discrete harmonic mappings is also briefly discussed

Multiscale solutions of radiative heat transfer by the discrete unified gas kinetic scheme

Science.gov (United States)

Luo, Xiao-Ping; Wang, Cun-Hai; Zhang, Yong; Yi, Hong-Liang; Tan, He-Ping

2018-06-01

The radiative transfer equation (RTE) has two asymptotic regimes characterized by the optical thickness, namely, optically thin and optically thick regimes. In the optically thin regime, a ballistic or kinetic transport is dominant. In the optically thick regime, energy transport is totally dominated by multiple collisions between photons; that is, the photons propagate by means of diffusion. To obtain convergent solutions to the RTE, conventional numerical schemes have a strong dependence on the number of spatial grids, which leads to a serious computational inefficiency in the regime where the diffusion is predominant. In this work, a discrete unified gas kinetic scheme (DUGKS) is developed to predict radiative heat transfer in participating media. Numerical performances of the DUGKS are compared in detail with conventional methods through three cases including one-dimensional transient radiative heat transfer, two-dimensional steady radiative heat transfer, and three-dimensional multiscale radiative heat transfer. Due to the asymptotic preserving property, the present method with relatively coarse grids gives accurate and reliable numerical solutions for large, small, and in-between values of optical thickness, and, especially in the optically thick regime, the DUGKS demonstrates a pronounced computational efficiency advantage over the conventional numerical models. In addition, the DUGKS has a promising potential in the study of multiscale radiative heat transfer inside the participating medium with a transition from optically thin to optically thick regimes.

An extended discrete gradient formula for oscillatory Hamiltonian systems

International Nuclear Information System (INIS)

Liu Kai; Shi Wei; Wu Xinyuan

2013-01-01

In this paper, incorporating the idea of the discrete gradient method into the extended Runge–Kutta–Nyström integrator, we derive and analyze an extended discrete gradient formula for the oscillatory Hamiltonian system with the Hamiltonian H(p,q)= 1/2 p T p+ 1/2 q T Mq+U(q), where q:R→R d represents generalized positions, p:R→R d represents generalized momenta and M is an element of R dxd is a symmetric and positive semi-definite matrix. The solution of this system is a nonlinear oscillator. Basically, many nonlinear oscillatory mechanical systems with a partitioned Hamiltonian function lend themselves to this approach. The extended discrete gradient formula presented in this paper exactly preserves the energy H(p, q). We derive some properties of the new formula. The convergence is analyzed for the implicit schemes based on the discrete gradient formula, and it turns out that the convergence of the implicit schemes based on the extended discrete gradient formula is independent of ‖M‖, which is a significant property for the oscillatory Hamiltonian system. Thus, it transpires that a larger step size can be chosen for the new energy-preserving schemes than that for the traditional discrete gradient methods when applied to the oscillatory Hamiltonian system. Illustrative examples show the competence and efficiency of the new schemes in comparison with the traditional discrete gradient methods in the scientific literature. (paper)

Discretisation Schemes for Level Sets of Planar Gaussian Fields

Science.gov (United States)

Beliaev, D.; Muirhead, S.

2018-01-01

Smooth random Gaussian functions play an important role in mathematical physics, a main example being the random plane wave model conjectured by Berry to give a universal description of high-energy eigenfunctions of the Laplacian on generic compact manifolds. Our work is motivated by questions about the geometry of such random functions, in particular relating to the structure of their nodal and level sets. We study four discretisation schemes that extract information about level sets of planar Gaussian fields. Each scheme recovers information up to a different level of precision, and each requires a maximum mesh-size in order to be valid with high probability. The first two schemes are generalisations and enhancements of similar schemes that have appeared in the literature (Beffara and Gayet in Publ Math IHES, 2017. https://doi.org/10.1007/s10240-017-0093-0; Mischaikow and Wanner in Ann Appl Probab 17:980-1018, 2007); these give complete topological information about the level sets on either a local or global scale. As an application, we improve the results in Beffara and Gayet (2017) on Russo-Seymour-Welsh estimates for the nodal set of positively-correlated planar Gaussian fields. The third and fourth schemes are, to the best of our knowledge, completely new. The third scheme is specific to the nodal set of the random plane wave, and provides global topological information about the nodal set up to `visible ambiguities'. The fourth scheme gives a way to approximate the mean number of excursion domains of planar Gaussian fields.

GRAP, Gamma-Ray Level-Scheme Assignment

International Nuclear Information System (INIS)

Franklyn, C.B.

2002-01-01

1 - Description of program or function: An interactive program for allocating gamma-rays to an energy level scheme. Procedure allows for searching for new candidate levels of the form: 1) L1 + G(A) + G(B) = L2; 2) G(A) + G(B) = G(C); 3) G(A) + G(B) = C (C is a user defined number); 4) L1 + G(A) + G(B) + G(C) = L2. Procedure indicates intensity balance of feed and decay of each energy level. Provides for optimization of a level energy (and associated error). Overall procedure allows for pre-defining of certain gamma-rays as belonging to particular regions of the level scheme, for example, high energy transition levels, or due to beta- decay. 2 - Method of solution: Search for cases in which the energy difference between two energy levels is equal to a gamma-ray energy within user-defined limits. 3 - Restrictions on the complexity of the problem: Maximum number of gamma-rays: 999; Maximum gamma ray energy: 32000 units; Minimum gamma ray energy: 10 units; Maximum gamma-ray intensity: 32000 units; Minimum gamma-ray intensity: 0.001 units; Maximum number of levels: 255; Maximum level energy: 32000 units; Minimum level energy: 10 units; Maximum error on energy, intensity: 32 units; Minimum error on energy, intensity: 0.001 units; Maximum number of combinations: 6400 (ca); Maximum number of gamma-ray types : 127

A numerical method for the quasi-incompressible Cahn–Hilliard–Navier–Stokes equations for variable density flows with a discrete energy law

International Nuclear Information System (INIS)

Guo, Z.; Lin, P.; Lowengrub, J.S.

2014-01-01

In this paper, we investigate numerically a diffuse interface model for the Navier–Stokes equation with fluid–fluid interface when the fluids have different densities [48]. Under minor reformulation of the system, we show that there is a continuous energy law underlying the system, assuming that all variables have reasonable regularities. It is shown in the literature that an energy law preserving method will perform better for multiphase problems. Thus for the reformulated system, we design a C 0 finite element method and a special temporal scheme where the energy law is preserved at the discrete level. Such a discrete energy law (almost the same as the continuous energy law) for this variable density two-phase flow model has never been established before with C 0 finite element. A Newton method is introduced to linearise the highly non-linear system of our discretization scheme. Some numerical experiments are carried out using the adaptive mesh to investigate the scenario of coalescing and rising drops with differing density ratio. The snapshots for the evolution of the interface together with the adaptive mesh at different times are presented to show that the evolution, including the break-up/pinch-off of the drop, can be handled smoothly by our numerical scheme. The discrete energy functional for the system is examined to show that the energy law at the discrete level is preserved by our scheme

The splitting in potential Crank-Nicolson scheme with discrete transparent boundary conditions for the Schroedinger equation on a semi-infinite strip

International Nuclear Information System (INIS)

Ducomet, Bernard; Zlotnik, Alexander; Zlotnik, Ilya

2014-01-01

We consider an initial-boundary value problem for a generalized 2D time-dependent Schroedinger equation (with variable coefficients) on a semi-infinite strip. For the Crank-Nicolson-type finite-difference scheme with approximate or discrete transparent boundary conditions (TBCs), the Strang-type splitting with respect to the potential is applied. For the resulting method, the unconditional uniform in time L2-stability is proved. Due to the splitting, an effective direct algorithm using FFT is developed now to implement the method with the discrete TBC for general potential. Numerical results on the tunnel effect for rectangular barriers are included together with the detailed practical error analysis confirming nice properties of the method. (authors)

A parametric level-set method for partially discrete tomography

NARCIS (Netherlands)

A. Kadu (Ajinkya); T. van Leeuwen (Tristan); K.J. Batenburg (Joost)

2017-01-01

textabstractThis paper introduces a parametric level-set method for tomographic reconstruction of partially discrete images. Such images consist of a continuously varying background and an anomaly with a constant (known) grey-value. We express the geometry of the anomaly using a level-set function,

Analysis of central and upwind compact schemes

International Nuclear Information System (INIS)

Sengupta, T.K.; Ganeriwal, G.; De, S.

2003-01-01

Central and upwind compact schemes for spatial discretization have been analyzed with respect to accuracy in spectral space, numerical stability and dispersion relation preservation. A von Neumann matrix spectral analysis is developed here to analyze spatial discretization schemes for any explicit and implicit schemes to investigate the full domain simultaneously. This allows one to evaluate various boundary closures and their effects on the domain interior. The same method can be used for stability analysis performed for the semi-discrete initial boundary value problems (IBVP). This analysis tells one about the stability for every resolved length scale. Some well-known compact schemes that were found to be G-K-S and time stable are shown here to be unstable for selective length scales by this analysis. This is attributed to boundary closure and we suggest special boundary treatment to remove this shortcoming. To demonstrate the asymptotic stability of the resultant schemes, numerical solution of the wave equation is compared with analytical solution. Furthermore, some of these schemes are used to solve two-dimensional Navier-Stokes equation and a computational acoustic problem to check their ability to solve problems for long time. It is found that those schemes, that were found unstable for the wave equation, are unsuitable for solving incompressible Navier-Stokes equation. In contrast, the proposed compact schemes with improved boundary closure and an explicit higher-order upwind scheme produced correct results. The numerical solution for the acoustic problem is compared with the exact solution and the quality of the match shows that the used compact scheme has the requisite DRP property

How update schemes influence crowd simulations

International Nuclear Information System (INIS)

Seitz, Michael J; Köster, Gerta

2014-01-01

Time discretization is a key modeling aspect of dynamic computer simulations. In current pedestrian motion models based on discrete events, e.g. cellular automata and the Optimal Steps Model, fixed-order sequential updates and shuffle updates are prevalent. We propose to use event-driven updates that process events in the order they occur, and thus better match natural movement. In addition, we present a parallel update with collision detection and resolution for situations where computational speed is crucial. Two simulation studies serve to demonstrate the practical impact of the choice of update scheme. Not only do density-speed relations differ, but there is a statistically significant effect on evacuation times. Fixed-order sequential and random shuffle updates with a short update period come close to event-driven updates. The parallel update scheme overestimates evacuation times. All schemes can be employed for arbitrary simulation models with discrete events, such as car traffic or animal behavior. (paper)

Theoretical Basics of Teaching Discrete Mathematics

Directory of Open Access Journals (Sweden)

Y. A. Perminov

2012-01-01

Full Text Available  The paper deals with the research findings concerning the process of mastering the theoretical basics of discrete mathematics by the students of vocational pedagogic profile. The methodological analysis is based on the subject and functions of the modern discrete mathematics and its role in mathematical modeling and computing. The modern discrete mathematics (i.e. mathematics of the finite type structures plays the important role in modernization of vocational training. It is especially rele- vant to training students for vocational pedagogic qualifications, as in the future they will be responsible for training the middle and the senior level specialists in engineer- ing and technical spheres. Nowadays in different industries, there arise the problems which require for their solving both continual – based on the classical mathematical methods – and discrete modeling. The teaching course of discrete mathematics for the future vocational teachers should be relevant to the target qualification and aimed at mastering the mathematical modeling, systems of computer mathematics and computer technologies. The author emphasizes the fundamental role of mastering the language of algebraic and serial structures, as well as the logical, algorithmic, combinatory schemes dominating in dis- crete mathematics. The guidelines for selecting the content of the course in discrete mathematics are specified. The theoretical findings of the research can be put into practice whilst developing curricula and working programs for bachelors and masters’ training. 

Progress with multigrid schemes for hypersonic flow problems

International Nuclear Information System (INIS)

Radespiel, R.; Swanson, R.C.

1995-01-01

Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm employs upwind spatial discretization with explicit multistage time stepping. Two-level versions of the various multigrid algorithms are applied to the two-dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving three different hypersonic flow problems. Some new multigrid schemes based on semicoarsening strategies are shown to be quite effective in relieving the stiffness caused by the high-aspect-ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 X 10 6 and Mach numbers up to 25. 32 refs., 31 figs., 1 tab

Optimized waveform relaxation domain decomposition method for discrete finite volume non stationary convection diffusion equation

International Nuclear Information System (INIS)

Berthe, P.M.

2013-01-01

In the context of nuclear waste repositories, we consider the numerical discretization of the non stationary convection diffusion equation. Discontinuous physical parameters and heterogeneous space and time scales lead us to use different space and time discretizations in different parts of the domain. In this work, we choose the discrete duality finite volume (DDFV) scheme and the discontinuous Galerkin scheme in time, coupled by an optimized Schwarz waveform relaxation (OSWR) domain decomposition method, because this allows the use of non-conforming space-time meshes. The main difficulty lies in finding an upwind discretization of the convective flux which remains local to a sub-domain and such that the multi domain scheme is equivalent to the mono domain one. These difficulties are first dealt with in the one-dimensional context, where different discretizations are studied. The chosen scheme introduces a hybrid unknown on the cell interfaces. The idea of up winding with respect to this hybrid unknown is extended to the DDFV scheme in the two-dimensional setting. The well-posedness of the scheme and of an equivalent multi domain scheme is shown. The latter is solved by an OSWR algorithm, the convergence of which is proved. The optimized parameters in the Robin transmission conditions are obtained by studying the continuous or discrete convergence rates. Several test-cases, one of which inspired by nuclear waste repositories, illustrate these results. (author) [fr

Adaptive Control and Function Projective Synchronization in 2D Discrete-Time Chaotic Systems

International Nuclear Information System (INIS)

Li Yin; Chen Yong; Li Biao

2009-01-01

This study addresses the adaptive control and function projective synchronization problems between 2D Rulkov discrete-time system and Network discrete-time system. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate the function projective synchronization of discrete-time chaotic systems. In addition, the adaptive control function is applied to achieve the state synchronization of two discrete-time systems. Numerical results demonstrate the effectiveness of the proposed control scheme.

Variational discretization of the nonequilibrium thermodynamics of simple systems

Science.gov (United States)

Gay-Balmaz, François; Yoshimura, Hiroaki

2018-04-01

In this paper, we develop variational integrators for the nonequilibrium thermodynamics of simple closed systems. These integrators are obtained by a discretization of the Lagrangian variational formulation of nonequilibrium thermodynamics developed in (Gay-Balmaz and Yoshimura 2017a J. Geom. Phys. part I 111 169–93 Gay-Balmaz and Yoshimura 2017b J. Geom. Phys. part II 111 194–212) and thus extend the variational integrators of Lagrangian mechanics, to include irreversible processes. In the continuous setting, we derive the structure preserving property of the flow of such systems. This property is an extension of the symplectic property of the flow of the Euler–Lagrange equations. In the discrete setting, we show that the discrete flow solution of our numerical scheme verifies a discrete version of this property. We also present the regularity conditions which ensure the existence of the discrete flow. We finally illustrate our discrete variational schemes with the implementation of an example of a simple and closed system.

Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

KAUST Repository

Mohamed, Mamdouh S.

2016-02-11

A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

Discrete exterior calculus discretization of incompressible Navier-Stokes equations over surface simplicial meshes

Science.gov (United States)

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-05-01

A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

On the mixed discretization of the time domain magnetic field integral equation

KAUST Repository

Ulku, Huseyin Arda

2012-09-01

Time domain magnetic field integral equation (MFIE) is discretized using divergence-conforming Rao-Wilton-Glisson (RWG) and curl-conforming Buffa-Christiansen (BC) functions as spatial basis and testing functions, respectively. The resulting mixed discretization scheme, unlike the classical scheme which uses RWG functions as both basis and testing functions, is proper: Testing functions belong to dual space of the basis functions. Numerical results demonstrate that the marching on-in-time (MOT) solution of the mixed discretized MFIE yields more accurate results than that of classically discretized MFIE. © 2012 IEEE.

Symmetric coupling of angular momenta, quadratic algebras and discrete polynomials

International Nuclear Information System (INIS)

Aquilanti, V; Marinelli, D; Marzuoli, A

2014-01-01

Eigenvalues and eigenfunctions of the volume operator, associated with the symmetric coupling of three SU(2) angular momentum operators, can be analyzed on the basis of a discrete Schrödinger–like equation which provides a semiclassical Hamiltonian picture of the evolution of a 'quantum of space', as shown by the authors in [1]. Emphasis is given here to the formalization in terms of a quadratic symmetry algebra and its automorphism group. This view is related to the Askey scheme, the hierarchical structure which includes all hypergeometric polynomials of one (discrete or continuous) variable. Key tool for this comparative analysis is the duality operation defined on the generators of the quadratic algebra and suitably extended to the various families of overlap functions (generalized recoupling coefficients). These families, recognized as lying at the top level of the Askey scheme, are classified and a few limiting cases are addressed

Function Projective Synchronization in Discrete-Time Chaotic System with Uncertain Parameters

International Nuclear Information System (INIS)

Chen Yong; Li Xin

2009-01-01

The function projective synchronization of discrete-time chaotic systems is presented. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate function projective synchronization (FPS) of discrete-time chaotic systems with uncertain parameters. With the aid of symbolic-numeric computation, we use the proposed scheme to illustrate FPS between two identical 3D Henon-like maps with uncertain parameters. Numeric simulations are used to verify the effectiveness of our scheme. (general)

Introduction of hypermatrix and operator notation into a discrete mathematics simulation model of malignant tumour response to therapeutic schemes in vivo. Some operator properties.

Science.gov (United States)

Stamatakos, Georgios S; Dionysiou, Dimitra D

2009-10-21

The tremendous rate of accumulation of experimental and clinical knowledge pertaining to cancer dictates the development of a theoretical framework for the meaningful integration of such knowledge at all levels of biocomplexity. In this context our research group has developed and partly validated a number of spatiotemporal simulation models of in vivo tumour growth and in particular tumour response to several therapeutic schemes. Most of the modeling modules have been based on discrete mathematics and therefore have been formulated in terms of rather complex algorithms (e.g. in pseudocode and actual computer code). However, such lengthy algorithmic descriptions, although sufficient from the mathematical point of view, may render it difficult for an interested reader to readily identify the sequence of the very basic simulation operations that lie at the heart of the entire model. In order to both alleviate this problem and at the same time provide a bridge to symbolic mathematics, we propose the introduction of the notion of hypermatrix in conjunction with that of a discrete operator into the already developed models. Using a radiotherapy response simulation example we demonstrate how the entire model can be considered as the sequential application of a number of discrete operators to a hypermatrix corresponding to the dynamics of the anatomic area of interest. Subsequently, we investigate the operators' commutativity and outline the "summarize and jump" strategy aiming at efficiently and realistically address multilevel biological problems such as cancer. In order to clarify the actual effect of the composite discrete operator we present further simulation results which are in agreement with the outcome of the clinical study RTOG 83-02, thus strengthening the reliability of the model developed.

Entropy-stable summation-by-parts discretization of the Euler equations on general curved elements

Science.gov (United States)

Crean, Jared; Hicken, Jason E.; Del Rey Fernández, David C.; Zingg, David W.; Carpenter, Mark H.

2018-03-01

We present and analyze an entropy-stable semi-discretization of the Euler equations based on high-order summation-by-parts (SBP) operators. In particular, we consider general multidimensional SBP elements, building on and generalizing previous work with tensor-product discretizations. In the absence of dissipation, we prove that the semi-discrete scheme conserves entropy; significantly, this proof of nonlinear L2 stability does not rely on integral exactness. Furthermore, interior penalties can be incorporated into the discretization to ensure that the total (mathematical) entropy decreases monotonically, producing an entropy-stable scheme. SBP discretizations with curved elements remain accurate, conservative, and entropy stable provided the mapping Jacobian satisfies the discrete metric invariants; polynomial mappings at most one degree higher than the SBP operators automatically satisfy the metric invariants in two dimensions. In three-dimensions, we describe an elementwise optimization that leads to suitable Jacobians in the case of polynomial mappings. The properties of the semi-discrete scheme are verified and investigated using numerical experiments.

The new Exponential Directional Iterative (EDI) 3-D Sn scheme for parallel adaptive differencing

International Nuclear Information System (INIS)

Sjoden, G.E.

2005-01-01

The new Exponential Directional Iterative (EDI) discrete ordinates (Sn) scheme for 3-D Cartesian Coordinates is presented. The EDI scheme is a logical extension of the positive, efficient Exponential Directional Weighted (EDW) Sn scheme currently used as the third level of the adaptive spatial differencing algorithm in the PENTRAN parallel discrete ordinates solver. Here, the derivation and advantages of the EDI scheme are presented; EDI uses EDW-rendered exponential coefficients as initial starting values to begin a fixed point iteration of the exponential coefficients. One issue that required evaluation was an iterative cutoff criterion to prevent the application of an unstable fixed point iteration; although this was needed in some cases, it was readily treated with a default to EDW. Iterative refinement of the exponential coefficients in EDI typically converged in fewer than four fixed point iterations. Moreover, EDI yielded more accurate angular fluxes compared to the other schemes tested, particularly in streaming conditions. Overall, it was found that the EDI scheme was up to an order of magnitude more accurate than the EDW scheme on a given mesh interval in streaming cases, and is potentially a good candidate as a fourth-level differencing scheme in the PENTRAN adaptive differencing sequence. The 3-D Cartesian computational cost of EDI was only about 20% more than the EDW scheme, and about 40% more than Diamond Zero (DZ). More evaluation and testing are required to determine suitable upgrade metrics for EDI to be fully integrated into the current adaptive spatial differencing sequence in PENTRAN. (author)

Discrete event simulation of the ATLAS second level trigger

International Nuclear Information System (INIS)

Vermeulen, J.C.; Dankers, R.J.; Hunt, S.; Harris, F.; Hortnagl, C.; Erasov, A.; Bogaerts, A.

1998-01-01

Discrete event simulation is applied for determining the computing and networking resources needed for the ATLAS second level trigger. This paper discusses the techniques used and some of the results obtained so far for well defined laboratory configurations and for the full system

Schemes for Probabilistic Teleportation of an Unknown Three-Particle Three-Level Entangled State

Institute of Scientific and Technical Information of China (English)

无

2006-01-01

In this paper, two schemes for teleporting an unknown three-particle three-level entangled state are proposed. In the first scheme, two partial three-particle three-level entangled states are used as the quantum channels, while in the second scheme, three two-particle three-level non-maximally entangled states are employed as quantum channels.It is shown that the teleportation can be successfully realized with certain probability, for both two schemes, if a receiver adopts some appropriate unitary transformations. It is shown also that the successful probabilities of these two schemes are different.

Projective Synchronization of Chaotic Discrete Dynamical Systems via Linear State Error Feedback Control

Directory of Open Access Journals (Sweden)

Baogui Xin

2015-04-01

Full Text Available A projective synchronization scheme for a kind of n-dimensional discrete dynamical system is proposed by means of a linear feedback control technique. The scheme consists of master and slave discrete dynamical systems coupled by linear state error variables. A kind of novel 3-D chaotic discrete system is constructed, to which the test for chaos is applied. By using the stability principles of an upper or lower triangular matrix, two controllers for achieving projective synchronization are designed and illustrated with the novel systems. Lastly some numerical simulations are employed to validate the effectiveness of the proposed projective synchronization scheme.

Charge-conserving FEM-PIC schemes on general grids

International Nuclear Information System (INIS)

Campos Pinto, M.; Jund, S.; Salmon, S.; Sonnendruecker, E.

2014-01-01

Particle-In-Cell (PIC) solvers are a major tool for the understanding of the complex behavior of a plasma or a particle beam in many situations. An important issue for electromagnetic PIC solvers, where the fields are computed using Maxwell's equations, is the problem of discrete charge conservation. In this article, we aim at proposing a general mathematical formulation for charge-conserving finite-element Maxwell solvers coupled with particle schemes. In particular, we identify the finite-element continuity equations that must be satisfied by the discrete current sources for several classes of time-domain Vlasov-Maxwell simulations to preserve the Gauss law at each time step, and propose a generic algorithm for computing such consistent sources. Since our results cover a wide range of schemes (namely curl-conforming finite element methods of arbitrary degree, general meshes in two or three dimensions, several classes of time discretization schemes, particles with arbitrary shape factors and piecewise polynomial trajectories of arbitrary degree), we believe that they provide a useful roadmap in the design of high-order charge-conserving FEM-PIC numerical schemes. (authors)

Forcing scheme analysis for the axisymmetric lattice Boltzmann method under incompressible limit.

Science.gov (United States)

Zhang, Liangqi; Yang, Shiliang; Zeng, Zhong; Chen, Jie; Yin, Linmao; Chew, Jia Wei

2017-04-01

Because the standard lattice Boltzmann (LB) method is proposed for Cartesian Navier-Stokes (NS) equations, additional source terms are necessary in the axisymmetric LB method for representing the axisymmetric effects. Therefore, the accuracy and applicability of the axisymmetric LB models depend on the forcing schemes adopted for discretization of the source terms. In this study, three forcing schemes, namely, the trapezium rule based scheme, the direct forcing scheme, and the semi-implicit centered scheme, are analyzed theoretically by investigating their derived macroscopic equations in the diffusive scale. Particularly, the finite difference interpretation of the standard LB method is extended to the LB equations with source terms, and then the accuracy of different forcing schemes is evaluated for the axisymmetric LB method. Theoretical analysis indicates that the discrete lattice effects arising from the direct forcing scheme are part of the truncation error terms and thus would not affect the overall accuracy of the standard LB method with general force term (i.e., only the source terms in the momentum equation are considered), but lead to incorrect macroscopic equations for the axisymmetric LB models. On the other hand, the trapezium rule based scheme and the semi-implicit centered scheme both have the advantage of avoiding the discrete lattice effects and recovering the correct macroscopic equations. Numerical tests applied for validating the theoretical analysis show that both the numerical stability and the accuracy of the axisymmetric LB simulations are affected by the direct forcing scheme, which indicate that forcing schemes free of the discrete lattice effects are necessary for the axisymmetric LB method.

Random discrete Morse theory and a new library of triangulations

DEFF Research Database (Denmark)

Benedetti, Bruno; Lutz, Frank Hagen

2014-01-01

We introduce random discrete Morse theory as a computational scheme to measure the complexity of a triangulation. The idea is to try to quantify the frequency of discrete Morse matchings with few critical cells. Our measure will depend on the topology of the space, but also on how nicely the space...... is triangulated. The scheme we propose looks for optimal discrete Morse functions with an elementary random heuristic. Despite its naiveté, this approach turns out to be very successful even in the case of huge inputs. In our view, the existing libraries of examples in computational topology are “too easy......” for testing algorithms based on discrete Morse theory. We propose a new library containing more complicated (and thus more meaningful) test examples....

Optimized low-order explicit Runge-Kutta schemes for high- order spectral difference method

KAUST Repository

Parsani, Matteo

2012-01-01

Optimal explicit Runge-Kutta (ERK) schemes with large stable step sizes are developed for method-of-lines discretizations based on the spectral difference (SD) spatial discretization on quadrilateral grids. These methods involve many stages and provide the optimal linearly stable time step for a prescribed SD spectrum and the minimum leading truncation error coefficient, while admitting a low-storage implementation. Using a large number of stages, the new ERK schemes lead to efficiency improvements larger than 60% over standard ERK schemes for 4th- and 5th-order spatial discretization.

An energy recondensation method using the discrete generalized multigroup energy expansion theory

International Nuclear Information System (INIS)

Zhu Lei; Forget, Benoit

2011-01-01

Highlights: → Discrete-generalized multigroup method was implemented as a recondensation scheme. → Coarse group cross-sections were recondensed from core-level solution. → Neighboring effect of reflector and MOX bundle was improved. → Methodology was shown to be fully consistent when a flat angular flux approximation is used. - Abstract: In this paper, the discrete generalized multigroup (DGM) method was used to recondense the coarse group cross-sections using the core level solution, thus providing a correction for neighboring effect found at the core level. This approach was tested using a discrete ordinates implementation in both 1-D and 2-D. Results indicate that 2 or 3 iterations can substantially improve the flux and fission density errors associated with strong interfacial spectral changes as found in the presence of strong absorbers, reflector of mixed-oxide fuel. The methodology is also proven to be fully consistent with the multigroup methodology as long as a flat-flux approximation is used spatially.

Application of a discrete-energy, discrete-ordinates technique to the study of neutron transport in iron

International Nuclear Information System (INIS)

Ching, J.T.

1975-01-01

An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated which allows the development of a discrete-energy, discrete-ordinates method for the solution of radiation transport problems. The method utilizes a modified version of a cross section processing scheme devised for the moments method code BMT and the transport equation solution algorithm from the one-dimensional discrete-ordinates transport code ANISN. The combined system, identified as MOMANS, computes fluxes directly from point cross sections in a single operation. In the cross-section processing, the group averaging required for multigroup calculations is replaced by a fast numerical scheme capable of generating a set of transfer cross sections containing all the physical features of interest, thereby increasing the detail in the calculated results. Test calculations in which the discrete-energy method was compared with the multigroup method have shown that for the same energy grid (number of points = number of groups), the discrete-energy method is faster but somewhat less accurate than the multigroup method. However, the accuracy of the discrete-energy method increases rapidly as the spacing between energy points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum the discrete-energy method has therefore proven to be as accurate as, and more economical than, the multigroup technique. This was demonstrated by the application of the method to the study of the transport of neutrons in an iron sphere. Using the capability of the discrete-energy method for rapidly treating changes in cross-section sets, the propagation of neutrons from a 14 MeV source in a 22 cm radius sphere of iron was analyzed for sensitivity to changes in the microscopic scattering mechanisms

Introduction of Hypermatrix and Operator Notation into a Discrete Mathematics Simulation Model of Malignant Tumour Response to Therapeutic Schemes In Vivo. Some Operator Properties

Directory of Open Access Journals (Sweden)

Georgios S. Stamatakos

2009-10-01

Full Text Available The tremendous rate of accumulation of experimental and clinical knowledge pertaining to cancer dictates the development of a theoretical framework for the meaningful integration of such knowledge at all levels of biocomplexity. In this context our research group has developed and partly validated a number of spatiotemporal simulation models of in vivo tumour growth and in particular tumour response to several therapeutic schemes. Most of the modeling modules have been based on discrete mathematics and therefore have been formulated in terms of rather complex algorithms (e.g. in pseudocode and actual computer code. However, such lengthy algorithmic descriptions, although sufficient from the mathematical point of view, may render it difficult for an interested reader to readily identify the sequence of the very basic simulation operations that lie at the heart of the entire model. In order to both alleviate this problem and at the same time provide a bridge to symbolic mathematics, we propose the introduction of the notion of hypermatrix in conjunction with that of a discrete operator into the already developed models. Using a radiotherapy response simulation example we demonstrate how the entire model can be considered as the sequential application of a number of discrete operators to a hypermatrix corresponding to the dynamics of the anatomic area of interest. Subsequently, we investigate the operators’ commutativity and outline the “summarize and jump” strategy aiming at efficiently and realistically address multilevel biological problems such as cancer. In order to clarify the actual effect of the composite discrete operator we present further simulation results which are in agreement with the outcome of the clinical study RTOG 83–02, thus strengthening the reliability of the model developed.

Transport synthetic acceleration for long-characteristics assembly-level transport problems

Energy Technology Data Exchange (ETDEWEB)

Zika, M R; Adams, M L

2000-02-01

The authors apply the transport synthetic acceleration (TSA) scheme to the long-characteristics spatial discretization for the two-dimensional assembly-level transport problem. This synthetic method employs a simplified transport operator as its low-order approximation. Thus, in the acceleration step, the authors take advantage of features of the long-characteristics discretization that make it particularly well suited to assembly-level transport problems. The main contribution is to address difficulties unique to the long-characteristics discretization and produce a computationally efficient acceleration scheme. The combination of the long-characteristics discretization, opposing reflecting boundary conditions (which are present in assembly-level transport problems), and TSA presents several challenges. The authors devise methods for overcoming each of them in a computationally efficient way. Since the boundary angular data exist on different grids in the high- and low-order problems, they define restriction and prolongation operations specific to the method of long characteristics to map between the two grids. They implement the conjugate gradient (CG) method in the presence of opposing reflection boundary conditions to solve the TSA low-order equations. The CG iteration may be applied only to symmetric positive definite (SPD) matrices; they prove that the long-characteristics discretization yields an SPD matrix. They present results of the acceleration scheme on a simple test problem, a typical pressurized water reactor assembly, and a typical boiling water reactor assembly.

Transport synthetic acceleration for long-characteristics assembly-level transport problems

International Nuclear Information System (INIS)

Zika, M.R.; Adams, M.L.

2000-01-01

The authors apply the transport synthetic acceleration (TSA) scheme to the long-characteristics spatial discretization for the two-dimensional assembly-level transport problem. This synthetic method employs a simplified transport operator as its low-order approximation. Thus, in the acceleration step, the authors take advantage of features of the long-characteristics discretization that make it particularly well suited to assembly-level transport problems. The main contribution is to address difficulties unique to the long-characteristics discretization and produce a computationally efficient acceleration scheme. The combination of the long-characteristics discretization, opposing reflecting boundary conditions (which are present in assembly-level transport problems), and TSA presents several challenges. The authors devise methods for overcoming each of them in a computationally efficient way. Since the boundary angular data exist on different grids in the high- and low-order problems, they define restriction and prolongation operations specific to the method of long characteristics to map between the two grids. They implement the conjugate gradient (CG) method in the presence of opposing reflection boundary conditions to solve the TSA low-order equations. The CG iteration may be applied only to symmetric positive definite (SPD) matrices; they prove that the long-characteristics discretization yields an SPD matrix. They present results of the acceleration scheme on a simple test problem, a typical pressurized water reactor assembly, and a typical boiling water reactor assembly

Transport Synthetic Acceleration for Long-Characteristics Assembly-Level Transport Problems

International Nuclear Information System (INIS)

Zika, Michael R.; Adams, Marvin L.

2000-01-01

We apply the transport synthetic acceleration (TSA) scheme to the long-characteristics spatial discretization for the two-dimensional assembly-level transport problem. This synthetic method employs a simplified transport operator as its low-order approximation. Thus, in the acceleration step, we take advantage of features of the long-characteristics discretization that make it particularly well suited to assembly-level transport problems. Our main contribution is to address difficulties unique to the long-characteristics discretization and produce a computationally efficient acceleration scheme.The combination of the long-characteristics discretization, opposing reflecting boundary conditions (which are present in assembly-level transport problems), and TSA presents several challenges. We devise methods for overcoming each of them in a computationally efficient way. Since the boundary angular data exist on different grids in the high- and low-order problems, we define restriction and prolongation operations specific to the method of long characteristics to map between the two grids. We implement the conjugate gradient (CG) method in the presence of opposing reflection boundary conditions to solve the TSA low-order equations. The CG iteration may be applied only to symmetric positive definite (SPD) matrices; we prove that the long-characteristics discretization yields an SPD matrix. We present results of our acceleration scheme on a simple test problem, a typical pressurized water reactor assembly, and a typical boiling water reactor assembly

Adopting the EU sustainable performance scheme Level(s) in the Danish building sector

DEFF Research Database (Denmark)

Kanafani, Kai; Rasmussen, Freja Nygaard; Zimmermann, Regitze Kjær

2018-01-01

to life cycle assessment (LCA) requirements within the Level(s) scheme. As a measure for the Danish building sector’s LCA practice, the specifications for LCAbyg, the official Danish building LCA tool, is used. In 2017, the European commission’s Joint Research Centre has launched Level(s) as a vo...

Towards the ultimate variance-conserving convection scheme

International Nuclear Information System (INIS)

Os, J.J.A.M. van; Uittenbogaard, R.E.

2004-01-01

In the past various arguments have been used for applying kinetic energy-conserving advection schemes in numerical simulations of incompressible fluid flows. One argument is obeying the programmed dissipation by viscous stresses or by sub-grid stresses in Direct Numerical Simulation and Large Eddy Simulation, see e.g. [Phys. Fluids A 3 (7) (1991) 1766]. Another argument is that, according to e.g. [J. Comput. Phys. 6 (1970) 392; 1 (1966) 119], energy-conserving convection schemes are more stable i.e. by prohibiting a spurious blow-up of volume-integrated energy in a closed volume without external energy sources. In the above-mentioned references it is stated that nonlinear instability is due to spatial truncation rather than to time truncation and therefore these papers are mainly concerned with the spatial integration. In this paper we demonstrate that discretized temporal integration of a spatially variance-conserving convection scheme can induce non-energy conserving solutions. In this paper the conservation of the variance of a scalar property is taken as a simple model for the conservation of kinetic energy. In addition, the derivation and testing of a variance-conserving scheme allows for a clear definition of kinetic energy-conserving advection schemes for solving the Navier-Stokes equations. Consequently, we first derive and test a strictly variance-conserving space-time discretization for the convection term in the convection-diffusion equation. Our starting point is the variance-conserving spatial discretization of the convection operator presented by Piacsek and Williams [J. Comput. Phys. 6 (1970) 392]. In terms of its conservation properties, our variance-conserving scheme is compared to other spatially variance-conserving schemes as well as with the non-variance-conserving schemes applied in our shallow-water solver, see e.g. [Direct and Large-eddy Simulation Workshop IV, ERCOFTAC Series, Kluwer Academic Publishers, 2001, pp. 409-287

Discrete diffusion Lyman α radiative transfer

Science.gov (United States)

Smith, Aaron; Tsang, Benny T.-H.; Bromm, Volker; Milosavljević, Miloš

2018-06-01

Due to its accuracy and generality, Monte Carlo radiative transfer (MCRT) has emerged as the prevalent method for Lyα radiative transfer in arbitrary geometries. The standard MCRT encounters a significant efficiency barrier in the high optical depth, diffusion regime. Multiple acceleration schemes have been developed to improve the efficiency of MCRT but the noise from photon packet discretization remains a challenge. The discrete diffusion Monte Carlo (DDMC) scheme has been successfully applied in state-of-the-art radiation hydrodynamics (RHD) simulations. Still, the established framework is not optimal for resonant line transfer. Inspired by the DDMC paradigm, we present a novel extension to resonant DDMC (rDDMC) in which diffusion in space and frequency are treated on equal footing. We explore the robustness of our new method and demonstrate a level of performance that justifies incorporating the method into existing Lyα codes. We present computational speedups of ˜102-106 relative to contemporary MCRT implementations with schemes that skip scattering in the core of the line profile. This is because the rDDMC runtime scales with the spatial and frequency resolution rather than the number of scatterings—the latter is typically ∝τ0 for static media, or ∝(aτ0)2/3 with core-skipping. We anticipate new frontiers in which on-the-fly Lyα radiative transfer calculations are feasible in 3D RHD. More generally, rDDMC is transferable to any computationally demanding problem amenable to a Fokker-Planck approximation of frequency redistribution.

Long-time behaviour of discretizations of the simple pendulum equation

Energy Technology Data Exchange (ETDEWEB)

Cieslinski, Jan L [Uniwersytet w Bialymstoku, Wydzial Fizyki, ul. Lipowa 41, 15-424 Bialystok (Poland); Ratkiewicz, Boguslaw [Doctoral Studies, Wydzial Fizyki, Uniwersytet Adama Mickiewicza, Poznan (Poland)], E-mail: janek@alpha.uwb.edu.pl, E-mail: bograt@poczta.onet.pl

2009-03-13

We compare several discretizations of the simple pendulum equation in a series of numerical experiments. The stress is put on the long-time behaviour. The chosen numerical schemes are either symplectic maps or integrable (energy-preserving) maps, or both. Therefore, they preserve qualitative features of solutions (such as periodicity). We describe characteristic periodic time dependences of numerical estimates of the period and the amplitude, and explain them as systematic numerical by-effects produced by any method. Finally, we propose a new numerical scheme which is a modification of the discrete gradient method. This modified discrete gradient method preserves (almost exactly) the period of small oscillations for any time step.

Long-time behaviour of discretizations of the simple pendulum equation

International Nuclear Information System (INIS)

Cieslinski, Jan L; Ratkiewicz, Boguslaw

2009-01-01

We compare several discretizations of the simple pendulum equation in a series of numerical experiments. The stress is put on the long-time behaviour. The chosen numerical schemes are either symplectic maps or integrable (energy-preserving) maps, or both. Therefore, they preserve qualitative features of solutions (such as periodicity). We describe characteristic periodic time dependences of numerical estimates of the period and the amplitude, and explain them as systematic numerical by-effects produced by any method. Finally, we propose a new numerical scheme which is a modification of the discrete gradient method. This modified discrete gradient method preserves (almost exactly) the period of small oscillations for any time step

An analytical approach for a nodal scheme of two-dimensional neutron transport problems

International Nuclear Information System (INIS)

Barichello, L.B.; Cabrera, L.C.; Prolo Filho, J.F.

2011-01-01

Research highlights: → Nodal equations for a two-dimensional neutron transport problem. → Analytical Discrete Ordinates Method. → Numerical results compared with the literature. - Abstract: In this work, a solution for a two-dimensional neutron transport problem, in cartesian geometry, is proposed, on the basis of nodal schemes. In this context, one-dimensional equations are generated by an integration process of the multidimensional problem. Here, the integration is performed for the whole domain such that no iterative procedure between nodes is needed. The ADO method is used to develop analytical discrete ordinates solution for the one-dimensional integrated equations, such that final solutions are analytical in terms of the spatial variables. The ADO approach along with a level symmetric quadrature scheme, lead to a significant order reduction of the associated eigenvalues problems. Relations between the averaged fluxes and the unknown fluxes at the boundary are introduced as the usually needed, in nodal schemes, auxiliary equations. Numerical results are presented and compared with test problems.

Revisiting the level scheme of the proton emitter 151Lu

International Nuclear Information System (INIS)

Wang, F.; Sun, B.H.; Liu, Z.; Scholey, C.; Eeckhaudt, S.; Grahn, T.; Greenlees, P.T.; Jones, P.; Julin, R.; Juutinen, S.; Kettelhut, S.; Leino, M.; Nyman, M.; Rahkila, P.; Saren, J.; Sorri, J.; Uusitalo, J.; Ashley, S.F.; Cullen, I.J.; Garnsworthy, A.B.; Gelletly, W.; Jones, G.A.; Pietri, S.; Podolyak, Z.; Steer, S.; Thompson, N.J.; Walker, P.M.; Williams, S.; Bianco, L.; Darby, I.G.; Joss, D.T.; Page, R.D.; Pakarinen, J.; Rigby, S.; Cullen, D.M.; Khan, S.; Kishada, A.; Gomez-Hornillos, M.B.; Simpson, J.; Jenkins, D.G.; Niikura, M.; Seweryniak, D.; Shizuma, Toshiyuki

2015-01-01

An experiment aiming to search for new isomers in the region of proton emitter 151 Lu was performed at the Accelerator Laboratory of the University of Jyväskylä (JYFL), by combining the high resolution γ-ray array JUROGAM, gas-filled RITU separator and GREAT detectors with the triggerless total data readout acquisition (TDR) system. In this proceeding, we revisit the level scheme of 151 Lu by using the proton-tagging technique. A level scheme consistent with the latest experimental results is obtained, and 3 additional levels are identified at high excitation energies. (author)

Geometric Structure-Preserving Discretization Schemes for Nonlinear Elasticity

Science.gov (United States)

2015-08-13

sufficient conditions for the compatibility of displacement gradient and the existence of stress functions on non-contractible bodies. The main...conditions. 15.  SUBJECT TERMS geometric theory for nonlinear elasticity, discrete exterior calculus 16.  SECURITY CLASSIFICATION OF: 17.  LIMITATION...complex allows one to readily derive the necessary and sufficient conditions for the compatibility of displacement gradient and the existence of stress

Globally asymptotically stable analysis in a discrete time eco-epidemiological system

International Nuclear Information System (INIS)

Hu, Zengyun; Teng, Zhidong; Zhang, Tailei; Zhou, Qiming; Chen, Xi

2017-01-01

Highlights: • Dynamical behaviors of a discrete time eco-epidemiological system are discussed. • Global asymptotical stability of this system is obtained by an iteration scheme which can be expended to general dimensional discrete system. • More complex dynamical behaviors are obtained by numerical simulations. - Abstract: In this study, the dynamical behaviors of a discrete time eco-epidemiological system are discussed. The local stability, bifurcation and chaos are obtained. Moreover, the global asymptotical stability of this system is explored by an iteration scheme. The numerical simulations illustrate the theoretical results and exhibit the complex dynamical behaviors such as flip bifurcation, Hopf bifurcation and chaotic dynamical behaviors. Our main results provide an efficient method to analyze the global asymptotical stability for general three dimensional discrete systems.

About several classes of bi-orthogonal polynomials and discrete integrable systems

International Nuclear Information System (INIS)

Chang, Xiang-Ke; Chen, Xiao-Min; Hu, Xing-Biao; Tam, Hon-Wah

2015-01-01

By introducing some special bi-orthogonal polynomials, we derive the so-called discrete hungry quotient-difference (dhQD) algorithm and a system related to the QD-type discrete hungry Lotka–Volterra (QD-type dhLV) system, together with their Lax pairs. These two known equations can be regarded as extensions of the QD algorithm. When this idea is applied to a higher analogue of the discrete-time Toda (HADT) equation and the quotient–quotient-difference (QQD) scheme proposed by Spicer, Nijhoff and van der Kamp, two extended systems are constructed. We call these systems the hungry forms of the higher analogue discrete-time Toda (hHADT) equation and the quotient-quotient-difference (hQQD) scheme, respectively. In addition, the corresponding Lax pairs are provided. (paper)

Convergence of Cell Based Finite Volume Discretizations for Problems of Control in the Conduction Coefficients

DEFF Research Database (Denmark)

Evgrafov, Anton; Gregersen, Misha Marie; Sørensen, Mads Peter

2011-01-01

We present a convergence analysis of a cell-based finite volume (FV) discretization scheme applied to a problem of control in the coefficients of a generalized Laplace equation modelling, for example, a steady state heat conduction. Such problems arise in applications dealing with geometric optimal......, whereas the convergence of the coefficients happens only with respect to the "volumetric" Lebesgue measure. Additionally, depending on whether the stationarity conditions are stated for the discretized or the original continuous problem, two distinct concepts of stationarity at a discrete level arise. We...... provide characterizations of limit points, with respect to FV mesh size, of globally optimal solutions and two types of stationary points to the discretized problems. We illustrate the practical behaviour of our cell-based FV discretization algorithm on a numerical example....

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

Discrete unified gas kinetic scheme for all Knudsen number flows. III. Binary gas mixtures of Maxwell molecules

Science.gov (United States)

Zhang, Yue; Zhu, Lianhua; Wang, Ruijie; Guo, Zhaoli

2018-05-01

Recently a discrete unified gas kinetic scheme (DUGKS) in a finite-volume formulation based on the Boltzmann model equation has been developed for gas flows in all flow regimes. The original DUGKS is designed for flows of single-species gases. In this work, we extend the DUGKS to flows of binary gas mixtures of Maxwell molecules based on the Andries-Aoki-Perthame kinetic model [P. Andries et al., J. Stat. Phys. 106, 993 (2002), 10.1023/A:1014033703134. A particular feature of the method is that the flux at each cell interface is evaluated based on the characteristic solution of the kinetic equation itself; thus the numerical dissipation is low in comparison with that using direct reconstruction. Furthermore, the implicit treatment of the collision term enables the time step to be free from the restriction of the relaxation time. Unlike the DUGKS for single-species flows, a nonlinear system must be solved to determine the interaction parameters appearing in the equilibrium distribution function, which can be obtained analytically for Maxwell molecules. Several tests are performed to validate the scheme, including the shock structure problem under different Mach numbers and molar concentrations, the channel flow driven by a small gradient of pressure, temperature, or concentration, the plane Couette flow, and the shear driven cavity flow under different mass ratios and molar concentrations. The results are compared with those from other reliable numerical methods. The results show that the proposed scheme is an effective and reliable method for binary gas mixtures in all flow regimes.

Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks

Directory of Open Access Journals (Sweden)

Fapojuwo Abraham O

2007-01-01

Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.

Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks

Directory of Open Access Journals (Sweden)

Abraham O. Fapojuwo

2007-11-01

Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.

Micro-macro multilevel latent class models with multiple discrete individual-level variables

NARCIS (Netherlands)

Bennink, M.; Croon, M.A.; Kroon, B.; Vermunt, J.K.

2016-01-01

An existing micro-macro method for a single individual-level variable is extended to the multivariate situation by presenting two multilevel latent class models in which multiple discrete individual-level variables are used to explain a group-level outcome. As in the univariate case, the

Comparative study of numerical schemes of TVD3, UNO3-ACM and optimized compact scheme

Science.gov (United States)

Lee, Duck-Joo; Hwang, Chang-Jeon; Ko, Duck-Kon; Kim, Jae-Wook

1995-01-01

Three different schemes are employed to solve the benchmark problem. The first one is a conventional TVD-MUSCL (Monotone Upwind Schemes for Conservation Laws) scheme. The second scheme is a UNO3-ACM (Uniformly Non-Oscillatory Artificial Compression Method) scheme. The third scheme is an optimized compact finite difference scheme modified by us: the 4th order Runge Kutta time stepping, the 4th order pentadiagonal compact spatial discretization with the maximum resolution characteristics. The problems of category 1 are solved by using the second (UNO3-ACM) and third (Optimized Compact) schemes. The problems of category 2 are solved by using the first (TVD3) and second (UNO3-ACM) schemes. The problem of category 5 is solved by using the first (TVD3) scheme. It can be concluded from the present calculations that the Optimized Compact scheme and the UN03-ACM show good resolutions for category 1 and category 2 respectively.

An efficient and stable hydrodynamic model with novel source term discretization schemes for overland flow and flood simulations

Science.gov (United States)

Xia, Xilin; Liang, Qiuhua; Ming, Xiaodong; Hou, Jingming

2017-05-01

Numerical models solving the full 2-D shallow water equations (SWEs) have been increasingly used to simulate overland flows and better understand the transient flow dynamics of flash floods in a catchment. However, there still exist key challenges that have not yet been resolved for the development of fully dynamic overland flow models, related to (1) the difficulty of maintaining numerical stability and accuracy in the limit of disappearing water depth and (2) inaccurate estimation of velocities and discharges on slopes as a result of strong nonlinearity of friction terms. This paper aims to tackle these key research challenges and present a new numerical scheme for accurately and efficiently modeling large-scale transient overland flows over complex terrains. The proposed scheme features a novel surface reconstruction method (SRM) to correctly compute slope source terms and maintain numerical stability at small water depth, and a new implicit discretization method to handle the highly nonlinear friction terms. The resulting shallow water overland flow model is first validated against analytical and experimental test cases and then applied to simulate a hypothetic rainfall event in the 42 km2 Haltwhistle Burn, UK.

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea

2013-01-01

Arbitrary Lagrangian Eulerian (ALE) formulations deal with PDEs on deformable domains upon extending the domain velocity from the boundary into the bulk with the purpose of keeping mesh regularity. This arbitrary extension has no effect on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time-dependent advection-diffusion-model problem in moving domains, and study their stability properties. The analysis hinges on the validity of the Reynold\\'s identity for dG. Exploiting the variational structure and assuming exact integration, we prove that our conservative and nonconservative dG schemes are equivalent and unconditionally stable. The same results remain true for piecewise polynomial ALE maps of any degree and suitable quadrature that guarantees the validity of the Reynold\\'s identity. This approach generalizes the so-called geometric conservation law to higher-order methods. We also prove that simpler Runge-Kutta-Radau methods of any order are conditionally stable, that is, subject to a mild ALE constraint on the time steps. Numerical experiments corroborate and complement our theoretical results. © 2013 Society for Industrial and Applied Mathematics.

Discrete Painlevé equations: an integrability paradigm

International Nuclear Information System (INIS)

Grammaticos, B; Ramani, A

2014-01-01

In this paper we present a review of results on discrete Painlevé equations. We begin with an introduction which serves as a refresher on the continuous Painlevé equations. Next, in the first, main part of the paper, we introduce the discrete Painlevé equations, the various methods for their derivation, and their properties as well as their classification scheme. Along the way we present a brief summary of the two major discrete integrability detectors and of Quispel–Roberts–Thompson mapping, which plays a primordial role in the derivation of discrete Painlevé equations. The second part of the paper is more technical and focuses on the presentation of new results on what are called asymmetric discrete Painlevé equations. (comment)

A Non-blind Color Image Watermarking Scheme Resistent Against Geometric Attacks

Directory of Open Access Journals (Sweden)

A. Ghafoor

2012-12-01

Full Text Available A non-blind color image watermarking scheme using principle component analysis, discrete wavelet transform and singular value decomposition is proposed. The color components are uncorrelated using principle component analysis. The watermark is embedded into the singular values of discrete wavelet transformed sub-band associated with principle component containing most of the color information. The scheme was tested against various attacks (including histogram equalization, rotation, Gaussian noise, scaling, cropping, Y-shearing, X-shearing, median filtering, affine transformation, translation, salt & pepper, sharpening, to check robustness. The results of proposed scheme are compared with state-of-the-art existing color watermarking schemes using normalized correlation coefficient and peak signal to noise ratio. The simulation results show that proposed scheme is robust and imperceptible.

Sensor data security level estimation scheme for wireless sensor networks.

Science.gov (United States)

Ramos, Alex; Filho, Raimir Holanda

2015-01-19

Due to their increasing dissemination, wireless sensor networks (WSNs) have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL) that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE), a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates.

Discrete Green’s functions for propagators between complex objects in discrete space-time nonlinear electromagnetics

NARCIS (Netherlands)

Arnold, J.M.; Hon, de B.P.; Graglia, R.D.

2007-01-01

We propose a potential-based form of the FDTD scheme, with potentials driven by sources that are themselves simple dynamical systems. This formulation admits a radiative boundary condition for the discrete-mesh Maxwell's equations in a multiply connected exterior domain, which facilitates

Third Order Reconstruction of the KP Scheme for Model of River Tinnelva

Directory of Open Access Journals (Sweden)

Susantha Dissanayake

2017-01-01

Full Text Available The Saint-Venant equation/Shallow Water Equation is used to simulate flow of river, flow of liquid in an open channel, tsunami etc. The Kurganov-Petrova (KP scheme which was developed based on the local speed of discontinuity propagation, can be used to solve hyperbolic type partial differential equations (PDEs, hence can be used to solve the Saint-Venant equation. The KP scheme is semi discrete: PDEs are discretized in the spatial domain, resulting in a set of Ordinary Differential Equations (ODEs. In this study, the common 2nd order KP scheme is extended into 3rd order scheme while following the Weighted Essentially Non-Oscillatory (WENO and Central WENO (CWENO reconstruction steps. Both the 2nd order and 3rd order schemes have been used in simulation in order to check the suitability of the KP schemes to solve hyperbolic type PDEs. The simulation results indicated that the 3rd order KP scheme shows some better stability compared to the 2nd order scheme. Computational time for the 3rd order KP scheme for variable step-length ode solvers in MATLAB is less compared to the computational time of the 2nd order KP scheme. In addition, it was confirmed that the order of the time integrators essentially should be lower compared to the order of the spatial discretization. However, for computation of abrupt step changes, the 2nd order KP scheme shows a more accurate solution.

Estimation of Interchannel Time Difference in Frequency Subbands Based on Nonuniform Discrete Fourier Transform

Directory of Open Access Journals (Sweden)

Qiu Bo

2008-01-01

Full Text Available Binaural cue coding (BCC is an efficient technique for spatial audio rendering by using the side information such as interchannel level difference (ICLD, interchannel time difference (ICTD, and interchannel correlation (ICC. Of the side information, the ICTD plays an important role to the auditory spatial image. However, inaccurate estimation of the ICTD may lead to the audio quality degradation. In this paper, we develop a novel ICTD estimation algorithm based on the nonuniform discrete Fourier transform (NDFT and integrate it with the BCC approach to improve the decoded auditory image. Furthermore, a new subjective assessment method is proposed for the evaluation of auditory image widths of decoded signals. The test results demonstrate that the NDFT-based scheme can achieve much wider and more externalized auditory image than the existing BCC scheme based on the discrete Fourier transform (DFT. It is found that the present technique, regardless of the image width, does not deteriorate the sound quality at the decoder compared to the traditional scheme without ICTD estimation.

Boudot's Range-Bounded Commitment Scheme Revisited

Science.gov (United States)

Cao, Zhengjun; Liu, Lihua

Checking whether a committed integer lies in a specific interval has many cryptographic applications. In Eurocrypt'98, Chan et al. proposed an instantiation (CFT Proof). Based on CFT, Boudot presented a popular range-bounded commitment scheme in Eurocrypt'2000. Both CFT Proof and Boudot Proof are based on the encryption E(x, r)=g^xh^r mod n, where n is an RSA modulus whose factorization is unknown by the prover. They did not use a single base as usual. Thus an increase in cost occurs. In this paper, we show that it suffices to adopt a single base. The cost of the modified Boudot Proof is about half of that of the original scheme. Moreover, the key restriction in the original scheme, i.e., both the discrete logarithm of g in base h and the discrete logarithm of h in base g are unknown by the prover, which is a potential menace to the Boudot Proof, is definitely removed.

Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms

Directory of Open Access Journals (Sweden)

Gregorio de Miguel Casado

2007-01-01

Full Text Available This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope of a recursive operation. When tackling the design level, the method shows suitable for developing a processor which achieves a satisfying trade-off between time delay, area costs, and stability. The method is particularly suitable for the mathematical transforms used in signal processing applications. A generic calculation scheme is developed for the discrete fast Fourier transform (DFT and then applied to other integral transforms such as the discrete Hartley transform (DHT, the discrete cosine transform (DCT, and the discrete sine transform (DST. Some comparisons with other well-known proposals are also provided.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

International Nuclear Information System (INIS)

Densmore, Jeffery D.; Warsa, James S.; Lowrie, Robert B.; Morel, Jim E.

2009-01-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

Energy Technology Data Exchange (ETDEWEB)

Densmore, Jeffery D [Los Alamos National Laboratory; Warsa, James S [Los Alamos National Laboratory; Lowrie, Robert B [Los Alamos National Laboratory; Morel, Jim E [TEXAS A& M UNIV

2008-01-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

Science.gov (United States)

Densmore, Jeffery D.; Warsa, James S.; Lowrie, Robert B.; Morel, Jim E.

2009-09-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Ulam's scheme revisited digital modeling of chaotic attractors via micro-perturbations

CERN Document Server

Domokos, Gabor K

2002-01-01

We consider discretizations $f_N$ of expanding maps $f:I \\to I$ in the strict sense: i.e. we assume that the only information available on the map is a finite set of integers. Using this definition for computability, we show that by adding a random perturbation of order $1/N$, the invariant measure corresponding to $f$ can be approximated and we can also give estimates of the error term. We prove that the randomized discrete scheme is equivalent to Ulam's scheme applied to the polygonal approximation of $f$, thus providing a new interpretation of Ulam's scheme. We also compare the efficiency of the randomized iterative scheme to the direct solution of the $N \\times N$ linear system.

On Generating Discrete Integrable Systems via Lie Algebras and Commutator Equations

International Nuclear Information System (INIS)

Zhang Yu-Feng; Tam, Honwah

2016-01-01

In the paper, we introduce the Lie algebras and the commutator equations to rewrite the Tu-d scheme for generating discrete integrable systems regularly. By the approach the various loop algebras of the Lie algebra A_1 are defined so that the well-known Toda hierarchy and a novel discrete integrable system are obtained, respectively. A reduction of the later hierarchy is just right the famous Ablowitz–Ladik hierarchy. Finally, via two different enlarging Lie algebras of the Lie algebra A_1, we derive two resulting differential-difference integrable couplings of the Toda hierarchy, of course, they are all various discrete expanding integrable models of the Toda hierarchy. When the introduced spectral matrices are higher degrees, the way presented in the paper is more convenient to generate discrete integrable equations than the Tu-d scheme by using the software Maple. (paper)

A robust and efficient finite volume scheme for the discretization of diffusive flux on extremely skewed meshes in complex geometries

Science.gov (United States)

Traoré, Philippe; Ahipo, Yves Marcel; Louste, Christophe

2009-08-01

In this paper an improved finite volume scheme to discretize diffusive flux on a non-orthogonal mesh is proposed. This approach, based on an iterative technique initially suggested by Khosla [P.K. Khosla, S.G. Rubin, A diagonally dominant second-order accurate implicit scheme, Computers and Fluids 2 (1974) 207-209] and known as deferred correction, has been intensively utilized by Muzaferija [S. Muzaferija, Adaptative finite volume method for flow prediction using unstructured meshes and multigrid approach, Ph.D. Thesis, Imperial College, 1994] and later Fergizer and Peric [J.H. Fergizer, M. Peric, Computational Methods for Fluid Dynamics, Springer, 2002] to deal with the non-orthogonality of the control volumes. Using a more suitable decomposition of the normal gradient, our scheme gives accurate solutions in geometries where the basic idea of Muzaferija fails. First the performances of both schemes are compared for a Poisson problem solved in quadrangular domains where control volumes are increasingly skewed in order to test their robustness and efficiency. It is shown that convergence properties and the accuracy order of the solution are not degraded even on extremely skewed mesh. Next, the very stable behavior of the method is successfully demonstrated on a randomly distorted grid as well as on an anisotropically distorted one. Finally we compare the solution obtained for quadrilateral control volumes to the ones obtained with a finite element code and with an unstructured version of our finite volume code for triangular control volumes. No differences can be observed between the different solutions, which demonstrates the effectiveness of our approach.

Discrete-time inverse optimal control for nonlinear systems

CERN Document Server

Sanchez, Edgar N

2013-01-01

Discrete-Time Inverse Optimal Control for Nonlinear Systems proposes a novel inverse optimal control scheme for stabilization and trajectory tracking of discrete-time nonlinear systems. This avoids the need to solve the associated Hamilton-Jacobi-Bellman equation and minimizes a cost functional, resulting in a more efficient controller. Design More Efficient Controllers for Stabilization and Trajectory Tracking of Discrete-Time Nonlinear Systems The book presents two approaches for controller synthesis: the first based on passivity theory and the second on a control Lyapunov function (CLF). Th

Sensor Data Security Level Estimation Scheme for Wireless Sensor Networks

Science.gov (United States)

Ramos, Alex; Filho, Raimir Holanda

2015-01-01

Due to their increasing dissemination, wireless sensor networks (WSNs) have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL) that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE), a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates. PMID:25608215

Sensor Data Security Level Estimation Scheme for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Alex Ramos

2015-01-01

Full Text Available Due to their increasing dissemination, wireless sensor networks (WSNs have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE, a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates.

The large discretization step method for time-dependent partial differential equations

Science.gov (United States)

Haras, Zigo; Taasan, Shlomo

1995-01-01

A new method for the acceleration of linear and nonlinear time dependent calculations is presented. It is based on the Large Discretization Step (LDS) approximation, defined in this work, which employs an extended system of low accuracy schemes to approximate a high accuracy discrete approximation to a time dependent differential operator. Error bounds on such approximations are derived. These approximations are efficiently implemented in the LDS methods for linear and nonlinear hyperbolic equations, presented here. In these algorithms the high and low accuracy schemes are interpreted as the same discretization of a time dependent operator on fine and coarse grids, respectively. Thus, a system of correction terms and corresponding equations are derived and solved on the coarse grid to yield the fine grid accuracy. These terms are initialized by visiting the fine grid once in many coarse grid time steps. The resulting methods are very general, simple to implement and may be used to accelerate many existing time marching schemes.

Digital Discretion

DEFF Research Database (Denmark)

Busch, Peter Andre; Zinner Henriksen, Helle

2018-01-01

discretion is suggested to reduce this footprint by influencing or replacing their discretionary practices using ICT. What is less researched is whether digital discretion can cause changes in public policy outcomes, and under what conditions such changes can occur. Using the concept of public service values......This study reviews 44 peer-reviewed articles on digital discretion published in the period from 1998 to January 2017. Street-level bureaucrats have traditionally had a wide ability to exercise discretion stirring debate since they can add their personal footprint on public policies. Digital......, we suggest that digital discretion can strengthen ethical and democratic values but weaken professional and relational values. Furthermore, we conclude that contextual factors such as considerations made by policy makers on the macro-level and the degree of professionalization of street...

A high-order method for the integration of the Galerkin semi-discretized nuclear reactor kinetics equations

International Nuclear Information System (INIS)

Vargas, L.

1988-01-01

The numerical approximate solution of the space-time nuclear reactor kinetics equation is investigated using a finite-element discretization of the space variable and a high order integration scheme for the resulting semi-discretized parabolic equation. The Galerkin method with spatial piecewise polynomial Lagrange basis functions are used to obtained a continuous time semi-discretized form of the space-time reactor kinetics equation. A temporal discretization is then carried out with a numerical scheme based on the Iterated Defect Correction (IDC) method using piecewise quadratic polynomials or exponential functions. The kinetics equations are thus solved with in a general finite element framework with respect to space as well as time variables in which the order of convergence of the spatial and temporal discretizations is consistently high. A computer code GALFEM/IDC is developed, to implement the numerical schemes described above. This issued to solve a one space dimensional benchmark problem. The results of the numerical experiments confirm the theoretical arguments and show that the convergence is very fast and the overall procedure is quite efficient. This is due to the good asymptotic properties of the numerical scheme which is of third order in the time interval

BEST-4, Fuel Cycle and Cost Optimization for Discrete Power Levels

International Nuclear Information System (INIS)

1973-01-01

1 - Nature of physical problem solved: Determination of optimal power strategy for a fuel cycle, for discrete power levels and n temporal stages, taking into account replacement energy costs and de-rating. 2 - Method of solution: Dynamic programming. 3 - Restrictions on the complexity of the problem: Restrictions may arise from number of power levels and temporal stages, due to machine limitations

Computation of 2-D pinhole image-formation process of large-scale furnaces using the discrete ordinates method

CERN Document Server

Li Hong; Lu Ji Dong; Zheng Chu Guan

2003-01-01

In most of the discrete ordinate schemes (DOS) reported in the literature, the discrete directions are fixed, and unable to be arbitrarily adjusted; therefore, it is difficult to employ these schemes to calculate the radiative energy image-formation of pulverized-coal furnaces. On the basis of a new DOS, named the discrete ordinate scheme with (an) infinitely small weight(s), which was recently proposed by the authors, a novel algorithm for computing the pinhole image-formation process is developed in this work. The performance of this algorithm is tested, and is found to be also suitable for parallel computation.

Computation of 2-D pinhole image-formation process of large-scale furnaces using the discrete ordinates method

International Nuclear Information System (INIS)

Li Hongshun; Zhou Huaichun; Lu Jidong; Zheng Chuguang

2003-01-01

In most of the discrete ordinate schemes (DOS) reported in the literature, the discrete directions are fixed, and unable to be arbitrarily adjusted; therefore, it is difficult to employ these schemes to calculate the radiative energy image-formation of pulverized-coal furnaces. On the basis of a new DOS, named the discrete ordinate scheme with (an) infinitely small weight(s), which was recently proposed by the authors, a novel algorithm for computing the pinhole image-formation process is developed in this work. The performance of this algorithm is tested, and is found to be also suitable for parallel computation

Out-of-order parallel discrete event simulation for electronic system-level design

CERN Document Server

Chen, Weiwei

2014-01-01

This book offers readers a set of new approaches and tools a set of tools and techniques for facing challenges in parallelization with design of embedded systems.? It provides an advanced parallel simulation infrastructure for efficient and effective system-level model validation and development so as to build better products in less time.? Since parallel discrete event simulation (PDES) has the potential to exploit the underlying parallel computational capability in today's multi-core simulation hosts, the author begins by reviewing the parallelization of discrete event simulation, identifyin

Pressure correction schemes for compressible flows: application to baro-tropic Navier-Stokes equations and to drift-flux model

International Nuclear Information System (INIS)

Gastaldo, L.

2007-11-01

We develop in this PhD thesis a simulation tool for bubbly flows encountered in some late phases of a core-melt accident in pressurized water reactors, when the flow of molten core and vessel structures comes to chemically interact with the concrete of the containment floor. The physical modelling is based on the so-called drift-flux model, consisting of mass balance and momentum balance equations for the mixture (Navier-Stokes equations) and a mass balance equation for the gaseous phase. First, we propose a pressure correction scheme for the compressible Navier-Stokes equations based on mixed non-conforming finite elements. An ad hoc discretization of the advection operator, by a finite volume technique based on a dual mesh, ensures the stability of the velocity prediction step. A priori estimates for the velocity and the pressure yields the existence of the solution. We prove that this scheme is stable, in the sense that the discrete entropy is decreasing. For the conservation equation of the gaseous phase, we build a finite volume discretization which satisfies a discrete maximum principle. From this last property, we deduce the existence and the uniqueness of the discrete solution. Finally, on the basis of these works, a conservative and monotone scheme which is stable in the low Mach number limit, is build for the drift-flux model. This scheme enjoys, moreover, the following property: the algorithm preserves a constant pressure and velocity through moving interfaces between phases (i.e. contact discontinuities of the underlying hyperbolic system). In order to satisfy this property at the discrete level, we build an original pressure correction step which couples the mass balance equation with the transport terms of the gas mass balance equation, the remaining terms of the gas mass balance being taken into account with a splitting method. We prove the existence of a discrete solution for the pressure correction step. Numerical results are presented; they

Balanced Central Schemes for the Shallow Water Equations on Unstructured Grids

Science.gov (United States)

Bryson, Steve; Levy, Doron

2004-01-01

We present a two-dimensional, well-balanced, central-upwind scheme for approximating solutions of the shallow water equations in the presence of a stationary bottom topography on triangular meshes. Our starting point is the recent central scheme of Kurganov and Petrova (KP) for approximating solutions of conservation laws on triangular meshes. In order to extend this scheme from systems of conservation laws to systems of balance laws one has to find an appropriate discretization of the source terms. We first show that for general triangulations there is no discretization of the source terms that corresponds to a well-balanced form of the KP scheme. We then derive a new variant of a central scheme that can be balanced on triangular meshes. We note in passing that it is straightforward to extend the KP scheme to general unstructured conformal meshes. This extension allows us to recover our previous well-balanced scheme on Cartesian grids. We conclude with several simulations, verifying the second-order accuracy of our scheme as well as its well-balanced properties.

Optimization strategies for discrete multi-material stiffness optimization

DEFF Research Database (Denmark)

Hvejsel, Christian Frier; Lund, Erik; Stolpe, Mathias

2011-01-01

Design of composite laminated lay-ups are formulated as discrete multi-material selection problems. The design problem can be modeled as a non-convex mixed-integer optimization problem. Such problems are in general only solvable to global optimality for small to moderate sized problems. To attack...... which numerically confirm the sought properties of the new scheme in terms of convergence to a discrete solution....

Quasi-disjoint pentadiagonal matrix systems for the parallelization of compact finite-difference schemes and filters

Science.gov (United States)

Kim, Jae Wook

2013-05-01

This paper proposes a novel systematic approach for the parallelization of pentadiagonal compact finite-difference schemes and filters based on domain decomposition. The proposed approach allows a pentadiagonal banded matrix system to be split into quasi-disjoint subsystems by using a linear-algebraic transformation technique. As a result the inversion of pentadiagonal matrices can be implemented within each subdomain in an independent manner subject to a conventional halo-exchange process. The proposed matrix transformation leads to new subdomain boundary (SB) compact schemes and filters that require three halo terms to exchange with neighboring subdomains. The internode communication overhead in the present approach is equivalent to that of standard explicit schemes and filters based on seven-point discretization stencils. The new SB compact schemes and filters demand additional arithmetic operations compared to the original serial ones. However, it is shown that the additional cost becomes sufficiently low by choosing optimal sizes of their discretization stencils. Compared to earlier published results, the proposed SB compact schemes and filters successfully reduce parallelization artifacts arising from subdomain boundaries to a level sufficiently negligible for sophisticated aeroacoustic simulations without degrading parallel efficiency. The overall performance and parallel efficiency of the proposed approach are demonstrated by stringent benchmark tests.

A CU-Level Rate and Distortion Estimation Scheme for RDO of Hardware-Friendly HEVC Encoders Using Low-Complexity Integer DCTs.

Science.gov (United States)

Lee, Bumshik; Kim, Munchurl

2016-08-01

In this paper, a low complexity coding unit (CU)-level rate and distortion estimation scheme is proposed for High Efficiency Video Coding (HEVC) hardware-friendly implementation where a Walsh-Hadamard transform (WHT)-based low-complexity integer discrete cosine transform (DCT) is employed for distortion estimation. Since HEVC adopts quadtree structures of coding blocks with hierarchical coding depths, it becomes more difficult to estimate accurate rate and distortion values without actually performing transform, quantization, inverse transform, de-quantization, and entropy coding. Furthermore, DCT for rate-distortion optimization (RDO) is computationally high, because it requires a number of multiplication and addition operations for various transform block sizes of 4-, 8-, 16-, and 32-orders and requires recursive computations to decide the optimal depths of CU or transform unit. Therefore, full RDO-based encoding is highly complex, especially for low-power implementation of HEVC encoders. In this paper, a rate and distortion estimation scheme is proposed in CU levels based on a low-complexity integer DCT that can be computed in terms of WHT whose coefficients are produced in prediction stages. For rate and distortion estimation in CU levels, two orthogonal matrices of 4×4 and 8×8 , which are applied to WHT that are newly designed in a butterfly structure only with addition and shift operations. By applying the integer DCT based on the WHT and newly designed transforms in each CU block, the texture rate can precisely be estimated after quantization using the number of non-zero quantized coefficients and the distortion can also be precisely estimated in transform domain without de-quantization and inverse transform required. In addition, a non-texture rate estimation is proposed by using a pseudoentropy code to obtain accurate total rate estimates. The proposed rate and the distortion estimation scheme can effectively be used for HW-friendly implementation of

A gas dynamics scheme for a two moments model of radiative transfer

International Nuclear Information System (INIS)

Buet, Ch.; Despres, B.

2007-01-01

We address the discretization of the Levermore's two moments and entropy model of the radiative transfer equation. We present a new approach for the discretization of this model: first we rewrite the moment equations as a Compressible Gas Dynamics equation by introducing an additional quantity that plays the role of a density. After that we discretize using a Lagrange-projection scheme. The Lagrange-projection scheme permits us to incorporate the source terms in the fluxes of an acoustic solver in the Lagrange step, using the well-known piecewise steady approximation and thus to capture correctly the diffusion regime. Moreover we show that the discretization is entropic and preserve the flux-limited property of the moment model. Numerical examples illustrate the feasibility of our approach. (authors)

A fast iterative model for discrete velocity calculations on triangular grids

International Nuclear Information System (INIS)

Szalmas, Lajos; Valougeorgis, Dimitris

2010-01-01

A fast synthetic type iterative model is proposed to speed up the slow convergence of discrete velocity algorithms for solving linear kinetic equations on triangular lattices. The efficiency of the scheme is verified both theoretically by a discrete Fourier stability analysis and computationally by solving a rarefied gas flow problem. The stability analysis of the discrete kinetic equations yields the spectral radius of the typical and the proposed iterative algorithms and reveal the drastically improved performance of the latter one for any grid resolution. This is the first time that stability analysis of the full discrete kinetic equations related to rarefied gas theory is formulated, providing the detailed dependency of the iteration scheme on the discretization parameters in the phase space. The corresponding characteristics of the model deduced by solving numerically the rarefied gas flow through a duct with triangular cross section are in complete agreement with the theoretical findings. The proposed approach may open a way for fast computation of rarefied gas flows on complex geometries in the whole range of gas rarefaction including the hydrodynamic regime.

Kernel Optimum Nearly-analytical Discretization (KOND) algorithm

International Nuclear Information System (INIS)

Kondoh, Yoshiomi; Hosaka, Yasuo; Ishii, Kenji

1992-10-01

Two applications of the Kernel Optimum Nearly-analytical Discretization (KOND) algorithm to the parabolic- and the hyperbolic type equations a presented in detail to lead to novel numerical schemes with very high numerical accuracy. It is demonstrated numerically that the two dimensional KOND-P scheme for the parabolic type yields quite less numerical error by over 2-3 orders and reduces the CPU time to about 1/5 for a common numerical accuracy, compared with the conventional explicit scheme of reference. It is also demonstrated numerically that the KOND-H scheme for the hyperbolic type yields fairly less diffusive error and has fairly high stability for both of the linear- and the nonlinear wave propagations compared with other conventional schemes. (author)

Displacement in the parameter space versus spurious solution of discretization with large time step

International Nuclear Information System (INIS)

Mendes, Eduardo; Letellier, Christophe

2004-01-01

In order to investigate a possible correspondence between differential and difference equations, it is important to possess discretization of ordinary differential equations. It is well known that when differential equations are discretized, the solution thus obtained depends on the time step used. In the majority of cases, such a solution is considered spurious when it does not resemble the expected solution of the differential equation. This often happens when the time step taken into consideration is too large. In this work, we show that, even for quite large time steps, some solutions which do not correspond to the expected ones are still topologically equivalent to solutions of the original continuous system if a displacement in the parameter space is considered. To reduce such a displacement, a judicious choice of the discretization scheme should be made. To this end, a recent discretization scheme, based on the Lie expansion of the original differential equations, proposed by Monaco and Normand-Cyrot will be analysed. Such a scheme will be shown to be sufficient for providing an adequate discretization for quite large time steps compared to the pseudo-period of the underlying dynamics

Comparison of reactivity estimation performance between two extended Kalman filtering schemes

International Nuclear Information System (INIS)

Peng, Xingjie; Cai, Yun; Li, Qing; Wang, Kan

2016-01-01

Highlights: • The performances of two EKF schemes using different Jacobian matrices are compared. • Numerical simulations are used for the validation and comparison of these two EKF schemes. • The simulation results show that the EKF scheme adopted by this paper performs better than the one adopted by previous literatures. - Abstract: The extended Kalman filtering (EKF) technique has been utilized in the estimation of reactivity which is a significantly important parameter to indicate the status of the nuclear reactor. In this paper, the performances of two EKF schemes using different Jacobian matrices are compared. Numerical simulations are used for the validation and comparison of these two EKF schemes, and the results show that the Jacobian matrix obtained directly from the discrete-time state model performs better than the one which is the discretization form of the Jacobian matrix obtained from the continuous-time state model.

Discretization of 3d gravity in different polarizations

Science.gov (United States)

Dupuis, Maïté; Freidel, Laurent; Girelli, Florian

2017-10-01

We study the discretization of three-dimensional gravity with Λ =0 following the loop quantum gravity framework. In the process, we realize that different choices of polarization are possible. This allows us to introduce a new discretization based on the triad as opposed to the connection as in the standard loop quantum gravity framework. We also identify the classical nontrivial symmetries of discrete gravity, namely the Drinfeld double, given in terms of momentum maps. Another choice of polarization is given by the Chern-Simons formulation of gravity. Our framework also provides a new discretization scheme of Chern-Simons, which keeps track of the link between the continuum variables and the discrete ones. We show how the Poisson bracket we recover between the Chern-Simons holonomies allows us to recover the Goldman bracket. There is also a transparent link between the discrete Chern-Simons formulation and the discretization of gravity based on the connection (loop gravity) or triad variables (dual loop gravity).

Single particle level scheme for alpha decay

International Nuclear Information System (INIS)

Mirea, M.

1998-01-01

The fine structure phenomenon in alpha decay was evidenced by Rosenblum. In this process the kinetic energy of the emitted particle has several determined values related to the structure of the parent and the daughter nucleus. The probability to find the daughter in a low lying state was considered strongly dependent on the spectroscopic factor defined as the square of overlap between the wave function of the parent in the ground state and the wave functions of the specific excited states of the daughter. This treatment provides a qualitative agreement with the experimental results if the variations of the penetrability between different excited states are neglected. Based on single particle structure during fission, a new formalism explained quantitatively the fine structure of the cluster decay. It was suggested that this formalism can be applied also to alpha decay. For this purpose, the first step is to construct the level scheme of this type of decay. Such a scheme, obtained with the super-asymmetric two-center potential, is plotted for the alpha decay of 223 Ra. It is interesting to note that, diabatically, the level with spin 3/2 emerging from 1i 11/2 (ground state of the parent) reaches an excited state of the daughter in agreement with the experiment. (author)

Infant differential behavioral responding to discrete emotions.

Science.gov (United States)

Walle, Eric A; Reschke, Peter J; Camras, Linda A; Campos, Joseph J

2017-10-01

Emotional communication regulates the behaviors of social partners. Research on individuals' responding to others' emotions typically compares responses to a single negative emotion compared with responses to a neutral or positive emotion. Furthermore, coding of such responses routinely measure surface level features of the behavior (e.g., approach vs. avoidance) rather than its underlying function (e.g., the goal of the approach or avoidant behavior). This investigation examined infants' responding to others' emotional displays across 5 discrete emotions: joy, sadness, fear, anger, and disgust. Specifically, 16-, 19-, and 24-month-old infants observed an adult communicate a discrete emotion toward a stimulus during a naturalistic interaction. Infants' responses were coded to capture the function of their behaviors (e.g., exploration, prosocial behavior, and security seeking). The results revealed a number of instances indicating that infants use different functional behaviors in response to discrete emotions. Differences in behaviors across emotions were clearest in the 24-month-old infants, though younger infants also demonstrated some differential use of behaviors in response to discrete emotions. This is the first comprehensive study to identify differences in how infants respond with goal-directed behaviors to discrete emotions. Additionally, the inclusion of a function-based coding scheme and interpersonal paradigms may be informative for future emotion research with children and adults. Possible developmental accounts for the observed behaviors and the benefits of coding techniques emphasizing the function of social behavior over their form are discussed. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Solution Algorithm for a New Bi-Level Discrete Network Design Problem

Directory of Open Access Journals (Sweden)

Qun Chen

2013-12-01

Full Text Available A new discrete network design problem (DNDP was pro-posed in this paper, where the variables can be a series of integers rather than just 0-1. The new DNDP can determine both capacity improvement grades of reconstruction roads and locations and capacity grades of newly added roads, and thus complies with the practical projects where road capacity can only be some discrete levels corresponding to the number of lanes of roads. This paper designed a solution algorithm combining branch-and-bound with Hooke-Jeeves algorithm, where feasible integer solutions are recorded in searching the process of Hooke-Jeeves algorithm, lend -ing itself to determine the upper bound of the upper-level problem. The thresholds for branch cutting and ending were set for earlier convergence. Numerical examples are given to demonstrate the efficiency of the proposed algorithm.

From street level to system level bureaucracies. How ICT is transforming administrative discretion and constitutional control

NARCIS (Netherlands)

Bovens, M.A.P.; Zouridis, S.

2002-01-01

The use of ICT is rapidly changing the structure of a number of large executive public agencies. They used to be machine bureaucracies in which street level officials exercised ample administrative discretion in dealing with individual clients. This was kept in check by elaborate systems of external

An assessment of unstructured grid finite volume schemes for cold gas hypersonic flow calculations

Directory of Open Access Journals (Sweden)

João Luiz F. Azevedo

2009-06-01

Full Text Available A comparison of five different spatial discretization schemes is performed considering a typical high speed flow application. Flowfields are simulated using the 2-D Euler equations, discretized in a cell-centered finite volume procedure on unstructured triangular meshes. The algorithms studied include a central difference-type scheme, and 1st- and 2nd-order van Leer and Liou flux-vector splitting schemes. These methods are implemented in an efficient, edge-based, unstructured grid procedure which allows for adaptive mesh refinement based on flow property gradients. Details of the unstructured grid implementation of the methods are presented together with a discussion of the data structure and of the adaptive refinement strategy. The application of interest is the cold gas flow through a typical hypersonic inlet. Results for different entrance Mach numbers and mesh topologies are discussed in order to assess the comparative performance of the various spatial discretization schemes.

A Robust Control Scheme for Medium-Voltage-Level DVR Implementation

DEFF Research Database (Denmark)

Blaabjerg, Frede; Loh, Poh Chiang; Li, Yun Wei

2007-01-01

of Hinfin controller weighting function selection, inner current loop tuning, and system disturbance rejection capability is presented. Finally, the designed control scheme is extensively tested on a laboratory 10-kV MV-level DVR system with varying voltage sag (balanced and unbalanced) and loading (linear....../nonlinear load and induction motor load) conditions. It is shown that the proposed control scheme is effective in both balanced and unbalanced sag compensation and load disturbance rejection, as its robustness is explicitly specified....

The analytical evolution of NLS solitons due to the numerical discretization error

Science.gov (United States)

Hoseini, S. M.; Marchant, T. R.

2011-12-01

Soliton perturbation theory is used to obtain analytical solutions describing solitary wave tails or shelves, due to numerical discretization error, for soliton solutions of the nonlinear Schrödinger equation. Two important implicit numerical schemes for the nonlinear Schrödinger equation, with second-order temporal and spatial discretization errors, are considered. These are the Crank-Nicolson scheme and a scheme, due to Taha [1], based on the inverse scattering transform. The first-order correction for the solitary wave tail, or shelf, is in integral form and an explicit expression is found for large time. The shelf decays slowly, at a rate of t^{-{1\\over 2}}, which is characteristic of the nonlinear Schrödinger equation. Singularity theory, usually used for combustion problems, is applied to the explicit large-time expression for the solitary wave tail. Analytical results are then obtained, such as the parameter regions in which qualitatively different types of solitary wave tails occur, the location of zeros and the location and amplitude of peaks. It is found that three different types of tail occur for the Crank-Nicolson and Taha schemes and that the Taha scheme exhibits some unusual symmetry properties, as the tails for left and right moving solitary waves are different. Optimal choices of the discretization parameters for the numerical schemes are also found, which minimize the amplitude of the solitary wave tail. The analytical solutions are compared with numerical simulations, and an excellent comparison is found.

The analytical evolution of NLS solitons due to the numerical discretization error

International Nuclear Information System (INIS)

Hoseini, S M; Marchant, T R

2011-01-01

Soliton perturbation theory is used to obtain analytical solutions describing solitary wave tails or shelves, due to numerical discretization error, for soliton solutions of the nonlinear Schrödinger equation. Two important implicit numerical schemes for the nonlinear Schrödinger equation, with second-order temporal and spatial discretization errors, are considered. These are the Crank–Nicolson scheme and a scheme, due to Taha, based on the inverse scattering transform. The first-order correction for the solitary wave tail, or shelf, is in integral form and an explicit expression is found for large time. The shelf decays slowly, at a rate of t -1/2 , which is characteristic of the nonlinear Schrödinger equation. Singularity theory, usually used for combustion problems, is applied to the explicit large-time expression for the solitary wave tail. Analytical results are then obtained, such as the parameter regions in which qualitatively different types of solitary wave tails occur, the location of zeros and the location and amplitude of peaks. It is found that three different types of tail occur for the Crank–Nicolson and Taha schemes and that the Taha scheme exhibits some unusual symmetry properties, as the tails for left and right moving solitary waves are different. Optimal choices of the discretization parameters for the numerical schemes are also found, which minimize the amplitude of the solitary wave tail. The analytical solutions are compared with numerical simulations, and an excellent comparison is found. (paper)

Macro-level integrated renewable energy production schemes for sustainable development

International Nuclear Information System (INIS)

Subhadra, Bobban G.

2011-01-01

The production of renewable clean energy is a prime necessity for the sustainable future existence of our planet. However, because of the resource-intensive nature, and other challenges associated with these new generation renewable energy sources, novel industrial frameworks need to be co-developed. Integrated renewable energy production schemes with foundations on resource sharing, carbon neutrality, energy-efficient design, source reduction, green processing plan, anthropogenic use of waste resources for the production green energy along with the production of raw material for allied food and chemical industries is imperative for the sustainable development of this sector especially in an emission-constrained future industrial scenario. To attain these objectives, the scope of hybrid renewable production systems and integrated renewable energy industrial ecology is briefly described. Further, the principles of Integrated Renewable Energy Park (IREP) approach, an example for macro-level energy production, and its benefits and global applications are also explored. - Research highlights: → Discusses the need for macro-level renewable energy production schemes. → Scope of hybrid and integrated industrial ecology for renewable energy production. → Integrated Renewable Energy Parks (IREPs): A macro-level energy production scheme. → Discusses the principle foundations and global applications of IREPs. → Describes the significance of IREPs in the carbon-neutral future business arena.

A Framework of Secured Embedding Scheme Using Vector Discrete Wavelet Transformation and Lagrange Interpolation

Directory of Open Access Journals (Sweden)

Maheswari Subramanian

2018-01-01

Full Text Available Information hiding techniques have a significant role in recent application areas. Steganography is the embedding of information within an innocent cover work in a way which cannot be detected by any person without accessing the steganographic key. The proposed work uses a steganographic scheme for useful information with the help of human skin tone regions as cover image. The proposed algorithm has undergone Lagrange interpolation encryption for enhancement of the security of the hidden information. First, the skin tone regions are identified by using YCbCr color space which can be used as a cover image. Image pixels which belong to the skin regions are used to carry more secret bits, and the secret information is hidden in both horizontal and vertical sequences of the skin areas of the cover image. The secret information will hide behind the human skin regions rather than other objects in the same image because the skin pixels have high intensity value. The performance of embedding is done and is quite invisible by the vector discrete wavelet transformation (VDWT technique. A new Lagrange interpolation-based encryption method is introduced to achieve high security of the hidden information with higher payload and better visual quality.

The theta/gamma discrete phase code occuring during the hippocampal phase precession may be a more general brain coding scheme.

Science.gov (United States)

Lisman, John

2005-01-01

In the hippocampus, oscillations in the theta and gamma frequency range occur together and interact in several ways, indicating that they are part of a common functional system. It is argued that these oscillations form a coding scheme that is used in the hippocampus to organize the readout from long-term memory of the discrete sequence of upcoming places, as cued by current position. This readout of place cells has been analyzed in several ways. First, plots of the theta phase of spikes vs. position on a track show a systematic progression of phase as rats run through a place field. This is termed the phase precession. Second, two cells with nearby place fields have a systematic difference in phase, as indicated by a cross-correlation having a peak with a temporal offset that is a significant fraction of a theta cycle. Third, several different decoding algorithms demonstrate the information content of theta phase in predicting the animal's position. It appears that small phase differences corresponding to jitter within a gamma cycle do not carry information. This evidence, together with the finding that principle cells fire preferentially at a given gamma phase, supports the concept of theta/gamma coding: a given place is encoded by the spatial pattern of neurons that fire in a given gamma cycle (the exact timing within a gamma cycle being unimportant); sequential places are encoded in sequential gamma subcycles of the theta cycle (i.e., with different discrete theta phase). It appears that this general form of coding is not restricted to readout of information from long-term memory in the hippocampus because similar patterns of theta/gamma oscillations have been observed in multiple brain regions, including regions involved in working memory and sensory integration. It is suggested that dual oscillations serve a general function: the encoding of multiple units of information (items) in a way that preserves their serial order. The relationship of such coding to

An efficient permeability scaling-up technique applied to the discretized flow equations

Energy Technology Data Exchange (ETDEWEB)

Urgelli, D.; Ding, Yu [Institut Francais du Petrole, Rueil Malmaison (France)

1997-08-01

Grid-block permeability scaling-up for numerical reservoir simulations has been discussed for a long time in the literature. It is now recognized that a full permeability tensor is needed to get an accurate reservoir description at large scale. However, two major difficulties are encountered: (1) grid-block permeability cannot be properly defined because it depends on boundary conditions; (2) discretization of flow equations with a full permeability tensor is not straightforward and little work has been done on this subject. In this paper, we propose a new method, which allows us to get around both difficulties. As the two major problems are closely related, a global approach will preserve the accuracy. So, in the proposed method, the permeability up-scaling technique is integrated in the discretized numerical scheme for flow simulation. The permeability is scaled-up via the transmissibility term, in accordance with the fluid flow calculation in the numerical scheme. A finite-volume scheme is particularly studied, and the transmissibility scaling-up technique for this scheme is presented. Some numerical examples are tested for flow simulation. This new method is compared with some published numerical schemes for full permeability tensor discretization where the full permeability tensor is scaled-up through various techniques. Comparing the results with fine grid simulations shows that the new method is more accurate and more efficient.

A three–step discretization scheme for direct numerical solution of ...

African Journals Online (AJOL)

In this paper, a three-step discretization (numerical) formula is developed for direct integration of second-order initial value problems in ordinary differential equations. The development of the method and analysis of its basic properties adopt Taylor series expansion and Dahlquist stability test methods. The results show that ...

Neutrino oscillations in discrete-time quantum walk framework

Energy Technology Data Exchange (ETDEWEB)

Mallick, Arindam; Mandal, Sanjoy; Chandrashekar, C.M. [C. I. T. Campus, The Institute of Mathematical Sciences, Chennai (India); Homi Bhabha National Institute, Training School Complex, Mumbai (India)

2017-02-15

Here we present neutrino oscillation in the framework of quantum walks. Starting from a one spatial dimensional discrete-time quantum walk we present a scheme of evolutions that will simulate neutrino oscillation. The set of quantum walk parameters which is required to reproduce the oscillation probability profile obtained in both, long range and short range neutrino experiment is explicitly presented. Our scheme to simulate three-generation neutrino oscillation from quantum walk evolution operators can be physically realized in any low energy experimental set-up with access to control a single six-level system, a multiparticle three-qubit or a qubit-qutrit system. We also present the entanglement between spins and position space, during neutrino propagation that will quantify the wave function delocalization around instantaneous average position of the neutrino. This work will contribute towards understanding neutrino oscillation in the framework of the quantum information perspective. (orig.)

Numerical simulations of natural or mixed convection in vertical channels: comparisons of level-set numerical schemes for the modeling of immiscible incompressible fluid flows

International Nuclear Information System (INIS)

Li, R.

2012-01-01

The aim of this research dissertation is at studying natural and mixed convections of fluid flows, and to develop and validate numerical schemes for interface tracking in order to treat incompressible and immiscible fluid flows, later. In a first step, an original numerical method, based on Finite Volume discretizations, is developed for modeling low Mach number flows with large temperature gaps. Three physical applications on air flowing through vertical heated parallel plates were investigated. We showed that the optimum spacing corresponding to the peak heat flux transferred from an array of isothermal parallel plates cooled by mixed convection is smaller than those for natural or forced convections when the pressure drop at the outlet keeps constant. We also proved that mixed convection flows resulting from an imposed flow rate may exhibit unexpected physical solutions; alternative model based on prescribed total pressure at inlet and fixed pressure at outlet sections gives more realistic results. For channels heated by heat flux on one wall only, surface radiation tends to suppress the onset of re-circulations at the outlet and to unify the walls temperature. In a second step, the mathematical model coupling the incompressible Navier-Stokes equations and the Level-Set method for interface tracking is derived. Improvements in fluid volume conservation by using high order discretization (ENO-WENO) schemes for the transport equation and variants of the signed distance equation are discussed. (author)

Structural and parameteric uncertainty quantification in cloud microphysics parameterization schemes

Science.gov (United States)

van Lier-Walqui, M.; Morrison, H.; Kumjian, M. R.; Prat, O. P.; Martinkus, C.

2017-12-01

Atmospheric model parameterization schemes employ approximations to represent the effects of unresolved processes. These approximations are a source of error in forecasts, caused in part by considerable uncertainty about the optimal value of parameters within each scheme -- parameteric uncertainty. Furthermore, there is uncertainty regarding the best choice of the overarching structure of the parameterization scheme -- structrual uncertainty. Parameter estimation can constrain the first, but may struggle with the second because structural choices are typically discrete. We address this problem in the context of cloud microphysics parameterization schemes by creating a flexible framework wherein structural and parametric uncertainties can be simultaneously constrained. Our scheme makes no assuptions about drop size distribution shape or the functional form of parametrized process rate terms. Instead, these uncertainties are constrained by observations using a Markov Chain Monte Carlo sampler within a Bayesian inference framework. Our scheme, the Bayesian Observationally-constrained Statistical-physical Scheme (BOSS), has flexibility to predict various sets of prognostic drop size distribution moments as well as varying complexity of process rate formulations. We compare idealized probabilistic forecasts from versions of BOSS with varying levels of structural complexity. This work has applications in ensemble forecasts with model physics uncertainty, data assimilation, and cloud microphysics process studies.

A discrete control model of PLANT

Science.gov (United States)

Mitchell, C. M.

1985-01-01

A model of the PLANT system using the discrete control modeling techniques developed by Miller is described. Discrete control models attempt to represent in a mathematical form how a human operator might decompose a complex system into simpler parts and how the control actions and system configuration are coordinated so that acceptable overall system performance is achieved. Basic questions include knowledge representation, information flow, and decision making in complex systems. The structure of the model is a general hierarchical/heterarchical scheme which structurally accounts for coordination and dynamic focus of attention. Mathematically, the discrete control model is defined in terms of a network of finite state systems. Specifically, the discrete control model accounts for how specific control actions are selected from information about the controlled system, the environment, and the context of the situation. The objective is to provide a plausible and empirically testable accounting and, if possible, explanation of control behavior.

A Hybrid DGTD-MNA Scheme for Analyzing Complex Electromagnetic Systems

KAUST Repository

Li, Peng

2015-01-07

A hybrid electromagnetics (EM)-circuit simulator for analyzing complex systems consisting of EM devices loaded with nonlinear multi-port lumped circuits is described. The proposed scheme splits the computational domain into two subsystems: EM and circuit subsystems, where field interactions are modeled using Maxwell and Kirchhoff equations, respectively. Maxwell equations are discretized using a discontinuous Galerkin time domain (DGTD) scheme while Kirchhoff equations are discretized using a modified nodal analysis (MNA)-based scheme. The coupling between the EM and circuit subsystems is realized at the lumped ports, where related EM fields and circuit voltages and currents are allowed to “interact’’ via numerical flux. To account for nonlinear lumped circuit elements, the standard Newton-Raphson method is applied at every time step. Additionally, a local time-stepping scheme is developed to improve the efficiency of the hybrid solver. Numerical examples consisting of EM systems loaded with single and multiport linear/nonlinear circuit networks are presented to demonstrate the accuracy, efficiency, and applicability of the proposed solver.

Manifestly gauge invariant discretizations of the Schrödinger equation

International Nuclear Information System (INIS)

Halvorsen, Tore Gunnar; Kvaal, Simen

2012-01-01

Grid-based discretizations of the time dependent Schrödinger equation coupled to an external magnetic field are converted to manifest gauge invariant discretizations. This is done using generalizations of ideas used in classical lattice gauge theory, and the process defined is applicable to a large class of discretized differential operators. In particular, popular discretizations such as pseudospectral discretizations using the fast Fourier transform can be transformed to gauge invariant schemes. Also generic gauge invariant versions of generic time integration methods are considered, enabling completely gauge invariant calculations of the time dependent Schrödinger equation. Numerical examples illuminating the differences between a gauge invariant discretization and conventional discretization procedures are also presented. -- Highlights: ► We investigate the Schrödinger equation coupled to an external magnetic field. ► Any grid-based discretization is made trivially gauge invariant. ► An extension of classical lattice gauge theory.

Non-hydrostatic semi-elastic hybrid-coordinate SISL extension of HIRLAM. Part I: numerical scheme

Science.gov (United States)

Rõõm, Rein; Männik, Aarne; Luhamaa, Andres

2007-10-01

Two-time-level, semi-implicit, semi-Lagrangian (SISL) scheme is applied to the non-hydrostatic pressure coordinate equations, constituting a modified Miller-Pearce-White model, in hybrid-coordinate framework. Neutral background is subtracted in the initial continuous dynamics, yielding modified equations for geopotential, temperature and logarithmic surface pressure fluctuation. Implicit Lagrangian marching formulae for single time-step are derived. A disclosure scheme is presented, which results in an uncoupled diagnostic system, consisting of 3-D Poisson equation for omega velocity and 2-D Helmholtz equation for logarithmic pressure fluctuation. The model is discretized to create a non-hydrostatic extension to numerical weather prediction model HIRLAM. The discretization schemes, trajectory computation algorithms and interpolation routines, as well as the physical parametrization package are maintained from parent hydrostatic HIRLAM. For stability investigation, the derived SISL model is linearized with respect to the initial, thermally non-equilibrium resting state. Explicit residuals of the linear model prove to be sensitive to the relative departures of temperature and static stability from the reference state. Relayed on the stability study, the semi-implicit term in the vertical momentum equation is replaced to the implicit term, which results in stability increase of the model.

Exactly and quasi-exactly solvable 'discrete' quantum mechanics.

Science.gov (United States)

Sasaki, Ryu

2011-03-28

A brief introduction to discrete quantum mechanics is given together with the main results on various exactly solvable systems. Namely, the intertwining relations, shape invariance, Heisenberg operator solutions, annihilation/creation operators and dynamical symmetry algebras, including the q-oscillator algebra and the Askey-Wilson algebra. A simple recipe to construct exactly and quasi-exactly solvable (QES) Hamiltonians in one-dimensional 'discrete' quantum mechanics is presented. It reproduces all the known Hamiltonians whose eigenfunctions consist of the Askey scheme of hypergeometric orthogonal polynomials of a continuous or a discrete variable. Several new exactly and QES Hamiltonians are constructed. The sinusoidal coordinate plays an essential role.

High-spin level scheme of odd-odd 142Pm

International Nuclear Information System (INIS)

Liu Minliang; Zhang Yuhu; Zhou Xiaohong; He Jianjun; Guo Yingxiang; Lei Xiangguo; Huang Wenxue; Liu Zhong; Luo Yixiao; Feng Xichen; Zhang Shuangquan; Xu Xiao; Zheng Yong; Luo Wanju

2002-01-01

The level structure of doubly odd nucleus 142 Pm has been studied via the 128 Te( 19 F, 5nγ) 142 Pm reaction in the energy region from 75 to 95 MeV. In-beam γ rays were measured including the excited function, γ-ray singles and γ-γ coincidences in experiment. The level scheme of 142 Pm has been extended up to excitation energy of 7030.0 keV including 25 new γ rays and 13 new levels. Based on the measured γ-ray anisotropies, the level spins in 142 Pm have been suggested

BSEA: A Blind Sealed-Bid E-Auction Scheme for E-Commerce Applications

Directory of Open Access Journals (Sweden)

Rohit Kumar Das

2016-12-01

Full Text Available Due to an increase in the number of internet users, electronic commerce has grown significantly during the last decade. Electronic auction (e-auction is one of the famous e-commerce applications. Even so, security and robustness of e-auction schemes still remain a challenge. Requirements like anonymity and privacy of the b i d value are under threat from the attackers. Any auction protocol must not leak the anonymity and the privacy of the b i d value of an honest Bidder. Keeping these requirements in mind, we have firstly proposed a controlled traceable blind signature scheme (CTBSS because e-auction schemes should be able to trace the Bidders. Using CTBSS, a blind sealed-bid electronic auction scheme is proposed (BSEA. We have incorporated the notion of blind signature to e-auction schemes. Moreover, both the schemes are based upon elliptic curve cryptography (ECC, which provides a similar level of security with a comparatively smaller key size than the discrete logarithm problem (DLP based e-auction protocols. The analysis shows that BSEA fulfills all the requirements of e-auction protocol, and the total computation overhead is lower than the existing schemes.

Simulating continuous-time Hamiltonian dynamics by way of a discrete-time quantum walk

International Nuclear Information System (INIS)

Schmitz, A.T.; Schwalm, W.A.

2016-01-01

Much effort has been made to connect the continuous-time and discrete-time quantum walks. We present a method for making that connection for a general graph Hamiltonian on a bigraph. Furthermore, such a scheme may be adapted for simulating discretized quantum models on a quantum computer. A coin operator is found for the discrete-time quantum walk which exhibits the same dynamics as the continuous-time evolution. Given the spectral decomposition of the graph Hamiltonian and certain restrictions, the discrete-time evolution is solved for explicitly and understood at or near important values of the parameters. Finally, this scheme is connected to past results for the 1D chain. - Highlights: • A discrete-time quantum walk is purposed which approximates a continuous-time quantum walk. • The purposed quantum walk could be used to simulate Hamiltonian dynamics on a quantum computer. • Given the spectra decomposition of the Hamiltonian, the quantum walk is solved explicitly. • The method is demonstrated and connected to previous work done on the 1D chain.

A Fully Discrete Galerkin Method for a Nonlinear Space-Fractional Diffusion Equation

Directory of Open Access Journals (Sweden)

Yunying Zheng

2011-01-01

Full Text Available The spatial transport process in fractal media is generally anomalous. The space-fractional advection-diffusion equation can be used to characterize such a process. In this paper, a fully discrete scheme is given for a type of nonlinear space-fractional anomalous advection-diffusion equation. In the spatial direction, we use the finite element method, and in the temporal direction, we use the modified Crank-Nicolson approximation. Here the fractional derivative indicates the Caputo derivative. The error estimate for the fully discrete scheme is derived. And the numerical examples are also included which are in line with the theoretical analysis.

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

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

Newton-type methods for the mixed finite element discretization of some degenerate parabolic equations

NARCIS (Netherlands)

Radu, F.A.; Pop, I.S.; Knabner, P.; Bermúdez de Castro, A.; Gómez, D.; Quintela, P.; Salgado, P.

2006-01-01

In this paper we discuss some iterative approaches for solving the nonlinear algebraic systems encountered as fully discrete counterparts of some degenerate (fast diffusion) parabolic problems. After regularization, we combine a mixed finite element discretization with the Euler implicit scheme. For

Discrete dark matter

CERN Document Server

Hirsch, M; Peinado, E; Valle, J W F

2010-01-01

We propose a new motivation for the stability of dark matter (DM). We suggest that the same non-abelian discrete flavor symmetry which accounts for the observed pattern of neutrino oscillations, spontaneously breaks to a Z2 subgroup which renders DM stable. The simplest scheme leads to a scalar doublet DM potentially detectable in nuclear recoil experiments, inverse neutrino mass hierarchy, hence a neutrinoless double beta decay rate accessible to upcoming searches, while reactor angle equal to zero gives no CP violation in neutrino oscillations.

Birkhoffian Symplectic Scheme for a Quantum System

International Nuclear Information System (INIS)

Su Hongling

2010-01-01

In this paper, a classical system of ordinary differential equations is built to describe a kind of n-dimensional quantum systems. The absorption spectrum and the density of the states for the system are defined from the points of quantum view and classical view. From the Birkhoffian form of the equations, a Birkhoffian symplectic scheme is derived for solving n-dimensional equations by using the generating function method. Besides the Birkhoffian structure-preserving, the new scheme is proven to preserve the discrete local energy conservation law of the system with zero vector f. Some numerical experiments for a 3-dimensional example show that the new scheme can simulate the general Birkhoffian system better than the implicit midpoint scheme, which is well known to be symplectic scheme for Hamiltonian system. (general)

Strong Stability Preserving Property of the Deferred Correction Time Discretization

National Research Council Canada - National Science Library

Liu, Yuan; Shu, Chi-Wang; Zhang, Mengping

2007-01-01

In this paper, we study the strong stability preserving "SSP" property of a class of deferred correction time discretization methods, for solving the method-of-lines schemes approximating hyperbolic...

About the unitary discretizations of Heisenberg equations of motion

International Nuclear Information System (INIS)

Vazquez, L.

1986-01-01

In a recent paper Bender et al. (1985) have used a unitary discretization of Heisenberg equations for a one-dimensional quantum system in order to obtain information about the spectrum of the underlying continuum theory. The method consists in comparing the matrix elements between adjacent Fock states of the operators and at two steps. At the same time a very simple variational approach must be made. The purpose of this paper is to show that with unitary schemes, accurate either to order τ or τ 2 , we obtain the same spectrum results in the framework of the above method. On the other hand the same eigenvalues are obtained with a non-unitary scheme (Section II). In Section III we discuss the construction of the Hamiltonian associated to the unitary discretizations. (orig.)

Gröbner Bases and Generation of Difference Schemes for Partial Differential Equations

Directory of Open Access Journals (Sweden)

Vladimir P. Gerdt

2006-05-01

Full Text Available In this paper we present an algorithmic approach to the generation of fully conservative difference schemes for linear partial differential equations. The approach is based on enlargement of the equations in their integral conservation law form by extra integral relations between unknown functions and their derivatives, and on discretization of the obtained system. The structure of the discrete system depends on numerical approximation methods for the integrals occurring in the enlarged system. As a result of the discretization, a system of linear polynomial difference equations is derived for the unknown functions and their partial derivatives. A difference scheme is constructed by elimination of all the partial derivatives. The elimination can be achieved by selecting a proper elimination ranking and by computing a Gröbner basis of the linear difference ideal generated by the polynomials in the discrete system. For these purposes we use the difference form of Janet-like Gröbner bases and their implementation in Maple. As illustration of the described methods and algorithms, we construct a number of difference schemes for Burgers and Falkowich-Karman equations and discuss their numerical properties.

Analysis of a fourth-order compact scheme for convection-diffusion

International Nuclear Information System (INIS)

Yavneh, I.

1997-01-01

In, 1984 Gupta et al. introduced a compact fourth-order finite-difference convection-diffusion operator with some very favorable properties. In particular, this scheme does not seem to suffer excessively from spurious oscillatory behavior, and it converges with standard methods such as Gauss Seidel or SOR (hence, multigrid) regardless of the diffusion. This scheme has been rederived, developed (including some variations), and applied in both convection-diffusion and Navier-Stokes equations by several authors. Accurate solutions to high Reynolds-number flow problems at relatively coarse resolutions have been reported. These solutions were often compared to those obtained by lower order discretizations, such as second-order central differences and first-order upstream discretizations. The latter, it was stated, achieved far less accurate results due to the artificial viscosity, which the compact scheme did not include. We show here that, while the compact scheme indeed does not suffer from a cross-stream artificial viscosity (as does the first-order upstream scheme when the characteristic direction is not aligned with the grid), it does include a streamwise artificial viscosity that is inversely proportional to the natural viscosity. This term is not always benign. 7 refs., 1 fig., 1 tab

A Classification Scheme for Production System Processes

DEFF Research Database (Denmark)

Sørensen, Daniel Grud Hellerup; Brunø, Thomas Ditlev; Nielsen, Kjeld

2018-01-01

Manufacturing companies often have difficulties developing production platforms, partly due to the complexity of many production systems and difficulty determining which processes constitute a platform. Understanding production processes is an important step to identifying candidate processes...... for a production platform based on existing production systems. Reviewing a number of existing classifications and taxonomies, a consolidated classification scheme for processes in production of discrete products has been outlined. The classification scheme helps ensure consistency during mapping of existing...

Soft rotator model and {sup 246}Cm low-lying level scheme

Energy Technology Data Exchange (ETDEWEB)

Porodzinskij, Yu.V.; Sukhovitskij, E.Sh. [Radiation Physics and Chemistry Problems Inst., Minsk-Sosny (Belarus)

1997-03-01

Non-axial soft rotator nuclear model is suggested as self-consistent approach for interpretation of level schemes, {gamma}-transition probabilities and neutron interaction with even-even nuclei. (author)

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

Identification of discrete chaotic maps with singular points

Directory of Open Access Journals (Sweden)

P. G. Akishin

2001-01-01

Full Text Available We investigate the ability of artificial neural networks to reconstruct discrete chaotic maps with singular points. We use as a simple test model the Cusp map. We compare the traditional Multilayer Perceptron, the Chebyshev Neural Network and the Wavelet Neural Network. The numerical scheme for the accurate determination of a singular point is also developed. We show that combining a neural network with the numerical algorithm for the determination of the singular point we are able to accurately approximate discrete chaotic maps with singularities.

Discrete quantum Fourier transform in coupled semiconductor double quantum dot molecules

International Nuclear Information System (INIS)

Dong Ping; Yang Ming; Cao Zhuoliang

2008-01-01

In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible unitary transformations. The current scheme would be a useful step towards the realization of complex quantum algorithms in the quantum dot system

On an integrable discretization of the modified Korteweg-de Vries equation

Science.gov (United States)

Suris, Yuri B.

1997-02-01

We find time discretizations for the two “second flows” of the Ablowitz-Ladik hierachy. These discretizations are described by local equations of motion, as opposed to the previously known ones, due to Taha and Ablowitz. Certain superpositions of our maps allow a one-field reduction and serve therefore as valid space-time discretizations of the modified Korteweg-de Vries equation. We expect the performance of these discretizations to be much better then that of the Taha-Ablowitz scheme. The way of finding interpolating Hamiltonians for our maps is also indicated, as well as the solution of an initial value problem in terms of matrix factorizations.

Analytical reconstruction schemes for coarse-mesh spectral nodal solution of slab-geometry SN transport problems

International Nuclear Information System (INIS)

Barros, R. C.; Filho, H. A.; Platt, G. M.; Oliveira, F. B. S.; Militao, D. S.

2009-01-01

Coarse-mesh numerical methods are very efficient in the sense that they generate accurate results in short computational time, as the number of floating point operations generally decrease, as a result of the reduced number of mesh points. On the other hand, they generate numerical solutions that do not give detailed information on the problem solution profile, as the grid points can be located considerably away from each other. In this paper we describe two analytical reconstruction schemes for the coarse-mesh solution generated by the spectral nodal method for neutral particle discrete ordinates (S N ) transport model in slab geometry. The first scheme we describe is based on the analytical reconstruction of the coarse-mesh solution within each discretization cell of the spatial grid set up on the slab. The second scheme is based on the angular reconstruction of the discrete ordinates solution between two contiguous ordinates of the angular quadrature set used in the S N model. Numerical results are given so we can illustrate the accuracy of the two reconstruction schemes, as described in this paper. (authors)

New data on excited level scheme of 73Ge nucleus

International Nuclear Information System (INIS)

Kosyak, Yu.G.; Kaipov, D.K.; Chekushina, L.V.

1990-01-01

New data on the scheme of 73 Ge decay obtained by the method of reactor fast neutron inelastic scattering are presented. γ-Spectra from reaction 73 Ge(n, n'γ) 73 Ge at the angles of 90 and 124 deg of relatively incident neutron beam have been measured. Experimental populations of the levels are studied. 29 new γ-transitions have been identified, two new levels have been introduced

A Study on the Security Levels of Spread-Spectrum Embedding Schemes in the WOA Framework.

Science.gov (United States)

Wang, Yuan-Gen; Zhu, Guopu; Kwong, Sam; Shi, Yun-Qing

2017-08-23

Security analysis is a very important issue for digital watermarking. Several years ago, according to Kerckhoffs' principle, the famous four security levels, namely insecurity, key security, subspace security, and stego-security, were defined for spread-spectrum (SS) embedding schemes in the framework of watermarked-only attack. However, up to now there has been little application of the definition of these security levels to the theoretical analysis of the security of SS embedding schemes, due to the difficulty of the theoretical analysis. In this paper, based on the security definition, we present a theoretical analysis to evaluate the security levels of five typical SS embedding schemes, which are the classical SS, the improved SS (ISS), the circular extension of ISS, the nonrobust and robust natural watermarking, respectively. The theoretical analysis of these typical SS schemes are successfully performed by taking advantage of the convolution of probability distributions to derive the probabilistic models of watermarked signals. Moreover, simulations are conducted to illustrate and validate our theoretical analysis. We believe that the theoretical and practical analysis presented in this paper can bridge the gap between the definition of the four security levels and its application to the theoretical analysis of SS embedding schemes.

An error estimate for Tremolieres method for the discretization of parabolic variational inequalities

International Nuclear Information System (INIS)

Uko, L.U.

1990-02-01

We study a scheme for the time-discretization of parabolic variational inequalities that is often easier to use than the classical method of Rothe. We show that if the data are compatible in a certain sense, then this scheme is of order ≥1/2. (author). 10 refs

Hybrid upwind discretization of nonlinear two-phase flow with gravity

Science.gov (United States)

Lee, S. H.; Efendiev, Y.; Tchelepi, H. A.

2015-08-01

time discretization to yield a fully implicit method. In the HU scheme, the phase flux is divided into two parts based on the driving force. The viscous-driven and buoyancy-driven phase fluxes are upwinded differently. Specifically, the viscous flux, which is always co-current, is upwinded based on the direction of the total-velocity. The buoyancy-driven flux across an interface is always counter-current and is upwinded such that the heavier fluid goes downward and the lighter fluid goes upward. We analyze the properties of the Implicit Hybrid Upwinding (IHU) scheme. It is shown that IHU is locally conservative and produces monotone, physically-consistent numerical solutions. The IHU solutions show numerical diffusion levels that are slightly higher than those for standard FIM (i.e., implicit PPU). The primary advantage of the IHU scheme is that the numerical overall-flux of a fluid phase remains continuous and differentiable as the flow regime changes between co-current and counter-current conditions. This is in contrast to the standard phase-potential upwinding scheme, in which the overall fractional-flow (flux) function is non-differentiable across the boundary between co-current and counter-current flows.

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.

Consequences of inelastic discrete-level neutron-collision mechanics for inelastic continuum scattering

Energy Technology Data Exchange (ETDEWEB)

Hoogenboom, J.E. (Technische Hogeschool Delft (Netherlands))

1983-01-01

From the collision mechanics of inelastic discrete-level scattering several properties are derived for the secondary-neutron energy distribution (SNED) for inelastic continuum scattering, when conceived as scattering with continuously-distributed inelastic levels. Using assumptions about the level density and neutron cross section the SNED can be calculated and some examples are shown. A formula is derived to calculate from a given inelastic continuum SNED a function, which is proportional to the level density and the neutron cross section. From this relation further conditions follow for the SNED. Representations for the inelastic continuum SNED currently in use do not, in general, satisfy most of the derived conditions.

Consequences of inelastic discrete-level neutron-collision mechanics for inelastic continuum scattering

International Nuclear Information System (INIS)

Hoogenboom, J.E.

1983-01-01

From the collision mechanics of inelastic discrete-level scattering several properties are derived for the secondary-neutron energy distribution (SNED) for inelastic continuum scattering, when conceived as scattering with continuously-distributed inelastic levels. Using assumptions about the level density and neutron cross section the SNED can be calculated and some examples are shown. A formula is derived to calculate from a given inelastic continuum SNED a function, which is proportional to the level density and the neutron cross section. From this relation further conditions follow for the SNED. Representations for the inelastic continuum SNED currently in use do not, in general, satisfy most of the derived conditions. (author)

A linear multiple balance method for discrete ordinates neutron transport equations

International Nuclear Information System (INIS)

Park, Chang Je; Cho, Nam Zin

2000-01-01

A linear multiple balance method (LMB) is developed to provide more accurate and positive solutions for the discrete ordinates neutron transport equations. In this multiple balance approach, one mesh cell is divided into two subcells with quadratic approximation of angular flux distribution. Four multiple balance equations are used to relate center angular flux with average angular flux by Simpson's rule. From the analysis of spatial truncation error, the accuracy of the linear multiple balance scheme is ο(Δ 4 ) whereas that of diamond differencing is ο(Δ 2 ). To accelerate the linear multiple balance method, we also describe a simplified additive angular dependent rebalance factor scheme which combines a modified boundary projection acceleration scheme and the angular dependent rebalance factor acceleration schme. It is demonstrated, via fourier analysis of a simple model problem as well as numerical calculations, that the additive angular dependent rebalance factor acceleration scheme is unconditionally stable with spectral radius < 0.2069c (c being the scattering ration). The numerical results tested so far on slab-geometry discrete ordinates transport problems show that the solution method of linear multiple balance is effective and sufficiently efficient

Particle Swarm Based Approach of a Real-Time Discrete Neural Identifier for Linear Induction Motors

Directory of Open Access Journals (Sweden)

Alma Y. Alanis

2013-01-01

Full Text Available This paper focusses on a discrete-time neural identifier applied to a linear induction motor (LIM model, whose model is assumed to be unknown. This neural identifier is robust in presence of external and internal uncertainties. The proposed scheme is based on a discrete-time recurrent high-order neural network (RHONN trained with a novel algorithm based on extended Kalman filter (EKF and particle swarm optimization (PSO, using an online series-parallel con…figuration. Real-time results are included in order to illustrate the applicability of the proposed scheme.

Certificateless Key-Insulated Generalized Signcryption Scheme without Bilinear Pairings

Directory of Open Access Journals (Sweden)

Caixue Zhou

2017-01-01

Full Text Available Generalized signcryption (GSC can be applied as an encryption scheme, a signature scheme, or a signcryption scheme with only one algorithm and one key pair. A key-insulated mechanism can resolve the private key exposure problem. To ensure the security of cloud storage, we introduce the key-insulated mechanism into GSC and propose a concrete scheme without bilinear pairings in the certificateless cryptosystem setting. We provide a formal definition and a security model of certificateless key-insulated GSC. Then, we prove that our scheme is confidential under the computational Diffie-Hellman (CDH assumption and unforgeable under the elliptic curve discrete logarithm (EC-DL assumption. Our scheme also supports both random-access key update and secure key update. Finally, we evaluate the efficiency of our scheme and demonstrate that it is highly efficient. Thus, our scheme is more suitable for users who communicate with the cloud using mobile devices.

High-order discrete ordinate transport in non-conforming 2D Cartesian meshes

International Nuclear Information System (INIS)

Gastaldo, L.; Le Tellier, R.; Suteau, C.; Fournier, D.; Ruggieri, J. M.

2009-01-01

We present in this paper a numerical scheme for solving the time-independent first-order form of the Boltzmann equation in non-conforming 2D Cartesian meshes. The flux solution technique used here is the discrete ordinate method and the spatial discretization is based on discontinuous finite elements. In order to have p-refinement capability, we have chosen a hierarchical polynomial basis based on Legendre polynomials. The h-refinement capability is also available and the element interface treatment has been simplified by the use of special functions decomposed over the mesh entities of an element. The comparison to a classical S N method using the Diamond Differencing scheme as spatial approximation confirms the good behaviour of the method. (authors)

Final Report for DOE grant DE-FG02-07ER64432 "New Grid and Discretization Technologies for Ocean and Ice Simulations"

Energy Technology Data Exchange (ETDEWEB)

Gunzburger, Max

2013-03-12

The work reported is in pursuit of these goals: high-quality unstructured, non-uniform Voronoi and Delaunay grids; improved finite element and finite volume discretization schemes; and improved finite element and finite volume discretization schemes. These are sought for application to spherical and three-dimensional applications suitable for ocean, atmosphere, ice-sheet, and other climate modeling applications.

Solving phase appearance/disappearance two-phase flow problems with high resolution staggered grid and fully implicit schemes by the Jacobian-free Newton–Krylov Method

Energy Technology Data Exchange (ETDEWEB)

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-04-01

The phase appearance/disappearance issue presents serious numerical challenges in two-phase flow simulations. Many existing reactor safety analysis codes use different kinds of treatments for the phase appearance/disappearance problem. However, to our best knowledge, there are no fully satisfactory solutions. Additionally, the majority of the existing reactor system analysis codes were developed using low-order numerical schemes in both space and time. In many situations, it is desirable to use high-resolution spatial discretization and fully implicit time integration schemes to reduce numerical errors. In this work, we adapted a high-resolution spatial discretization scheme on staggered grid mesh and fully implicit time integration methods (such as BDF1 and BDF2) to solve the two-phase flow problems. The discretized nonlinear system was solved by the Jacobian-free Newton Krylov (JFNK) method, which does not require the derivation and implementation of analytical Jacobian matrix. These methods were tested with a few two-phase flow problems with phase appearance/disappearance phenomena considered, such as a linear advection problem, an oscillating manometer problem, and a sedimentation problem. The JFNK method demonstrated extremely robust and stable behaviors in solving the two-phase flow problems with phase appearance/disappearance. No special treatments such as water level tracking or void fraction limiting were used. High-resolution spatial discretization and second- order fully implicit method also demonstrated their capabilities in significantly reducing numerical errors.

Synchronization of discrete-time hyperchaotic systems: An application in communications

International Nuclear Information System (INIS)

Aguilar-Bustos, A.Y.; Cruz-Hernandez, C.

2009-01-01

In this paper, the synchronization problem of discrete-time complex dynamics is presented. In particular, we use the model-matching approach from nonlinear control theory to synchronize two unidirectionally coupled discrete-time hyperchaotic systems. A potential application to secure/private communication of confidential information is also given. By using different (hyperchaotic) encryption schemes with a single and two transmission channels, we show that output synchronization of hyperchaotic maps is indeed suitable for encryption, transmission, and decryption of information.

ZZ-CENPL, Chinese Evaluated Nuclear Parameter Library. ZZ CENPL-DLS, Discrete Level Schemes and Gamma Branching Ratios Library; ZZ CENPL-FBP, Fission Barrier Parameter Library; ZZ CENPL-GDRP, Giant Dipole Resonance Parameter Library; ZZ CENPL-NLD, Nuclear Level Density Parameter Library; ZZ CENPL-MCC, Nuclear Ground State Atomic Masses Library; ZZ CENPL-OMP, Optical Model Parameter Library

International Nuclear Information System (INIS)

Su Zongdi

1995-01-01

Description of program or function: CENPL - GDRP (Giant Dipole Resonance Parameters for Gamma-Ray): - Format: special format described in documentation; - Nuclides: V, Mn, Co, Ni, Cu, Zn, Ga, Ge, As, Se, Rb, Sr, Y, Zr, Nb, Mo, Rh, Pd, Ag, Cd, In, Sn, Sb, Te, I, Cs, Ba, La, Ce, Pr, Nd, Sm, Eu, Gd, Tb, Ho, Er, Lu, Ta, W, Re, Os, Ir, Pt, Au, Hg, Pb, Bi, Th, U, Np, Pu. - Origin: Experimental values offered by S.S. Dietrich and B.L. Berman. CENPL - FBP (Fission Barrier Parameter Sub-Library): - Format: special format described in documentation; - Nuclides: (1) 51 nuclei region from Th-230 to Cf-255, (2) 46 nuclei region from Th-229 to Cf-253, (3) 24 nuclei region from Pa-232 to Cf-253; - Origin: (1) Lynn, (2) Analysis of experimental data by Back et al., (3) Ohsawa. CENPL - DLS (Discrete level scheme and branch ratio of gamma decay: - Format: Special format described in documentation; - Origin: ENSDF - BNL. CENPL - NLD (Nuclear Level Density): - Format: Special format described in documentation; - Origin: Huang Zhongfu et al. CENPL - OMP (Optical model parameter sub-library): - Format: special format described in documentation ; - Origin: CENDL, ENDF/B-VI, JENDL-3. CENPL - MC (I) and (II) (Atomic masses and characteristic constants for nuclear ground states) : - Format: Brief table format; - Nuclides: 4760 nuclides ranging from Z=0 A=1 to Z=122 A=318. - Origin: Experimental data and systematic results evaluated by Wapstra, theoretical results calculated by Moller, ENSDF - BNL and Nuclear Wallet Cards. CENPL contains the following six sub-libraries: 1. Atomic Masses and Characteristic Constants for nuclear ground states (MCC). This data consists of calculated and in most cases also measured mass excesses, atomic masses, total binding energies, spins, parities, and half-lives of nuclear ground states, abundances, etc. for 4800 nuclides. 2. Discrete Level Schemes and branching ratios of gamma decay (DLS). The data on nuclear discrete levels are based on the Evaluated

Scheme of 2-dimensional atom localization for a three-level atom via quantum coherence

OpenAIRE

Zafar, Sajjad; Ahmed, Rizwan; Khan, M. Khalid

2013-01-01

We present a scheme for two-dimensional (2D) atom localization in a three-level atomic system. The scheme is based on quantum coherence via classical standing wave fields between the two excited levels. Our results show that conditional position probability is significantly phase dependent of the applied field and frequency detuning of spontaneously emitted photons. We obtain a single localization peak having probability close to unity by manipulating the control parameters. The effect of ato...

An Iteration Scheme for Contraction Mappings with an Application to Synchronization of Discrete Logistic Maps

Directory of Open Access Journals (Sweden)

Ke Ding

2017-01-01

Full Text Available This paper deals with designing a new iteration scheme associated with a given scheme for contraction mappings. This new scheme has a similar structure to that of the given scheme, in which those two iterative schemes converge to the same fixed point of the given contraction mapping. The positive influence of feedback parameters on the convergence rate of this new scheme is investigated. Moreover, the derived convergence and comparison results can be extended to nonexpansive mappings. As an application, the derived results are utilized to study the synchronization of logistic maps. Two illustrated examples are used to reveal the effectiveness of our results.

Discrete event simulation of the Defense Waste Processing Facility (DWPF) analytical laboratory

International Nuclear Information System (INIS)

Shanahan, K.L.

1992-02-01

A discrete event simulation of the Savannah River Site (SRS) Defense Waste Processing Facility (DWPF) analytical laboratory has been constructed in the GPSS language. It was used to estimate laboratory analysis times at process analytical hold points and to study the effect of sample number on those times. Typical results are presented for three different simultaneous representing increasing levels of complexity, and for different sampling schemes. Example equipment utilization time plots are also included. SRS DWPF laboratory management and chemists found the simulations very useful for resource and schedule planning

An adjoint-based scheme for eigenvalue error improvement

International Nuclear Information System (INIS)

Merton, S.R.; Smedley-Stevenson, R.P.; Pain, C.C.; El-Sheikh, A.H.; Buchan, A.G.

2011-01-01

A scheme for improving the accuracy and reducing the error in eigenvalue calculations is presented. Using a rst order Taylor series expansion of both the eigenvalue solution and the residual of the governing equation, an approximation to the error in the eigenvalue is derived. This is done using a convolution of the equation residual and adjoint solution, which is calculated in-line with the primal solution. A defect correction on the solution is then performed in which the approximation to the error is used to apply a correction to the eigenvalue. The method is shown to dramatically improve convergence of the eigenvalue. The equation for the eigenvalue is shown to simplify when certain normalizations are applied to the eigenvector. Two such normalizations are considered; the rst of these is a fission-source type of normalisation and the second is an eigenvector normalisation. Results are demonstrated on a number of demanding elliptic problems using continuous Galerkin weighted nite elements. Moreover, the correction scheme may also be applied to hyperbolic problems and arbitrary discretization. This is not limited to spatial corrections and may be used throughout the phase space of the discrete equation. The applied correction not only improves fidelity of the calculation, it allows assessment of the reliability of numerical schemes to be made and could be used to guide mesh adaption algorithms or to automate mesh generation schemes. (author)

Geometric Integration Of The Valsov-Maxwell System With A Variational Particle-in-cell Scheme

International Nuclear Information System (INIS)

Squire, J.; Qin, H.; Tang, W.M.

2012-01-01

A fully variational, unstructured, electromagnetic particle-in-cell integrator is developed for integration of the Vlasov-Maxwell equations. Using the formalism of Discrete Exterior Calculus [1], the field solver, interpolation scheme and particle advance algorithm are derived through minimization of a single discrete field theory action. As a consequence of ensuring that the action is invariant under discrete electromagnetic gauge transformations, the integrator exactly conserves Gauss's law.

Discretization of Stationary Solutions of Stochastic Systems Driven by Fractional Brownian Motion

International Nuclear Information System (INIS)

Garrido-Atienza, Maria J.; Kloeden, Peter E.; Neuenkirch, Andreas

2009-01-01

In this article we study the behavior of dissipative systems with additive fractional noise of any Hurst parameter. Under a one-sided dissipative Lipschitz condition on the drift the continuous stochastic system is shown to have a unique stationary solution, which pathwise attracts all other solutions. The same holds for the discretized stochastic system, if the drift-implicit Euler method is used for the discretization. Moreover, the unique stationary solution of the drift-implicit Euler scheme converges to the unique stationary solution of the original system as the stepsize of the discretization decreases

Time-discrete higher order ALE formulations: a priori error analysis

KAUST Repository

Bonito, Andrea; Kyza, Irene; Nochetto, Ricardo H.

2013-01-01

We derive optimal a priori error estimates for discontinuous Galerkin (dG) time discrete schemes of any order applied to an advection-diffusion model defined on moving domains and written in the Arbitrary Lagrangian Eulerian (ALE) framework. Our

Low-frequency logarithmic discretization of the reservoir spectrum for improving the efficiency of hierarchical equations of motion approach.

Science.gov (United States)

Ye, LvZhou; Zhang, Hou-Dao; Wang, Yao; Zheng, Xiao; Yan, YiJing

2017-08-21

An efficient low-frequency logarithmic discretization (LFLD) scheme for the decomposition of fermionic reservoir spectrum is proposed for the investigation of quantum impurity systems. The scheme combines the Padé spectrum decomposition (PSD) and a logarithmic discretization of the residual part in which the parameters are determined based on an extension of the recently developed minimum-dissipaton ansatz [J. J. Ding et al., J. Chem. Phys. 145, 204110 (2016)]. A hierarchical equations of motion (HEOM) approach is then employed to validate the proposed scheme by examining the static and dynamic system properties in both the Kondo and noninteracting regimes. The LFLD scheme requires a much smaller number of exponential functions than the conventional PSD scheme to reproduce the reservoir correlation function and thus facilitates the efficient implementation of the HEOM approach in extremely low temperature regimes.

Advances in the discrete ordinates and finite volume methods for the solution of radiative heat transfer problems in participating media

International Nuclear Information System (INIS)

Coelho, Pedro J.

2014-01-01

Many methods are available for the solution of radiative heat transfer problems in participating media. Among these, the discrete ordinates method (DOM) and the finite volume method (FVM) are among the most widely used ones. They provide a good compromise between accuracy and computational requirements, and they are relatively easy to integrate in CFD codes. This paper surveys recent advances on these numerical methods. Developments concerning the grid structure (e.g., new formulations for axisymmetrical geometries, body-fitted structured and unstructured meshes, embedded boundaries, multi-block grids, local grid refinement), the spatial discretization scheme, and the angular discretization scheme are described. Progress related to the solution accuracy, solution algorithm, alternative formulations, such as the modified DOM and FVM, even-parity formulation, discrete-ordinates interpolation method and method of lines, and parallelization strategies is addressed. The application to non-gray media, variable refractive index media, and transient problems is also reviewed. - Highlights: • We survey recent advances in the discrete ordinates and finite volume methods. • Developments in spatial and angular discretization schemes are described. • Progress in solution algorithms and parallelization methods is reviewed. • Advances in the transient solution of the radiative transfer equation are appraised. • Non-gray media and variable refractive index media are briefly addressed

A dynamic discretization method for reliability inference in Dynamic Bayesian Networks

International Nuclear Information System (INIS)

Zhu, Jiandao; Collette, Matthew

2015-01-01

The material and modeling parameters that drive structural reliability analysis for marine structures are subject to a significant uncertainty. This is especially true when time-dependent degradation mechanisms such as structural fatigue cracking are considered. Through inspection and monitoring, information such as crack location and size can be obtained to improve these parameters and the corresponding reliability estimates. Dynamic Bayesian Networks (DBNs) are a powerful and flexible tool to model dynamic system behavior and update reliability and uncertainty analysis with life cycle data for problems such as fatigue cracking. However, a central challenge in using DBNs is the need to discretize certain types of continuous random variables to perform network inference while still accurately tracking low-probability failure events. Most existing discretization methods focus on getting the overall shape of the distribution correct, with less emphasis on the tail region. Therefore, a novel scheme is presented specifically to estimate the likelihood of low-probability failure events. The scheme is an iterative algorithm which dynamically partitions the discretization intervals at each iteration. Through applications to two stochastic crack-growth example problems, the algorithm is shown to be robust and accurate. Comparisons are presented between the proposed approach and existing methods for the discretization problem. - Highlights: • A dynamic discretization method is developed for low-probability events in DBNs. • The method is compared to existing approaches on two crack growth problems. • The method is shown to improve on existing methods for low-probability events

Higher-order schemes for the Laplace transformation method for parabolic problems

KAUST Repository

Douglas, C.

2011-01-01

In this paper we solve linear parabolic problems using the three stage noble algorithms. First, the time discretization is approximated using the Laplace transformation method, which is both parallel in time (and can be in space, too) and extremely high order convergent. Second, higher-order compact schemes of order four and six are used for the the spatial discretization. Finally, the discretized linear algebraic systems are solved using multigrid to show the actual convergence rate for numerical examples, which are compared to other numerical solution methods. © 2011 Springer-Verlag.

Discrete quintic spline for boundary value problem in plate deflation theory

Science.gov (United States)

Wong, Patricia J. Y.

2017-07-01

We propose a numerical scheme for a fourth-order boundary value problem arising from plate deflation theory. The scheme involves a discrete quintic spline, and it is of order 4 if a parameter takes a specific value, else it is of order 2. We also present a well known numerical example to illustrate the efficiency of our method as well as to compare with other numerical methods proposed in the literature.

A Positivity-Preserving Numerical Scheme for Nonlinear Option Pricing Models

Directory of Open Access Journals (Sweden)

Shengwu Zhou

2012-01-01

Full Text Available A positivity-preserving numerical method for nonlinear Black-Scholes models is developed in this paper. The numerical method is based on a nonstandard approximation of the second partial derivative. The scheme is not only unconditionally stable and positive, but also allows us to solve the discrete equation explicitly. Monotone properties are studied in order to avoid unwanted oscillations of the numerical solution. The numerical results for European put option and European butterfly spread are compared to the standard finite difference scheme. It turns out that the proposed scheme is efficient and reliable.

Designing carbon taxation schemes for automobiles: A simulation exercise for Germany

OpenAIRE

Adamou, Adamos; Clerides, Sofronis; Zachariadis, Theodoros

2011-01-01

Vehicle taxation based on CO2 emissions is increasingly being adopted worldwide in order to shift consumer purchases to low-carbon cars, yet little is known about the effectiveness and overall economic impact of these schemes. We focus on feebate schemes, which impose a fee on high-carbon vehicles and give a rebate to purchasers of low-carbon automobiles. We estimate a discrete choice model of demand for automobiles in Germany and simulate the impact of alternative feebate schemes on emission...

Impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks.

Science.gov (United States)

Chen, Wu-Hua; Lu, Xiaomei; Zheng, Wei Xing

2015-04-01

This paper investigates the problems of impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks (DDNNs). Two types of DDNNs with stabilizing impulses are studied. By introducing the time-varying Lyapunov functional to capture the dynamical characteristics of discrete-time impulsive delayed neural networks (DIDNNs) and by using a convex combination technique, new exponential stability criteria are derived in terms of linear matrix inequalities. The stability criteria for DIDNNs are independent of the size of time delay but rely on the lengths of impulsive intervals. With the newly obtained stability results, sufficient conditions on the existence of linear-state feedback impulsive controllers are derived. Moreover, a novel impulsive synchronization scheme for two identical DDNNs is proposed. The novel impulsive synchronization scheme allows synchronizing two identical DDNNs with unknown delays. Simulation results are given to validate the effectiveness of the proposed criteria of impulsive stabilization and impulsive synchronization of DDNNs. Finally, an application of the obtained impulsive synchronization result for two identical chaotic DDNNs to a secure communication scheme is presented.

Convergence of discrete Aubry–Mather model in the continuous limit

Science.gov (United States)

Su, Xifeng; Thieullen, Philippe

2018-05-01

We develop two approximation schemes for solving the cell equation and the discounted cell equation using Aubry–Mather–Fathi theory. The Hamiltonian is supposed to be Tonelli, time-independent and periodic in space. By Legendre transform it is equivalent to find a fixed point of some nonlinear operator, called Lax-Oleinik operator, which may be discounted or not. By discretizing in time, we are led to solve an additive eigenvalue problem involving a discrete Lax–Oleinik operator. We show how to approximate the effective Hamiltonian and some weak KAM solutions by letting the time step in the discrete model tend to zero. We also obtain a selected discrete weak KAM solution as in Davini et al (2016 Invent. Math. 206 29–55), and show that it converges to a particular solution of the cell equation. In order to unify the two settings, continuous and discrete, we develop a more general formalism of the short-range interactions.

Physics-preserving averaging scheme based on Grunwald-Letnikov formula for gas flow in fractured media

KAUST Repository

Amir, Sahar Z.

2018-01-02

The heterogeneous natures of rock fabrics, due to the existence of multi-scale fractures and geological formations, led to the deviations from unity in the flux-equations fractional-exponent magnitudes. In this paper, the resulting non-Newtonian non-Darcy fractional-derivatives flux equations are solved using physics-preserving averaging schemes that incorporates both, original and shifted, Grunwald-Letnikov (GL) approximation formulas preserving the physics, by reducing the shifting effects, while maintaining the stability of the system, by keeping one shifted expansion. The proposed way of using the GL expansions also generate symmetrical coefficient matrices that significantly reduces the discretization complexities appearing with all shifted cases from literature, and help considerably in 2D and 3D systems. Systems equations derivations and discretization details are discussed. Then, the physics-preserving averaging scheme is explained and illustrated. Finally, results are presented and reviewed. Edge-based original GL expansions are unstable as also illustrated in literatures. Shifted GL expansions are stable but add a lot of additional weights to both discretization sides affecting the physical accuracy. In comparison, the physics-preserving averaging scheme balances the physical accuracy and stability requirements leading to a more physically conservative scheme that is more stable than the original GL approximation but might be slightly less stable than the shifted GL approximations. It is a locally conservative Single-Continuum averaging scheme that applies a finite-volume viewpoint.

Physics-preserving averaging scheme based on Grunwald-Letnikov formula for gas flow in fractured media

KAUST Repository

Amir, Sahar Z.; Sun, Shuyu

2018-01-01

The heterogeneous natures of rock fabrics, due to the existence of multi-scale fractures and geological formations, led to the deviations from unity in the flux-equations fractional-exponent magnitudes. In this paper, the resulting non-Newtonian non-Darcy fractional-derivatives flux equations are solved using physics-preserving averaging schemes that incorporates both, original and shifted, Grunwald-Letnikov (GL) approximation formulas preserving the physics, by reducing the shifting effects, while maintaining the stability of the system, by keeping one shifted expansion. The proposed way of using the GL expansions also generate symmetrical coefficient matrices that significantly reduces the discretization complexities appearing with all shifted cases from literature, and help considerably in 2D and 3D systems. Systems equations derivations and discretization details are discussed. Then, the physics-preserving averaging scheme is explained and illustrated. Finally, results are presented and reviewed. Edge-based original GL expansions are unstable as also illustrated in literatures. Shifted GL expansions are stable but add a lot of additional weights to both discretization sides affecting the physical accuracy. In comparison, the physics-preserving averaging scheme balances the physical accuracy and stability requirements leading to a more physically conservative scheme that is more stable than the original GL approximation but might be slightly less stable than the shifted GL approximations. It is a locally conservative Single-Continuum averaging scheme that applies a finite-volume viewpoint.

A SEMI-LAGRANGIAN TWO-LEVEL PRECONDITIONED NEWTON-KRYLOV SOLVER FOR CONSTRAINED DIFFEOMORPHIC IMAGE REGISTRATION.

Science.gov (United States)

Mang, Andreas; Biros, George

2017-01-01

We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation. We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve for a stationary velocity field using a preconditioned, globalized, matrix-free Newton-Krylov scheme. We propose and test a two-level Hessian preconditioner. We consider two strategies for inverting the preconditioner on the coarse grid: a nested preconditioned conjugate gradient method (exact solve) and a nested Chebyshev iterative method (inexact solve) with a fixed number of iterations. We test the performance of our solver in different synthetic and real-world two-dimensional application scenarios. We study grid convergence and computational efficiency of our new scheme. We compare the performance of our solver against our initial implementation that uses the same spatial discretization but a standard, explicit, second-order Runge-Kutta scheme for the numerical time integration of the transport equations and a single-level preconditioner. Our improved scheme delivers significant speedups over our original implementation. As a highlight, we observe a 20 × speedup for a two dimensional, real world multi-subject medical image registration problem.

Non Standard Finite Difference Scheme for Mutualistic Interaction Description

OpenAIRE

Gabbriellini, Gianluca

2012-01-01

One of the more interesting themes of the mathematical ecology is the description of the mutualistic interaction between two interacting species. Based on continuous-time model developed by Holland and DeAngelis 2009 for consumer-resource mutualism description, this work deals with the application of the Mickens Non Standard Finite Difference method to transform the continuous-time scheme into a discrete-time one. It has been proved that the Mickens scheme is dynamically consistent with the o...

On the integration scheme along a trajectory for the characteristics method

International Nuclear Information System (INIS)

Le Tellier, Romain; Hebert, Alain

2006-01-01

The issue of the integration scheme along a trajectory which appears for all tracking-based transport methods is discussed from the point of view of the method of characteristics. The analogy with the discrete ordinates method in slab geometry is highlighted along with the practical limitation in transposing high-order S N schemes to a trajectory-based method. We derived an example of such a transposition starting from the linear characteristic scheme. This new scheme is compared with the standard flat-source approximation of the step characteristic scheme and with the diamond differencing scheme. The numerical study covers a 1D analytical case, 2D one-group critical and fixed-source benchmarks and finally a realistic multigroup calculation on a BWR-MOX assembly

Discrete-time control system design with applications

CERN Document Server

Rabbath, C A

2014-01-01

This book presents practical techniques of discrete-time control system design. In general, the design techniques lead to low-order dynamic compensators that ensure satisfactory closed-loop performance for a wide range of sampling rates. The theory is given in the form of theorems, lemmas, and propositions. The design of the control systems is presented as step-by-step procedures and algorithms. The proposed feedback control schemes are applied to well-known dynamic system models. This book also discusses: Closed-loop performance of generic models of mobile robot and airborne pursuer dynamic systems under discrete-time feedback control with limited computing capabilities Concepts of discrete-time models and sampled-data models of continuous-time systems, for both single- and dual-rate operation Local versus global digital redesign Optimal, closed-loop digital redesign methods Plant input mapping design Generalized holds and samplers for use in feedback control loops, Numerical simulation of fixed-point arithm...

Proposed classification scheme for high-level and other radioactive wastes

International Nuclear Information System (INIS)

Kocher, D.C.; Croff, A.G.

1986-01-01

The Nuclear Waste Policy Act (NWPA) of 1982 defines high-level radioactive waste (HLW) as: (A) the highly radioactive material resulting from the reprocessing of spent nuclear fuel....that contains fission products in sufficient concentrations; and (B) other highly radioactive material that the Commission....determines....requires permanent isolation. This paper presents a generally applicable quantitative definition of HLW that addresses the description in paragraph (B). The approach also results in definitions of other waste classes, i.e., transuranic (TRU) and low-level waste (LLW). A basic waste classification scheme results from the quantitative definitions

The Full—Discrete Mixed Finite Element Methods for Nonlinear Hyperbolic Equations

Institute of Scientific and Technical Information of China (English)

YanpingCHEN; YunqingHUANG

1998-01-01

This article treats mixed finite element methods for second order nonlinear hyperbolic equations.A fully discrete scheme is presented and improved L2-error estimates are established.The convergence of both the function value andthe flux is demonstrated.

Analysis of a discrete element method and coupling with a compressible fluid flow method

International Nuclear Information System (INIS)

Monasse, L.

2011-01-01

This work aims at the numerical simulation of compressible fluid/deformable structure interactions. In particular, we have developed a partitioned coupling algorithm between a Finite Volume method for the compressible fluid and a Discrete Element method capable of taking into account fractures in the solid. A survey of existing fictitious domain methods and partitioned algorithms has led to choose an Embedded Boundary method and an explicit coupling scheme. We first showed that the Discrete Element method used for the solid yielded the correct macroscopic behaviour and that the symplectic time-integration scheme ensured the preservation of energy. We then developed an explicit coupling algorithm between a compressible inviscid fluid and an un-deformable solid. Mass, momentum and energy conservation and consistency properties were proved for the coupling scheme. The algorithm was then extended to the coupling with a deformable solid, in the form of a semi implicit scheme. Finally, we applied this method to unsteady inviscid flows around moving structures: comparisons with existing numerical and experimental results demonstrate the excellent accuracy of our method. (author) [fr

Multi-level Monte Carlo Methods for Efficient Simulation of Coulomb Collisions

Science.gov (United States)

Ricketson, Lee

2013-10-01

We discuss the use of multi-level Monte Carlo (MLMC) schemes--originally introduced by Giles for financial applications--for the efficient simulation of Coulomb collisions in the Fokker-Planck limit. The scheme is based on a Langevin treatment of collisions, and reduces the computational cost of achieving a RMS error scaling as ɛ from O (ɛ-3) --for standard Langevin methods and binary collision algorithms--to the theoretically optimal scaling O (ɛ-2) for the Milstein discretization, and to O (ɛ-2 (logɛ)2) with the simpler Euler-Maruyama discretization. In practice, this speeds up simulation by factors up to 100. We summarize standard MLMC schemes, describe some tricks for achieving the optimal scaling, present results from a test problem, and discuss the method's range of applicability. This work was performed under the auspices of the U.S. DOE by the University of California, Los Angeles, under grant DE-FG02-05ER25710, and by LLNL under contract DE-AC52-07NA27344.

Convergence Analysis of a FV-FE Scheme for Partially Miscible Two-Phase Flow in Anisotropic Porous Media

KAUST Repository

Saad, Bilal Mohammed; Saad, Mazen

2014-01-01

We study the convergence of a combined finite volume nonconforming finite element scheme on general meshes for a partially miscible two-phase flow model in anisotropic porous media. This model includes capillary effects and exchange between the phase. The diffusion term,which can be anisotropic and heterogeneous, is discretized by piecewise linear nonconforming triangular finite elements. The other terms are discretized by means of a cell-centered finite volume scheme on a dual mesh. The relative permeability of each phase is decentred according the sign of the velocity at the dual interface. The convergence of the scheme is proved thanks to an estimate on the two pressures which allows to show estimates on the discrete time and compactness results in the case of degenerate relative permeabilities. A key point in the scheme is to use particular averaging formula for the dissolution function arising in the diffusion term. We show also a simulation of CO2 injection in a water saturated reservoir and nuclear waste management. Numerical results are obtained by in-house numerical code. © Springer International Publishing Switzerland 2014.

Reliability of the discrete choice experiment at the input and output level in patients with rheumatoid arthritis

DEFF Research Database (Denmark)

Skjoldborg, Ulla Slothuus; Lauridsen, Jørgen; Junker, Peter

2009-01-01

OBJECTIVES: To investigate the issue of conjoint reliability over time. METHODS: A discrete choice experiment was applied using scenarios that describe the effect of treating rheumatoid arthritis patients with TNF-alpha inhibitors, a novel class of highly effective, but expensive antirheumatic...... agents. Respondents participated in three face-to-face interviews over a period of 4 months. Reliability was measured both at the input level, where the consistency of matches made by respondents to the Discrete Choice Experiment (DCE) question between replications was determined, and at the output level...... and the final choice in survey 3. Output level: The confidence intervals for WTP figures in surveys 1 and 2 and 1 and 3 were overlapping, implying that the DCE was reliable at the output level over time. CONCLUSION: The proportion of consistent responses was higher than would be expected by chance. Conjoint...

Network Regulation and Support Schemes

DEFF Research Database (Denmark)

Ropenus, Stephanie; Schröder, Sascha Thorsten; Jacobsen, Henrik

2009-01-01

-in tariffs to market-based quota systems, and network regulation approaches, comprising rate-of-return and incentive regulation. National regulation and the vertical structure of the electricity sector shape the incentives of market agents, notably of distributed generators and network operators......At present, there exists no explicit European policy framework on distributed generation. Various Directives encompass distributed generation; inherently, their implementation is to the discretion of the Member States. The latter have adopted different kinds of support schemes, ranging from feed....... This article seeks to investigate the interactions between the policy dimensions of support schemes and network regulation and how they affect the deployment of distributed generation. Firstly, a conceptual analysis examines how the incentives of the different market agents are affected. In particular...

A space-time mixed galerkin marching-on-in-time scheme for the time-domain combined field integral equation

KAUST Repository

Beghein, Yves

2013-03-01

The time domain combined field integral equation (TD-CFIE), which is constructed from a weighted sum of the time domain electric and magnetic field integral equations (TD-EFIE and TD-MFIE) for analyzing transient scattering from closed perfect electrically conducting bodies, is free from spurious resonances. The standard marching-on-in-time technique for discretizing the TD-CFIE uses Galerkin and collocation schemes in space and time, respectively. Unfortunately, the standard scheme is theoretically not well understood: stability and convergence have been proven for only one class of space-time Galerkin discretizations. Moreover, existing discretization schemes are nonconforming, i.e., the TD-MFIE contribution is tested with divergence conforming functions instead of curl conforming functions. We therefore introduce a novel space-time mixed Galerkin discretization for the TD-CFIE. A family of temporal basis and testing functions with arbitrary order is introduced. It is explained how the corresponding interactions can be computed efficiently by existing collocation-in-time codes. The spatial mixed discretization is made fully conforming and consistent by leveraging both Rao-Wilton-Glisson and Buffa-Christiansen basis functions and by applying the appropriate bi-orthogonalization procedures. The combination of both techniques is essential when high accuracy over a broad frequency band is required. © 2012 IEEE.

Cryptographic analysis on the key space of optical phase encryption algorithm based on the design of discrete random phase mask

Science.gov (United States)

Lin, Chao; Shen, Xueju; Li, Zengyan

2013-07-01

The key space of phase encryption algorithm using discrete random phase mask is investigated by numerical simulation in this paper. Random phase mask with finite and discrete phase levels is considered as the core component in most practical optical encryption architectures. The key space analysis is based on the design criteria of discrete random phase mask. The role of random amplitude mask and random phase mask in optical encryption system is identified from the perspective of confusion and diffusion. The properties of discrete random phase mask in a practical double random phase encoding scheme working in both amplitude encoding (AE) and phase encoding (PE) modes are comparably analyzed. The key space of random phase encryption algorithm is evaluated considering both the encryption quality and the brute-force attack resistibility. A method for enlarging the key space of phase encryption algorithm is also proposed to enhance the security of optical phase encryption techniques.

Spatial discretizations for self-adjoint forms of the radiative transfer equations

International Nuclear Information System (INIS)

Morel, Jim E.; Adams, B. Todd; Noh, Taewan; McGhee, John M.; Evans, Thomas M.; Urbatsch, Todd J.

2006-01-01

There are three commonly recognized second-order self-adjoint forms of the neutron transport equation: the even-parity equations, the odd-parity equations, and the self-adjoint angular flux equations. Because all of these equations contain second-order spatial derivatives and are self-adjoint for the mono-energetic case, standard continuous finite-element discretization techniques have proved quite effective when applied to the spatial variables. We first derive analogs of these equations for the case of time-dependent radiative transfer. The primary unknowns for these equations are functions of the angular intensity rather than the angular flux, hence the analog of the self-adjoint angular flux equation is referred to as the self-adjoint angular intensity equation. Then we describe a general, arbitrary-order, continuous spatial finite-element approach that is applied to each of the three equations in conjunction with backward-Euler differencing in time. We refer to it as the 'standard' technique. We also introduce an alternative spatial discretization scheme for the self-adjoint angular intensity equation that requires far fewer unknowns than the standard method, but appears to give comparable accuracy. Computational results are given that demonstrate the validity of both of these discretization schemes

Performance Comparison of Reconstruction Algorithms in Discrete Blind Multi-Coset Sampling

DEFF Research Database (Denmark)

Grigoryan, Ruben; Arildsen, Thomas; Tandur, Deepaknath

2012-01-01

This paper investigates the performance of different reconstruction algorithms in discrete blind multi-coset sampling. Multi-coset scheme is a promising compressed sensing architecture that can replace traditional Nyquist-rate sampling in the applications with multi-band frequency sparse signals...

Geometric integration of the Vlasov-Maxwell system with a variational particle-in-cell scheme

Energy Technology Data Exchange (ETDEWEB)

Squire, J.; Tang, W. M. [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States); Qin, H. [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States); Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China)

2012-08-15

A fully variational, unstructured, electromagnetic particle-in-cell integrator is developed for integration of the Vlasov-Maxwell equations. Using the formalism of discrete exterior calculus [Desbrun et al., e-print arXiv:math/0508341 (2005)], the field solver, interpolation scheme, and particle advance algorithm are derived through minimization of a single discrete field theory action. As a consequence of ensuring that the action is invariant under discrete electromagnetic gauge transformations, the integrator exactly conserves Gauss's law.

Schemes of Superradiant Emission from Electron Beams and "Spin-Flip Emission of Radiation"

CERN Document Server

Gover, A

2005-01-01

A unified analysis for Superradiant emission from bunched electron beams in various kinds of radiation scheme is presented. Radiation schemes that can be described by the formulation include Pre-bunched FEL (PB-FEL), Coherent Synchrotron Radiation (CSR), Smith-Purcell Radiation, Cerenkov-Radiation, Transition-Radiation and more. The theory is based on mode excitation formulation - either discrete or continuous (the latter - in open structures). The discrete mode formulation permits simple evaluation of the spatially coherent power and spectral power of the source. These figures of merit of the radiation source are useful for characterizing and comparing the performance of different radiation schemes. When the bunched electron beam emits superradiantly, these parameters scale like the square of the number of electrons, orders of magnitude more than spontaneous emission. The formulation applies to emission from single electron bunches, periodically bunched beams, or emission from a finite number of bunches in a...

Computational and analytical comparison of flux discretizations for the semiconductor device equations beyond Boltzmann statistics

International Nuclear Information System (INIS)

Farrell, Patricio; Koprucki, Thomas; Fuhrmann, Jürgen

2017-01-01

We compare three thermodynamically consistent numerical fluxes known in the literature, appearing in a Voronoï finite volume discretization of the van Roosbroeck system with general charge carrier statistics. Our discussion includes an extension of the Scharfetter–Gummel scheme to non-Boltzmann (e.g. Fermi–Dirac) statistics. It is based on the analytical solution of a two-point boundary value problem obtained by projecting the continuous differential equation onto the interval between neighboring collocation points. Hence, it serves as a reference flux. The exact solution of the boundary value problem can be approximated by computationally cheaper fluxes which modify certain physical quantities. One alternative scheme averages the nonlinear diffusion (caused by the non-Boltzmann nature of the problem), another one modifies the effective density of states. To study the differences between these three schemes, we analyze the Taylor expansions, derive an error estimate, visualize the flux error and show how the schemes perform for a carefully designed p-i-n benchmark simulation. We present strong evidence that the flux discretization based on averaging the nonlinear diffusion has an edge over the scheme based on modifying the effective density of states.

Computational and analytical comparison of flux discretizations for the semiconductor device equations beyond Boltzmann statistics

Science.gov (United States)

Farrell, Patricio; Koprucki, Thomas; Fuhrmann, Jürgen

2017-10-01

We compare three thermodynamically consistent numerical fluxes known in the literature, appearing in a Voronoï finite volume discretization of the van Roosbroeck system with general charge carrier statistics. Our discussion includes an extension of the Scharfetter-Gummel scheme to non-Boltzmann (e.g. Fermi-Dirac) statistics. It is based on the analytical solution of a two-point boundary value problem obtained by projecting the continuous differential equation onto the interval between neighboring collocation points. Hence, it serves as a reference flux. The exact solution of the boundary value problem can be approximated by computationally cheaper fluxes which modify certain physical quantities. One alternative scheme averages the nonlinear diffusion (caused by the non-Boltzmann nature of the problem), another one modifies the effective density of states. To study the differences between these three schemes, we analyze the Taylor expansions, derive an error estimate, visualize the flux error and show how the schemes perform for a carefully designed p-i-n benchmark simulation. We present strong evidence that the flux discretization based on averaging the nonlinear diffusion has an edge over the scheme based on modifying the effective density of states.

A hybrid Lagrangian Voronoi-SPH scheme

Science.gov (United States)

Fernandez-Gutierrez, D.; Souto-Iglesias, A.; Zohdi, T. I.

2017-11-01

A hybrid Lagrangian Voronoi-SPH scheme, with an explicit weakly compressible formulation for both the Voronoi and SPH sub-domains, has been developed. The SPH discretization is substituted by Voronoi elements close to solid boundaries, where SPH consistency and boundary conditions implementation become problematic. A buffer zone to couple the dynamics of both sub-domains is used. This zone is formed by a set of particles where fields are interpolated taking into account SPH particles and Voronoi elements. A particle may move in or out of the buffer zone depending on its proximity to a solid boundary. The accuracy of the coupled scheme is discussed by means of a set of well-known verification benchmarks.

Discrete memory schemes for finite strain thermoplasticity and application to shape memory alloys

International Nuclear Information System (INIS)

Favier, D.; Guelin, P.; Pegon, P.; Nowacki, W.K.

1987-01-01

A theory of finite strain plasticity has been proposed: The scheme of pure hysteresis with mixed transport has been extended to the case of non-rotational kinematics. Secondly, the simple shear case has been studied, taking into account Drucker's recent analysis regarding the 'appropriate simple idealizations for finite plasticity'. Illustrations are provided for general stress/strain paths. Also a new theory of isotropic hyperelasticity has been proposed. The 'reversible' relative Cauchy stress tensor (of type (1,1) and weight one) is defined in the dragged along coordinates as a tensorial isotropic function of the Almansi tensor and of its invariants (through the partial derivatives of the actual scalar density of elastic energy per unit extent of dragged along coordinates). The correspondance between strain and stress paths is then defined in a general form which is particularly convenient for the study of first order effects, limit behaviours, coupling and second order effects. Illustrations are provided. The addition of the pure hysteresis stress contribution σ a and of the reversible contribution σ rev leads to a scheme of 'superelasticity' departure to obtain a provisional scheme of shape memory effects. Some remarks are given regarding some of the possible generalizations of the scheme. (orig./GL)

Hybrid discrete-time neural networks.

Science.gov (United States)

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

Gaussian quadrature and lattice discretization of the Fermi-Dirac distribution for graphene

OpenAIRE

Oettinger, D.; Mendoza, M.; Herrmann, H. J.

2013-01-01

We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use these polynomials to expand the respective distribution in a moving frame, for both cases, undoped and doped graphene. In order to discretize the Boltzmann equation and make feasible the numerical implementation, we reduce the number of discrete points in m...

Combinatorial nuclear level-density model

International Nuclear Information System (INIS)

Uhrenholt, H.; Åberg, S.; Dobrowolski, A.; Døssing, Th.; Ichikawa, T.; Möller, P.

2013-01-01

A microscopic nuclear level-density model is presented. The model is a completely combinatorial (micro-canonical) model based on the folded-Yukawa single-particle potential and includes explicit treatment of pairing, rotational and vibrational states. The microscopic character of all states enables extraction of level-distribution functions with respect to pairing gaps, parity and angular momentum. The results of the model are compared to available experimental data: level spacings at neutron separation energy, data on total level-density functions from the Oslo method, cumulative level densities from low-lying discrete states, and data on parity ratios. Spherical and deformed nuclei follow basically different coupling schemes, and we focus on deformed nuclei

Supervisory control synthesis of discrete-event systems using a coordination scheme

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; Masopust, Tomáš; van Schuppen, J. H.

2012-01-01

Roč. 48, č. 2 (2012), s. 247-254 ISSN 0005-1098 R&D Projects: GA ČR(CZ) GAP103/11/0517; GA ČR GPP202/11/P028 Grant - others:European Commission(XE) EU.ICT.DISC 224498 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete-event systems * supervisory control * distributed control * closed-loop systems * controllability Subject RIV: BA - General Mathematics Impact factor: 2.919, year: 2012 http://www.sciencedirect.com/science/article/pii/S0005109811005395

Supervisory control synthesis of discrete-event systems using a coordination scheme

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; Masopust, Tomáš; van Schuppen, J. H.

2012-01-01

Roč. 48, č. 2 (2012), s. 247-254 ISSN 0005-1098 R&D Projects: GA ČR(CZ) GAP103/11/0517; GA ČR GPP202/11/P028 Grant - others:European Commission(XE) EU. ICT .DISC 224498 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete-event systems * supervisory control * distributed control * closed-loop systems * controllability Subject RIV: BA - General Mathematics Impact factor: 2.919, year: 2012 http://www.sciencedirect.com/science/article/pii/S0005109811005395

Generalized Second-Order Parametric Optimality Conditions in Semiinfinite Discrete Minmax Fractional Programming and Second-Order Univexity

Directory of Open Access Journals (Sweden)

Ram Verma

2016-02-01

Full Text Available This paper deals with mainly establishing numerous sets of generalized second order paramertic sufficient optimality conditions for a semiinfinite discrete minmax fractional programming problem, while the results on semiinfinite discrete minmax fractional programming problem achieved based on some partitioning schemes under various types of generalized second order univexity assumptions. 

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

Science.gov (United States)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

An Enhanced Three-Level Voltage Switching State Scheme for Direct Torque Controlled Open End Winding Induction Motor

Science.gov (United States)

Kunisetti, V. Praveen Kumar; Thippiripati, Vinay Kumar

2018-01-01

Open End Winding Induction Motors (OEWIM) are popular for electric vehicles, ship propulsion applications due to less DC link voltage. Electric vehicles, ship propulsions require ripple free torque. In this article, an enhanced three-level voltage switching state scheme for direct torque controlled OEWIM drive is implemented to reduce torque and flux ripples. The limitations of conventional Direct Torque Control (DTC) are: possible problems during low speeds and starting, it operates with variable switching frequency due to hysteresis controllers and produces higher torque and flux ripple. The proposed DTC scheme can abate the problems of conventional DTC with an enhanced voltage switching state scheme. The three-level inversion was obtained by operating inverters with equal DC-link voltages and it produces 18 voltage space vectors. These 18 vectors are divided into low and high frequencies of operation based on rotor speed. The hardware results prove the validity of proposed DTC scheme during steady-state and transients. From simulation and experimental results, proposed DTC scheme gives less torque and flux ripples on comparison to two-level DTC. The proposed DTC is implemented using dSPACE DS-1104 control board interface with MATLAB/SIMULINK-RTI model.

A space-time mixed galerkin marching-on-in-time scheme for the time-domain combined field integral equation

KAUST Repository

Beghein, Yves; Cools, Kristof; Bagci, Hakan; De Zutter, Danië l

2013-01-01

electrically conducting bodies, is free from spurious resonances. The standard marching-on-in-time technique for discretizing the TD-CFIE uses Galerkin and collocation schemes in space and time, respectively. Unfortunately, the standard scheme is theoretically

Measurement of discrete energy-level spectra in individual chemically synthesized gold nanoparticles

DEFF Research Database (Denmark)

Kuemmeth, Ferdinand; Bolotin, Kirill I; Shi, Su-Fei

2008-01-01

We form single-electron transistors from individual chemically synthesized gold nanoparticles, 5-15 nm in diameter, with monolayers of organic molecules serving as tunnel barriers. These devices allow us to measure the discrete electronic energy levels of individual gold nanoparticles that are......, by virtue of chemical synthesis, well-defined in their composition, size and shape. We show that the nanoparticles are nonmagnetic and have spectra in good accord with random-matrix-theory predictions taking into account strong spin-orbit coupling....

A SCHEME FOR TEMPLATE SECURITY AT FEATURE FUSION LEVEL IN MULTIMODAL BIOMETRIC SYSTEM

Directory of Open Access Journals (Sweden)

Arvind Selwal

2016-09-01

Full Text Available Biometric is the science of human recognition based upon using their biological, chemical or behavioural traits. These systems are used in many real life applications simply from biometric based attendance system to providing security at very sophisticated level. A biometric system deals with raw data captured using a sensor and feature template extracted from raw image. One of the challenges being faced by designers of these systems is to secure template data extracted from the biometric modalities of the user and protect the raw images. To minimize spoof attacks on biometric systems by unauthorised users one of the solutions is to use multi-biometric systems. Multi-modal biometric system works by using fusion technique to merge feature templates generated from different modalities of the human. In this work a new scheme is proposed to secure template during feature fusion level. Scheme is based on union operation of fuzzy relations of templates of modalities during fusion process of multimodal biometric systems. This approach serves dual purpose of feature fusion as well as transformation of templates into a single secured non invertible template. The proposed technique is cancelable and experimentally tested on a bimodal biometric system comprising of fingerprint and hand geometry. Developed scheme removes the problem of an attacker learning the original minutia position in fingerprint and various measurements of hand geometry. Given scheme provides improved performance of the system with reduction in false accept rate and improvement in genuine accept rate.

Synchronised PWM Schemes for Three-level Inverters with Zero Common-mode Voltage

DEFF Research Database (Denmark)

Oleschuk, Valentin; Blaabjerg, Frede

2002-01-01

This paper presents results of analysis and comparison of novel synchronised schemes of pulsewidth modulation (PWM), applied to three-level voltage source inverters with control algorithms providing elimination of the common-mode voltage. The proposed approach is based on a new strategy of digital...

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

Analysis of the F. Calogero Type Projection-Algebraic Scheme for Differential Operator Equations

International Nuclear Information System (INIS)

Lustyk, Miroslaw; Bogolubov, Nikolai N. Jr.; Blackmore, Denis; Prykarpatsky, Anatoliy K.

2010-12-01

The existence, convergence, realizability and stability of solutions of differential operator equations obtained via a novel projection-algebraic scheme are analyzed in detail. This analysis is based upon classical discrete approximation techniques coupled with a recent generalization of the Leray-Schauder fixed point theorem. An example is included to illustrate the efficacy of the projection scheme and analysis strategy. (author)

The parallel algorithm for the 2D discrete wavelet transform

Science.gov (United States)

Barina, David; Najman, Pavel; Kleparnik, Petr; Kula, Michal; Zemcik, Pavel

2018-04-01

The discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the lifting scheme consists of a small number of operations, it is preferred for processing using single-core CPUs. However, considering a parallel processing using multi-core processors, this scheme is inappropriate due to a large number of steps. On such architectures, the number of steps corresponds to the number of points that represent the exchange of data. Consequently, these points often form a performance bottleneck. Our approach appropriately rearranges calculations inside the transform, and thereby reduces the number of steps. In other words, we propose a new scheme that is friendly to parallel environments. When evaluating on multi-core CPUs, we consistently overcome the original lifting scheme. The evaluation was performed on 61-core Intel Xeon Phi and 8-core Intel Xeon processors.

A discontinous Galerkin finite element method with an efficient time integration scheme for accurate simulations

KAUST Repository

Liu, Meilin

2011-07-01

A discontinuous Galerkin finite element method (DG-FEM) with a highly-accurate time integration scheme is presented. The scheme achieves its high accuracy using numerically constructed predictor-corrector integration coefficients. Numerical results show that this new time integration scheme uses considerably larger time steps than the fourth-order Runge-Kutta method when combined with a DG-FEM using higher-order spatial discretization/basis functions for high accuracy. © 2011 IEEE.

Discrete phase space based on finite fields

International Nuclear Information System (INIS)

Gibbons, Kathleen S.; Hoffman, Matthew J.; Wootters, William K.

2004-01-01

The original Wigner function provides a way of representing in phase space the quantum states of systems with continuous degrees of freedom. Wigner functions have also been developed for discrete quantum systems, one popular version being defined on a 2Nx2N discrete phase space for a system with N orthogonal states. Here we investigate an alternative class of discrete Wigner functions, in which the field of real numbers that labels the axes of continuous phase space is replaced by a finite field having N elements. There exists such a field if and only if N is a power of a prime; so our formulation can be applied directly only to systems for which the state-space dimension takes such a value. Though this condition may seem limiting, we note that any quantum computer based on qubits meets the condition and can thus be accommodated within our scheme. The geometry of our NxN phase space also leads naturally to a method of constructing a complete set of N+1 mutually unbiased bases for the state space

Investigation of radiation effects in Hiroshima and Nagasaki using a general Monte Carlo-discrete ordinates coupling scheme

International Nuclear Information System (INIS)

Cramer, S.N.; Slater, C.O.

1990-01-01

A general adjoint Monte Carlo-forward discrete ordinates radiation transport calculational scheme has been created to study the effects of the radiation environment in Hiroshima and Nagasaki due to the bombing of these two cities. Various such studies for comparison with physical data have progressed since the end of World War II with advancements in computing machinery and computational methods. These efforts have intensified in the last several years with the U.S.-Japan joint reassessment of nuclear weapons dosimetry in Hiroshima and Nagasaki. Three principal areas of investigation are: (1) to determine by experiment and calculation the neutron and gamma-ray energy and angular spectra and total yield of the two weapons; (2) using these weapons descriptions as source terms, to compute radiation effects at several locations in the two cities for comparison with experimental data collected at various times after the bombings and thus validate the source terms; and (3) to compute radiation fields at the known locations of fatalities and surviving individuals at the time of the bombings and thus establish an absolute cause-and-effect relationship between the radiation received and the resulting injuries to these individuals and any of their descendants as indicated by their medical records. It is in connection with the second and third items, the determination of the radiation effects and the dose received by individuals, that the current study is concerned

Numerical viscosity of entropy stable schemes for systems of conservation laws. Final Report

International Nuclear Information System (INIS)

Tadmor, E.

1985-11-01

Discrete approximations to hyperbolic systems of conservation laws are studied. The amount of numerical viscosity present in such schemes is quantified and related to their entropy stability by means of comparison. To this end conservative schemes which are also entropy conservative are constructed. These entropy conservative schemes enjoy second-order accuracy; moreover, they admit a particular interpretation within the finite-element frameworks, and hence can be formulated on various mesh configurations. It is then shown that conservative schemes are entropy stable if and only if they contain more viscosity than the mentioned above entropy conservative ones

Zak Phase in Discrete-Time Quantum Walks

OpenAIRE

Puentes, G.; Santillán, O.

2015-01-01

We report on a simple scheme that may present a non-trivial geometric Zak phase ($\\Phi_{Zak}$) structure, which is based on a discrete-time quantum walk architecture. By detecting the Zak phase difference between two trajectories connecting adjacent Dirac points where the quasi-energy gap closes for opposite values of quasi-momentum ($k$), it is possible to identify geometric invariants. These geometric invariants correspond to $|\\Phi_{Zak}^{+(-)}-\\Phi_{Zak}^{-(+)}|=\\pi$ and $|\\Phi_{Zak}^{+(-...

The discrete adjoint method for parameter identification in multibody system dynamics.

Science.gov (United States)

Lauß, Thomas; Oberpeilsteiner, Stefan; Steiner, Wolfgang; Nachbagauer, Karin

2018-01-01

The adjoint method is an elegant approach for the computation of the gradient of a cost function to identify a set of parameters. An additional set of differential equations has to be solved to compute the adjoint variables, which are further used for the gradient computation. However, the accuracy of the numerical solution of the adjoint differential equation has a great impact on the gradient. Hence, an alternative approach is the discrete adjoint method , where the adjoint differential equations are replaced by algebraic equations. Therefore, a finite difference scheme is constructed for the adjoint system directly from the numerical time integration method. The method provides the exact gradient of the discretized cost function subjected to the discretized equations of motion.

Numerical schemes for one-point closure turbulence models

International Nuclear Information System (INIS)

Larcher, Aurelien

2010-01-01

First-order Reynolds Averaged Navier-Stokes (RANS) turbulence models are studied in this thesis. These latter consist of the Navier-Stokes equations, supplemented with a system of balance equations describing the evolution of characteristic scalar quantities called 'turbulent scales'. In so doing, the contribution of the turbulent agitation to the momentum can be determined by adding a diffusive coefficient (called 'turbulent viscosity') in the Navier-Stokes equations, such that it is defined as a function of the turbulent scales. The numerical analysis problems, which are studied in this dissertation, are treated in the frame of a fractional step algorithm, consisting of an approximation on regular meshes of the Navier-Stokes equations by the nonconforming Crouzeix-Raviart finite elements, and a set of scalar convection-diffusion balance equations discretized by the standard finite volume method. A monotone numerical scheme based on the standard finite volume method is proposed so as to ensure that the turbulent scales, like the turbulent kinetic energy (k) and its dissipation rate (ε), remain positive in the case of the standard k - ε model, as well as the k - ε RNG and the extended k - ε - ν 2 models. The convergence of the proposed numerical scheme is then studied on a system composed of the incompressible Stokes equations and a steady convection-diffusion equation, which are both coupled by the viscosities and the turbulent production term. This reduced model allows to deal with the main difficulty encountered in the analysis of such problems: the definition of the turbulent production term leads to consider a class of convection-diffusion problems with an irregular right-hand side belonging to L 1 . Finally, to step towards the unsteady problem, the convergence of the finite volume scheme for a model convection-diffusion equation with L 1 data is proved. The a priori estimates on the solution and on its time derivative are obtained in discrete norms, for

Conservative Semidiscrete Difference Schemes for Timoshenko Systems

OpenAIRE

Júnior, D. S. Almeida

2014-01-01

We present a parameterized family of finite-difference schemes to analyze the energy properties for linearly elastic constant-coefficient Timoshenko systems considering shear deformation and rotatory inertia. We derive numerical energies showing the positivity, and the energy conservation property and we show how to avoid a numerical anomaly known as locking phenomenon on shear force. Our method of proof relies on discrete multiplier techniques.

Two-level MOC calculation scheme in APOLLO2 for cross-section library generation for LWR hexagonal assemblies

International Nuclear Information System (INIS)

Petrov, Nikolay; Todorova, Galina; Kolev, Nikola; Damian, Frederic

2011-01-01

The accurate and efficient MOC calculation scheme in APOLLO2, developed by CEA for generating multi-parameterized cross-section libraries for PWR assemblies, has been adapted to hexagonal assemblies. The neutronic part of this scheme is based on a two-level calculation methodology. At the first level, a multi-cell method is used in 281 energy groups for cross-section definition and self-shielding. At the second level, precise MOC calculations are performed in a collapsed energy mesh (30-40 groups). In this paper, the application and validation of the two-level scheme for hexagonal assemblies is described. Solutions for a VVER assembly are compared with TRIPOLI4® calculations and direct 281g MOC solutions. The results show that the accuracy is close to that of the 281g MOC calculation while the CPU time is substantially reduced. Compared to the multi-cell method, the accuracy is markedly improved. (author)

Stabilized linear semi-implicit schemes for the nonlocal Cahn-Hilliard equation

Science.gov (United States)

Du, Qiang; Ju, Lili; Li, Xiao; Qiao, Zhonghua

2018-06-01

Comparing with the well-known classic Cahn-Hilliard equation, the nonlocal Cahn-Hilliard equation is equipped with a nonlocal diffusion operator and can describe more practical phenomena for modeling phase transitions of microstructures in materials. On the other hand, it evidently brings more computational costs in numerical simulations, thus efficient and accurate time integration schemes are highly desired. In this paper, we propose two energy-stable linear semi-implicit methods with first and second order temporal accuracies respectively for solving the nonlocal Cahn-Hilliard equation. The temporal discretization is done by using the stabilization technique with the nonlocal diffusion term treated implicitly, while the spatial discretization is carried out by the Fourier collocation method with FFT-based fast implementations. The energy stabilities are rigorously established for both methods in the fully discrete sense. Numerical experiments are conducted for a typical case involving Gaussian kernels. We test the temporal convergence rates of the proposed schemes and make a comparison of the nonlocal phase transition process with the corresponding local one. In addition, long-time simulations of the coarsening dynamics are also performed to predict the power law of the energy decay.

From ordinary to discrete quantum mechanics: The Charlier oscillator and its coalgebra symmetry

Energy Technology Data Exchange (ETDEWEB)

Latini, D., E-mail: latini@fis.uniroma3.it [Department of Mathematics and Physics and INFN, Roma Tre University, Via della Vasca Navale 84, I-00146 Rome (Italy); Riglioni, D. [Department of Mathematics and Physics, Roma Tre University, Via della Vasca Navale 84, I-00146 Rome (Italy)

2016-10-14

The coalgebraic structure of the harmonic oscillator is used to underline possible connections between continuous and discrete superintegrable models which can be described in terms of SUSY discrete quantum mechanics. A set of 1-parameter algebraic transformations is introduced in order to generate a discrete representation for the coalgebraic harmonic oscillator. This set of transformations is shown to play a role in the generalization of classical orthogonal polynomials to the realm of discrete orthogonal polynomials in the Askey scheme. As an explicit example the connection between Hermite and Charlier oscillators, that share the same coalgebraic structure, is presented and a two-dimensional maximally superintegrable version of the Charlier oscillator is constructed. - Highlights: • We construct a discrete quantum version of the harmonic oscillator. • We solve the spectral problem on the lattice. • We introduce the coalgebra symmetry in real discrete Quantum Mechanics (rdQM). • The coalgebra is used to extend the system to higher dimensions preserving its superintegrability. • We explicitly write down a discrete version of both the angular momentum and the Demkov–Fradkin Tensor.

Breaking a chaos-noise-based secure communication scheme

Science.gov (United States)

Li, Shujun; Álvarez, Gonzalo; Chen, Guanrong; Mou, Xuanqin

2005-03-01

This paper studies the security of a secure communication scheme based on two discrete-time intermittently chaotic systems synchronized via a common random driving signal. Some security defects of the scheme are revealed: 1) The key space can be remarkably reduced; 2) the decryption is insensitive to the mismatch of the secret key; 3) the key-generation process is insecure against known/chosen-plaintext attacks. The first two defects mean that the scheme is not secure enough against brute-force attacks, and the third one means that an attacker can easily break the cryptosystem by approximately estimating the secret key once he has a chance to access a fragment of the generated keystream. Yet it remains to be clarified if intermittent chaos could be used for designing secure chaotic cryptosystems.

Optical movie encryption based on a discrete multiple-parameter fractional Fourier transform

International Nuclear Information System (INIS)

Zhong, Zhi; Zhang, Yujie; Shan, Mingguang; Wang, Ying; Zhang, Yabin; Xie, Hong

2014-01-01

A movie encryption scheme is proposed using a discrete multiple-parameter fractional Fourier transform and theta modulation. After being modulated by sinusoidal amplitude grating, each frame of the movie is transformed by a filtering procedure and then multiplexed into a complex signal. The complex signal is multiplied by a pixel scrambling operation and random phase mask, and then encrypted by a discrete multiple-parameter fractional Fourier transform. The movie can be retrieved by using the correct keys, such as a random phase mask, a pixel scrambling operation, the parameters in a discrete multiple-parameter fractional Fourier transform and a time sequence. Numerical simulations have been performed to demonstrate the validity and the security of the proposed method. (paper)

Finite difference discretization of semiconductor drift-diffusion equations for nanowire solar cells

Science.gov (United States)

Deinega, Alexei; John, Sajeev

2012-10-01

We introduce a finite difference discretization of semiconductor drift-diffusion equations using cylindrical partial waves. It can be applied to describe the photo-generated current in radial pn-junction nanowire solar cells. We demonstrate that the cylindrically symmetric (l=0) partial wave accurately describes the electronic response of a square lattice of silicon nanowires at normal incidence. We investigate the accuracy of our discretization scheme by using different mesh resolution along the radial direction r and compare with 3D (x, y, z) discretization. We consider both straight nanowires and nanowires with radius modulation along the vertical axis. The charge carrier generation profile inside each nanowire is calculated using an independent finite-difference time-domain simulation.

Optimized Explicit Runge--Kutta Schemes for the Spectral Difference Method Applied to Wave Propagation Problems

KAUST Repository

Parsani, Matteo

2013-04-10

Explicit Runge--Kutta schemes with large stable step sizes are developed for integration of high-order spectral difference spatial discretizations on quadrilateral grids. The new schemes permit an effective time step that is substantially larger than the maximum admissible time step of standard explicit Runge--Kutta schemes available in the literature. Furthermore, they have a small principal error norm and admit a low-storage implementation. The advantages of the new schemes are demonstrated through application to the Euler equations and the linearized Euler equations.

Optimized Explicit Runge--Kutta Schemes for the Spectral Difference Method Applied to Wave Propagation Problems

KAUST Repository

Parsani, Matteo; Ketcheson, David I.; Deconinck, W.

2013-01-01

Explicit Runge--Kutta schemes with large stable step sizes are developed for integration of high-order spectral difference spatial discretizations on quadrilateral grids. The new schemes permit an effective time step that is substantially larger than the maximum admissible time step of standard explicit Runge--Kutta schemes available in the literature. Furthermore, they have a small principal error norm and admit a low-storage implementation. The advantages of the new schemes are demonstrated through application to the Euler equations and the linearized Euler equations.

Projection scheme for a reflected stochastic heat equation with additive noise

Science.gov (United States)

Higa, Arturo Kohatsu; Pettersson, Roger

2005-02-01

We consider a projection scheme as a numerical solution of a reflected stochastic heat equation driven by a space-time white noise. Convergence is obtained via a discrete contraction principle and known convergence results for numerical solutions of parabolic variational inequalities.

Navier-Stokes Dynamics by a Discrete Boltzmann Model

Science.gov (United States)

Rubinstein, Robet

2010-01-01

This work investigates the possibility of particle-based algorithms for the Navier-Stokes equations and higher order continuum approximations of the Boltzmann equation; such algorithms would generalize the well-known Pullin scheme for the Euler equations. One such method is proposed in the context of a discrete velocity model of the Boltzmann equation. Preliminary results on shock structure are consistent with the expectation that the shock should be much broader than the near discontinuity predicted by the Pullin scheme, yet narrower than the prediction of the Boltzmann equation. We discuss the extension of this essentially deterministic method to a stochastic particle method that, like DSMC, samples the distribution function rather than resolving it completely.

Applying LU Decomposition of Matrices to Design Anonymity Bilateral Remote User Authentication Scheme

Directory of Open Access Journals (Sweden)

Xiong Li

2013-01-01

Full Text Available We apply LU decomposition of matrices to present an anonymous bilateral authentication scheme. This paper aims at improving security and providing more excellent performances for remote user authentication scheme. The proposed scheme can provide bilateral authentication and session key agreement, can quickly check the validity of the input password, and can really protect the user anonymity. The security of the proposed scheme is based on the discrete logarithm problem (DLP, Diffie-Hellman problem (DHP, and the one-way hash function. It can resist various attacks such as insider attack, impersonation attack, server spoofing attack, and stolen smart card attack. Moreover, the presented scheme is computationally efficient for real-life implementation.

Efficient scheme for parametric fitting of data in arbitrary dimensions.

Science.gov (United States)

Pang, Ning-Ning; Tzeng, Wen-Jer; Kao, Hisen-Ching

2008-07-01

We propose an efficient scheme for parametric fitting expressed in terms of the Legendre polynomials. For continuous systems, our scheme is exact and the derived explicit expression is very helpful for further analytical studies. For discrete systems, our scheme is almost as accurate as the method of singular value decomposition. Through a few numerical examples, we show that our algorithm costs much less CPU time and memory space than the method of singular value decomposition. Thus, our algorithm is very suitable for a large amount of data fitting. In addition, the proposed scheme can also be used to extract the global structure of fluctuating systems. We then derive the exact relation between the correlation function and the detrended variance function of fluctuating systems in arbitrary dimensions and give a general scaling analysis.

Discrete Control Processes, Dynamic Games and Multicriterion Control Problems

Directory of Open Access Journals (Sweden)

Dumitru Lozovanu

2002-07-01

Full Text Available The discrete control processes with state evaluation in time of dynamical system is considered. A general model of control problems with integral-time cost criterion by a trajectory is studied and a general scheme for solving such classes of problems is proposed. In addition the game-theoretical and multicriterion models for control problems are formulated and studied.

Discrete gradients in discrete classical mechanics

International Nuclear Information System (INIS)

Renna, L.

1987-01-01

A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated

Enhanced Discrete-Time Scheduler Engine for MBMS E-UMTS System Level Simulator

DEFF Research Database (Denmark)

Pratas, Nuno; Rodrigues, António

2007-01-01

In this paper the design of an E-UMTS system level simulator developed for the study of optimization methods for the MBMS is presented. The simulator uses a discrete event based philosophy, which captures the dynamic behavior of the Radio Network System. This dynamic behavior includes the user...... mobility, radio interfaces and the Radio Access Network. Its given emphasis on the enhancements developed for the simulator core, the Event Scheduler Engine. Two implementations for the Event Scheduler Engine are proposed, one optimized for single core processors and other for multi-core ones....

Discrete time duration models with group-level heterogeneity

DEFF Research Database (Denmark)

Frederiksen, Anders; Honoré, Bo; Hu, Loujia

2007-01-01

Dynamic discrete choice panel data models have received a great deal of attention. In those models, the dynamics is usually handled by including the lagged outcome as an explanatory variable. In this paper we consider an alternative model in which the dynamics is handled by using the duration...

Approximation-Based Discrete-Time Adaptive Position Tracking Control for Interior Permanent Magnet Synchronous Motors.

Science.gov (United States)

Yu, Jinpeng; Shi, Peng; Yu, Haisheng; Chen, Bing; Lin, Chong

2015-07-01

This paper considers the problem of discrete-time adaptive position tracking control for a interior permanent magnet synchronous motor (IPMSM) based on fuzzy-approximation. Fuzzy logic systems are used to approximate the nonlinearities of the discrete-time IPMSM drive system which is derived by direct discretization using Euler method, and a discrete-time fuzzy position tracking controller is designed via backstepping approach. In contrast to existing results, the advantage of the scheme is that the number of the adjustable parameters is reduced to two only and the problem of coupling nonlinearity can be overcome. It is shown that the proposed discrete-time fuzzy controller can guarantee the tracking error converges to a small neighborhood of the origin and all the signals are bounded. Simulation results illustrate the effectiveness and the potentials of the theoretic results obtained.

Quantum attack-resistent certificateless multi-receiver signcryption scheme.

Directory of Open Access Journals (Sweden)

Huixian Li

Full Text Available The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC, which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ problem and its unforgeability under the Isomorphism of Polynomials (IP assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.

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

Optimal Face-Iris Multimodal Fusion Scheme

Directory of Open Access Journals (Sweden)

Omid Sharifi

2016-06-01

Full Text Available Multimodal biometric systems are considered a way to minimize the limitations raised by single traits. This paper proposes new schemes based on score level, feature level and decision level fusion to efficiently fuse face and iris modalities. Log-Gabor transformation is applied as the feature extraction method on face and iris modalities. At each level of fusion, different schemes are proposed to improve the recognition performance and, finally, a combination of schemes at different fusion levels constructs an optimized and robust scheme. In this study, CASIA Iris Distance database is used to examine the robustness of all unimodal and multimodal schemes. In addition, Backtracking Search Algorithm (BSA, a novel population-based iterative evolutionary algorithm, is applied to improve the recognition accuracy of schemes by reducing the number of features and selecting the optimized weights for feature level and score level fusion, respectively. Experimental results on verification rates demonstrate a significant improvement of proposed fusion schemes over unimodal and multimodal fusion methods.

An encryption scheme based on phase-shifting digital holography and amplitude-phase disturbance

International Nuclear Information System (INIS)

Hua Li-Li; Xu Ning; Yang Geng

2014-01-01

In this paper, we propose an encryption scheme based on phase-shifting digital interferometry. According to the original system framework, we add a random amplitude mask and replace the Fourier transform by the Fresnel transform. We develop a mathematical model and give a discrete formula based on the scheme, which makes it easy to implement the scheme in computer programming. The experimental results show that the improved system has a better performance in security than the original encryption method. Moreover, it demonstrates a good capability of anti-noise and anti-shear robustness

A well-balanced scheme for Ten-Moment Gaussian closure equations with source term

Science.gov (United States)

Meena, Asha Kumari; Kumar, Harish

2018-02-01

In this article, we consider the Ten-Moment equations with source term, which occurs in many applications related to plasma flows. We present a well-balanced second-order finite volume scheme. The scheme is well-balanced for general equation of state, provided we can write the hydrostatic solution as a function of the space variables. This is achieved by combining hydrostatic reconstruction with contact preserving, consistent numerical flux, and appropriate source discretization. Several numerical experiments are presented to demonstrate the well-balanced property and resulting accuracy of the proposed scheme.

Total energy and potential enstrophy conserving schemes for the shallow water equations using Hamiltonian methods - Part 1: Derivation and properties

Science.gov (United States)

Eldred, Christopher; Randall, David

2017-02-01

The shallow water equations provide a useful analogue of the fully compressible Euler equations since they have similar characteristics: conservation laws, inertia-gravity and Rossby waves, and a (quasi-) balanced state. In order to obtain realistic simulation results, it is desirable that numerical models have discrete analogues of these properties. Two prototypical examples of such schemes are the 1981 Arakawa and Lamb (AL81) C-grid total energy and potential enstrophy conserving scheme, and the 2007 Salmon (S07) Z-grid total energy and potential enstrophy conserving scheme. Unfortunately, the AL81 scheme is restricted to logically square, orthogonal grids, and the S07 scheme is restricted to uniform square grids. The current work extends the AL81 scheme to arbitrary non-orthogonal polygonal grids and the S07 scheme to arbitrary orthogonal spherical polygonal grids in a manner that allows for both total energy and potential enstrophy conservation, by combining Hamiltonian methods (work done by Salmon, Gassmann, Dubos, and others) and discrete exterior calculus (Thuburn, Cotter, Dubos, Ringler, Skamarock, Klemp, and others). Detailed results of the schemes applied to standard test cases are deferred to part 2 of this series of papers.

Discrete mKdV and discrete sine-Gordon flows on discrete space curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2014-01-01

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)

ZN graded discrete Lax pairs and Yang–Baxter maps

Science.gov (United States)

Fordy, Allan P.

2017-01-01

We recently introduced a class of ZN graded discrete Lax pairs and studied the associated discrete integrable systems (lattice equations). In this paper, we introduce the corresponding Yang–Baxter maps. Many well-known examples belong to this scheme for N=2, so, for N≥3, our systems may be regarded as generalizations of these. In particular, for each N we introduce a class of multi-component Yang–Baxter maps, which include HBIII (of Papageorgiou et al. 2010 SIGMA 6, 003 (9 p). (doi:10.3842/SIGMA.2010.033)), when N=2, and that associated with the discrete modified Boussinesq equation, for N=3. For N≥5 we introduce a new family of Yang–Baxter maps, which have no lower dimensional analogue. We also present new multi-component versions of the Yang–Baxter maps FIV and FV (given in the classification of Adler et al. 2004 Commun. Anal. Geom. 12, 967–1007. (doi:10.4310/CAG.2004.v12.n5.a1)). PMID:28588406

On the uncertainty inequality as applied to discrete signals

Directory of Open Access Journals (Sweden)

Y. V. Venkatesh

2006-01-01

Full Text Available Given a continuous-time bandlimited signal, the Shannon sampling theorem provides an interpolation scheme for exactly reconstructing it from its discrete samples. We analyze the relationship between concentration (or compactness in the temporal/spectral domains of the (i continuous-time and (ii discrete-time signals. The former is governed by the Heisenberg uncertainty inequality which prescribes a lower bound on the product of effective temporal and spectral spreads of the signal. On the other hand, the discrete-time counterpart seems to exhibit some strange properties, and this provides motivation for the present paper. We consider the following problem: for a bandlimited signal, can the uncertainty inequality be expressed in terms of the samples, using thestandard definitions of the temporal and spectral spreads of the signal? In contrast with the results of the literature, we present a new approach to solve this problem. We also present a comparison of the results obtained using the proposed definitions with those available in the literature.

Discrete gradient methods for solving variational image regularisation models

International Nuclear Information System (INIS)

Grimm, V; McLachlan, Robert I; McLaren, David I; Quispel, G R W; Schönlieb, C-B

2017-01-01

Discrete gradient methods are well-known methods of geometric numerical integration, which preserve the dissipation of gradient systems. In this paper we show that this property of discrete gradient methods can be interesting in the context of variational models for image processing, that is where the processed image is computed as a minimiser of an energy functional. Numerical schemes for computing minimisers of such energies are desired to inherit the dissipative property of the gradient system associated to the energy and consequently guarantee a monotonic decrease of the energy along iterations, avoiding situations in which more computational work might lead to less optimal solutions. Under appropriate smoothness assumptions on the energy functional we prove that discrete gradient methods guarantee a monotonic decrease of the energy towards stationary states, and we promote their use in image processing by exhibiting experiments with convex and non-convex variational models for image deblurring, denoising, and inpainting. (paper)

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-06-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads to great interest in studying discrete surfaces. With the rich smooth surface theory in hand, one would hope that this elegant theory can still be applied to the discrete counter part. Such a generalization, however, is not always successful. While discrete surfaces have the advantage of being finite dimensional, thus easier to treat, their geometric properties such as curvatures are not well defined in the classical sense. Furthermore, the powerful calculus tool can hardly be applied. The methods in this thesis, including angular defect formula, cotangent formula, parallel meshes, relative geometry etc. are approaches based on offset meshes or generalized offset meshes. As an important application, we discuss discrete minimal surfaces and discrete Koenigs meshes.

Damping efficiency of the Tchamwa-Wielgosz explicit dissipative scheme under instantaneous loading conditions

Science.gov (United States)

Mahéo, Laurent; Grolleau, Vincent; Rio, Gérard

2009-11-01

To deal with dynamic and wave propagation problems, dissipative methods are often used to reduce the effects of the spurious oscillations induced by the spatial and time discretization procedures. Among the many dissipative methods available, the Tchamwa-Wielgosz (TW) explicit scheme is particularly useful because it damps out the spurious oscillations occurring in the highest frequency domain. The theoretical study performed here shows that the TW scheme is decentered to the right, and that the damping can be attributed to a nodal displacement perturbation. The FEM study carried out using instantaneous 1-D and 3-D compression loads shows that it is useful to display the damping versus the number of time steps in order to obtain a constant damping efficiency whatever the size of element used for the regular meshing. A study on the responses obtained with irregular meshes shows that the TW scheme is only slightly sensitive to the spatial discretization procedure used. To cite this article: L. Mahéo et al., C. R. Mecanique 337 (2009).

Proposed classification scheme for high-level and other radioactive wastes

International Nuclear Information System (INIS)

Kocher, D.C.; Croff, A.G.

1986-01-01

The Nuclear Waste Policy Act (NWPA) of 1982 defines high-level (radioactive) waste (HLW) as (A) the highly radioactive material resulting from the reprocessing of spent nuclear fuel...that contains fission products in sufficient concentrations; and (B) other highly radioactive material that the Commission...determines...requires permanent isolation. This paper presents a generally applicable quantitative definition of HLW that addresses the description in paragraph B. The approach also results in definitions of other wastes classes, i.e., transuranic (TRU) and low-level waste (LLW). The basic waste classification scheme that results from the quantitative definitions of highly radioactive and requires permanent isolation is depicted. The concentrations of radionuclides that correspond to these two boundaries, and that may be used to classify radioactive wastes, are given

Minimax terminal approach problem in two-level hierarchical nonlinear discrete-time dynamical system

Energy Technology Data Exchange (ETDEWEB)

Shorikov, A. F., E-mail: afshorikov@mail.ru [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia Institute of Mathematics and Mechanics, Ural Branch of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)

2015-11-30

We consider a discrete–time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector nonlinear or linear discrete–time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solving.

Toward Optimal Manifold Hashing via Discrete Locally Linear Embedding.

Science.gov (United States)

Rongrong Ji; Hong Liu; Liujuan Cao; Di Liu; Yongjian Wu; Feiyue Huang

2017-11-01

Binary code learning, also known as hashing, has received increasing attention in large-scale visual search. By transforming high-dimensional features to binary codes, the original Euclidean distance is approximated via Hamming distance. More recently, it is advocated that it is the manifold distance, rather than the Euclidean distance, that should be preserved in the Hamming space. However, it retains as an open problem to directly preserve the manifold structure by hashing. In particular, it first needs to build the local linear embedding in the original feature space, and then quantize such embedding to binary codes. Such a two-step coding is problematic and less optimized. Besides, the off-line learning is extremely time and memory consuming, which needs to calculate the similarity matrix of the original data. In this paper, we propose a novel hashing algorithm, termed discrete locality linear embedding hashing (DLLH), which well addresses the above challenges. The DLLH directly reconstructs the manifold structure in the Hamming space, which learns optimal hash codes to maintain the local linear relationship of data points. To learn discrete locally linear embeddingcodes, we further propose a discrete optimization algorithm with an iterative parameters updating scheme. Moreover, an anchor-based acceleration scheme, termed Anchor-DLLH, is further introduced, which approximates the large similarity matrix by the product of two low-rank matrices. Experimental results on three widely used benchmark data sets, i.e., CIFAR10, NUS-WIDE, and YouTube Face, have shown superior performance of the proposed DLLH over the state-of-the-art approaches.

Parallel S/sub n/ iteration schemes

International Nuclear Information System (INIS)

Wienke, B.R.; Hiromoto, R.E.

1986-01-01

The iterative, multigroup, discrete ordinates (S/sub n/) technique for solving the linear transport equation enjoys widespread usage and appeal. Serial iteration schemes and numerical algorithms developed over the years provide a timely framework for parallel extension. On the Denelcor HEP, the authors investigate three parallel iteration schemes for solving the one-dimensional S/sub n/ transport equation. The multigroup representation and serial iteration methods are also reviewed. This analysis represents a first attempt to extend serial S/sub n/ algorithms to parallel environments and provides good baseline estimates on ease of parallel implementation, relative algorithm efficiency, comparative speedup, and some future directions. The authors examine ordered and chaotic versions of these strategies, with and without concurrent rebalance and diffusion acceleration. Two strategies efficiently support high degrees of parallelization and appear to be robust parallel iteration techniques. The third strategy is a weaker parallel algorithm. Chaotic iteration, difficult to simulate on serial machines, holds promise and converges faster than ordered versions of the schemes. Actual parallel speedup and efficiency are high and payoff appears substantial

Discrete conservation laws and the convergence of long time simulations of the mkdv equation

Science.gov (United States)

Gorria, C.; Alejo, M. A.; Vega, L.

2013-02-01

Pseudospectral collocation methods and finite difference methods have been used for approximating an important family of soliton like solutions of the mKdV equation. These solutions present a structural instability which make difficult to approximate their evolution in long time intervals with enough accuracy. The standard numerical methods do not guarantee the convergence to the proper solution of the initial value problem and often fail by approaching solutions associated to different initial conditions. In this frame the numerical schemes that preserve the discrete invariants related to some conservation laws of this equation produce better results than the methods which only take care of a high consistency order. Pseudospectral spatial discretization appear as the most robust of the numerical methods, but finite difference schemes are useful in order to analyze the rule played by the conservation of the invariants in the convergence.

Research on a New Signature Scheme on Blockchain

Directory of Open Access Journals (Sweden)

Chao Yuan

2017-01-01

Full Text Available With the rise of Bitcoin, blockchain which is the core technology of Bitcoin has received increasing attention. Privacy preserving and performance on blockchain are two research points in academia and business, but there are still some unresolved issues in both respects. An aggregate signature scheme is a digital signature that supports making signatures on many different messages generated by many different users. Using aggregate signature, the size of the signature could be shortened by compressing multiple signatures into a single signature. In this paper, a new signature scheme for transactions on blockchain based on the aggregate signature was proposed. It was worth noting that elliptic curve discrete logarithm problem and bilinear maps played major roles in our signature scheme. And the security properties of our signature scheme were proved. In our signature scheme, the amount will be hidden especially in the transactions which contain multiple inputs and outputs. Additionally, the size of the signature on transaction is constant regardless of the number of inputs and outputs that the transaction contains, which can improve the performance of signature. Finally, we gave an application scenario for our signature scheme which aims to achieve the transactions of big data on blockchain.

Bayesian inference for hybrid discrete-continuous stochastic kinetic models

International Nuclear Information System (INIS)

Sherlock, Chris; Golightly, Andrew; Gillespie, Colin S

2014-01-01

We consider the problem of efficiently performing simulation and inference for stochastic kinetic models. Whilst it is possible to work directly with the resulting Markov jump process (MJP), computational cost can be prohibitive for networks of realistic size and complexity. In this paper, we consider an inference scheme based on a novel hybrid simulator that classifies reactions as either ‘fast’ or ‘slow’ with fast reactions evolving as a continuous Markov process whilst the remaining slow reaction occurrences are modelled through a MJP with time-dependent hazards. A linear noise approximation (LNA) of fast reaction dynamics is employed and slow reaction events are captured by exploiting the ability to solve the stochastic differential equation driving the LNA. This simulation procedure is used as a proposal mechanism inside a particle MCMC scheme, thus allowing Bayesian inference for the model parameters. We apply the scheme to a simple application and compare the output with an existing hybrid approach and also a scheme for performing inference for the underlying discrete stochastic model. (paper)

Solution of the Neutron transport equation in hexagonal geometry using strongly discontinuous nodal schemes

International Nuclear Information System (INIS)

Mugica R, C.A.; Valle G, E. del

2005-01-01

In 2002, E. del Valle and Ernest H. Mund developed a technique to solve numerically the Neutron transport equations in discrete ordinates and hexagonal geometry using two nodal schemes type finite element weakly discontinuous denominated WD 5,3 and WD 12,8 (of their initials in english Weakly Discontinuous). The technique consists on representing each hexagon in the union of three rhombuses each one of which it is transformed in a square in the one that the methods WD 5,3 and WD 12,8 were applied. In this work they are solved the mentioned equations of transport using the same discretization technique by hexagon but using two nodal schemes type finite element strongly discontinuous denominated SD 3 and SD 8 (of their initials in english Strongly Discontinuous). The application in each case as well as a reference problem for those that results are provided for the effective multiplication factor is described. It is carried out a comparison with the obtained results by del Valle and Mund for different discretization meshes so much angular as spatial. (Author)

A conservative scheme for 2D and 3D adaptive semi-Lagrangian advection

OpenAIRE

Behrens, Jörn; Mentrup, Lars

2005-01-01

This article describes a 2D and 3D adaptive and mass conservingsemi-Lagrangian advection scheme for atmospheric transport problems. Fromthe integral form of the conservation law we derive a semi-Lagrangian schemebased on conservation of mass along trajectories. The mapping of mass fromthe old (adaptively refined and possibly different) grid to the upstream controlvolume is performed by a mass packet based scheme, essentially consistingof a sub-grid discretization. We validate the new adaptive...

Explicit solution of the time domain volume integral equation using a stable predictor-corrector scheme

KAUST Repository

Al Jarro, Ahmed

2012-11-01

An explicit marching-on-in-time (MOT) scheme for solving the time domain volume integral equation is presented. The proposed method achieves its stability by employing, at each time step, a corrector scheme, which updates/corrects fields computed by the explicit predictor scheme. The proposedmethod is computationally more efficient when compared to the existing filtering techniques used for the stabilization of explicit MOT schemes. Numerical results presented in this paper demonstrate that the proposed method maintains its stability even when applied to the analysis of electromagnetic wave interactions with electrically large structures meshed using approximately half a million discretization elements.

Explicit solution of the time domain volume integral equation using a stable predictor-corrector scheme

KAUST Repository

Al Jarro, Ahmed; Salem, Mohamed; Bagci, Hakan; Benson, Trevor; Sewell, Phillip D.; Vuković, Ana

2012-01-01

An explicit marching-on-in-time (MOT) scheme for solving the time domain volume integral equation is presented. The proposed method achieves its stability by employing, at each time step, a corrector scheme, which updates/corrects fields computed by the explicit predictor scheme. The proposedmethod is computationally more efficient when compared to the existing filtering techniques used for the stabilization of explicit MOT schemes. Numerical results presented in this paper demonstrate that the proposed method maintains its stability even when applied to the analysis of electromagnetic wave interactions with electrically large structures meshed using approximately half a million discretization elements.

The Performance-based Funding Scheme of Universities

Directory of Open Access Journals (Sweden)

Juha KETTUNEN

2016-05-01

Full Text Available The purpose of this study is to analyse the effectiveness of the performance-based funding scheme of the Finnish universities that was adopted at the beginning of 2013. The political decision-makers expect that the funding scheme will create incentives for the universities to improve performance, but these funding schemes have largely failed in many other countries, primarily because public funding is only a small share of the total funding of universities. This study is interesting because Finnish universities have no tuition fees, unlike in many other countries, and the state allocates funding based on the objectives achieved. The empirical evidence of the graduation rates indicates that graduation rates increased when a new scheme was adopted, especially among male students, who have more room for improvement than female students. The new performance-based funding scheme allocates the funding according to the output-based indicators and limits the scope of strategic planning and the autonomy of the university. The performance-based funding scheme is transformed to the strategy map of the balanced scorecard. The new funding scheme steers universities in many respects but leaves the research and teaching skills to the discretion of the universities. The new scheme has also diminished the importance of the performance agreements between the university and the Ministry. The scheme increases the incentives for universities to improve the processes and structures in order to attain as much public funding as possible. It is optimal for the central administration of the university to allocate resources to faculties and other organisational units following the criteria of the performance-based funding scheme. The new funding scheme has made the universities compete with each other, because the total funding to the universities is allocated to each university according to the funding scheme. There is a tendency that the funding schemes are occasionally

Time-discrete higher order ALE formulations: a priori error analysis

KAUST Repository

Bonito, Andrea

2013-03-16

We derive optimal a priori error estimates for discontinuous Galerkin (dG) time discrete schemes of any order applied to an advection-diffusion model defined on moving domains and written in the Arbitrary Lagrangian Eulerian (ALE) framework. Our estimates hold without any restrictions on the time steps for dG with exact integration or Reynolds\\' quadrature. They involve a mild restriction on the time steps for the practical Runge-Kutta-Radau methods of any order. The key ingredients are the stability results shown earlier in Bonito et al. (Time-discrete higher order ALE formulations: stability, 2013) along with a novel ALE projection. Numerical experiments illustrate and complement our theoretical results. © 2013 Springer-Verlag Berlin Heidelberg.

Finite element discretization of Darcy's equations with pressure dependent porosity

KAUST Repository

Girault, Vivette

2010-02-23

We consider the flow of a viscous incompressible fluid through a rigid homogeneous porous medium. The permeability of the medium depends on the pressure, so that the model is nonlinear. We propose a finite element discretization of this problem and, in the case where the dependence on the pressure is bounded from above and below, we prove its convergence to the solution and propose an algorithm to solve the discrete system. In the case where the dependence on the pressure is exponential, we propose a splitting scheme which involves solving two linear systems, but parts of the analysis of this method are still heuristic. Numerical tests are presented, which illustrate the introduced methods. © 2010 EDP Sciences, SMAI.

A discrete-ordinates solution for a radiation therapy problem

International Nuclear Information System (INIS)

Goldschmidt, Gustavo Brun; Reichert, Janice Teresinha; Barichello, Liliane Basso

2008-01-01

A concise and accurate procedure for evaluating dose distribution, in a radiation therapy planning, is presented. The analytical discrete-ordinates method (ADO method) is used to develop a complete solution for a spectral dependent radiative transfer equation, in a one-dimensional medium, according to a multigroup scheme. Numerical results are presented for test problems, where the Klein-Nishina scattering kernel was used to describe the interaction processes. (author)

Autonomous learning by simple dynamical systems with a discrete-time formulation

Science.gov (United States)

Bilen, Agustín M.; Kaluza, Pablo

2017-05-01

We present a discrete-time formulation for the autonomous learning conjecture. The main feature of this formulation is the possibility to apply the autonomous learning scheme to systems in which the errors with respect to target functions are not well-defined for all times. This restriction for the evaluation of functionality is a typical feature in systems that need a finite time interval to process a unit piece of information. We illustrate its application on an artificial neural network with feed-forward architecture for classification and a phase oscillator system with synchronization properties. The main characteristics of the discrete-time formulation are shown by constructing these systems with predefined functions.

Pressure correction schemes for compressible flows: application to baro-tropic Navier-Stokes equations and to drift-flux model; Methodes de correction de pression pour les ecoulements compressibles: application aux equations de Navier-Stokes barotropes et au modele de derive

Energy Technology Data Exchange (ETDEWEB)

Gastaldo, L

2007-11-15

We develop in this PhD thesis a simulation tool for bubbly flows encountered in some late phases of a core-melt accident in pressurized water reactors, when the flow of molten core and vessel structures comes to chemically interact with the concrete of the containment floor. The physical modelling is based on the so-called drift-flux model, consisting of mass balance and momentum balance equations for the mixture (Navier-Stokes equations) and a mass balance equation for the gaseous phase. First, we propose a pressure correction scheme for the compressible Navier-Stokes equations based on mixed non-conforming finite elements. An ad hoc discretization of the advection operator, by a finite volume technique based on a dual mesh, ensures the stability of the velocity prediction step. A priori estimates for the velocity and the pressure yields the existence of the solution. We prove that this scheme is stable, in the sense that the discrete entropy is decreasing. For the conservation equation of the gaseous phase, we build a finite volume discretization which satisfies a discrete maximum principle. From this last property, we deduce the existence and the uniqueness of the discrete solution. Finally, on the basis of these works, a conservative and monotone scheme which is stable in the low Mach number limit, is build for the drift-flux model. This scheme enjoys, moreover, the following property: the algorithm preserves a constant pressure and velocity through moving interfaces between phases (i.e. contact discontinuities of the underlying hyperbolic system). In order to satisfy this property at the discrete level, we build an original pressure correction step which couples the mass balance equation with the transport terms of the gas mass balance equation, the remaining terms of the gas mass balance being taken into account with a splitting method. We prove the existence of a discrete solution for the pressure correction step. Numerical results are presented; they

Novel Iris Biometric Watermarking Based on Singular Value Decomposition and Discrete Cosine Transform

Directory of Open Access Journals (Sweden)

Jinyu Lu

2014-01-01

Full Text Available A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the singular values of each host image's coefficients which are obtained through discrete cosine transform (DCT. Numerical results reveal that proposed method can extract the watermark effectively and illustrate its security and robustness.

Discontinuous nodal schemes applied to the bidimensional neutron transport equation

International Nuclear Information System (INIS)

Delfin L, A.; Valle G, E. Del; Hennart B, J.P.

1996-01-01

In this paper several strong discontinuous nodal schemes are described, starting from the one that has only two interpolation parameters per cell to the one having ten. Their application to the spatial discretization of the neutron transport equation in X-Y geometry is also described, giving, for each one of the nodal schemes, the approximation for the angular neutron flux that includes the set of interpolation parameters and the corresponding polynomial space. Numerical results were obtained for several test problems presenting here the problem with the highest degree of difficulty and their comparison with published results 1,2 . (Author)

Discrete/PWM Ballast-Resistor Controller

Science.gov (United States)

King, Roger J.

1994-01-01

Circuit offers low switching loss and automatic compensation for failure of ballast resistor. Discrete/PWM ballast-resistor controller improved shunt voltage-regulator circuit designed to supply power from high-resistance source to low-impedance bus. Provides both coarse discrete voltage levels (by switching of ballast resistors) and continuous fine control of voltage via pulse-width modulation.

Controlling the chaotic discrete-Hénon system using a feedforward neural network with an adaptive learning rate

OpenAIRE

GÖKCE, Kürşad; UYAROĞLU, Yılmaz

2013-01-01

This paper proposes a feedforward neural network-based control scheme to control the chaotic trajectories of a discrete-Hénon map in order to stay within an acceptable distance from the stable fixed point. An adaptive learning back propagation algorithm with online training is employed to improve the effectiveness of the proposed method. The simulation study carried in the discrete-Hénon system verifies the validity of the proposed control system.

On the equivalence between the discrete ordinates and the spherical harmonics methods in radiative transfer

International Nuclear Information System (INIS)

Barichello, L.B.; Siewert, C.E.

1998-01-01

In this work concerning steady-state radiative-transfer calculations in plane-parallel media, the equivalence between the discrete ordinates method and the spherical harmonics method is proved. More specifically, it is shown that for standard radiative-transfer problems without the imposed restriction of azimuthal symmetry the two methods yield identical results for the radiation intensity when the quadrature scheme for the discrete ordinates method is defined by the zeros of the associated Legendre functions and when generalized Mark boundary conditions are used to define the spherical harmonics solution. It is also shown that, with these choices for a quadrature scheme and for the boundary conditions, the two methods can be formulated so as to require the same computational effort. Finally a justification for using the generalized Mark boundary conditions in the spherical harmonics solution is given

A novel grain cluster-based homogenization scheme

International Nuclear Information System (INIS)

Tjahjanto, D D; Eisenlohr, P; Roters, F

2010-01-01

An efficient homogenization scheme, termed the relaxed grain cluster (RGC), for elasto-plastic deformations of polycrystals is presented. The scheme is based on a generalization of the grain cluster concept. A volume element consisting of eight (= 2 × 2 × 2) hexahedral grains is considered. The kinematics of the RGC scheme is formulated within a finite deformation framework, where the relaxation of the local deformation gradient of each individual grain is connected to the overall deformation gradient by the, so-called, interface relaxation vectors. The set of relaxation vectors is determined by the minimization of the constitutive energy (or work) density of the overall cluster. An additional energy density associated with the mismatch at the grain boundaries due to relaxations is incorporated as a penalty term into the energy minimization formulation. Effectively, this penalty term represents the kinematical condition of deformation compatibility at the grain boundaries. Simulations have been performed for a dual-phase grain cluster loaded in uniaxial tension. The results of the simulations are presented and discussed in terms of the effective stress–strain response and the overall deformation anisotropy as functions of the penalty energy parameters. In addition, the prediction of the RGC scheme is compared with predictions using other averaging schemes, as well as to the result of direct finite element (FE) simulation. The comparison indicates that the present RGC scheme is able to approximate FE simulation results of relatively fine discretization at about three orders of magnitude lower computational cost

A Single Multilocus Sequence Typing (MLST) Scheme for Seven Pathogenic Leptospira Species

Science.gov (United States)

Amornchai, Premjit; Wuthiekanun, Vanaporn; Bailey, Mark S.; Holden, Matthew T. G.; Zhang, Cuicai; Jiang, Xiugao; Koizumi, Nobuo; Taylor, Kyle; Galloway, Renee; Hoffmaster, Alex R.; Craig, Scott; Smythe, Lee D.; Hartskeerl, Rudy A.; Day, Nicholas P.; Chantratita, Narisara; Feil, Edward J.; Aanensen, David M.; Spratt, Brian G.; Peacock, Sharon J.

2013-01-01

Background The available Leptospira multilocus sequence typing (MLST) scheme supported by a MLST website is limited to L. interrogans and L. kirschneri. Our aim was to broaden the utility of this scheme to incorporate a total of seven pathogenic species. Methodology and Findings We modified the existing scheme by replacing one of the seven MLST loci (fadD was changed to caiB), as the former gene did not appear to be present in some pathogenic species. Comparison of the original and modified schemes using data for L. interrogans and L. kirschneri demonstrated that the discriminatory power of the two schemes was not significantly different. The modified scheme was used to further characterize 325 isolates (L. alexanderi [n = 5], L. borgpetersenii [n = 34], L. interrogans [n = 222], L. kirschneri [n = 29], L. noguchii [n = 9], L. santarosai [n = 10], and L. weilii [n = 16]). Phylogenetic analysis using concatenated sequences of the 7 loci demonstrated that each species corresponded to a discrete clade, and that no strains were misclassified at the species level. Comparison between genotype and serovar was possible for 254 isolates. Of the 31 sequence types (STs) represented by at least two isolates, 18 STs included isolates assigned to two or three different serovars. Conversely, 14 serovars were identified that contained between 2 to 10 different STs. New observations were made on the global phylogeography of Leptospira spp., and the utility of MLST in making associations between human disease and specific maintenance hosts was demonstrated. Conclusion The new MLST scheme, supported by an updated MLST website, allows the characterization and species assignment of isolates of the seven major pathogenic species associated with leptospirosis. PMID:23359622

Discrete gauge symmetries in discrete MSSM-like orientifolds

International Nuclear Information System (INIS)

Ibáñez, L.E.; Schellekens, A.N.; Uranga, A.M.

2012-01-01

Motivated by the necessity of discrete Z N symmetries in the MSSM to insure baryon stability, we study the origin of discrete gauge symmetries from open string sector U(1)'s in orientifolds based on rational conformal field theory. By means of an explicit construction, we find an integral basis for the couplings of axions and U(1) factors for all simple current MIPFs and orientifolds of all 168 Gepner models, a total of 32 990 distinct cases. We discuss how the presence of discrete symmetries surviving as a subgroup of broken U(1)'s can be derived using this basis. We apply this procedure to models with MSSM chiral spectrum, concretely to all known U(3)×U(2)×U(1)×U(1) and U(3)×Sp(2)×U(1)×U(1) configurations with chiral bi-fundamentals, but no chiral tensors, as well as some SU(5) GUT models. We find examples of models with Z 2 (R-parity) and Z 3 symmetries that forbid certain B and/or L violating MSSM couplings. Their presence is however relatively rare, at the level of a few percent of all cases.

Simulation of coupled flow and mechanical deformation using IMplicit Pressure-Displacement Explicit Saturation (IMPDES) scheme

KAUST Repository

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

2012-01-01

cell along the entire domain is given by the implicit difference equation. Also, the deformation equations are discretized implicitly. Using the obtained pressure, velocity is evaluated explicitly, while, using the upwind scheme, the saturation

An explicit MOT-TDVIE scheme for analyzing electromagnetic field interactions on nonlinear scatterers

KAUST Repository

Ulku, Huseyin Arda

2015-02-01

An explicit marching on-in-time (MOT) based time domain electric field volume integral equation (TDVIE) solver for characterizing electromagnetic wave interactions on scatterers with nonlinear material properties is proposed. Discretization of the unknown electric field intensity and flux density is carried out by half and full Schaubert-Wilton-Glisson basis functions, respectively. Coupled system of spatially discretized TDVIE and the nonlinear constitutive relation between the field intensity and the flux density is integrated in time to compute the samples of the unknowns. An explicit PE(CE)m scheme is used for this purpose. Explicitness allows for \\'easy\\' incorporation of the nonlinearity as a function only to be evaluated on the right hand side of the coupled system of equations. A numerical example that demonstrates the applicability of the proposed MOT scheme to analyzing electromagnetic interactions on Kerr-nonlinear scatterers is presented. © 2015 IEEE.

A robust H.264/AVC video watermarking scheme with drift compensation.

Science.gov (United States)

Jiang, Xinghao; Sun, Tanfeng; Zhou, Yue; Wang, Wan; Shi, Yun-Qing

2014-01-01

A robust H.264/AVC video watermarking scheme for copyright protection with self-adaptive drift compensation is proposed. In our scheme, motion vector residuals of macroblocks with the smallest partition size are selected to hide copyright information in order to hold visual impact and distortion drift to a minimum. Drift compensation is also implemented to reduce the influence of watermark to the most extent. Besides, discrete cosine transform (DCT) with energy compact property is applied to the motion vector residual group, which can ensure robustness against intentional attacks. According to the experimental results, this scheme gains excellent imperceptibility and low bit-rate increase. Malicious attacks with different quantization parameters (QPs) or motion estimation algorithms can be resisted efficiently, with 80% accuracy on average after lossy compression.

ADER discontinuous Galerkin schemes for general-relativistic ideal magnetohydrodynamics

Science.gov (United States)

Fambri, F.; Dumbser, M.; Köppel, S.; Rezzolla, L.; Zanotti, O.

2018-03-01

We present a new class of high-order accurate numerical algorithms for solving the equations of general-relativistic ideal magnetohydrodynamics in curved spacetimes. In this paper we assume the background spacetime to be given and static, i.e. we make use of the Cowling approximation. The governing partial differential equations are solved via a new family of fully-discrete and arbitrary high-order accurate path-conservative discontinuous Galerkin (DG) finite-element methods combined with adaptive mesh refinement and time accurate local timestepping. In order to deal with shock waves and other discontinuities, the high-order DG schemes are supplemented with a novel a-posteriori subcell finite-volume limiter, which makes the new algorithms as robust as classical second-order total-variation diminishing finite-volume methods at shocks and discontinuities, but also as accurate as unlimited high-order DG schemes in smooth regions of the flow. We show the advantages of this new approach by means of various classical two- and three-dimensional benchmark problems on fixed spacetimes. Finally, we present a performance and accuracy comparisons between Runge-Kutta DG schemes and ADER high-order finite-volume schemes, showing the higher efficiency of DG schemes.

Improved stochastic approximation methods for discretized parabolic partial differential equations

Science.gov (United States)

Guiaş, Flavius

2016-12-01

We present improvements of the stochastic direct simulation method, a known numerical scheme based on Markov jump processes which is used for approximating solutions of ordinary differential equations. This scheme is suited especially for spatial discretizations of evolution partial differential equations (PDEs). By exploiting the full path simulation of the stochastic method, we use this first approximation as a predictor and construct improved approximations by Picard iterations, Runge-Kutta steps, or a combination. This has as consequence an increased order of convergence. We illustrate the features of the improved method at a standard benchmark problem, a reaction-diffusion equation modeling a combustion process in one space dimension (1D) and two space dimensions (2D).

Geometry and Hamiltonian mechanics on discrete spaces

International Nuclear Information System (INIS)

Talasila, V; Clemente-Gallardo, J; Schaft, A J van der

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to provide a discrete analogue of differential geometry, and to define on these discrete models a formal discrete Hamiltonian structure-in doing so we try to bring together various fundamental concepts from numerical analysis, differential geometry, algebraic geometry, simplicial homology and classical Hamiltonian mechanics. For example, the concept of a twisted derivation is borrowed from algebraic geometry for developing a discrete calculus. The theory is applied to a nonlinear pendulum and we compare the dynamics obtained through a discrete modelling approach with the dynamics obtained via the usual discretization procedures. Also an example of an energy-conserving algorithm on a simple harmonic oscillator is presented, and its effect on the Poisson structure is discussed

A Bayesian random effects discrete-choice model for resource selection: Population-level selection inference

Science.gov (United States)

Thomas, D.L.; Johnson, D.; Griffith, B.

2006-01-01

Modeling the probability of use of land units characterized by discrete and continuous measures, we present a Bayesian random-effects model to assess resource selection. This model provides simultaneous estimation of both individual- and population-level selection. Deviance information criterion (DIC), a Bayesian alternative to AIC that is sample-size specific, is used for model selection. Aerial radiolocation data from 76 adult female caribou (Rangifer tarandus) and calf pairs during 1 year on an Arctic coastal plain calving ground were used to illustrate models and assess population-level selection of landscape attributes, as well as individual heterogeneity of selection. Landscape attributes included elevation, NDVI (a measure of forage greenness), and land cover-type classification. Results from the first of a 2-stage model-selection procedure indicated that there is substantial heterogeneity among cow-calf pairs with respect to selection of the landscape attributes. In the second stage, selection of models with heterogeneity included indicated that at the population-level, NDVI and land cover class were significant attributes for selection of different landscapes by pairs on the calving ground. Population-level selection coefficients indicate that the pairs generally select landscapes with higher levels of NDVI, but the relationship is quadratic. The highest rate of selection occurs at values of NDVI less than the maximum observed. Results for land cover-class selections coefficients indicate that wet sedge, moist sedge, herbaceous tussock tundra, and shrub tussock tundra are selected at approximately the same rate, while alpine and sparsely vegetated landscapes are selected at a lower rate. Furthermore, the variability in selection by individual caribou for moist sedge and sparsely vegetated landscapes is large relative to the variability in selection of other land cover types. The example analysis illustrates that, while sometimes computationally intense, a

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

Energy Technology Data Exchange (ETDEWEB)

Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhou, Xinyang [University of Colorado; Liu, Zhiyuan [University of Colorado; Chen, Lijun [University of Colorado

2017-10-03

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together with pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.

Bit-level quantum color image encryption scheme with quantum cross-exchange operation and hyper-chaotic system

Science.gov (United States)

Zhou, Nanrun; Chen, Weiwei; Yan, Xinyu; Wang, Yunqian

2018-06-01

In order to obtain higher encryption efficiency, a bit-level quantum color image encryption scheme by exploiting quantum cross-exchange operation and a 5D hyper-chaotic system is designed. Additionally, to enhance the scrambling effect, the quantum channel swapping operation is employed to swap the gray values of corresponding pixels. The proposed color image encryption algorithm has larger key space and higher security since the 5D hyper-chaotic system has more complex dynamic behavior, better randomness and unpredictability than those based on low-dimensional hyper-chaotic systems. Simulations and theoretical analyses demonstrate that the presented bit-level quantum color image encryption scheme outperforms its classical counterparts in efficiency and security.

A Non-symmetric Digital Image Secure Communication Scheme Based on Generalized Chaos Synchronization System

International Nuclear Information System (INIS)

Zhang Xiaohong; Min Lequan

2005-01-01

Based on a generalized chaos synchronization system and a discrete Sinai map, a non-symmetric true color (RGB) digital image secure communication scheme is proposed. The scheme first changes an ordinary RGB digital image with 8 bits into unrecognizable disorder codes and then transforms the disorder codes into an RGB digital image with 16 bits for transmitting. A receiver uses a non-symmetric key to verify the authentication of the received data origin, and decrypts the ciphertext. The scheme can encrypt and decrypt most formatted digital RGB images recognized by computers, and recover the plaintext almost without any errors. The scheme is suitable to be applied in network image communications. The analysis of the key space, sensitivity of key parameters, and correlation of encrypted images imply that this scheme has sound security.

Simulation of coupled flow and mechanical deformation using IMplicit Pressure-Displacement Explicit Saturation (IMPDES) scheme

KAUST Repository

El-Amin, Mohamed

2012-01-01

The problem of coupled structural deformation with two-phase flow in porous media is solved numerically using cellcentered finite difference (CCFD) method. In order to solve the system of governed partial differential equations, the implicit pressure explicit saturation (IMPES) scheme that governs flow equations is combined with the the implicit displacement scheme. The combined scheme may be called IMplicit Pressure-Displacement Explicit Saturation (IMPDES). The pressure distribution for each cell along the entire domain is given by the implicit difference equation. Also, the deformation equations are discretized implicitly. Using the obtained pressure, velocity is evaluated explicitly, while, using the upwind scheme, the saturation is obtained explicitly. Moreover, the stability analysis of the present scheme has been introduced and the stability condition is determined.

Mixed finite element - discontinuous finite volume element discretization of a general class of multicontinuum models

Science.gov (United States)

Ruiz-Baier, Ricardo; Lunati, Ivan

2016-10-01

We present a novel discretization scheme tailored to a class of multiphase models that regard the physical system as consisting of multiple interacting continua. In the framework of mixture theory, we consider a general mathematical model that entails solving a system of mass and momentum equations for both the mixture and one of the phases. The model results in a strongly coupled and nonlinear system of partial differential equations that are written in terms of phase and mixture (barycentric) velocities, phase pressure, and saturation. We construct an accurate, robust and reliable hybrid method that combines a mixed finite element discretization of the momentum equations with a primal discontinuous finite volume-element discretization of the mass (or transport) equations. The scheme is devised for unstructured meshes and relies on mixed Brezzi-Douglas-Marini approximations of phase and total velocities, on piecewise constant elements for the approximation of phase or total pressures, as well as on a primal formulation that employs discontinuous finite volume elements defined on a dual diamond mesh to approximate scalar fields of interest (such as volume fraction, total density, saturation, etc.). As the discretization scheme is derived for a general formulation of multicontinuum physical systems, it can be readily applied to a large class of simplified multiphase models; on the other, the approach can be seen as a generalization of these models that are commonly encountered in the literature and employed when the latter are not sufficiently accurate. An extensive set of numerical test cases involving two- and three-dimensional porous media are presented to demonstrate the accuracy of the method (displaying an optimal convergence rate), the physics-preserving properties of the mixed-primal scheme, as well as the robustness of the method (which is successfully used to simulate diverse physical phenomena such as density fingering, Terzaghi's consolidation

A blind video watermarking scheme resistant to rotation and collusion attacks

Directory of Open Access Journals (Sweden)

Amlan Karmakar

2016-04-01

Full Text Available In this paper, Discrete Cosine Transform (DCT based blind video watermarking algorithm is proposed, which is perceptually invisible and robust against rotation and collusion attacks. To make the scheme resistant against rotation, watermark is embedded within the square blocks, placed on the middle position of every luminance channel. Then Zernike moments of those square blocks are calculated. The rotation invariance property of the Complex Zernike moments is exploited to predict the rotation angle of the video at the time of extraction of watermark bits. To make the scheme robust against collusion, design of the scheme is done in such a way that the embedding blocks will vary for the successive frames of the video. A Pseudo Random Number (PRN generator and a permutation vector are used to achieve the goal. The experimental results show that the scheme is robust against conventional video attacks, rotation attack and collusion attacks.

Observer-based adaptive control of chaos in nonlinear discrete-time systems using time-delayed state feedback

International Nuclear Information System (INIS)

Goharrizi, Amin Yazdanpanah; Khaki-Sedigh, Ali; Sepehri, Nariman

2009-01-01

A new approach to adaptive control of chaos in a class of nonlinear discrete-time-varying systems, using a delayed state feedback scheme, is presented. It is discussed that such systems can show chaotic behavior as their parameters change. A strategy is employed for on-line calculation of the Lyapunov exponents that will be used within an adaptive scheme that decides on the control effort to suppress the chaotic behavior once detected. The scheme is further augmented with a nonlinear observer for estimation of the states that are required by the controller but are hard to measure. Simulation results for chaotic control problem of Jin map are provided to show the effectiveness of the proposed scheme.

Design and application of discrete wavelet packet transform based multiresolution controller for liquid level system.

Science.gov (United States)

Paul, Rimi; Sengupta, Anindita

2017-11-01

A new controller based on discrete wavelet packet transform (DWPT) for liquid level system (LLS) has been presented here. This controller generates control signal using node coefficients of the error signal which interprets many implicit phenomena such as process dynamics, measurement noise and effect of external disturbances. Through simulation results on LLS problem, this controller is shown to perform faster than both the discrete wavelet transform based controller and conventional proportional integral controller. Also, it is more efficient in terms of its ability to provide better noise rejection. To overcome the wind up phenomenon by considering the saturation due to presence of actuator, anti-wind up technique is applied to the conventional PI controller and compared to the wavelet packet transform based controller. In this case also, packet controller is found better than the other ones. This similar work has been extended for analogous first order RC plant as well as second order plant also. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Modulation Schemes of Multi-phase Three-Level Z-Source Inverters

DEFF Research Database (Denmark)

Gao, F.; Loh, P.C.; Blaabjerg, Frede

2007-01-01

different modulation requirement and output performance. For clearly illustrating the detailed modulation process, time domain analysis instead of the traditional multi-dimensional space vector demonstration is assumed which reveals the right way to insert shoot-through durations in the switching sequence...... with minimal commutation count. Lastly, the theoretical findings are verified in Matlab/PLECS simulation and experimentally using constructed laboratory prototypes.......This paper investigates the modulation schemes of three-level multiphase Z-source inverters with either two Z-source networks or single Z-source network connected between the dc sources and inverter circuitry. With the proper offset added for achieving both desired four-leg operation and optimized...

Mammogram classification scheme using 2D-discrete wavelet and local binary pattern for detection of breast cancer

Science.gov (United States)

Adi Putra, Januar

2018-04-01

In this paper, we propose a new mammogram classification scheme to classify the breast tissues as normal or abnormal. Feature matrix is generated using Local Binary Pattern to all the detailed coefficients from 2D-DWT of the region of interest (ROI) of a mammogram. Feature selection is done by selecting the relevant features that affect the classification. Feature selection is used to reduce the dimensionality of data and features that are not relevant, in this paper the F-test and Ttest will be performed to the results of the feature extraction dataset to reduce and select the relevant feature. The best features are used in a Neural Network classifier for classification. In this research we use MIAS and DDSM database. In addition to the suggested scheme, the competent schemes are also simulated for comparative analysis. It is observed that the proposed scheme has a better say with respect to accuracy, specificity and sensitivity. Based on experiments, the performance of the proposed scheme can produce high accuracy that is 92.71%, while the lowest accuracy obtained is 77.08%.

Spatial and Angular Moment Analysis of Continuous and Discretized Transport Problems

International Nuclear Information System (INIS)

Brantley, Patrick S.; Larsen, Edward W.

2000-01-01

A new theoretical tool for analyzing continuous and discretized transport equations is presented. This technique is based on a spatial and angular moment analysis of the analytic transport equation, which yields exact expressions for the 'center of mass' and 'squared radius of gyration' of the particle distribution. Essentially the same moment analysis is applied to discretized particle transport problems to determine numerical expressions for the center of mass and squared radius of gyration. Because this technique makes no assumption about the optical thickness of the spatial cells or about the amount of absorption in the system, it is applicable to problems that cannot be analyzed by a truncation analysis or an asymptotic diffusion limit analysis. The spatial differencing schemes examined (weighted- diamond, lumped linear discontinuous, and multiple balance) yield a numerically consistent expression for computing the squared radius of gyration plus an error term that depends on the mesh spacing, quadrature constants, and material properties of the system. The numerical results presented suggest that the relative accuracy of spatial differencing schemes for different types of problems can be assessed by comparing the magnitudes of these error terms

An analysis on equal width quantization and linearly separable subcode encoding-based discretization and its performance resemblances

Directory of Open Access Journals (Sweden)

Lim Meng-Hui

2011-01-01

Full Text Available Abstract Biometric discretization extracts a binary string from a set of real-valued features per user. This representative string can be used as a cryptographic key in many security applications upon error correction. Discretization performance should not degrade from the actual continuous features-based classification performance significantly. However, numerous discretization approaches based on ineffective encoding schemes have been put forward. Therefore, the correlation between such discretization and classification has never been made clear. In this article, we aim to bridge the gap between continuous and Hamming domains, and provide a revelation upon how discretization based on equal-width quantization and linearly separable subcode encoding could affect the classification performance in the Hamming domain. We further illustrate how such discretization can be applied in order to obtain a highly resembled classification performance under the general Lp distance and the inner product metrics. Finally, empirical studies conducted on two benchmark face datasets vindicate our analysis results.

The peculiarities of particle dynamics in the Fermi acceleration scheme

International Nuclear Information System (INIS)

Buts, V.A.

2015-01-01

With examples of discrete and distributed mathematical models of the Fermi acceleration mechanism, a usefulness, or even necessity, of taking into account of singular solutions is demonstrated. Also the role is shown of those parts of phase space where the uniqueness theorem conditions to form the dynamics of physical systems are broken. It was found that the dynamics of particles in discrete and distributed mathematical schemes of Fermi acceleration can be significantly different. The difference is due to the fact that the distributed model takes into account the effects of phase space where conditions do not correspond to those necessary for application of the uniqueness theorem. The role of singular solutions is under discussion as well.

Efficient and Provable Secure Pairing-Free Security-Mediated Identity-Based Identification Schemes

Directory of Open Access Journals (Sweden)

Ji-Jian Chin

2014-01-01

Full Text Available Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user’s secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions.

Efficient and provable secure pairing-free security-mediated identity-based identification schemes.

Science.gov (United States)

Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael C-W

2014-01-01

Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user's secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions.

A gas dynamics scheme for a two moments model of radiative transfer; Un schema de type dynamique des gaz pour un modele a deux moments en transfert radiatif

Energy Technology Data Exchange (ETDEWEB)

Buet, Ch.; Despres, B

2007-07-01

We address the discretization of the Levermore's two moments and entropy model of the radiative transfer equation. We present a new approach for the discretization of this model: first we rewrite the moment equations as a Compressible Gas Dynamics equation by introducing an additional quantity that plays the role of a density. After that we discretize using a Lagrange-projection scheme. The Lagrange-projection scheme permits us to incorporate the source terms in the fluxes of an acoustic solver in the Lagrange step, using the well-known piecewise steady approximation and thus to capture correctly the diffusion regime. Moreover we show that the discretization is entropic and preserve the flux-limited property of the moment model. Numerical examples illustrate the feasibility of our approach. (authors)

Stable explicit coupling of the Yee scheme with a linear current model in fluctuating magnetized plasmas

International Nuclear Information System (INIS)

Silva, Filipe da; Pinto, Martin Campos; Després, Bruno; Heuraux, Stéphane

2015-01-01

This work analyzes the stability of the Yee scheme for non-stationary Maxwell's equations coupled with a linear current model with density fluctuations. We show that the usual procedure may yield unstable scheme for physical situations that correspond to strongly magnetized plasmas in X-mode (TE) polarization. We propose to use first order clustered discretization of the vectorial product that gives back a stable coupling. We validate the schemes on some test cases representative of direct numerical simulations of X-mode in a magnetic fusion plasma including turbulence

ESCL8R and LEVIT8R: interactive graphical analysis of {gamma}-{gamma} and {gamma}-{gamma}-{gamma} coincidence data for level schemes

Energy Technology Data Exchange (ETDEWEB)

Radford, D C [Atomic Energy of Canada Ltd., Chalk River, ON (Canada). Chalk River Nuclear Labs.

1992-08-01

The extraction of complete and consistent nuclear level schemes from high-fold coincidence data will require intelligent computer programs. These will need to present the relevant data in an easily assimilated manner, keep track of all {gamma}-ray assignments and expected coincidence intensities, and quickly find significant discrepancies between a proposed level scheme and the data. Some steps in this direction have been made at Chalk River. The programs ESCL8R and LEVIT8R, for analysis of two-fold and three-fold data sets respectively, allow fast and easy inspection of the data, and compare the results to expectations calculations on the basis of a proposed level scheme. Least-squares fits directly to the 2D and/or 3D data, with the intensities and energies of the level scheme transitions as parameters, allow fast and easy extraction of the optimum physics results. (author). 4 refs., 3 figs.

Synchronization and Desynchronizing Control Schemes for Supermarket Refrigeration Systems

DEFF Research Database (Denmark)

Larsen, Lars Finn Sloth; Thybo, Claus Thybo; Izadi-Zamanabadi, Roozbeh

2007-01-01

A supermarket refrigeration system is a hybrid system with switched nonlinear dynamics and discrete-valued input variables such as opening/closing of valves and start/stop of compressors. Practical and simulation studies have shown that the use of distributed hysteresis controllers to operate...... complexity for desynchronizing the valve operations while improving performance. Simulation results indicate the potential increase in efficiency and reduction in wear comparing with traditional control schemes....

Domain of composition and finite volume schemes on non-matching grids; Decomposition de domaine et schemas volumes finis sur maillages non-conformes

Energy Technology Data Exchange (ETDEWEB)

Saas, L.

2004-05-01

This Thesis deals with sedimentary basin modeling whose goal is the prediction through geological times of the localizations and appraisal of hydrocarbons quantities present in the ground. Due to the natural and evolutionary decomposition of the sedimentary basin in blocks and stratigraphic layers, domain decomposition methods are requested to simulate flows of waters and of hydrocarbons in the ground. Conservations laws are used to model the flows in the ground and form coupled partial differential equations which must be discretized by finite volume method. In this report we carry out a study on finite volume methods on non-matching grids solved by domain decomposition methods. We describe a family of finite volume schemes on non-matching grids and we prove that the associated global discretized problem is well posed. Then we give an error estimate. We give two examples of finite volume schemes on non matching grids and the corresponding theoretical results (Constant scheme and Linear scheme). Then we present the resolution of the global discretized problem by a domain decomposition method using arbitrary interface conditions (for example Robin conditions). Finally we give numerical results which validate the theoretical results and study the use of finite volume methods on non-matching grids for basin modeling. (author)

Discrete-Time LPV Current Control of an Induction Motor

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon; Trangbæk, Klaus

2003-01-01

In this paper we apply a new method for gain-scheduled output feedback control of nonlinear systems to current control of an induction motor. The method relies on recently developed controller synthesis results for linear parameter-varying (LPV) systems, where the controller synthesis is formulated...... as a set of linear matrix inequalities with full-block multipliers. A standard nonlinear model of the motor is constructed and written on LPV form. We then show that, although originally developed in continuous time, the controller synthesis results can be applied to a discrete-time model as well without...... further complications. The synthesis method is applied to the model, yielding an LPV discrete-time controller. Finally, the efficiency of the control scheme is validated via simulations as well as on the actual induction motor, both in open-loop current control and when an outer speed control loop...

A Robust H.264/AVC Video Watermarking Scheme with Drift Compensation

Directory of Open Access Journals (Sweden)

Xinghao Jiang

2014-01-01

Full Text Available A robust H.264/AVC video watermarking scheme for copyright protection with self-adaptive drift compensation is proposed. In our scheme, motion vector residuals of macroblocks with the smallest partition size are selected to hide copyright information in order to hold visual impact and distortion drift to a minimum. Drift compensation is also implemented to reduce the influence of watermark to the most extent. Besides, discrete cosine transform (DCT with energy compact property is applied to the motion vector residual group, which can ensure robustness against intentional attacks. According to the experimental results, this scheme gains excellent imperceptibility and low bit-rate increase. Malicious attacks with different quantization parameters (QPs or motion estimation algorithms can be resisted efficiently, with 80% accuracy on average after lossy compression.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

The objectives of Discrete Mathematics (IDISM2) are: The introduction of the mathematics needed for analysis, design and verification of discrete systems, including the application within programming languages for computer systems. Having passed the IDISM2 course, the student will be able...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics......; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...

An analytical discrete ordinates solution for a nodal model of a two-dimensional neutron transport problem

International Nuclear Information System (INIS)

Filho, J. F. P.; Barichello, L. B.

2013-01-01

In this work, an analytical discrete ordinates method is used to solve a nodal formulation of a neutron transport problem in x, y-geometry. The proposed approach leads to an important reduction in the order of the associated eigenvalue systems, when combined with the classical level symmetric quadrature scheme. Auxiliary equations are proposed, as usually required for nodal methods, to express the unknown fluxes at the boundary introduced as additional unknowns in the integrated equations. Numerical results, for the problem defined by a two-dimensional region with a spatially constant and isotropically emitting source, are presented and compared with those available in the literature. (authors)

Multiple Estimation Architecture in Discrete-Time Adaptive Mixing Control

Directory of Open Access Journals (Sweden)

Simone Baldi

2013-05-01

Full Text Available Adaptive mixing control (AMC is a recently developed control scheme for uncertain plants, where the control action coming from a bank of precomputed controller is mixed based on the parameter estimates generated by an on-line parameter estimator. Even if the stability of the control scheme, also in the presence of modeling errors and disturbances, has been shown analytically, its transient performance might be sensitive to the initial conditions of the parameter estimator. In particular, for some initial conditions, transient oscillations may not be acceptable in practical applications. In order to account for such a possible phenomenon and to improve the learning capability of the adaptive scheme, in this paper a new mixing architecture is developed, involving the use of parallel parameter estimators, or multi-estimators, each one working on a small subset of the uncertainty set. A supervisory logic, using performance signals based on the past and present estimation error, selects the parameter estimate to determine the mixing of the controllers. The stability and robustness properties of the resulting approach, referred to as multi-estimator adaptive mixing control (Multi-AMC, are analytically established. Besides, extensive simulations demonstrate that the scheme improves the transient performance of the original AMC with a single estimator. The control scheme and the analysis are carried out in a discrete-time framework, for easier implementation of the method in digital control.

LIE GROUPS AND NUMERICAL SOLUTIONS OF DIFFERENTIAL EQUATIONS: INVARIANT DISCRETIZATION VERSUS DIFFERENTIAL APPROXIMATION

Directory of Open Access Journals (Sweden)

Decio Levi

2013-10-01

Full Text Available We briefly review two different methods of applying Lie group theory in the numerical solution of ordinary differential equations. On specific examples we show how the symmetry preserving discretization provides difference schemes for which the “first differential approximation” is invariant under the same Lie group as the original ordinary differential equation.

Baecklund transformations for discrete Painleve equations: Discrete PII-PV

International Nuclear Information System (INIS)

Sakka, A.; Mugan, U.

2006-01-01

Transformation properties of discrete Painleve equations are investigated by using an algorithmic method. This method yields explicit transformations which relates the solutions of discrete Painleve equations, discrete P II -P V , with different values of parameters. The particular solutions which are expressible in terms of the discrete analogue of the classical special functions of discrete Painleve equations can also be obtained from these transformations

High-order discrete ordinate transport in hexagonal geometry: A new capability in ERANOS

International Nuclear Information System (INIS)

Le Tellier, R.; Suteau, C.; Fournier, D.; Ruggieri, J.M.

2010-01-01

This paper presents the implementation of an arbitrary order discontinuous Galerkin scheme within the framework of a discrete ordinate solver of the neutron transport equation for nuclear reactor calculations. More precisely, it deals with non-conforming spatial meshes for the 2 D and 3 D modeling of core geometries based on hexagonal assemblies. This work aims at improving the capabilities of the ERANOS code system dedicated to fast reactor analysis and design. Both the angular quadrature and spatial scheme peculiarities for hexagonal geometries are presented. A particular focus is set on the spatial non-conforming mesh and variable order capabilities of this scheme in anticipation to the development of spatial adaptiveness algorithms. These features are illustrated on a 3 D numerical benchmark with comparison to a Monte Carlo reference and a 2 D benchmark that shows the potential of this scheme for both h-and p-adaptation.

Preliminary Study of 1D Thermal-Hydraulic System Analysis Code Using the Higher-Order Numerical Scheme

Energy Technology Data Exchange (ETDEWEB)

Lee, Won Woong; Lee, Jeong Ik [KAIST, Daejeon (Korea, Republic of)

2016-05-15

The existing nuclear system analysis codes such as RELAP5, TRAC, MARS and SPACE use the first-order numerical scheme in both space and time discretization. However, the first-order scheme is highly diffusive and less accurate due to the first order of truncation error. So, the numerical diffusion problem which makes the gradients to be smooth in the regions where the gradients should be steep can occur during the analysis, which often predicts less conservatively than the reality. Therefore, the first-order scheme is not always useful in many applications such as boron solute transport. RELAP7 which is an advanced nuclear reactor system safety analysis code using the second-order numerical scheme in temporal and spatial discretization is being developed by INL (Idaho National Laboratory) since 2011. Therefore, for better predictive performance of the safety of nuclear reactor systems, more accurate nuclear reactor system analysis code is needed for Korea too to follow the global trend of nuclear safety analysis. Thus, this study will evaluate the feasibility of applying the higher-order numerical scheme to the next generation nuclear system analysis code to provide the basis for the better nuclear system analysis code development. The accuracy is enhanced in the spatial second-order scheme and the numerical diffusion problem is alleviated while indicates significantly lower maximum Courant limit and the numerical dispersion issue which produces spurious oscillation and non-physical results in the higher-order scheme. If the spatial scheme is the first order scheme then the temporal second-order scheme provides almost the same result with the temporal firstorder scheme. However, when the temporal second order scheme and the spatial second-order scheme are applied together, the numerical dispersion can occur more severely. For the more in-depth study, the verification and validation of the NTS code built in MATLAB will be conducted further and expanded to handle two

On the influence of spatial discretization in LWR steady state and burnup calculations with HELIOS 1.9

International Nuclear Information System (INIS)

Merk, B.; Weiss, F. P.

2009-01-01

Cell and burnup calculations are fundamental to all deterministic static and transient 3D full core calculations for different operational states of the reactor. The spatial discretization used for the cell and burnup calculations influences significantly the results of full integral transport solutions. The influence of the discretization on k inf is shown for the steady state case and the influence on the neutron spectrum is analyzed. Moreover, the differences in k inf are presented for different spatial discretization strategies in the burnup calculation of Uranium Oxide (UOX) fuel. The resulting different flux distributions cause significant changes in the isotopic densities. The influence of the discretization strategies on the calculation of homogenized few group cross-sections is investigated. This detailed discretization study demonstrates the need for sufficiently fine discretization to produce reliable and accurate results when using integral transport methods. In contrast to the currently used discretization schemes, refined discretization is especially important in the moderator region of the unit cell to reproduce the influence on the thermal neutron spectrum. Additionally, the need for sufficient discretization affects the idea of full core calculations based on integral transport methods since it has to be discussed whether it is worth to do full core calculations with reduced discretization when facing this strong discretization effect. The computer resources required for full core calculations with fine discretization are currently not available. (authors)

Numerical Schemes for Rough Parabolic Equations

Energy Technology Data Exchange (ETDEWEB)

Deya, Aurelien, E-mail: deya@iecn.u-nancy.fr [Universite de Nancy 1, Institut Elie Cartan Nancy (France)

2012-04-15

This paper is devoted to the study of numerical approximation schemes for a class of parabolic equations on (0,1) perturbed by a non-linear rough signal. It is the continuation of Deya (Electron. J. Probab. 16:1489-1518, 2011) and Deya et al. (Probab. Theory Relat. Fields, to appear), where the existence and uniqueness of a solution has been established. The approach combines rough paths methods with standard considerations on discretizing stochastic PDEs. The results apply to a geometric 2-rough path, which covers the case of the multidimensional fractional Brownian motion with Hurst index H>1/3.

Frequency response testing at Experimental Breeder Reactor II using discrete-level periodic signals

International Nuclear Information System (INIS)

Rhodes, W.D.; Larson, H.A.

1990-01-01

The Experimental Breeder Reactor 2 (EBR-2) reactivity-to-power frequency-response function was measured with pseudo-random, discrete-level, periodic signals. The reactor power deviation was small with insignificant perturbation of normal operation and in-place irradiation experiments. Comparison of results with measured rod oscillator data and with theoretical predictions show good agreement. Moreover, measures of input signal quality (autocorrelation function and energy spectra) confirm the ability to enable this type of frequency response determination at EBR-2. Measurements were made with the pseudo-random binary sequence, quadratic residue binary sequence, pseudo-random ternary sequence, and the multifrequency binary sequence. 10 refs., 7 figs., 3 tabs

Transport synthetic acceleration scheme for multi-dimensional neutron transport problems

Energy Technology Data Exchange (ETDEWEB)

Modak, R S; Kumar, Vinod; Menon, S V.G. [Theoretical Physics Div., Bhabha Atomic Research Centre, Mumbai (India); Gupta, Anurag [Reactor Physics Design Div., Bhabha Atomic Research Centre, Mumbai (India)

2005-09-15

The numerical solution of linear multi-energy-group neutron transport equation is required in several analyses in nuclear reactor physics and allied areas. Computer codes based on the discrete ordinates (Sn) method are commonly used for this purpose. These codes solve external source problem and K-eigenvalue problem. The overall solution technique involves solution of source problem in each energy group as intermediate procedures. Such a single-group source problem is solved by the so-called Source Iteration (SI) method. As is well-known, the SI-method converges very slowly for optically thick and highly scattering regions, leading to large CPU times. Over last three decades, many schemes have been tried to accelerate the SI; the most prominent being the Diffusion Synthetic Acceleration (DSA) scheme. The DSA scheme, however, often fails and is also rather difficult to implement. In view of this, in 1997, Ramone and others have developed a new acceleration scheme called Transport Synthetic Acceleration (TSA) which is much more robust and easy to implement. This scheme has been recently incorporated in 2-D and 3-D in-house codes at BARC. This report presents studies on the utility of TSA scheme for fairly general test problems involving many energy groups and anisotropic scattering. The scheme is found to be useful for problems in Cartesian as well as Cylindrical geometry. (author)

Transport synthetic acceleration scheme for multi-dimensional neutron transport problems

International Nuclear Information System (INIS)

Modak, R.S.; Vinod Kumar; Menon, S.V.G.; Gupta, Anurag

2005-09-01

The numerical solution of linear multi-energy-group neutron transport equation is required in several analyses in nuclear reactor physics and allied areas. Computer codes based on the discrete ordinates (Sn) method are commonly used for this purpose. These codes solve external source problem and K-eigenvalue problem. The overall solution technique involves solution of source problem in each energy group as intermediate procedures. Such a single-group source problem is solved by the so-called Source Iteration (SI) method. As is well-known, the SI-method converges very slowly for optically thick and highly scattering regions, leading to large CPU times. Over last three decades, many schemes have been tried to accelerate the SI; the most prominent being the Diffusion Synthetic Acceleration (DSA) scheme. The DSA scheme, however, often fails and is also rather difficult to implement. In view of this, in 1997, Ramone and others have developed a new acceleration scheme called Transport Synthetic Acceleration (TSA) which is much more robust and easy to implement. This scheme has been recently incorporated in 2-D and 3-D in-house codes at BARC. This report presents studies on the utility of TSA scheme for fairly general test problems involving many energy groups and anisotropic scattering. The scheme is found to be useful for problems in Cartesian as well as Cylindrical geometry. (author)

Gauss-Kronrod-Trapezoidal Integration Scheme for Modeling Biological Tissues with Continuous Fiber Distributions

Science.gov (United States)

Hou, Chieh; Ateshian, Gerard A.

2015-01-01

Fibrous biological tissues may be modeled using a continuous fiber distribution (CFD) to capture tension-compression nonlinearity, anisotropic fiber distributions, and load-induced anisotropy. The CFD framework requires spherical integration of weighted individual fiber responses, with fibers contributing to the stress response only when they are in tension. The common method for performing this integration employs the discretization of the unit sphere into a polyhedron with nearly uniform triangular faces (finite element integration or FEI scheme). Although FEI has proven to be more accurate and efficient than integration using spherical coordinates, it presents three major drawbacks: First, the number of elements on the unit sphere needed to achieve satisfactory accuracy becomes a significant computational cost in a finite element analysis. Second, fibers may not be in tension in some regions on the unit sphere, where the integration becomes a waste. Third, if tensed fiber bundles span a small region compared to the area of the elements on the sphere, a significant discretization error arises. This study presents an integration scheme specialized to the CFD framework, which significantly mitigates the first drawback of the FEI scheme, while eliminating the second and third completely. Here, integration is performed only over the regions of the unit sphere where fibers are in tension. Gauss-Kronrod quadrature is used across latitudes and the trapezoidal scheme across longitudes. Over a wide range of strain states, fiber material properties, and fiber angular distributions, results demonstrate that this new scheme always outperforms FEI, sometimes by orders of magnitude in the number of computational steps and relative accuracy of the stress calculation. PMID:26291492

Discrete systems and integrability

CERN Document Server

Hietarinta, J; Nijhoff, F W

2016-01-01

This first introductory text to discrete integrable systems introduces key notions of integrability from the vantage point of discrete systems, also making connections with the continuous theory where relevant. While treating the material at an elementary level, the book also highlights many recent developments. Topics include: Darboux and Bäcklund transformations; difference equations and special functions; multidimensional consistency of integrable lattice equations; associated linear problems (Lax pairs); connections with Padé approximants and convergence algorithms; singularities and geometry; Hirota's bilinear formalism for lattices; intriguing properties of discrete Painlevé equations; and the novel theory of Lagrangian multiforms. The book builds the material in an organic way, emphasizing interconnections between the various approaches, while the exposition is mostly done through explicit computations on key examples. Written by respected experts in the field, the numerous exercises and the thoroug...

Conservative adaptivity and two-way self-nesting using discrete wavelets

Science.gov (United States)

Dubos, Thomas

2010-05-01

In simulating atmosphere and oceans, multiscale modelling is desirable to track high-intensity weather patterns, to investigate the interactions between the various spatio-temporal scales of the climate system, and to perform assessments of climate change at scales small enough to derive impacts on society and ecosystems. The mainstream approach to multiscale modelling is to nest a fine, limited-area model into a coarse, global model. These models are then coupled, either one-way or two-way, in order to combine the global coverage of the global model and the fine details of the fine model. In the long simulations typical of climate studies, initial conditions are unimportant, except for the few quantities like mass that are exactly conserved. In this context it is crucial that numerical models conserve at least mass exactly at the discrete level. However even with elaborate strategies like adaptive mesh refinement (AMR) conservation is not straightforwardly achieved. Although the continuous wavelet transform has become a standard tool of geophysical data analysis, it is less known that discrete wavelets and the associated transforms provide the basis for spatially adaptive numerical methods. Such methods are now well-developed in the fluid dynamics community. Since they allow spatial adaptivity, they can also be seen as two-way self-nesting methods. However since they are not specifically designed for geophysical purposes they are usually not exactly conservative. I present a fairly general framework in which a wavelet-based layer is added to an existing conservative scheme (finite-volume or finite-difference) to make it spatially adaptive without breaking the exact conservation of linear invariants. Discrete wavelet transforms involve an upscaling operation by which fields are transferred from a fine grid to a coarser grid with half the resolution. The method requires that mass fluxes be upscaled in a way that is consistent with the upscaling of mass. This

AN ACCURATE ORBITAL INTEGRATOR FOR THE RESTRICTED THREE-BODY PROBLEM AS A SPECIAL CASE OF THE DISCRETE-TIME GENERAL THREE-BODY PROBLEM

International Nuclear Information System (INIS)

Minesaki, Yukitaka

2013-01-01

For the restricted three-body problem, we propose an accurate orbital integration scheme that retains all conserved quantities of the two-body problem with two primaries and approximately preserves the Jacobi integral. The scheme is obtained by taking the limit as mass approaches zero in the discrete-time general three-body problem. For a long time interval, the proposed scheme precisely reproduces various periodic orbits that cannot be accurately computed by other generic integrators

A comparative study of upwind and MacCormack schemes for CAA benchmark problems

Science.gov (United States)

Viswanathan, K.; Sankar, L. N.

1995-01-01

In this study, upwind schemes and MacCormack schemes are evaluated as to their suitability for aeroacoustic applications. The governing equations are cast in a curvilinear coordinate system and discretized using finite volume concepts. A flux splitting procedure is used for the upwind schemes, where the signals crossing the cell faces are grouped into two categories: signals that bring information from outside into the cell, and signals that leave the cell. These signals may be computed in several ways, with the desired spatial and temporal accuracy achieved by choosing appropriate interpolating polynomials. The classical MacCormack schemes employed here are fourth order accurate in time and space. Results for categories 1, 4, and 6 of the workshop's benchmark problems are presented. Comparisons are also made with the exact solutions, where available. The main conclusions of this study are finally presented.

QIM blind video watermarking scheme based on Wavelet transform and principal component analysis

Directory of Open Access Journals (Sweden)

Nisreen I. Yassin

2014-12-01

Full Text Available In this paper, a blind scheme for digital video watermarking is proposed. The security of the scheme is established by using one secret key in the retrieval of the watermark. Discrete Wavelet Transform (DWT is applied on each video frame decomposing it into a number of sub-bands. Maximum entropy blocks are selected and transformed using Principal Component Analysis (PCA. Quantization Index Modulation (QIM is used to quantize the maximum coefficient of the PCA blocks of each sub-band. Then, the watermark is embedded into the selected suitable quantizer values. The proposed scheme is tested using a number of video sequences. Experimental results show high imperceptibility. The computed average PSNR exceeds 45 dB. Finally, the scheme is applied on two medical videos. The proposed scheme shows high robustness against several attacks such as JPEG coding, Gaussian noise addition, histogram equalization, gamma correction, and contrast adjustment in both cases of regular videos and medical videos.

Multicomponent gas flow computations by a discontinuous Galerkin scheme using L2-projection of perfect gas EOS

Science.gov (United States)

Franchina, N.; Savini, M.; Bassi, F.

2016-06-01

A new formulation of multicomponent gas flow computation, suited to a discontinuous Galerkin discretization, is here presented and discussed. The original key feature is the use of L2-projection form of the (perfect gas) equation of state that allows all thermodynamic variables to span the same functional space. This choice greatly mitigates problems encountered by the front-capturing schemes in computing discontinuous flow field, retaining at the same time their conservation properties at the discrete level and ease of use. This new approach, combined with an original residual-based artificial dissipation technique, shows itself capable, through a series of tests illustrated in the paper, to both control the spurious oscillations of flow variables occurring in high-order accurate computations and reduce them increasing the degree of the polynomial representation of the solution. This result is of great importance in computing reacting gaseous flows, where the local accuracy of temperature and species mass fractions is crucial to the correct evaluation of the chemical source terms contained in the equations, even if the presence of the physical diffusivities somewhat brings relief to these problems. The present work can therefore also be considered, among many others already presented in the literature, as the authors' first step toward the construction of a new discontinuous Galerkin scheme for reacting gas mixture flows.

Robust self-triggered model predictive control for constrained discrete-time LTI systems based on homothetic tubes

NARCIS (Netherlands)

Aydiner, E.; Brunner, F.D.; Heemels, W.P.M.H.; Allgower, F.

2015-01-01

In this paper we present a robust self-triggered model predictive control (MPC) scheme for discrete-time linear time-invariant systems subject to input and state constraints and additive disturbances. In self-triggered model predictive control, at every sampling instant an optimization problem based

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-01-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads

Gaussian quadrature and lattice discretization of the Fermi-Dirac distribution for graphene.

Science.gov (United States)

Oettinger, D; Mendoza, M; Herrmann, H J

2013-07-01

We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as the weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use these polynomials to expand the respective distribution in a moving frame, for both cases, undoped and doped graphene. In order to discretize the Boltzmann equation and make feasible the numerical implementation, we reduce the number of discrete points in momentum space to 18 by applying a Gaussian quadrature, finding that the family of representative wave (2+1)-vectors, which satisfies the quadrature, reconstructs a honeycomb lattice. The procedure and discrete model are validated by solving the Riemann problem, finding excellent agreement with other numerical models. In addition, we have extended the Riemann problem to the case of different dopings, finding that by increasing the chemical potential the electronic fluid behaves as if it increases its effective viscosity.

Validation of a RANS transition model using a high-order weighted compact nonlinear scheme

Science.gov (United States)

Tu, GuoHua; Deng, XiaoGang; Mao, MeiLiang

2013-04-01

A modified transition model is given based on the shear stress transport (SST) turbulence model and an intermittency transport equation. The energy gradient term in the original model is replaced by flow strain rate to saving computational costs. The model employs local variables only, and then it can be conveniently implemented in modern computational fluid dynamics codes. The fifth-order weighted compact nonlinear scheme and the fourth-order staggered scheme are applied to discrete the governing equations for the purpose of minimizing discretization errors, so as to mitigate the confusion between numerical errors and transition model errors. The high-order package is compared with a second-order TVD method on simulating the transitional flow of a flat plate. Numerical results indicate that the high-order package give better grid convergence property than that of the second-order method. Validation of the transition model is performed for transitional flows ranging from low speed to hypersonic speed.

Development and comparison of different spatial numerical schemes for the radiative transfer equation resolution using three-dimensional unstructured meshes

International Nuclear Information System (INIS)

Capdevila, R.; Perez-Segarra, C.D.; Oliva, A.

2010-01-01

In the present work four different spatial numerical schemes have been developed with the aim of reducing the false-scattering of the numerical solutions obtained with the discrete ordinates (DOM) and the finite volume (FVM) methods. These schemes have been designed specifically for unstructured meshes by means of the extrapolation of nodal values of intensity on the studied radiative direction. The schemes have been tested and compared in several 3D benchmark test cases using both structured orthogonal and unstructured grids.

Space discretization in SN methods: Features, improvements and convergence patterns

International Nuclear Information System (INIS)

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

1990-01-01

A comparative analysis of the space discretization schemes currently used in S N methods is performed and special attention is devoted to direct integration techniques. Some improvements are proposed in one- and two-dimensional applications, which are based on suitable choices for the spatial variation of the collision source. A study of the convergence pattern is carried out for eigenvalue calculations within the space asymptotic approximation by means of both analytical and numerical investigations. (orig.) [de

Geometry and Hamiltonian mechanics on discrete spaces

NARCIS (Netherlands)

Talasila, V.; Clemente Gallardo, J.J.; Clemente-Gallardo, J.; van der Schaft, Arjan

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to

Multilevel discretized random field models with 'spin' correlations for the simulation of environmental spatial data

Science.gov (United States)

Žukovič, Milan; Hristopulos, Dionissios T.

2009-02-01

A current problem of practical significance is how to analyze large, spatially distributed, environmental data sets. The problem is more challenging for variables that follow non-Gaussian distributions. We show by means of numerical simulations that the spatial correlations between variables can be captured by interactions between 'spins'. The spins represent multilevel discretizations of environmental variables with respect to a number of pre-defined thresholds. The spatial dependence between the 'spins' is imposed by means of short-range interactions. We present two approaches, inspired by the Ising and Potts models, that generate conditional simulations of spatially distributed variables from samples with missing data. Currently, the sampling and simulation points are assumed to be at the nodes of a regular grid. The conditional simulations of the 'spin system' are forced to respect locally the sample values and the system statistics globally. The second constraint is enforced by minimizing a cost function representing the deviation between normalized correlation energies of the simulated and the sample distributions. In the approach based on the Nc-state Potts model, each point is assigned to one of Nc classes. The interactions involve all the points simultaneously. In the Ising model approach, a sequential simulation scheme is used: the discretization at each simulation level is binomial (i.e., ± 1). Information propagates from lower to higher levels as the simulation proceeds. We compare the two approaches in terms of their ability to reproduce the target statistics (e.g., the histogram and the variogram of the sample distribution), to predict data at unsampled locations, as well as in terms of their computational complexity. The comparison is based on a non-Gaussian data set (derived from a digital elevation model of the Walker Lake area, Nevada, USA). We discuss the impact of relevant simulation parameters, such as the domain size, the number of

Asymptotic diffusion limit of cell temperature discretisation schemes for thermal radiation transport

Energy Technology Data Exchange (ETDEWEB)

Smedley-Stevenson, Richard P., E-mail: richard.smedley-stevenson@awe.co.uk [AWE PLC, Aldermaston, Reading, Berkshire, RG7 4PR (United Kingdom); Department of Earth Science and Engineering, Imperial College London, SW7 2AZ (United Kingdom); McClarren, Ryan G., E-mail: rmcclarren@ne.tamu.edu [Department of Nuclear Engineering, Texas A & M University, College Station, TX 77843-3133 (United States)

2015-04-01

This paper attempts to unify the asymptotic diffusion limit analysis of thermal radiation transport schemes, for a linear-discontinuous representation of the material temperature reconstructed from cell centred temperature unknowns, in a process known as ‘source tilting’. The asymptotic limits of both Monte Carlo (continuous in space) and deterministic approaches (based on linear-discontinuous finite elements) for solving the transport equation are investigated in slab geometry. The resulting discrete diffusion equations are found to have nonphysical terms that are proportional to any cell-edge discontinuity in the temperature representation. Based on this analysis it is possible to design accurate schemes for representing the material temperature, for coupling thermal radiation transport codes to a cell centred representation of internal energy favoured by ALE (arbitrary Lagrange–Eulerian) hydrodynamics schemes.

Asymptotic diffusion limit of cell temperature discretisation schemes for thermal radiation transport

International Nuclear Information System (INIS)

Smedley-Stevenson, Richard P.; McClarren, Ryan G.

2015-01-01

This paper attempts to unify the asymptotic diffusion limit analysis of thermal radiation transport schemes, for a linear-discontinuous representation of the material temperature reconstructed from cell centred temperature unknowns, in a process known as ‘source tilting’. The asymptotic limits of both Monte Carlo (continuous in space) and deterministic approaches (based on linear-discontinuous finite elements) for solving the transport equation are investigated in slab geometry. The resulting discrete diffusion equations are found to have nonphysical terms that are proportional to any cell-edge discontinuity in the temperature representation. Based on this analysis it is possible to design accurate schemes for representing the material temperature, for coupling thermal radiation transport codes to a cell centred representation of internal energy favoured by ALE (arbitrary Lagrange–Eulerian) hydrodynamics schemes

All-optical conversion scheme: Binary to quaternary and quaternary to binary number

Science.gov (United States)

Chattopadhyay, Tanay; Roy, Jitendra Nath

2009-04-01

To achieve the inherent parallelism in optics a suitable number system and efficient encoding/decoding scheme for handling the data are very much essential. Binary number is accepted as the best representing number system in almost all types of existing electronic computers. But, binary number (0 and 1) is insufficient in respect to the demand of the coming generation. Multi-valued logic (with radix >2) can be viewed as an alternative approach to solve many problems in transmission, storage and processing of large amount of information in digital signal processing. Here, in this paper all-optical scheme for the conversion of binary to quaternary number and vice versa have been proposed and described. Simulation has also been done. In this all-optical scheme the numbers are represented by different discrete polarized state of light.

Stability analysis of the Backward Euler time discretization for the pin-resolved transport transient reactor calculation

International Nuclear Information System (INIS)

Zhu, Ang; Xu, Yunlin; Downar, Thomas

2016-01-01

Three-dimensional, full core transport modeling with pin-resolved detail for reactor dynamic simulation is important for some multi-physics reactor applications. However, it can be computationally intensive due to the difficulty in maintaining accuracy while minimizing the number of time steps. A recently proposed Transient Multi-Level (TML) methodology overcomes this difficulty by use multi-level transient solvers to capture the physical phenomenal in different time domains and thus maximize the numerical accuracy and computational efficiency. One major problem with the TML method is the negative flux/precursor number density generated using large time steps for the MOC solver, which is due to the Backward Euler discretization scheme. In this paper, the stability issue of Backward Euler discretization is first investigated using the Point Kinetics Equations (PKEs), and the predicted maximum allowed time step for SPERT test 60 case is shown to be less than 10 ms. To overcome this difficulty, linear and exponential transformations are investigated using the PKEs. The linear transformation is shown to increase the maximum time step by a factor of 2, and the exponential transformation is shown to increase the maximum time step by a factor of 5, as well as provide unconditionally stability above a specified threshold. The two sets of transformations are then applied to TML scheme in the MPACT code, and the numerical results presented show good agreement for standard, linear transformed, and exponential transformed maximum time step between the PKEs model and the MPACT whole core transport solution for three different cases, including a pin cell case, a 3D SPERT assembly case and a row of assemblies (“striped assembly case”) from the SPERT model. Finally, the successful whole transient execution of the stripe assembly case shows the ability of the exponential transformation method to use 10 ms and 20 ms time steps, which all failed using the standard method.

Geometry and Hamiltonian mechanics on discrete spaces

NARCIS (Netherlands)

Talasila, V.; Clemente-Gallardo, J.; Schaft, A.J. van der

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a ‘smooth’ model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

Science.gov (United States)

Ryaben'kii, V. S.; Tsynkov, S. V.; Turchaninov, V. I.

2001-12-01

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special nondeteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of “nonreflecting kernels” nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The nondeteriorating algorithm, which is the core of the new ABCs, is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimensional spaces. It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the unmodified scheme. In this paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABC algorithm.

Associated computational plasticity schemes for nonassociated frictional materials

DEFF Research Database (Denmark)

Krabbenhoft, K.; Karim, M. R.; Lyamin, A. V.

2012-01-01

A new methodology for computational plasticity of nonassociated frictional materials is presented. The new approach is inspired by the micromechanical origins of friction and results in a set of governing equations similar to those of standard associated plasticity. As such, procedures previously...... developed for associated plasticity are applicable with minor modification. This is illustrated by adaptation of the standard implicit scheme. Moreover, the governing equations can be cast in terms of a variational principle, which after discretization is solved by means of a newly developed second...

[Formula: see text] graded discrete Lax pairs and Yang-Baxter maps.

Science.gov (United States)

Fordy, Allan P; Xenitidis, Pavlos

2017-05-01

We recently introduced a class of [Formula: see text] graded discrete Lax pairs and studied the associated discrete integrable systems (lattice equations). In this paper, we introduce the corresponding Yang-Baxter maps. Many well-known examples belong to this scheme for N =2, so, for N ≥3, our systems may be regarded as generalizations of these. In particular, for each N we introduce a class of multi-component Yang-Baxter maps, which include H B III (of Papageorgiou et al. 2010 SIGMA 6, 003 (9 p). (doi:10.3842/SIGMA.2010.033)), when N =2, and that associated with the discrete modified Boussinesq equation, for N =3. For N ≥5 we introduce a new family of Yang-Baxter maps, which have no lower dimensional analogue. We also present new multi-component versions of the Yang-Baxter maps F IV and F V (given in the classification of Adler et al. 2004 Commun. Anal. Geom. 12, 967-1007. (doi:10.4310/CAG.2004.v12.n5.a1)).

A Gauss-Kronrod-Trapezoidal integration scheme for modeling biological tissues with continuous fiber distributions.

Science.gov (United States)

Hou, Chieh; Ateshian, Gerard A

2016-01-01

Fibrous biological tissues may be modeled using a continuous fiber distribution (CFD) to capture tension-compression nonlinearity, anisotropic fiber distributions, and load-induced anisotropy. The CFD framework requires spherical integration of weighted individual fiber responses, with fibers contributing to the stress response only when they are in tension. The common method for performing this integration employs the discretization of the unit sphere into a polyhedron with nearly uniform triangular faces (finite element integration or FEI scheme). Although FEI has proven to be more accurate and efficient than integration using spherical coordinates, it presents three major drawbacks: First, the number of elements on the unit sphere needed to achieve satisfactory accuracy becomes a significant computational cost in a finite element (FE) analysis. Second, fibers may not be in tension in some regions on the unit sphere, where the integration becomes a waste. Third, if tensed fiber bundles span a small region compared to the area of the elements on the sphere, a significant discretization error arises. This study presents an integration scheme specialized to the CFD framework, which significantly mitigates the first drawback of the FEI scheme, while eliminating the second and third completely. Here, integration is performed only over the regions of the unit sphere where fibers are in tension. Gauss-Kronrod quadrature is used across latitudes and the trapezoidal scheme across longitudes. Over a wide range of strain states, fiber material properties, and fiber angular distributions, results demonstrate that this new scheme always outperforms FEI, sometimes by orders of magnitude in the number of computational steps and relative accuracy of the stress calculation.

Limitations of discrete-time quantum walk on a one-dimensional infinite chain

Science.gov (United States)

Lin, Jia-Yi; Zhu, Xuanmin; Wu, Shengjun

2018-04-01

How well can we manipulate the state of a particle via a discrete-time quantum walk? We show that the discrete-time quantum walk on a one-dimensional infinite chain with coin operators that are independent of the position can only realize product operators of the form eiξ A ⊗1p, which cannot change the position state of the walker. We present a scheme to construct all possible realizations of all the product operators of the form eiξ A ⊗1p. When the coin operators are dependent on the position, we show that the translation operators on the position can not be realized via a DTQW with coin operators that are either the identity operator 1 or the Pauli operator σx.

A stable computational scheme for stiff time-dependent constitutive equations

International Nuclear Information System (INIS)

Shih, C.F.; Delorenzi, H.G.; Miller, A.K.

1977-01-01

Viscoplasticity and creep type constitutive equations are increasingly being employed in finite element codes for evaluating the deformation of high temperature structural members. These constitutive equations frequently exhibit stiff regimes which makes an analytical assessment of the structure very costly. A computational scheme for handling deformation in stiff regimes is proposed in this paper. By the finite element discretization, the governing partial differential equations in the spatial (x) and time (t) variables are reduced to a system of nonlinear ordinary differential equations in the independent variable t. The constitutive equations are expanded in a Taylor's series about selected values of t. The resulting system of differential equations are then integrated by an implicit scheme which employs a predictor technique to initiate the Newton-Raphson procedure. To examine the stability and accuracy of the computational scheme, a series of calculations were carried out for uniaxial specimens and thick wall tubes subjected to mechanical and thermal loading. (Auth.)

The effect of hearing aid signal-processing schemes on acceptable noise levels: perception and prediction.

Science.gov (United States)

Wu, Yu-Hsiang; Stangl, Elizabeth

2013-01-01

The acceptable noise level (ANL) test determines the maximum noise level that an individual is willing to accept while listening to speech. The first objective of the present study was to systematically investigate the effect of wide dynamic range compression processing (WDRC), and its combined effect with digital noise reduction (DNR) and directional processing (DIR), on ANL. Because ANL represents the lowest signal-to-noise ratio (SNR) that a listener is willing to accept, the second objective was to examine whether the hearing aid output SNR could predict aided ANL across different combinations of hearing aid signal-processing schemes. Twenty-five adults with sensorineural hearing loss participated in the study. ANL was measured monaurally in two unaided and seven aided conditions, in which the status of the hearing aid processing schemes (enabled or disabled) and the location of noise (front or rear) were manipulated. The hearing aid output SNR was measured for each listener in each condition using a phase-inversion technique. The aided ANL was predicted by unaided ANL and hearing aid output SNR, under the assumption that the lowest acceptable SNR at the listener's eardrum is a constant across different ANL test conditions. Study results revealed that, on average, WDRC increased (worsened) ANL by 1.5 dB, while DNR and DIR decreased (improved) ANL by 1.1 and 2.8 dB, respectively. Because the effects of WDRC and DNR on ANL were opposite in direction but similar in magnitude, the ANL of linear/DNR-off was not significantly different from that of WDRC/DNR-on. The results further indicated that the pattern of ANL change across different aided conditions was consistent with the pattern of hearing aid output SNR change created by processing schemes. Compared with linear processing, WDRC creates a noisier sound image and makes listeners less willing to accept noise. However, this negative effect on noise acceptance can be offset by DNR, regardless of microphone mode

Arbitrary-Lagrangian-Eulerian Discontinuous Galerkin schemes with a posteriori subcell finite volume limiting on moving unstructured meshes

Science.gov (United States)

Boscheri, Walter; Dumbser, Michael

2017-10-01

We present a new family of high order accurate fully discrete one-step Discontinuous Galerkin (DG) finite element schemes on moving unstructured meshes for the solution of nonlinear hyperbolic PDE in multiple space dimensions, which may also include parabolic terms in order to model dissipative transport processes, like molecular viscosity or heat conduction. High order piecewise polynomials of degree N are adopted to represent the discrete solution at each time level and within each spatial control volume of the computational grid, while high order of accuracy in time is achieved by the ADER approach, making use of an element-local space-time Galerkin finite element predictor. A novel nodal solver algorithm based on the HLL flux is derived to compute the velocity for each nodal degree of freedom that describes the current mesh geometry. In our algorithm the spatial mesh configuration can be defined in two different ways: either by an isoparametric approach that generates curved control volumes, or by a piecewise linear decomposition of each spatial control volume into simplex sub-elements. Each technique generates a corresponding number of geometrical degrees of freedom needed to describe the current mesh configuration and which must be considered by the nodal solver for determining the grid velocity. The connection of the old mesh configuration at time tn with the new one at time t n + 1 provides the space-time control volumes on which the governing equations have to be integrated in order to obtain the time evolution of the discrete solution. Our numerical method belongs to the category of so-called direct Arbitrary-Lagrangian-Eulerian (ALE) schemes, where a space-time conservation formulation of the governing PDE system is considered and which already takes into account the new grid geometry (including a possible rezoning step) directly during the computation of the numerical fluxes. We emphasize that our method is a moving mesh method, as opposed to total

Parallel performance of the angular versus spatial domain decomposition for discrete ordinates transport methods

International Nuclear Information System (INIS)

Fischer, J.W.; Azmy, Y.Y.

2003-01-01

A previously reported parallel performance model for Angular Domain Decomposition (ADD) of the Discrete Ordinates method for solving multidimensional neutron transport problems is revisited for further validation. Three communication schemes: native MPI, the bucket algorithm, and the distributed bucket algorithm, are included in the validation exercise that is successfully conducted on a Beowulf cluster. The parallel performance model is comprised of three components: serial, parallel, and communication. The serial component is largely independent of the number of participating processors, P, while the parallel component decreases like 1/P. These two components are independent of the communication scheme, in contrast with the communication component that typically increases with P in a manner highly dependent on the global reduced algorithm. Correct trends for each component and each communication scheme were measured for the Arbitrarily High Order Transport (AHOT) code, thus validating the performance models. Furthermore, extensive experiments illustrate the superiority of the bucket algorithm. The primary question addressed in this research is: for a given problem size, which domain decomposition method, angular or spatial, is best suited to parallelize Discrete Ordinates methods on a specific computational platform? We address this question for three-dimensional applications via parallel performance models that include parameters specifying the problem size and system performance: the above-mentioned ADD, and a previously constructed and validated Spatial Domain Decomposition (SDD) model. We conclude that for large problems the parallel component dwarfs the communication component even on moderately large numbers of processors. The main advantages of SDD are: (a) scalability to higher numbers of processors of the order of the number of computational cells; (b) smaller memory requirement; (c) better performance than ADD on high-end platforms and large number of

AN ADVANCED LEAKAGE SCHEME FOR NEUTRINO TREATMENT IN ASTROPHYSICAL SIMULATIONS

Energy Technology Data Exchange (ETDEWEB)

Perego, A. [Institut für Kernphysik, Technische Universität Darmstadt, Schlossgartenstraße 2, D-64289 Darmstadt (Germany); Cabezón, R. M. [Physics Department, University of Basel, Klingelbergstrasse 82, CH-4056 Basel (Switzerland); Käppeli, R., E-mail: albino.perego@physik.tu-darmstadt.de [Seminar for Applied Mathematics, ETH Zürich, Rämistrasse 101, 8092 Zürich (Switzerland)

2016-04-15

We present an Advanced Spectral Leakage (ASL) scheme to model neutrinos in the context of core-collapse supernovae (CCSNe) and compact binary mergers. Based on previous gray leakage schemes, the ASL scheme computes the neutrino cooling rates by interpolating local production and diffusion rates (relevant in optically thin and thick regimes, respectively) separately for discretized values of the neutrino energy. Neutrino trapped components are also modeled, based on equilibrium and timescale arguments. The better accuracy achieved by the spectral treatment allows a more reliable computation of neutrino heating rates in optically thin conditions. The scheme has been calibrated and tested against Boltzmann transport in the context of Newtonian spherically symmetric models of CCSNe. ASL shows a very good qualitative and a partial quantitative agreement for key quantities from collapse to a few hundreds of milliseconds after core bounce. We have proved the adaptability and flexibility of our ASL scheme, coupling it to an axisymmetric Eulerian and to a three-dimensional smoothed particle hydrodynamics code to simulate core collapse. Therefore, the neutrino treatment presented here is ideal for large parameter-space explorations, parametric studies, high-resolution tests, code developments, and long-term modeling of asymmetric configurations, where more detailed neutrino treatments are not available or are currently computationally too expensive.

Mimetic discretization methods

CERN Document Server

Castillo, Jose E

2013-01-01

To help solve physical and engineering problems, mimetic or compatible algebraic discretization methods employ discrete constructs to mimic the continuous identities and theorems found in vector calculus. Mimetic Discretization Methods focuses on the recent mimetic discretization method co-developed by the first author. Based on the Castillo-Grone operators, this simple mimetic discretization method is invariably valid for spatial dimensions no greater than three. The book also presents a numerical method for obtaining corresponding discrete operators that mimic the continuum differential and

The Cannabis Infringement Notice scheme in Western Australia: a review of policy, police and judicial perspectives.

Science.gov (United States)

Sutton, Adam; Hawks, David

2005-07-01

Western Australia (WA) became the fourth Australian jurisdiction to adopt a 'prohibition with civil penalties scheme' for minor cannabis offences when its Cannabis Infringement Notice (CIN) scheme became law on 22 March 2004. This study examined the attitudes and practices of policy makers, members of the law enforcement and magistracy and other judicial sectors involved in enforcing the new scheme, and their views as to its likely impact on the drug market. As part of the pre--post evaluation of the legislative reforms a sample of 30 police, other criminal justice personnel and policy makers have been qualitatively interviewed. Data were collected both at the pre-implementation stage (March and June 2003) and shortly after the Act became operational (mid-June 2004). The Western Australia Police Service's implementation of the CIN scheme has been extremely professional. However, these early results suggest that while the CIN scheme has been designed to take into account problems with similar schemes elsewhere in Australia, possible problems include: some operational police being unsure about the operation of the scheme; expected savings in police resources will probably be reduced by procedures which require offenders to be taken back to the station rather than issue notices on the spot as intended by the scheme's architects; probable net widening; problems with exercise of police discretion to issue a CIN; and public misunderstanding of the scheme. In the early months of the scheme understanding of the new laws among both police and members of the public was far from perfect. For the system to achieve the outcomes intended by legislators, it is essential that levels of understanding improve. Media and other campaigns to inform the public that cannabis cultivation and use remain illegal, and to warn about risks associated with cannabis use, should be extended. As it will be at least 18 months before the scheme is operationally settled in, the media and others

Time step rescaling recovers continuous-time dynamical properties for discrete-time Langevin integration of nonequilibrium systems.

Science.gov (United States)

Sivak, David A; Chodera, John D; Crooks, Gavin E

2014-06-19

When simulating molecular systems using deterministic equations of motion (e.g., Newtonian dynamics), such equations are generally numerically integrated according to a well-developed set of algorithms that share commonly agreed-upon desirable properties. However, for stochastic equations of motion (e.g., Langevin dynamics), there is still broad disagreement over which integration algorithms are most appropriate. While multiple desiderata have been proposed throughout the literature, consensus on which criteria are important is absent, and no published integration scheme satisfies all desiderata simultaneously. Additional nontrivial complications stem from simulating systems driven out of equilibrium using existing stochastic integration schemes in conjunction with recently developed nonequilibrium fluctuation theorems. Here, we examine a family of discrete time integration schemes for Langevin dynamics, assessing how each member satisfies a variety of desiderata that have been enumerated in prior efforts to construct suitable Langevin integrators. We show that the incorporation of a novel time step rescaling in the deterministic updates of position and velocity can correct a number of dynamical defects in these integrators. Finally, we identify a particular splitting (related to the velocity Verlet discretization) that has essentially universally appropriate properties for the simulation of Langevin dynamics for molecular systems in equilibrium, nonequilibrium, and path sampling contexts.

Positive affect and markers of inflammation: discrete positive emotions predict lower levels of inflammatory cytokines.

Science.gov (United States)

Stellar, Jennifer E; John-Henderson, Neha; Anderson, Craig L; Gordon, Amie M; McNeil, Galen D; Keltner, Dacher

2015-04-01

Negative emotions are reliably associated with poorer health (e.g., Kiecolt-Glaser, McGuire, Robles, & Glaser, 2002), but only recently has research begun to acknowledge the important role of positive emotions for our physical health (Fredrickson, 2003). We examine the link between dispositional positive affect and one potential biological pathway between positive emotions and health-proinflammatory cytokines, specifically levels of interleukin-6 (IL-6). We hypothesized that greater trait positive affect would be associated with lower levels of IL-6 in a healthy sample. We found support for this hypothesis across two studies. We also explored the relationship between discrete positive emotions and IL-6 levels, finding that awe, measured in two different ways, was the strongest predictor of lower levels of proinflammatory cytokines. These effects held when controlling for relevant personality and health variables. This work suggests a potential biological pathway between positive emotions and health through proinflammatory cytokines. (c) 2015 APA, all rights reserved).

One-way functions based on the discrete logarithm problem in the groups meeting conditions C(3-T (6

Directory of Open Access Journals (Sweden)

N. V. Bezverkhniy

2014-01-01

Full Text Available In this work we are consider a possibility to create schemes of open key distribution in the groups meeting conditions C(3-T(6. Our constructions use the following algorithms.1. The algorithm that solves the membership problem for cyclic subgroups, also known as the discrete logarithm problem.2. The algorithm that solves the word problem in this class of groups.Our approach is based on the geometric methods of combinatorial group theory (the method of diagrams in groups.In a cryptographic scheme based on the open key distribution one-way functions are used, i.e. functions direct calculation of which must be much easier than that of the inverse one. Our task was to construct a one-way function using groups with small cancelation conditions C(3-T(6 and to compare the calculation complexity of this function with the calculation complexity of its inverse.P.W. Shor has shown in the paper that there exists a polynomial algorithm that can be implemented in a quantum computer to solve the discrete logarithm problem in the groups of units of finite fields and the rings of congruences mod n. This stimulated a series of investigations trying to find alternative complicated mathematical problems that can be used for construction of new asymmetric cryptosystems. For example, open key distribution systems based on the conjugacy problem in matrix groups and the braid groups were proposed.In the other papers the constructions used the discrete logarithm problem in the groups of inner automorphisms of semi-direct products of SL(2,Z and Zp and GL(2,Zp and Zp. groups. The paper of E. Sakalauskas, P. Tvarijonas, A. Raulinaitis proposed a scheme that uses a composition of two problems of group theory, namely the conjugacy problem and the discrete logarithm problem.Our results show that the scheme that we propose is of polynomial complexity. Therefore its security is not sufficient for further applications in communications. However the security can be improved

Hybrid Discrete Differential Evolution Algorithm for Lot Splitting with Capacity Constraints in Flexible Job Scheduling

Directory of Open Access Journals (Sweden)

Xinli Xu

2013-01-01

Full Text Available A two-level batch chromosome coding scheme is proposed to solve the lot splitting problem with equipment capacity constraints in flexible job shop scheduling, which includes a lot splitting chromosome and a lot scheduling chromosome. To balance global search and local exploration of the differential evolution algorithm, a hybrid discrete differential evolution algorithm (HDDE is presented, in which the local strategy with dynamic random searching based on the critical path and a random mutation operator is developed. The performance of HDDE was experimented with 14 benchmark problems and the practical dye vat scheduling problem. The simulation results showed that the proposed algorithm has the strong global search capability and can effectively solve the practical lot splitting problems with equipment capacity constraints.

A positive and entropy-satisfying finite volume scheme for the Baer-Nunziato model

Science.gov (United States)

Coquel, Frédéric; Hérard, Jean-Marc; Saleh, Khaled

2017-02-01

We present a relaxation scheme for approximating the entropy dissipating weak solutions of the Baer-Nunziato two-phase flow model. This relaxation scheme is straightforwardly obtained as an extension of the relaxation scheme designed in [16] for the isentropic Baer-Nunziato model and consequently inherits its main properties. To our knowledge, this is the only existing scheme for which the approximated phase fractions, phase densities and phase internal energies are proven to remain positive without any restrictive condition other than a classical fully computable CFL condition. For ideal gas and stiffened gas equations of state, real values of the phasic speeds of sound are also proven to be maintained by the numerical scheme. It is also the only scheme for which a discrete entropy inequality is proven, under a CFL condition derived from the natural sub-characteristic condition associated with the relaxation approximation. This last property, which ensures the non-linear stability of the numerical method, is satisfied for any admissible equation of state. We provide a numerical study for the convergence of the approximate solutions towards some exact Riemann solutions. The numerical simulations show that the relaxation scheme compares well with two of the most popular existing schemes available for the Baer-Nunziato model, namely Schwendeman-Wahle-Kapila's Godunov-type scheme [39] and Tokareva-Toro's HLLC scheme [44]. The relaxation scheme also shows a higher precision and a lower computational cost (for comparable accuracy) than a standard numerical scheme used in the nuclear industry, namely Rusanov's scheme. Finally, we assess the good behavior of the scheme when approximating vanishing phase solutions.

A New Chaos-Based Color Image Encryption Scheme with an Efficient Substitution Keystream Generation Strategy

Directory of Open Access Journals (Sweden)

Chong Fu

2018-01-01

Full Text Available This paper suggests a new chaos-based color image cipher with an efficient substitution keystream generation strategy. The hyperchaotic Lü system and logistic map are employed to generate the permutation and substitution keystream sequences for image data scrambling and mixing. In the permutation stage, the positions of colored subpixels in the input image are scrambled using a pixel-swapping mechanism, which avoids two main problems encountered when using the discretized version of area-preserving chaotic maps. In the substitution stage, we introduce an efficient keystream generation method that can extract three keystream elements from the current state of the iterative logistic map. Compared with conventional method, the total number of iterations is reduced by 3 times. To ensure the robustness of the proposed scheme against chosen-plaintext attack, the current state of the logistic map is perturbed during each iteration and the disturbance value is determined by plain-pixel values. The mechanism of associating the keystream sequence with plain-image also helps accelerate the diffusion process and increase the degree of randomness of the keystream sequence. Experimental results demonstrate that the proposed scheme has a satisfactory level of security and outperforms the conventional schemes in terms of computational efficiency.

Equivalence between the Energy Stable Flux Reconstruction and Filtered Discontinuous Galerkin Schemes

Science.gov (United States)

Zwanenburg, Philip; Nadarajah, Siva

2016-02-01

The aim of this paper is to demonstrate the equivalence between filtered Discontinuous Galerkin (DG) schemes and the Energy Stable Flux Reconstruction (ESFR) schemes, expanding on previous demonstrations in 1D [1] and for straight-sided elements in 3D [2]. We first derive the DG and ESFR schemes in strong form and compare the respective flux penalization terms while highlighting the implications of the fundamental assumptions for stability in the ESFR formulations, notably that all ESFR scheme correction fields can be interpreted as modally filtered DG correction fields. We present the result in the general context of all higher dimensional curvilinear element formulations. Through a demonstration that there exists a weak form of the ESFR schemes which is both discretely and analytically equivalent to the strong form, we then extend the results obtained for the strong formulations to demonstrate that ESFR schemes can be interpreted as a DG scheme in weak form where discontinuous edge flux is substituted for numerical edge flux correction. Theoretical derivations are then verified with numerical results obtained from a 2D Euler testcase with curved boundaries. Given the current choice of high-order DG-type schemes and the question as to which might be best to use for a specific application, the main significance of this work is the bridge that it provides between them. Clearly outlining the similarities between the schemes results in the important conclusion that it is always less efficient to use ESFR schemes, as opposed to the weak DG scheme, when solving problems implicitly.

Dispersion tolerance enhancement using an improved offset-QAM OFDM scheme.

Science.gov (United States)

Zhao, Jian; Townsend, Paul D

2015-06-29

Discrete-Fourier transform (DFT) based offset quadrature amplitude modulation (offset-QAM) orthogonal frequency division multiplexing (OFDM) without cyclic prefix (CP) was shown to offer a dispersion tolerance the same as that of conventional OFDM with ~20% CP overhead. In this paper, we analytically study the fundamental mechanism limiting the dispersion tolerance of this conventional scheme. It is found that the signal and the crosstalk from adjacent subcarriers, which are orthogonal with π/2 phase difference at back to back, can be in-phase when the dispersion increases to a certain value. We propose a novel scheme to overcome this limitation and significantly improve the dispersion tolerance to that of one subcarrier. Simulations show that the proposed scheme can support a 224-Gb/s polarization-division-multiplexed offset-4QAM OFDM signal over 160,000 ps/nm without any CP under 128 subcarriers, and this tolerance scales with the square of the number of subcarriers. It is also shown that this scheme exhibits advantages of greatly enhanced spectral efficiency, larger dispersion tolerance, and/or reduced complexity compared to the conventional CP-OFDM and reduced-guard-interval OFDM using frequency domain equalization.

Stochastic ℋ∞ Finite-Time Control of Discrete-Time Systems with Packet Loss

Directory of Open Access Journals (Sweden)

Yingqi Zhang

2012-01-01

Full Text Available This paper investigates the stochastic finite-time stabilization and ℋ∞ control problem for one family of linear discrete-time systems over networks with packet loss, parametric uncertainties, and time-varying norm-bounded disturbance. Firstly, the dynamic model description studied is given, which, if the packet dropout is assumed to be a discrete-time homogenous Markov process, the class of discrete-time linear systems with packet loss can be regarded as Markovian jump systems. Based on Lyapunov function approach, sufficient conditions are established for the resulting closed-loop discrete-time system with Markovian jumps to be stochastic ℋ∞ finite-time boundedness and then state feedback controllers are designed to guarantee stochastic ℋ∞ finite-time stabilization of the class of stochastic systems. The stochastic ℋ∞ finite-time boundedness criteria can be tackled in the form of linear matrix inequalities with a fixed parameter. As an auxiliary result, we also give sufficient conditions on the robust stochastic stabilization of the class of linear systems with packet loss. Finally, simulation examples are presented to illustrate the validity of the developed scheme.

Low-Dissipation Advection Schemes Designed for Large Eddy Simulations of Hypersonic Propulsion Systems

Science.gov (United States)

White, Jeffrey A.; Baurle, Robert A.; Fisher, Travis C.; Quinlan, Jesse R.; Black, William S.

2012-01-01

The 2nd-order upwind inviscid flux scheme implemented in the multi-block, structured grid, cell centered, finite volume, high-speed reacting flow code VULCAN has been modified to reduce numerical dissipation. This modification was motivated by the desire to improve the codes ability to perform large eddy simulations. The reduction in dissipation was accomplished through a hybridization of non-dissipative and dissipative discontinuity-capturing advection schemes that reduces numerical dissipation while maintaining the ability to capture shocks. A methodology for constructing hybrid-advection schemes that blends nondissipative fluxes consisting of linear combinations of divergence and product rule forms discretized using 4th-order symmetric operators, with dissipative, 3rd or 4th-order reconstruction based upwind flux schemes was developed and implemented. A series of benchmark problems with increasing spatial and fluid dynamical complexity were utilized to examine the ability of the candidate schemes to resolve and propagate structures typical of turbulent flow, their discontinuity capturing capability and their robustness. A realistic geometry typical of a high-speed propulsion system flowpath was computed using the most promising of the examined schemes and was compared with available experimental data to demonstrate simulation fidelity.

Continuous versus discrete structures II -- Discrete Hamiltonian systems and Helmholtz conditions

OpenAIRE

Cresson, Jacky; Pierret, Frédéric

2015-01-01

We define discrete Hamiltonian systems in the framework of discrete embeddings. An explicit comparison with previous attempts is given. We then solve the discrete Helmholtz's inverse problem for the discrete calculus of variation in the Hamiltonian setting. Several applications are discussed.

Recent developments of discrete material optimization of laminated composite structures

DEFF Research Database (Denmark)

Lund, Erik; Sørensen, Rene

2015-01-01

This work will give a quick summary of recent developments of the Discrete Material Optimization approach for structural optimization of laminated composite structures. This approach can be seen as a multi-material topology optimization approach for selecting the best ply material and number...... of plies in a laminated composite structure. The conceptual combinatorial design problem is relaxed to a continuous problem such that well-established gradient based optimization techniques can be applied, and the optimization problem is solved on basis of interpolation schemes with penalization...

Synchronization of discrete-time spatiotemporal chaos via adaptive fuzzy control

International Nuclear Information System (INIS)

Xue Yueju; Yang Shiyuan

2003-01-01

A discrete-time adaptive fuzzy control scheme is presented to synchronize model-unknown coupled Henon-map lattices (CHMLs). The proposed method is robust to approximate errors, parameter mismatches and disturbances, because it integrates the merits of the adaptive fuzzy systems and the variable structure control with a sector. The simulation results of synchronization of CHMLs show that it not only can synchronize model-unknown CHMLs but also is robust against parameter mismatches and noise of the systems. These merits are advantageous for engineering realization

Synchronization of discrete-time spatiotemporal chaos via adaptive fuzzy control

Energy Technology Data Exchange (ETDEWEB)

Xue Yueju E-mail: xueyj@mail.tsinghua.edu.cn; Yang Shiyuan E-mail: ysy-dau@tsinghua.edu.cn

2003-08-01

A discrete-time adaptive fuzzy control scheme is presented to synchronize model-unknown coupled Henon-map lattices (CHMLs). The proposed method is robust to approximate errors, parameter mismatches and disturbances, because it integrates the merits of the adaptive fuzzy systems and the variable structure control with a sector. The simulation results of synchronization of CHMLs show that it not only can synchronize model-unknown CHMLs but also is robust against parameter mismatches and noise of the systems. These merits are advantageous for engineering realization.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics...... to new problems. Relations and functions: Define a product set; define and apply equivalence relations; construct and apply functions. Apply these concepts to new problems. Natural numbers and induction: Define the natural numbers; apply the principle of induction to verify a selection of properties...

Discrete and mesoscopic regimes of finite-size wave turbulence

International Nuclear Information System (INIS)

L'vov, V. S.; Nazarenko, S.

2010-01-01

Bounding volume results in discreteness of eigenmodes in wave systems. This leads to a depletion or complete loss of wave resonances (three-wave, four-wave, etc.), which has a strong effect on wave turbulence (WT) i.e., on the statistical behavior of broadband sets of weakly nonlinear waves. This paper describes three different regimes of WT realizable for different levels of the wave excitations: discrete, mesoscopic and kinetic WT. Discrete WT comprises chaotic dynamics of interacting wave 'clusters' consisting of discrete (often finite) number of connected resonant wave triads (or quarters). Kinetic WT refers to the infinite-box theory, described by well-known wave-kinetic equations. Mesoscopic WT is a regime in which either the discrete and the kinetic evolutions alternate or when none of these two types is purely realized. We argue that in mesoscopic systems the wave spectrum experiences a sandpile behavior. Importantly, the mesoscopic regime is realized for a broad range of wave amplitudes which typically spans over several orders on magnitude, and not just for a particular intermediate level.

A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model

Directory of Open Access Journals (Sweden)

Lili Zhang

2014-01-01

Full Text Available A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of original signers without knowing the content of the message. It combines the advantages of proxy signature and blind signature. Up to date, most proxy blind signature schemes rely on hard number theory problems, discrete logarithm, and bilinear pairings. Unfortunately, the above underlying number theory problems will be solvable in the postquantum era. Lattice-based cryptography is enjoying great interest these days, due to implementation simplicity and provable security reductions. Moreover, lattice-based cryptography is believed to be hard even for quantum computers. In this paper, we present a new identity-based proxy blind signature scheme from lattices without random oracles. The new scheme is proven to be strongly unforgeable under the standard hardness assumption of the short integer solution problem (SIS and the inhomogeneous small integer solution problem (ISIS. Furthermore, the secret key size and the signature length of our scheme are invariant and much shorter than those of the previous lattice-based proxy blind signature schemes. To the best of our knowledge, our construction is the first short lattice-based identity-based proxy blind signature scheme in the standard model.

A combined finite volume-nonconforming finite element scheme for compressible two phase flow in porous media

KAUST Repository

Saad, Bilal Mohammed; Saad, Mazen Naufal B M

2014-01-01

We propose and analyze a combined finite volume-nonconforming finite element scheme on general meshes to simulate the two compressible phase flow in porous media. The diffusion term, which can be anisotropic and heterogeneous, is discretized by piecewise linear nonconforming triangular finite elements. The other terms are discretized by means of a cell-centered finite volume scheme on a dual mesh, where the dual volumes are constructed around the sides of the original mesh. The relative permeability of each phase is decentred according the sign of the velocity at the dual interface. This technique also ensures the validity of the discrete maximum principle for the saturation under a non restrictive shape regularity of the space mesh and the positiveness of all transmissibilities. Next, a priori estimates on the pressures and a function of the saturation that denote capillary terms are established. These stabilities results lead to some compactness arguments based on the use of the Kolmogorov compactness theorem, and allow us to derive the convergence of a subsequence of the sequence of approximate solutions to a weak solution of the continuous equations, provided the mesh size tends to zero. The proof is given for the complete system when the density of the each phase depends on its own pressure. © 2014 Springer-Verlag Berlin Heidelberg.

A combined finite volume-nonconforming finite element scheme for compressible two phase flow in porous media

KAUST Repository

Saad, Bilal Mohammed

2014-06-28

We propose and analyze a combined finite volume-nonconforming finite element scheme on general meshes to simulate the two compressible phase flow in porous media. The diffusion term, which can be anisotropic and heterogeneous, is discretized by piecewise linear nonconforming triangular finite elements. The other terms are discretized by means of a cell-centered finite volume scheme on a dual mesh, where the dual volumes are constructed around the sides of the original mesh. The relative permeability of each phase is decentred according the sign of the velocity at the dual interface. This technique also ensures the validity of the discrete maximum principle for the saturation under a non restrictive shape regularity of the space mesh and the positiveness of all transmissibilities. Next, a priori estimates on the pressures and a function of the saturation that denote capillary terms are established. These stabilities results lead to some compactness arguments based on the use of the Kolmogorov compactness theorem, and allow us to derive the convergence of a subsequence of the sequence of approximate solutions to a weak solution of the continuous equations, provided the mesh size tends to zero. The proof is given for the complete system when the density of the each phase depends on its own pressure. © 2014 Springer-Verlag Berlin Heidelberg.

A hybrid finite-volume and finite difference scheme for depth-integrated non-hydrostatic model

Science.gov (United States)

Yin, Jing; Sun, Jia-wen; Wang, Xing-gang; Yu, Yong-hai; Sun, Zhao-chen

2017-06-01

A depth-integrated, non-hydrostatic model with hybrid finite difference and finite volume numerical algorithm is proposed in this paper. By utilizing a fraction step method, the governing equations are decomposed into hydrostatic and non-hydrostatic parts. The first part is solved by using the finite volume conservative discretization method, whilst the latter is considered by solving discretized Poisson-type equations with the finite difference method. The second-order accuracy, both in time and space, of the finite volume scheme is achieved by using an explicit predictor-correction step and linear construction of variable state in cells. The fluxes across the cell faces are computed in a Godunov-based manner by using MUSTA scheme. Slope and flux limiting technique is used to equip the algorithm with total variation dimensioning property for shock capturing purpose. Wave breaking is treated as a shock by switching off the non-hydrostatic pressure in the steep wave front locally. The model deals with moving wet/dry front in a simple way. Numerical experiments are conducted to verify the proposed model.

Discrete spectroscopy in {sup 180}Os at high spins

Energy Technology Data Exchange (ETDEWEB)

Marti, G; Venkova, Ts; Morek, T; Schnare, H; Gast, W; Georgiev, A; Spohr, K M; Lieder, R M [Institut fuer Kernphysik, KFA-Juelich (Germany); Maier, K H [Hahn-Meitner-Institut Berlin GmbH (Germany); Zell, K O [Institut fuer Kernphysik, Universitaet Koeln (Germany)

1992-08-01

New information on rotational bands in {sup 180}Os was obtained from a discrete spectroscopy experiment in which the final nucleus was populated through the {sup 150}Nd({sup 36}S,6n) reaction at 177 MeV. A new strongly-coupled rotational band starting at a relatively high excitation energy was found. The observation and placement of the 185.6 keV in the level scheme gives strong support to a hypothetical 2-quasineutron configuration assigned to the 7{sup -} isomeric bands in {sup 180}Os and the isotone {sup 178}W. Band mixing between the (-,1){sub 1} and (-,1){sub 3} bands of same parity and signature was observed, and the interaction strength was estimated from experimental branching ratios. The authors` results confirm a previous assignment for the yrast and yrare sequences in this nucleus. With the identification of new transitions above the states with I {approx_equal} 24, previously assigned bands had to be revised, with the result that the second band crossing vanishes. 23 refs., 3 figs.

Spectrum Control through Discrete Frequency Diffraction in the Presence of Photonic Gauge Potentials

Science.gov (United States)

Qin, Chengzhi; Zhou, Feng; Peng, Yugui; Sounas, Dimitrios; Zhu, Xuefeng; Wang, Bing; Dong, Jianji; Zhang, Xinliang; Alù; , Andrea; Lu, Peixiang

2018-03-01

By using optical phase modulators in a fiber-optical circuit, we theoretically and experimentally demonstrate large control over the spectrum of an impinging signal, which may evolve analogously to discrete diffraction in spatial waveguide arrays. The modulation phase acts as a photonic gauge potential in the frequency dimension, realizing efficient control of the central frequency and bandwidth of frequency combs. We experimentally achieve a 50 GHz frequency shift and threefold bandwidth expansion of an impinging comb, as well as the frequency analogue of various refraction phenomena, including negative refraction and perfect focusing in the frequency domain, both for discrete and continuous incident spectra. Our study paves a promising way towards versatile frequency management for optical communications and signal processing using time modulation schemes.

Multi-symplectic integrators: numerical schemes for Hamiltonian PDEs that conserve symplecticity

Science.gov (United States)

Bridges, Thomas J.; Reich, Sebastian

2001-06-01

The symplectic numerical integration of finite-dimensional Hamiltonian systems is a well established subject and has led to a deeper understanding of existing methods as well as to the development of new very efficient and accurate schemes, e.g., for rigid body, constrained, and molecular dynamics. The numerical integration of infinite-dimensional Hamiltonian systems or Hamiltonian PDEs is much less explored. In this Letter, we suggest a new theoretical framework for generalizing symplectic numerical integrators for ODEs to Hamiltonian PDEs in R2: time plus one space dimension. The central idea is that symplecticity for Hamiltonian PDEs is directional: the symplectic structure of the PDE is decomposed into distinct components representing space and time independently. In this setting PDE integrators can be constructed by concatenating uni-directional ODE symplectic integrators. This suggests a natural definition of multi-symplectic integrator as a discretization that conserves a discrete version of the conservation of symplecticity for Hamiltonian PDEs. We show that this approach leads to a general framework for geometric numerical schemes for Hamiltonian PDEs, which have remarkable energy and momentum conservation properties. Generalizations, including development of higher-order methods, application to the Euler equations in fluid mechanics, application to perturbed systems, and extension to more than one space dimension are also discussed.

Indirect adaptive control of discrete chaotic systems

International Nuclear Information System (INIS)

Salarieh, Hassan; Shahrokhi, Mohammad

2007-01-01

In this paper an indirect adaptive control algorithm is proposed to stabilize the fixed points of discrete chaotic systems. It is assumed that the functionality of the chaotic dynamics is known but the system parameters are unknown. This assumption is usually applicable to many chaotic systems, such as the Henon map, logistic and many other nonlinear maps. Using the recursive-least squares technique, the system parameters are identified and based on the feedback linearization method an adaptive controller is designed for stabilizing the fixed points, or unstable periodic orbits of the chaotic maps. The stability of the proposed scheme has been shown and the effectiveness of the control algorithm has been demonstrated through computer simulations

Multilevel Fast Multipole Method for Higher Order Discretizations

DEFF Research Database (Denmark)

Borries, Oscar Peter; Meincke, Peter; Jorgensen, Erik

2014-01-01

The multi-level fast multipole method (MLFMM) for a higher order (HO) discretization is demonstrated on high-frequency (HF) problems, illustrating for the first time how an efficient MLFMM for HO can be achieved even for very large groups. Applying several novel ideas, beneficial to both lower...... order and higher order discretizations, results from a low-memory, high-speed MLFMM implementation of a HO hierarchical discretization are shown. These results challenge the general view that the benefits of HO and HF-MLFMM cannot be combined....

Non-fragile ?-? control for discrete-time stochastic nonlinear systems under event-triggered protocols

Science.gov (United States)

Sun, Ying; Ding, Derui; Zhang, Sunjie; Wei, Guoliang; Liu, Hongjian

2018-07-01

In this paper, the non-fragile ?-? control problem is investigated for a class of discrete-time stochastic nonlinear systems under event-triggered communication protocols, which determine whether the measurement output should be transmitted to the controller or not. The main purpose of the addressed problem is to design an event-based output feedback controller subject to gain variations guaranteeing the prescribed disturbance attenuation level described by the ?-? performance index. By utilizing the Lyapunov stability theory combined with S-procedure, a sufficient condition is established to guarantee both the exponential mean-square stability and the ?-? performance for the closed-loop system. In addition, with the help of the orthogonal decomposition, the desired controller parameter is obtained in terms of the solution to certain linear matrix inequalities. Finally, a simulation example is exploited to demonstrate the effectiveness of the proposed event-based controller design scheme.

Numerical solution of the 1D kinetics equations using a cubic reduced nodal scheme

International Nuclear Information System (INIS)

Gomez T, A.M.; Valle G, E. del; Delfin L, A.; Alonso V, G.

2003-01-01

In this work a finite differences technique centered in mesh based on a cubic reduced nodal scheme type finite element to solve the equations of the kinetics 1 D that include the equations corresponding to the concentrations of precursors of delayed neutrons is described. The technique of finite elements used is that of Galerkin where so much the neutron flux as the concentrations of precursors its are spatially approached by means of a three grade polynomial. The matrices of rigidity and of mass that arise during this discretization process are numerically evaluated using the open quadrature non standard of Newton-Cotes and that of Radau respectively. The purpose of the application of these quadratures is the one of to eliminate in the global matrices the couplings among the values of the flow in points of the discretization with the consequent advantages as for the reduction of the order of the matrix associated to the discreet problem that is to solve. As for the time dependent part the classical integration scheme known as Θ scheme is applied. After carrying out the one reordering of unknown and equations it arrives to a reduced system that it can be solved but quickly. With the McKin compute program developed its were solved three benchmark problems and those results are shown for the relative powers. (Author)

An efficient shock-capturing scheme for simulating compressible homogeneous mixture flow

Energy Technology Data Exchange (ETDEWEB)

Dang, Son Tung; Ha, Cong Tu; Park, Warn Gyu [School of Mechanical Engineering, Pusan National University, Busan (Korea, Republic of); Jung, Chul Min [Advanced Naval Technology CenterNSRDI, ADD, Changwon (Korea, Republic of)

2016-09-15

This work is devoted to the development of a procedure for the numerical solution of Navier-Stokes equations for cavitating flows with and without ventilation based on a compressible, multiphase, homogeneous mixture model. The governing equations are discretized on a general structured grid using a high-resolution shock-capturing scheme in conjunction with appropriate limiters to prevent the generation of spurious solutions near shock waves or discontinuities. Two well-known limiters are examined, and a new limiter is proposed to enhance the accuracy and stability of the numerical scheme. A sensitivity analysis is first conducted to determine the relative influences of various model parameters on the solution. These parameters are adopted for the computation of water flows over a hemispherical body, conical body and a divergent/convergent nozzle. Finally, numerical calculations of ventilated supercavitating flows over a hemispherical cylinder body with a hot propulsive jet are conducted to verify the capabilities of the numerical scheme.

An efficient shock-capturing scheme for simulating compressible homogeneous mixture flow

International Nuclear Information System (INIS)

Dang, Son Tung; Ha, Cong Tu; Park, Warn Gyu; Jung, Chul Min

2016-01-01

This work is devoted to the development of a procedure for the numerical solution of Navier-Stokes equations for cavitating flows with and without ventilation based on a compressible, multiphase, homogeneous mixture model. The governing equations are discretized on a general structured grid using a high-resolution shock-capturing scheme in conjunction with appropriate limiters to prevent the generation of spurious solutions near shock waves or discontinuities. Two well-known limiters are examined, and a new limiter is proposed to enhance the accuracy and stability of the numerical scheme. A sensitivity analysis is first conducted to determine the relative influences of various model parameters on the solution. These parameters are adopted for the computation of water flows over a hemispherical body, conical body and a divergent/convergent nozzle. Finally, numerical calculations of ventilated supercavitating flows over a hemispherical cylinder body with a hot propulsive jet are conducted to verify the capabilities of the numerical scheme

Fourier two-level analysis for discontinuous Galerkin discretization with linear elements

NARCIS (Netherlands)

P.W. Hemker (Piet); W. Hoffmann; M.H. van Raalte (Marc)

2002-01-01

textabstractIn this paper we study the convergence of a multigrid method for the solution of a linear second order elliptic equation, discretized by discontinuous Galerkin (DG) methods, and we give a detailed analysis of the convergence fordifferent block-relaxation strategies. In addition to an

Low-storage implicit/explicit Runge-Kutta schemes for the simulation of stiff high-dimensional ODE systems

Science.gov (United States)

Cavaglieri, Daniele; Bewley, Thomas

2015-04-01

Implicit/explicit (IMEX) Runge-Kutta (RK) schemes are effective for time-marching ODE systems with both stiff and nonstiff terms on the RHS; such schemes implement an (often A-stable or better) implicit RK scheme for the stiff part of the ODE, which is often linear, and, simultaneously, a (more convenient) explicit RK scheme for the nonstiff part of the ODE, which is often nonlinear. Low-storage RK schemes are especially effective for time-marching high-dimensional ODE discretizations of PDE systems on modern (cache-based) computational hardware, in which memory management is often the most significant computational bottleneck. In this paper, we develop and characterize eight new low-storage implicit/explicit RK schemes which have higher accuracy and better stability properties than the only low-storage implicit/explicit RK scheme available previously, the venerable second-order Crank-Nicolson/Runge-Kutta-Wray (CN/RKW3) algorithm that has dominated the DNS/LES literature for the last 25 years, while requiring similar storage (two, three, or four registers of length N) and comparable floating-point operations per timestep.

Economic sustainability, water security and multi-level governance of local water schemes in Nepal

Directory of Open Access Journals (Sweden)

Emma Hakala

2017-07-01

Full Text Available This article explores the role of multi-level governance and power structures in local water security through a case study of the Nawalparasi district in Nepal. It focuses on economic sustainability as a measure to address water security, placing this thematic in the context of a complicated power structure consisting of local, district and national administration as well as external development cooperation actors. The study aims to find out whether efforts to improve the economic sustainability of water schemes have contributed to water security at the local level. In addition, it will consider the interactions between water security, power structures and local equality and justice. The research builds upon survey data from the Nepalese districts of Nawalparasi and Palpa, and a case study based on interviews and observation in Nawalparasi. The survey was performed in water schemes built within a Finnish development cooperation programme spanning from 1990 to 2004, allowing a consideration of the long-term sustainability of water management projects. This adds a crucial external influence into the intra-state power structures shaping water management in Nepal. The article thus provides an alternative perspective to cross-regional water security through a discussion combining transnational involvement with national and local points of view.

Adaptive local refinement and multi-level methods for simulating multiphasic flows

International Nuclear Information System (INIS)

Minjeaud, Sebastian

2010-01-01

This thesis describes some numerical and mathematical aspects of incompressible multiphase flows simulations with a diffuse interface Cahn-Hilliard / Navier-Stokes model (interfaces have a small but a positive thickness). The space discretization is performed thanks to a Galerkin formulation and the finite elements method. The presence of different scales in the system (interfaces have a very small thickness compared to the characteristic lengths of the domain) suggests the use of a local adaptive refinement method. The algorithm that is introduced allows to implicitly handle the non-conformities of the generated meshes to produce conformal finite elements approximation spaces. It consists in refining basis functions instead of cells. The refinement of a basis function is made possible by the conceptual existence of a nested sequence of uniformly refined grids from which 'parent-child' relationships are deduced, linking the basis functions of two consecutive refinement levels. Moreover, it is shown how this method can be exploited to build multigrid pre-conditioners. From a composite finite elements approximation space, it is indeed possible to rebuild, by 'coarsening', a sequence of auxiliary nested spaces which allows to enter in the abstract multigrid framework. Concerning the time discretization, it begins with the study of the Cahn-Hilliard system. A semi-implicit scheme is proposed to remedy to convergence failures of the Newton method used to solve this (non linear) system. It guarantees the decrease of the discrete free energy ensuring the stability of the scheme. The existence and convergence of discrete solutions towards the weak solution of the system are shown. The study continues with providing an unconditionally stable time discretization of the complete Cahn-Hilliard / Navier-Stokes model. An important point is that this discretization does not strongly couple the Cahn-Hilliard and Navier-Stokes systems allowing to independently solve the two systems

A positive and entropy-satisfying finite volume scheme for the Baer–Nunziato model

Energy Technology Data Exchange (ETDEWEB)

Coquel, Frédéric, E-mail: frederic.coquel@cmap.polytechnique.fr [CMAP, École Polytechnique CNRS, UMR 7641, Route de Saclay, F-91128 Palaiseau cedex (France); Hérard, Jean-Marc, E-mail: jean-marc.herard@edf.fr [EDF-R& D, Département MFEE, 6 Quai Watier, F-78401 Chatou Cedex (France); Saleh, Khaled, E-mail: saleh@math.univ-lyon1.fr [Université de Lyon, CNRS UMR 5208, Université Lyon 1, Institut Camille Jordan, 43 bd 11 novembre 1918, F-69622 Villeurbanne cedex (France)

2017-02-01

We present a relaxation scheme for approximating the entropy dissipating weak solutions of the Baer–Nunziato two-phase flow model. This relaxation scheme is straightforwardly obtained as an extension of the relaxation scheme designed in for the isentropic Baer–Nunziato model and consequently inherits its main properties. To our knowledge, this is the only existing scheme for which the approximated phase fractions, phase densities and phase internal energies are proven to remain positive without any restrictive condition other than a classical fully computable CFL condition. For ideal gas and stiffened gas equations of state, real values of the phasic speeds of sound are also proven to be maintained by the numerical scheme. It is also the only scheme for which a discrete entropy inequality is proven, under a CFL condition derived from the natural sub-characteristic condition associated with the relaxation approximation. This last property, which ensures the non-linear stability of the numerical method, is satisfied for any admissible equation of state. We provide a numerical study for the convergence of the approximate solutions towards some exact Riemann solutions. The numerical simulations show that the relaxation scheme compares well with two of the most popular existing schemes available for the Baer–Nunziato model, namely Schwendeman–Wahle–Kapila's Godunov-type scheme and Tokareva–Toro's HLLC scheme . The relaxation scheme also shows a higher precision and a lower computational cost (for comparable accuracy) than a standard numerical scheme used in the nuclear industry, namely Rusanov's scheme. Finally, we assess the good behavior of the scheme when approximating vanishing phase solutions.

Discrete tomography in neutron radiography

International Nuclear Information System (INIS)

Kuba, Attila; Rodek, Lajos; Kiss, Zoltan; Rusko, Laszlo; Nagy, Antal; Balasko, Marton

2005-01-01

Discrete tomography (DT) is an imaging technique for reconstructing discrete images from their projections using the knowledge that the object to be reconstructed contains only a few homogeneous materials characterized by known discrete absorption values. One of the main reasons for applying DT is that we will hopefully require relatively few projections. Using discreteness and some a priori information (such as an approximate shape of the object) we can apply two DT methods in neutron imaging by reducing the problem to an optimization task. The first method is a special one because it is only suitable if the object is composed of cylinders and sphere shapes. The second method is a general one in the sense that it can be used for reconstructing objects of any shape. Software was developed and physical experiments performed in order to investigate the effects of several reconstruction parameters: the number of projections, noise levels, and complexity of the object to be reconstructed. We give a summary of the experimental results and make a comparison of the results obtained using a classical reconstruction technique (FBP). The programs we developed are available in our DT reconstruction program package DIRECT

Monotone methods for solving a boundary value problem of second order discrete system

Directory of Open Access Journals (Sweden)

Wang Yuan-Ming

1999-01-01

Full Text Available A new concept of a pair of upper and lower solutions is introduced for a boundary value problem of second order discrete system. A comparison result is given. An existence theorem for a solution is established in terms of upper and lower solutions. A monotone iterative scheme is proposed, and the monotone convergence rate of the iteration is compared and analyzed. The numerical results are given.

Relaxation approximations to second-order traffic flow models by high-resolution schemes

International Nuclear Information System (INIS)

Nikolos, I.K.; Delis, A.I.; Papageorgiou, M.

2015-01-01

A relaxation-type approximation of second-order non-equilibrium traffic models, written in conservation or balance law form, is considered. Using the relaxation approximation, the nonlinear equations are transformed to a semi-linear diagonilizable problem with linear characteristic variables and stiff source terms with the attractive feature that neither Riemann solvers nor characteristic decompositions are in need. In particular, it is only necessary to provide the flux and source term functions and an estimate of the characteristic speeds. To discretize the resulting relaxation system, high-resolution reconstructions in space are considered. Emphasis is given on a fifth-order WENO scheme and its performance. The computations reported demonstrate the simplicity and versatility of relaxation schemes as numerical solvers

Positivity-preserving dual time stepping schemes for gas dynamics

Science.gov (United States)

Parent, Bernard

2018-05-01

A new approach at discretizing the temporal derivative of the Euler equations is here presented which can be used with dual time stepping. The temporal discretization stencil is derived along the lines of the Cauchy-Kowalevski procedure resulting in cross differences in spacetime but with some novel modifications which ensure the positivity of the discretization coefficients. It is then shown that the so-obtained spacetime cross differences result in changes to the wave speeds and can thus be incorporated within Roe or Steger-Warming schemes (with and without reconstruction-evolution) simply by altering the eigenvalues. The proposed approach is advantaged over alternatives in that it is positivity-preserving for the Euler equations. Further, it yields monotone solutions near discontinuities while exhibiting a truncation error in smooth regions less than the one of the second- or third-order accurate backward-difference-formula (BDF) for either small or large time steps. The high resolution and positivity preservation of the proposed discretization stencils are independent of the convergence acceleration technique which can be set to multigrid, preconditioning, Jacobian-free Newton-Krylov, block-implicit, etc. Thus, the current paper also offers the first implicit integration of the time-accurate Euler equations that is positivity-preserving in the strict sense (that is, the density and temperature are guaranteed to remain positive). This is in contrast to all previous positivity-preserving implicit methods which only guaranteed the positivity of the density, not of the temperature or pressure. Several stringent reacting and inert test cases confirm the positivity-preserving property of the proposed method as well as its higher resolution and higher computational efficiency over other second-order and third-order implicit temporal discretization strategies.

Exploring the Use of Discrete Gestures for Authentication

Science.gov (United States)

Chong, Ming Ki; Marsden, Gary

Research in user authentication has been a growing field in HCI. Previous studies have shown that peoples’ graphical memory can be used to increase password memorability. On the other hand, with the increasing number of devices with built-in motion sensors, kinesthetic memory (or muscle memory) can also be exploited for authentication. This paper presents a novel knowledge-based authentication scheme, called gesture password, which uses discrete gestures as password elements. The research presents a study of multiple password retention using PINs and gesture passwords. The study reports that although participants could use kinesthetic memory to remember gesture passwords, retention of PINs is far superior to retention of gesture passwords.