International Nuclear Information System (INIS)
Ribeiro, R.D.M.; Vellozo, S.O.; Botelho, D.A.
1983-01-01
The EPON computer code based in a Nodal Polynomial Expansion Method, wrote in Fortran IV, for steady-state, square geometry, one-dimensional or two-dimensional geometry and for one or two-energy group is presented. The neutron and power flux distributions for nuclear power plants were calculated, comparing with codes that use similar or different methodologies. The availability, economy and speed of the methodology is demonstrated. (E.G.) [pt
Higher order polynomial expansion nodal method for hexagonal core neutronics analysis
International Nuclear Information System (INIS)
Jin, Young Cho; Chang, Hyo Kim
1998-01-01
A higher-order polynomial expansion nodal(PEN) method is newly formulated as a means to improve the accuracy of the conventional PEN method solutions to multi-group diffusion equations in hexagonal core geometry. The new method is applied to solving various hexagonal core neutronics benchmark problems. The computational accuracy of the higher order PEN method is then compared with that of the conventional PEN method, the analytic function expansion nodal (AFEN) method, and the ANC-H method. It is demonstrated that the higher order PEN method improves the accuracy of the conventional PEN method and that it compares very well with the other nodal methods like the AFEN and ANC-H methods in accuracy
Non-linear triangle-based polynomial expansion nodal method for hexagonal core analysis
International Nuclear Information System (INIS)
Cho, Jin Young; Cho, Byung Oh; Joo, Han Gyu; Zee, Sung Qunn; Park, Sang Yong
2000-09-01
This report is for the implementation of triangle-based polynomial expansion nodal (TPEN) method to MASTER code in conjunction with the coarse mesh finite difference(CMFD) framework for hexagonal core design and analysis. The TPEN method is a variation of the higher order polynomial expansion nodal (HOPEN) method that solves the multi-group neutron diffusion equation in the hexagonal-z geometry. In contrast with the HOPEN method, only two-dimensional intranodal expansion is considered in the TPEN method for a triangular domain. The axial dependence of the intranodal flux is incorporated separately here and it is determined by the nodal expansion method (NEM) for a hexagonal node. For the consistency of node geometry of the MASTER code which is based on hexagon, TPEN solver is coded to solve one hexagonal node which is composed of 6 triangular nodes directly with Gauss elimination scheme. To solve the CMFD linear system efficiently, stabilized bi-conjugate gradient(BiCG) algorithm and Wielandt eigenvalue shift method are adopted. And for the construction of the efficient preconditioner of BiCG algorithm, the incomplete LU(ILU) factorization scheme which has been widely used in two-dimensional problems is used. To apply the ILU factorization scheme to three-dimensional problem, a symmetric Gauss-Seidel Factorization scheme is used. In order to examine the accuracy of the TPEN solution, several eigenvalue benchmark problems and two transient problems, i.e., a realistic VVER1000 and VVER440 rod ejection benchmark problems, were solved and compared with respective references. The results of eigenvalue benchmark problems indicate that non-linear TPEN method is very accurate showing less than 15 pcm of eigenvalue errors and 1% of maximum power errors, and fast enough to solve the three-dimensional VVER-440 problem within 5 seconds on 733MHz PENTIUM-III. In the case of the transient problems, the non-linear TPEN method also shows good results within a few minute of
The Nodal Polynomial Expansion method to solve the multigroup diffusion equations
International Nuclear Information System (INIS)
Ribeiro, R.D.M.
1983-03-01
The methodology of the solutions of the multigroup diffusion equations and uses the Nodal Polynomial Expansion Method is covered. The EPON code was developed based upon the above mentioned method for stationary state, rectangular geometry, one-dimensional or two-dimensional and for one or two energy groups. Then, one can study some effects such as the influence of the baffle on the thermal flux by calculating the flux and power distribution in nuclear reactors. Furthermore, a comparative study with other programs which use Finite Difference (CITATION and PDQ5) and Finite Element (CHD and FEMB) Methods was undertaken. As a result, the coherence, feasibility, speed and accuracy of the methodology used were demonstrated. (Author) [pt
Need for higher order polynomial basis for polynomial nodal methods employed in LWR calculations
International Nuclear Information System (INIS)
Taiwo, T.A.; Palmiotti, G.
1997-01-01
The paper evaluates the accuracy and efficiency of sixth order polynomial solutions and the use of one radial node per core assembly for pressurized water reactor (PWR) core power distributions and reactivities. The computer code VARIANT was modified to calculate sixth order polynomial solutions for a hot zero power benchmark problem in which a control assembly along a core axis is assumed to be out of the core. Results are presented for the VARIANT, DIF3D-NODAL, and DIF3D-finite difference codes. The VARIANT results indicate that second order expansion of the within-node source and linear representation of the node surface currents are adequate for this problem. The results also demonstrate the improvement in the VARIANT solution when the order of the polynomial expansion of the within-node flux is increased from fourth to sixth order. There is a substantial saving in computational time for using one radial node per assembly with the sixth order expansion compared to using four or more nodes per assembly and fourth order polynomial solutions. 11 refs., 1 tab
Development of a polynomial nodal model to the multigroup transport equation in one dimension
International Nuclear Information System (INIS)
Feiz, M.
1986-01-01
A polynomial nodal model that uses Legendre polynomial expansions was developed for the multigroup transport equation in one dimension. The development depends upon the least-squares minimization of the residuals using the approximate functions over the node. Analytical expressions were developed for the polynomial coefficients. The odd moments of the angular neutron flux over the half ranges were used at the internal interfaces, and the Marshak boundary condition was used at the external boundaries. Sample problems with fine-mesh finite-difference solutions of the diffusion and transport equations were used for comparison with the model
International Nuclear Information System (INIS)
Chung, S.K.; Hah, C.J.; Lee, H.C.; Kim, Y.H.; Cho, N.Z.
1996-01-01
Modern nodal methods usually employs the transverse integration technique in order to reduce a multi-dimensional diffusion equation to one-dimensional diffusion equations. The use of the transverse integration technique requires two major approximations such as a transverse leakage approximation and a one-dimensional flux approximation. Both the transverse leakage and the one-dimensional flux are approximated by polynomials. ANC (Advanced Nodal Code) developed by Westinghouse employs a modern nodal expansion method for the flux calculation, the equivalence theory for the homogenization error reduction and a group theory for pin power recovery. Unlike the conventional modern nodal methods, AFEN (Analytic Function Expansion Nodal) method expands homogeneous flux distributions within a node into non-separable analytic basis functions, which eliminate two major approximations of the modern nodal methods. A comparison study of AFEN with ANC has been performed to see the applicability of AFEN to commercial PWR and different types of reactors such as MOX fueled reactor. The qualification comparison results demonstrate that AFEN methodology is accurate enough to apply for commercial PWR analysis. The results show that AFEN provides very accurate results (core multiplication factor and assembly power distribution) for cores that exhibit strong flux gradients as in a MOX loaded core. (author)
Using nodal expansion method in calculation of reactor core with square fuel assemblies
International Nuclear Information System (INIS)
Abdollahzadeh, M. Y.; Boroushaki, M.
2009-01-01
A polynomial nodal method is developed to solve few-group neutron diffusion equations in cartesian geometry. In this article, the effective multiplication factor, group flux and power distribution based on the nodal polynomial expansion procedure is presented. In addition, by comparison of the results the superiority of nodal expansion method on finite-difference and finite-element are fully demonstrated. The comparison of the results obtained by these method with those of the well known benchmark problems have shown that they are in very good agreement.
Analytic function expansion nodal method for nuclear reactor core design
International Nuclear Information System (INIS)
Noh, Hae Man
1995-02-01
In most advanced nodal methods the transverse integration is commonly used to reduce the multi-dimensional diffusion equation into equivalent one- dimensional diffusion equations when derving the nodal coupling equations. But the use of the transverse integration results in some limitations. The first limitation is that the transverse leakage term which appears in the transverse integration procedure must be appropriately approximated. The second limitation is that the one-dimensional flux shapes in each spatial direction resulted from the nodal calculation are not accurate enough to be directly used in reconstructing the pinwise flux distributions. Finally the transverse leakage defined for a non-rectangular node such as a hexagonal node or a triangular node is too complicated to be easily handled and may contain non-physical singular terms of step-function and delta-function types. In this thesis, the Analytic Function Expansion Nodal (AFEN) method and its two variations : the Polynomial Expansion Nodal (PEN) method and the hybrid of the AFEN and PEN methods, have been developed to overcome the limitations of the transverse integration procedure. All of the methods solve the multidimensional diffusion equation without the transverse integration. The AFEN method which we believe is the major contribution of this study to the reactor core analysis expands the homogeneous flux distributions within a node in non-separable analytic basis functions satisfying the neutron diffusion equations at any point of the node and expresses the coefficients of the flux expansion in terms of the nodal unknowns which comprise a node-average flux, node-interface fluxes, and corner-point fluxes. Then, the nodal coupling equations composed of the neutron balance equations, the interface current continuity equations, and the corner-point leakage balance equations are solved iteratively to determine all the nodal unknowns. Since the AFEN method does not use the transverse integration in
Temporal quadratic expansion nodal Green's function method
International Nuclear Information System (INIS)
Liu Cong; Jing Xingqing; Xu Xiaolin
2000-01-01
A new approach is presented to efficiently solve the three-dimensional space-time reactor dynamics equation which overcomes the disadvantages of current methods. In the Temporal Quadratic Expansion Nodal Green's Function Method (TQE/NGFM), the Quadratic Expansion Method (QEM) is used for the temporal solution with the Nodal Green's Function Method (NGFM) employed for the spatial solution. Test calculational results using TQE/NGFM show that its time step size can be 5-20 times larger than that of the Fully Implicit Method (FIM) for similar precision. Additionally, the spatial mesh size with NGFM can be nearly 20 times larger than that using the finite difference method. So, TQE/NGFM is proved to be an efficient reactor dynamics analysis method
A nonlinear analytic function expansion nodal method for transient calculations
Energy Technology Data Exchange (ETDEWEB)
Joo, Han Gyn; Park, Sang Yoon; Cho, Byung Oh; Zee, Sung Quun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1998-12-31
The nonlinear analytic function expansion nodal (AFEN) method is applied to the solution of the time-dependent neutron diffusion equation. Since the AFEN method requires both the particular solution and the homogeneous solution to the transient fixed source problem, the derivation of the solution method is focused on finding the particular solution efficiently. To avoid complicated particular solutions, the source distribution is approximated by quadratic polynomials and the transient source is constructed such that the error due to the quadratic approximation is minimized, In addition, this paper presents a new two-node solution scheme that is derived by imposing the constraint of current continuity at the interface corner points. The method is verified through a series of application to the NEACRP PWR rod ejection benchmark problems. 6 refs., 2 figs., 1 tab. (Author)
A nonlinear analytic function expansion nodal method for transient calculations
Energy Technology Data Exchange (ETDEWEB)
Joo, Han Gyn; Park, Sang Yoon; Cho, Byung Oh; Zee, Sung Quun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1999-12-31
The nonlinear analytic function expansion nodal (AFEN) method is applied to the solution of the time-dependent neutron diffusion equation. Since the AFEN method requires both the particular solution and the homogeneous solution to the transient fixed source problem, the derivation of the solution method is focused on finding the particular solution efficiently. To avoid complicated particular solutions, the source distribution is approximated by quadratic polynomials and the transient source is constructed such that the error due to the quadratic approximation is minimized, In addition, this paper presents a new two-node solution scheme that is derived by imposing the constraint of current continuity at the interface corner points. The method is verified through a series of application to the NEACRP PWR rod ejection benchmark problems. 6 refs., 2 figs., 1 tab. (Author)
Three-dimensional static and dynamic reactor calculations by the nodal expansion method
International Nuclear Information System (INIS)
Christensen, B.
1985-05-01
This report reviews various method for the calculation of the neutron-flux- and power distribution in an nuclear reactor. The nodal expansion method (NEM) is especially described in much detail. The nodal expansion method solves the diffusion equation. In this method the reactor core is divided into nodes, typically 10 to 20 cm in each direction, and the average flux in each node is calculated. To obtain the coupling between the nodes the local flux inside each node is expressed by use of a polynomial expansion. The expansion is one-dimensional, so inside each node such three expansions occur. To calculate the expansion coefficients it is necessary that the polynomial expansion is a solution to the one-dimensional diffusion equation. When the one-dimensional diffusion equation is established a term with the transversal leakage occur, and this term is expanded after the same polynomials. The resulting equation system with the expansion coefficients as the unknowns is solved with weigthed residual technique. The nodal expansion method is built into a computer program (also called NEM), which is divided into two parts, one part for steady-state calculations and one part for dynamic calculations. It is possible to take advantage of symmetry properties of the reactor core. The program is very flexible with regard to the number of energy groups, the node size, the flux expansion order and the transverse leakage expansion order. The boundary of the core is described by albedos. The program and input to it are described. The program is tested on a number of examples extending from small theoretical one up to realistic reactor cores. Many calculations are done on the wellknown IAEA benchmark case. The calculations have tested the accuracy and the computing time for various node sizes and polynomial expansions. In the dynamic examples various strategies for variation of the time step-length have been tested. (author)
International Nuclear Information System (INIS)
Cho, J. Y.; Noh, J. M.; Cheong, H. K.; Choo, H. K.
1998-01-01
In order to simplify the previous spectral history effect correction based on the polynomial expansion nodal method, a new spectral history effect correction is proposed. The new spectral history correction eliminates four microscopic depletion points out of total 13 depletion points in the previous correction by approximating the group cross sections with exponential function. The neutron flux to homogenize the group cross sections for the correction of the spectral history effect is calculated by the analytic function expansion nodal method in stead of the conventional polynomial expansion nodal method. This spectral history correction model is verified against the three MOX benchmark cores: a checkerboard type, a small core with 25 fuel assemblies, and a large core with 177 fuel assemblies. The benchmark results prove that this new spectral history correction model is superior to the previous one even with the reduced number of the local microscopic depletion points
A nodal expansion method using conformal mapping for hexagonal geometry
International Nuclear Information System (INIS)
Chao, Y.A.; Shatilla, Y.A.
1993-01-01
Hexagonal nodal methods adopting the same transverse integration process used for square nodal methods face the subtle theoretical problem that this process leads to highly singular nonphysical terms in the diffusion equation. Lawrence, in developing the DIF3D-N code, tried to approximate the singular terms with relatively simple polynomials. In the HEX-NOD code, Wagner ignored the singularities to simplify the diffusion equation and introduced compensating terms in the nodal equations to restore the nodal balance relation. More recently developed hexagonal nodal codes, such as HEXPE-DITE and the hexagonal version of PANTHER, used methods similar to Wagner's. It will be shown that for light water reactor applications, these two different approximations significantly degraded the accuracy of the respective method as compared to the established square nodal methods. Alternatively, the method of conformal mapping was suggested to map a hexagon to a rectangle, with the unique feature of leaving the diffusion operator invariant, thereby fundamentally resolving the problems associated with transverse integration. This method is now implemented in the Westinghouse hexagonal nodal code ANC-H. In this paper we report on the results of comparing the three methods for a variety of problems via benchmarking against the fine-mesh finite difference code
A quasi-static polynomial nodal method for nuclear reactor analysis
International Nuclear Information System (INIS)
Gehin, J.C.
1992-09-01
Modern nodal methods are currently available which can accurately and efficiently solve the static and transient neutron diffusion equations. Most of the methods, however, are limited to two energy groups for practical application. The objective of this research is the development of a static and transient, multidimensional nodal method which allows more than two energy groups and uses a non-linear iterative method for efficient solution of the nodal equations. For both the static and transient methods, finite-difference equations which are corrected by the use of discontinuity factors are derived. The discontinuity factors are computed from a polynomial nodal method using a non-linear iteration technique. The polynomial nodal method is based upon a quartic approximation and utilizes a quadratic transverse-leakage approximation. The solution of the time-dependent equations is performed by the use of a quasi-static method in which the node-averaged fluxes are factored into shape and amplitude functions. The application of the quasi-static polynomial method to several benchmark problems demonstrates that the accuracy is consistent with that of other nodal methods. The use of the quasi-static method is shown to substantially reduce the computation time over the traditional fully-implicit time-integration method. Problems involving thermal-hydraulic feedback are accurately, and efficiently, solved by performing several reactivity/thermal-hydraulic updates per shape calculation
A quasi-static polynomial nodal method for nuclear reactor analysis
Energy Technology Data Exchange (ETDEWEB)
Gehin, Jess C. [Massachusetts Inst. of Tech., Cambridge, MA (United States)
1992-09-01
Modern nodal methods are currently available which can accurately and efficiently solve the static and transient neutron diffusion equations. Most of the methods, however, are limited to two energy groups for practical application. The objective of this research is the development of a static and transient, multidimensional nodal method which allows more than two energy groups and uses a non-linear iterative method for efficient solution of the nodal equations. For both the static and transient methods, finite-difference equations which are corrected by the use of discontinuity factors are derived. The discontinuity factors are computed from a polynomial nodal method using a non-linear iteration technique. The polynomial nodal method is based upon a quartic approximation and utilizes a quadratic transverse-leakage approximation. The solution of the time-dependent equations is performed by the use of a quasi-static method in which the node-averaged fluxes are factored into shape and amplitude functions. The application of the quasi-static polynomial method to several benchmark problems demonstrates that the accuracy is consistent with that of other nodal methods. The use of the quasi-static method is shown to substantially reduce the computation time over the traditional fully-implicit time-integration method. Problems involving thermal-hydraulic feedback are accurately, and efficiently, solved by performing several reactivity/thermal-hydraulic updates per shape calculation.
A summation procedure for expansions in orthogonal polynomials
International Nuclear Information System (INIS)
Garibotti, C.R.; Grinstein, F.F.
1977-01-01
Approximants to functions defined by formal series expansions in orthogonal polynomials are introduced. They are shown to be convergent even out of the elliptical domain where the original expansion converges
NUMERICAL SOLUTION OF SINGULAR INVERSE NODAL PROBLEM BY USING CHEBYSHEV POLYNOMIALS
NEAMATY, ABDOLALI; YILMAZ, EMRAH; AKBARPOOR, SHAHRBANOO; DABBAGHIAN, ABDOLHADI
2017-01-01
In this study, we consider Sturm-Liouville problem in two cases: the first case having no singularity and the second case having a singularity at zero. Then, we calculate the eigenvalues and the nodal points and present the uniqueness theorem for the solution of the inverse problem by using a dense subset of the nodal points in two given cases. Also, we use Chebyshev polynomials of the first kind for calculating the approximate solution of the inverse nodal problem in these cases. Finally, we...
Global sensitivity analysis using polynomial chaos expansions
International Nuclear Information System (INIS)
Sudret, Bruno
2008-01-01
Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices
Global sensitivity analysis using polynomial chaos expansions
Energy Technology Data Exchange (ETDEWEB)
Sudret, Bruno [Electricite de France, R and D Division, Site des Renardieres, F 77818 Moret-sur-Loing Cedex (France)], E-mail: bruno.sudret@edf.fr
2008-07-15
Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices.
A new diffusion nodal method based on analytic basis function expansion
International Nuclear Information System (INIS)
Noh, J.M.; Cho, N.Z.
1993-01-01
The transverse integration procedure commonly used in most advanced nodal methods results in some limitations. The first is that the transverse leakage term that appears in the transverse integration procedure must be appropriately approximated. In most advanced nodal methods, this term is expanded in a quadratic polynomial. The second arises when reconstructing the pinwise flux distribution within a node. The available one-dimensional flux shapes from nodal calculation in each spatial direction cannot be used directly in the flux reconstruction. Finally, the transverse leakage defined for a hexagonal node becomes so complicated as not to be easily handled and contains nonphysical singular terms. In this paper, a new nodal method called the analytic function expansion nodal (AFEN) method is described for both the rectangular geometry and the hexagonal geometry in order to overcome these limitations. This method does not solve the transverse-integrated one-dimensional diffusion equations but instead solves directly the original multidimensional diffusion equation within a node. This is a accomplished by expanding the solution (or the intranodal homogeneous flux distribution) in terms of nonseparable analytic basis functions satisfying the diffusion equation at any point in the node
A two-dimensional, semi-analytic expansion method for nodal calculations
International Nuclear Information System (INIS)
Palmtag, S.P.
1995-08-01
Most modern nodal methods used today are based upon the transverse integration procedure in which the multi-dimensional flux shape is integrated over the transverse directions in order to produce a set of coupled one-dimensional flux shapes. The one-dimensional flux shapes are then solved either analytically or by representing the flux shape by a finite polynomial expansion. While these methods have been verified for most light-water reactor applications, they have been found to have difficulty predicting the large thermal flux gradients near the interfaces of highly-enriched MOX fuel assemblies. A new method is presented here in which the neutron flux is represented by a non-seperable, two-dimensional, semi-analytic flux expansion. The main features of this method are (1) the leakage terms from the node are modeled explicitly and therefore, the transverse integration procedure is not used, (2) the corner point flux values for each node are directly edited from the solution method, and a corner-point interpolation is not needed in the flux reconstruction, (3) the thermal flux expansion contains hyperbolic terms representing analytic solutions to the thermal flux diffusion equation, and (4) the thermal flux expansion contains a thermal to fast flux ratio term which reduces the number of polynomial expansion functions needed to represent the thermal flux. This new nodal method has been incorporated into the computer code COLOR2G and has been used to solve a two-dimensional, two-group colorset problem containing uranium and highly-enriched MOX fuel assemblies. The results from this calculation are compared to the results found using a code based on the traditional transverse integration procedure
An alternative solver for the nodal expansion method equations - 106
International Nuclear Information System (INIS)
Carvalho da Silva, F.; Carlos Marques Alvim, A.; Senra Martinez, A.
2010-01-01
An automated procedure for nuclear reactor core design is accomplished by using a quick and accurate 3D nodal code, aiming at solving the diffusion equation, which describes the spatial neutron distribution in the reactor. This paper deals with an alternative solver for nodal expansion method (NEM), with only two inner iterations (mesh sweeps) per outer iteration, thus having the potential to reduce the time required to calculate the power distribution in nuclear reactors, but with accuracy similar to the ones found in conventional NEM. The proposed solver was implemented into a computational system which, besides solving the diffusion equation, also solves the burnup equations governing the gradual changes in material compositions of the core due to fuel depletion. Results confirm the effectiveness of the method for practical purposes. (authors)
Szegö Kernels and Asymptotic Expansions for Legendre Polynomials
Directory of Open Access Journals (Sweden)
Roberto Paoletti
2017-01-01
Full Text Available We present a geometric approach to the asymptotics of the Legendre polynomials Pk,n+1, based on the Szegö kernel of the Fermat quadric hypersurface, leading to complete asymptotic expansions holding on expanding subintervals of [-1,1].
Polynomial chaos expansion with random and fuzzy variables
Jacquelin, E.; Friswell, M. I.; Adhikari, S.; Dessombz, O.; Sinou, J.-J.
2016-06-01
A dynamical uncertain system is studied in this paper. Two kinds of uncertainties are addressed, where the uncertain parameters are described through random variables and/or fuzzy variables. A general framework is proposed to deal with both kinds of uncertainty using a polynomial chaos expansion (PCE). It is shown that fuzzy variables may be expanded in terms of polynomial chaos when Legendre polynomials are used. The components of the PCE are a solution of an equation that does not depend on the nature of uncertainty. Once this equation is solved, the post-processing of the data gives the moments of the random response when the uncertainties are random or gives the response interval when the variables are fuzzy. With the PCE approach, it is also possible to deal with mixed uncertainty, when some parameters are random and others are fuzzy. The results provide a fuzzy description of the response statistical moments.
Global Monte Carlo Simulation with High Order Polynomial Expansions
International Nuclear Information System (INIS)
William R. Martin; James Paul Holloway; Kaushik Banerjee; Jesse Cheatham; Jeremy Conlin
2007-01-01
The functional expansion technique (FET) was recently developed for Monte Carlo simulation. The basic idea of the FET is to expand a Monte Carlo tally in terms of a high order expansion, the coefficients of which can be estimated via the usual random walk process in a conventional Monte Carlo code. If the expansion basis is chosen carefully, the lowest order coefficient is simply the conventional histogram tally, corresponding to a flat mode. This research project studied the applicability of using the FET to estimate the fission source, from which fission sites can be sampled for the next generation. The idea is that individual fission sites contribute to expansion modes that may span the geometry being considered, possibly increasing the communication across a loosely coupled system and thereby improving convergence over the conventional fission bank approach used in most production Monte Carlo codes. The project examined a number of basis functions, including global Legendre polynomials as well as 'local' piecewise polynomials such as finite element hat functions and higher order versions. The global FET showed an improvement in convergence over the conventional fission bank approach. The local FET methods showed some advantages versus global polynomials in handling geometries with discontinuous material properties. The conventional finite element hat functions had the disadvantage that the expansion coefficients could not be estimated directly but had to be obtained by solving a linear system whose matrix elements were estimated. An alternative fission matrix-based response matrix algorithm was formulated. Studies were made of two alternative applications of the FET, one based on the kernel density estimator and one based on Arnoldi's method of minimized iterations. Preliminary results for both methods indicate improvements in fission source convergence. These developments indicate that the FET has promise for speeding up Monte Carlo fission source convergence
International Nuclear Information System (INIS)
Hong, Ser Gi; Lee, Deokjung
2015-01-01
A highly accurate S 4 eigenfunction-based nodal method has been developed to solve multi-group discrete ordinate neutral particle transport problems with a linearly anisotropic scattering in slab geometry. The new method solves the even-parity form of discrete ordinates transport equation with an arbitrary S N order angular quadrature using two sub-cell balance equations and the S 4 eigenfunctions of within-group transport equation. The four eigenfunctions from S 4 approximation have been chosen as basis functions for the spatial expansion of the angular flux in each mesh. The constant and cubic polynomial approximations are adopted for the scattering source terms from other energy groups and fission source. A nodal method using the conventional polynomial expansion and the sub-cell balances was also developed to be used for demonstrating the high accuracy of the new methods. Using the new methods, a multi-group eigenvalue problem has been solved as well as fixed source problems. The numerical test results of one-group problem show that the new method has third-order accuracy as mesh size is finely refined and it has much higher accuracies for large meshes than the diamond differencing method and the nodal method using sub-cell balances and polynomial expansion of angular flux. For multi-group problems including eigenvalue problem, it was demonstrated that the new method using the cubic polynomial approximation of the sources could produce very accurate solutions even with large mesh sizes. (author)
Development of nodal interface conditions for a PN approximation nodal model
International Nuclear Information System (INIS)
Feiz, M.
1993-01-01
A relation was developed for approximating higher order odd-moments from lower order odd-moments at the nodal interfaces of a Legendre polynomial nodal model. Two sample problems were tested using different order P N expansions in adjacent nodes. The developed relation proved to be adequate and matched the nodal interface flux accurately. The development allows the use of different order expansions in adjacent nodes, and will be used in a hybrid diffusion-transport nodal model. (author)
Polynomial Chaos Expansion Approach to Interest Rate Models
Directory of Open Access Journals (Sweden)
Luca Di Persio
2015-01-01
Full Text Available The Polynomial Chaos Expansion (PCE technique allows us to recover a finite second-order random variable exploiting suitable linear combinations of orthogonal polynomials which are functions of a given stochastic quantity ξ, hence acting as a kind of random basis. The PCE methodology has been developed as a mathematically rigorous Uncertainty Quantification (UQ method which aims at providing reliable numerical estimates for some uncertain physical quantities defining the dynamic of certain engineering models and their related simulations. In the present paper, we use the PCE approach in order to analyze some equity and interest rate models. In particular, we take into consideration those models which are based on, for example, the Geometric Brownian Motion, the Vasicek model, and the CIR model. We present theoretical as well as related concrete numerical approximation results considering, without loss of generality, the one-dimensional case. We also provide both an efficiency study and an accuracy study of our approach by comparing its outputs with the ones obtained adopting the Monte Carlo approach, both in its standard and its enhanced version.
Global Sensitivity Analysis for multivariate output using Polynomial Chaos Expansion
International Nuclear Information System (INIS)
Garcia-Cabrejo, Oscar; Valocchi, Albert
2014-01-01
Many mathematical and computational models used in engineering produce multivariate output that shows some degree of correlation. However, conventional approaches to Global Sensitivity Analysis (GSA) assume that the output variable is scalar. These approaches are applied on each output variable leading to a large number of sensitivity indices that shows a high degree of redundancy making the interpretation of the results difficult. Two approaches have been proposed for GSA in the case of multivariate output: output decomposition approach [9] and covariance decomposition approach [14] but they are computationally intensive for most practical problems. In this paper, Polynomial Chaos Expansion (PCE) is used for an efficient GSA with multivariate output. The results indicate that PCE allows efficient estimation of the covariance matrix and GSA on the coefficients in the approach defined by Campbell et al. [9], and the development of analytical expressions for the multivariate sensitivity indices defined by Gamboa et al. [14]. - Highlights: • PCE increases computational efficiency in 2 approaches of GSA of multivariate output. • Efficient estimation of covariance matrix of output from coefficients of PCE. • Efficient GSA on coefficients of orthogonal decomposition of the output using PCE. • Analytical expressions of multivariate sensitivity indices from coefficients of PCE
Computing derivative-based global sensitivity measures using polynomial chaos expansions
International Nuclear Information System (INIS)
Sudret, B.; Mai, C.V.
2015-01-01
In the field of computer experiments sensitivity analysis aims at quantifying the relative importance of each input parameter (or combinations thereof) of a computational model with respect to the model output uncertainty. Variance decomposition methods leading to the well-known Sobol' indices are recognized as accurate techniques, at a rather high computational cost though. The use of polynomial chaos expansions (PCE) to compute Sobol' indices has allowed to alleviate the computational burden though. However, when dealing with large dimensional input vectors, it is good practice to first use screening methods in order to discard unimportant variables. The derivative-based global sensitivity measures (DGSMs) have been developed recently in this respect. In this paper we show how polynomial chaos expansions may be used to compute analytically DGSMs as a mere post-processing. This requires the analytical derivation of derivatives of the orthonormal polynomials which enter PC expansions. Closed-form expressions for Hermite, Legendre and Laguerre polynomial expansions are given. The efficiency of the approach is illustrated on two well-known benchmark problems in sensitivity analysis. - Highlights: • Derivative-based global sensitivity measures (DGSM) have been developed for screening purpose. • Polynomial chaos expansions (PC) are used as a surrogate model of the original computational model. • From a PC expansion the DGSM can be computed analytically. • The paper provides the derivatives of Hermite, Legendre and Laguerre polynomials for this purpose
Energy Technology Data Exchange (ETDEWEB)
Konakli, Katerina, E-mail: konakli@ibk.baug.ethz.ch; Sudret, Bruno
2016-09-15
The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input
International Nuclear Information System (INIS)
Konakli, Katerina; Sudret, Bruno
2016-01-01
The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input
Asymptotics and Numerics of Polynomials Used in Tricomi and Buchholz Expansions of Kummer functions
J.L. López; N.M. Temme (Nico)
2010-01-01
textabstractExpansions in terms of Bessel functions are considered of the Kummer function ${}_1F_1(a;c,z)$ (or confluent hypergeometric function) as given by Tricomi and Buchholz. The coefficients of these expansions are polynomials in the parameters of the Kummer function and the asymptotic
Expansion of Sobolev functions in series in Laguerre polynomials
International Nuclear Information System (INIS)
Selyakov, K.I.
1985-01-01
The solution of the integral equation for the Sobolev functions is represented in the form of series in Laguerre polynomials. The coefficients of these series are simultaneously the coefficients of the power series for the Ambartsumyan-Chandrasekhar H functions. Infinite systems of linear algebraic equations with Toeplitz matrices are given for the coefficients of the series. Numerical results and approximate expressions are given for the case of isotropic scattering
International Nuclear Information System (INIS)
Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.
2013-01-01
Highlights: ► A new adaptive h-refinement approach has been developed for a class of nodal method. ► The resulting system of nodal equations is more amenable to efficient numerical solution. ► The benefit of the approach is reducing computational efforts relative to the uniform fine mesh modeling. ► Spatially adaptive approach greatly enhances the accuracy of the solution. - Abstract: The aim of this work is to develop a spatially adaptive coarse mesh strategy that progressively refines the nodes in appropriate regions of domain to solve the neutron balance equation by zeroth order nodal expansion method. A flux gradient based a posteriori estimation scheme has been utilized for checking the approximate solutions for various nodes. The relative surface net leakage of nodes has been considered as an assessment criterion. In this approach, the core module is called in by adaptive mesh generator to determine gradients of node surfaces flux to explore the possibility of node refinements in appropriate regions and directions of the problem. The benefit of the approach is reducing computational efforts relative to the uniform fine mesh modeling. For this purpose, a computer program ANRNE-2D, Adaptive Node Refinement Nodal Expansion, has been developed to solve neutron diffusion equation using average current nodal expansion method for 2D rectangular geometries. Implementing the adaptive algorithm confirms its superiority in enhancing the accuracy of the solution without using fine nodes throughout the domain and increasing the number of unknown solution. Some well-known benchmarks have been investigated and improvements are reported
The BWR core simulator COSIMA with 2 group nodal flux expansion and control rod history
International Nuclear Information System (INIS)
Hoejerup, C.F.
1989-08-01
The boiling water simulator NOTAM has been modified and improved in several aspects: - The ''1 1/2'' energy group TRILUX nodal flux solution method has been exchanged with a 2 group modal expansion method. - Control rod ''history'' has been introduced. - Precalculated instrument factors have been introduced. The paper describes these improvements, which were considered sufficiently large to justify a new name to the programme: COSIMA. (author)
Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies
International Nuclear Information System (INIS)
Hampton, Jerrad; Doostan, Alireza
2015-01-01
Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as coherence, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ℓ 1 -minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy
Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies
Hampton, Jerrad; Doostan, Alireza
2015-01-01
Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as coherence, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ℓ1-minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy.
International Nuclear Information System (INIS)
Doha, E H; Ahmed, H M
2004-01-01
A formula expressing explicitly the derivatives of Bessel polynomials of any degree and for any order in terms of the Bessel polynomials themselves is proved. Another explicit formula, which expresses the Bessel expansion coefficients of a general-order derivative of an infinitely differentiable function in terms of its original Bessel coefficients, is also given. A formula for the Bessel coefficients of the moments of one single Bessel polynomial of certain degree is proved. A formula for the Bessel coefficients of the moments of a general-order derivative of an infinitely differentiable function in terms of its Bessel coefficients is also obtained. Application of these formulae for solving ordinary differential equations with varying coefficients, by reducing them to recurrence relations in the expansion coefficients of the solution, is explained. An algebraic symbolic approach (using Mathematica) in order to build and solve recursively for the connection coefficients between Bessel-Bessel polynomials is described. An explicit formula for these coefficients between Jacobi and Bessel polynomials is given, of which the ultraspherical polynomial and its consequences are important special cases. Two analytical formulae for the connection coefficients between Laguerre-Bessel and Hermite-Bessel are also developed
A polynomial expansion method and its application in the coupled Zakharov-Kuznetsov equations
International Nuclear Information System (INIS)
Huang Wenhua
2006-01-01
A polynomial expansion method is presented to solve nonlinear evolution equations. Applying this method, the coupled Zakharov-Kuznetsov equations in fluid system are studied and many exact travelling wave solutions are obtained. These solutions include solitary wave solutions, periodic solutions and rational type solutions
International Nuclear Information System (INIS)
Takahashi, Akito; Yamamoto, Junji; Ebisuya, Mituo; Sumita, Kenji
1979-01-01
A new method for calculating the anisotropic neutron transport is proposed for the angular spectral analysis of D-T fusion reactor neutronics. The method is based on the transport equation with new type of anisotropic scattering kernels formulated by a single function I sub(i) (μ', μ) instead of polynomial expansion, for instance, Legendre polynomials. In the calculation of angular flux spectra by using scattering kernels with the Legendre polynomial expansion, we often observe the oscillation with negative flux. But in principle this oscillation disappears by this new method. In this work, we discussed anisotropic scattering kernels of the elastic scattering and the inelastic scatterings which excite discrete energy levels. The other scatterings were included in isotropic scattering kernels. An approximation method, with use of the first collision source written by the I sub(i) (μ', μ) function, was introduced to attenuate the ''oscillations'' when we are obliged to use the scattering kernels with the Legendre polynomial expansion. Calculated results with this approximation showed remarkable improvement for the analysis of the angular flux spectra in a slab system of lithium metal with the D-T neutron source. (author)
Data-driven uncertainty quantification using the arbitrary polynomial chaos expansion
International Nuclear Information System (INIS)
Oladyshkin, S.; Nowak, W.
2012-01-01
We discuss the arbitrary polynomial chaos (aPC), which has been subject of research in a few recent theoretical papers. Like all polynomial chaos expansion techniques, aPC approximates the dependence of simulation model output on model parameters by expansion in an orthogonal polynomial basis. The aPC generalizes chaos expansion techniques towards arbitrary distributions with arbitrary probability measures, which can be either discrete, continuous, or discretized continuous and can be specified either analytically (as probability density/cumulative distribution functions), numerically as histogram or as raw data sets. We show that the aPC at finite expansion order only demands the existence of a finite number of moments and does not require the complete knowledge or even existence of a probability density function. This avoids the necessity to assign parametric probability distributions that are not sufficiently supported by limited available data. Alternatively, it allows modellers to choose freely of technical constraints the shapes of their statistical assumptions. Our key idea is to align the complexity level and order of analysis with the reliability and detail level of statistical information on the input parameters. We provide conditions for existence and clarify the relation of the aPC to statistical moments of model parameters. We test the performance of the aPC with diverse statistical distributions and with raw data. In these exemplary test cases, we illustrate the convergence with increasing expansion order and, for the first time, with increasing reliability level of statistical input information. Our results indicate that the aPC shows an exponential convergence rate and converges faster than classical polynomial chaos expansion techniques.
Numerical divergence effects of equivalence theory in the nodal expansion method
International Nuclear Information System (INIS)
Zika, M.R.; Downar, T.J.
1993-01-01
Accurate solutions of the advanced nodal equations require the use of discontinuity factors (DFs) to account for the homogenization errors that are inherent in all coarse-mesh nodal methods. During the last several years, nodal equivalence theory (NET) has successfully been implemented for the Cartesian geometry and has received widespread acceptance in the light water reactor industry. The extension of NET to other reactor types has had limited success. Recent efforts to implement NET within the framework of the nodal expansion method have successfully been applied to the fast breeder reactor. However, attempts to apply the same methods to thermal reactors such as the Modular High-Temperature Gas Reactor (MHTGR) have led to numerical divergence problems that can be attributed directly to the magnitude of the DFs. In the work performed here, it was found that the numerical problems occur in the inner and upscatter iterations of the solution algorithm. These iterations use a Gauss-Seidel iterative technique that is always convergent for problems with unity DFs. However, for an MHTGR model that requires large DFs, both the inner and upscatter iterations were divergent. Initial investigations into methods for bounding the DFs have proven unsatisfactory as a means of remedying the convergence problems. Although the DFs could be bounded to yield a convergent solution, several cases were encountered where the resulting flux solution was less accurate than the solution without DFs. For the specific case of problems without upscattering, an alternate numerical method for the inner iteration, an LU decomposition, was identified and shown to be feasible
Sparse grid-based polynomial chaos expansion for aerodynamics of an airfoil with uncertainties
Directory of Open Access Journals (Sweden)
Xiaojing WU
2018-05-01
Full Text Available The uncertainties can generate fluctuations with aerodynamic characteristics. Uncertainty Quantification (UQ is applied to compute its impact on the aerodynamic characteristics. In addition, the contribution of each uncertainty to aerodynamic characteristics should be computed by uncertainty sensitivity analysis. Non-Intrusive Polynomial Chaos (NIPC has been successfully applied to uncertainty quantification and uncertainty sensitivity analysis. However, the non-intrusive polynomial chaos method becomes inefficient as the number of random variables adopted to describe uncertainties increases. This deficiency becomes significant in stochastic aerodynamic analysis considering the geometric uncertainty because the description of geometric uncertainty generally needs many parameters. To solve the deficiency, a Sparse Grid-based Polynomial Chaos (SGPC expansion is used to do uncertainty quantification and sensitivity analysis for stochastic aerodynamic analysis considering geometric and operational uncertainties. It is proved that the method is more efficient than non-intrusive polynomial chaos and Monte Carlo Simulation (MSC method for the stochastic aerodynamic analysis. By uncertainty quantification, it can be learnt that the flow characteristics of shock wave and boundary layer separation are sensitive to the geometric uncertainty in transonic region. The uncertainty sensitivity analysis reveals the individual and coupled effects among the uncertainty parameters. Keywords: Non-intrusive polynomial chaos, Sparse grid, Stochastic aerodynamic analysis, Uncertainty sensitivity analysis, Uncertainty quantification
International Nuclear Information System (INIS)
Carpenter, K.H.
1976-11-01
A description is given of FORTRAN programs for transient eddy current calculations in thin, non-magnetic conductors using a perturbation-polynomial expansion technique. Basic equations are presented as well as flow charts for the programs implementing them. The implementation is in two steps--a batch program to produce an intermediate data file and interactive programs to produce graphical output. FORTRAN source listings are included for all program elements, and sample inputs and outputs are given for the major programs
Directory of Open Access Journals (Sweden)
Wang Mingjie
2017-01-01
Full Text Available A framework of non-intrusive polynomial chaos expansion method (PC was proposed to investigate the statistic characteristics of the response of structural-acoustic system containing random uncertainty. The PC method does not need to reformulate model equations, and the statistics of the response can be evaluated directly. The results show that compared to the direct Monte Carlo method (MCM based on the original numerical model, the PC method is effective and more efficient.
Dolgov, Sergey; Khoromskij, Boris N.; Litvinenko, Alexander; Matthies, Hermann G.
2015-01-01
We apply the tensor train (TT) decomposition to construct the tensor product polynomial chaos expansion (PCE) of a random field, to solve the stochastic elliptic diffusion PDE with the stochastic Galerkin discretization, and to compute some
Pellet by pellet neutron flux calculations coupled with nodal expansion method
International Nuclear Information System (INIS)
Aldo, Dall'Osso
2003-01-01
We present a technique whose aim is to replace 2-dimensional pin by pin de-homogenization, currently done in core reactor calculations with the nodal expansion method (NEM), by a 3-dimensional finite difference diffusion calculation. This fine calculation is performed as a zoom in each node taking as boundary conditions the results of the NEM calculations. The size of fine mesh is of the order of a fuel pellet. The coupling between fine and NEM calculations is realised by an albedo like boundary condition. Some examples are presented showing fine neutron flux shape near control rods or assembly grids. Other fine flux behaviour as the thermal flux rise in the fuel near the reflector is emphasised. In general the results show the interest of the method in conditions where the separability of radial and axial directions is not granted. (author)
Lattice Boltzmann method for bosons and fermions and the fourth-order Hermite polynomial expansion.
Coelho, Rodrigo C V; Ilha, Anderson; Doria, Mauro M; Pereira, R M; Aibe, Valter Yoshihiko
2014-04-01
The Boltzmann equation with the Bhatnagar-Gross-Krook collision operator is considered for the Bose-Einstein and Fermi-Dirac equilibrium distribution functions. We show that the expansion of the microscopic velocity in terms of Hermite polynomials must be carried to the fourth order to correctly describe the energy equation. The viscosity and thermal coefficients, previously obtained by Yang et al. [Shi and Yang, J. Comput. Phys. 227, 9389 (2008); Yang and Hung, Phys. Rev. E 79, 056708 (2009)] through the Uehling-Uhlenbeck approach, are also derived here. Thus the construction of a lattice Boltzmann method for the quantum fluid is possible provided that the Bose-Einstein and Fermi-Dirac equilibrium distribution functions are expanded to fourth order in the Hermite polynomials.
International Nuclear Information System (INIS)
Bogdanova, N.B.; Todorov, S.T.; Ososkov, G.A.
2015-01-01
Orthonormal polynomial expansion method (OPEM) is applied to the data obtained by the method of energy spectra to the liquid of the biomass of wheat in the case when herbicides are used. Since the biomass of a biological object contains liquid composed mainly of water, the method of water spectra is applicable to this case as well. For comparison, the similar data obtained from control sample consisting of wheat liquid without the application of herbicides are shown. The total variance OPEM is involved including errors in both dependent and independent variables. Special criteria are used for evaluating the optimal polynomial degree and the number of iterations. The presented numerical results show good agreement with the experimental data. The developed analysis frame is of interest for future analysis in theoretical ecology.
Analysis of the performance of a H-Darrieus rotor under uncertainty using Polynomial Chaos Expansion
International Nuclear Information System (INIS)
Daróczy, László; Janiga, Gábor; Thévenin, Dominique
2016-01-01
Due to the growing importance of wind energy, improving the efficiency of energy conversion is essential. Horizontal Axis Wind Turbines are the most well-spread, but H-Darrieus turbines are becoming popular as well due to their simple design and easier integration. Due to the high efficiency of existing wind turbines, further improvements require numerical optimization. One important aspect is to find a better configuration that is also robust, i.e., a configuration that retains its performance under uncertainties. For this purpose, forward uncertainty propagation has to be applied. In the present work, an Uncertainty Quantification (UQ) method, Polynomial Chaos Expansion, is applied to transient, turbulent flow simulations of a variable-speed H-Darrieus turbine, taking into account uncertainty in the preset pitch angle and in the angular velocity. The resulting uncertainty of the performance coefficient and of the quasi-periodic torque curve are quantified. In the presence of stall the instantaneous torque coefficients tend to show asymmetric distributions, meaning that error bars cannot be correctly reconstructed using only mean value and standard deviation. The expected performance was always found to be smaller than in computations without UQ techniques, corresponding to up to 10% of relative losses for λ = 2.5. - Highlights: • Uncertainty Quantification/Polynomial Chaos Expansion successfully applied to H-rotor. • Accounting simultaneously for uncertainty in pitch angle and angular velocity. • Performance coefficient decreases by up to 10% when accounting for uncertainty. • For low tip-speed-ratio, high-order polynomials are needed. • Polynomial order 4 is sufficient to reconstruct distribution at higher TSR.
Efficient linear precoding for massive MIMO systems using truncated polynomial expansion
Müller, Axel
2014-06-01
Massive multiple-input multiple-output (MIMO) techniques have been proposed as a solution to satisfy many requirements of next generation cellular systems. One downside of massive MIMO is the increased complexity of computing the precoding, especially since the relatively \\'antenna-efficient\\' regularized zero-forcing (RZF) is preferred to simple maximum ratio transmission. We develop in this paper a new class of precoders for single-cell massive MIMO systems. It is based on truncated polynomial expansion (TPE) and mimics the advantages of RZF, while offering reduced and scalable computational complexity that can be implemented in a convenient parallel fashion. Using random matrix theory we provide a closed-form expression of the signal-to-interference-and-noise ratio under TPE precoding and compare it to previous works on RZF. Furthermore, the sum rate maximizing polynomial coefficients in TPE precoding are calculated. By simulation, we find that to maintain a fixed peruser rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and signal-to-noise ratio. © 2014 IEEE.
Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
Energy Technology Data Exchange (ETDEWEB)
Huan, Xun; Safta, Cosmin; Sargsyan, Khachik; Vane, Zachary Phillips; Lacaze, Guilhem; Oefelein, Joseph C.; Najm, Habib N.
2017-07-01
Compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quanti cation analysis of expensive and high-dimensional physical models. We perform numerical investigations employing several com- pressive sensing solvers that target the unconstrained LASSO formulation, with a focus on linear systems that arise in the construction of polynomial chaos expansions. With core solvers of l1 ls, SpaRSA, CGIST, FPC AS, and ADMM, we develop techniques to mitigate over tting through an automated selection of regularization constant based on cross-validation, and a heuristic strategy to guide the stop-sampling decision. Practical recommendations on parameter settings for these tech- niques are provided and discussed. The overall method is applied to a series of numerical examples of increasing complexity, including large eddy simulations of supersonic turbulent jet-in-cross flow involving a 24-dimensional input. Through empirical phase-transition diagrams and convergence plots, we illustrate sparse recovery performance under structures induced by polynomial chaos, accuracy and computational tradeoffs between polynomial bases of different degrees, and practi- cability of conducting compressive sensing for a realistic, high-dimensional physical application. Across test cases studied in this paper, we find ADMM to have demonstrated empirical advantages through consistent lower errors and faster computational times.
Linear precoding based on polynomial expansion: reducing complexity in massive MIMO
Mueller, Axel
2016-02-29
Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, the computational precoding complexity grows with the system dimensions. For example, the close-to-optimal and relatively “antenna-efficient” regularized zero-forcing (RZF) precoding is very complicated to implement in practice, since it requires fast inversions of large matrices in every coherence period. Motivated by the high performance of RZF, we propose to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol. The degree of the matrix polynomial can be adapted to the available hardware resources and enables smooth transition between simple maximum ratio transmission and more advanced RZF. By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.
International Nuclear Information System (INIS)
Lee, Joo Hee
2006-02-01
There is growing interest in developing pebble bed reactors (PBRs) as a candidate of very high temperature gas-cooled reactors (VHTRs). Until now, most existing methods of nuclear design analysis for this type of reactors are base on old finite-difference solvers or on statistical methods. But for realistic analysis of PBRs, there is strong desire of making available high fidelity nodal codes in three-dimensional (r,θ,z) cylindrical geometry. Recently, the Analytic Function Expansion Nodal (AFEN) method developed quite extensively in Cartesian (x,y,z) geometry and in hexagonal-z geometry was extended to two-group (r,z) cylindrical geometry, and gave very accurate results. In this thesis, we develop a method for the full three-dimensional cylindrical (r,θ,z) geometry and implement the method into a code named TOPS. The AFEN methodology in this geometry as in hexagonal geometry is 'robus' (e.g., no occurrence of singularity), due to the unique feature of the AFEN method that it does not use the transverse integration. The transverse integration in the usual nodal methods, however, leads to an impasse, that is, failure of the azimuthal term to be transverse-integrated over r-z surface. We use 13 nodal unknowns in an outer node and 7 nodal unknowns in an innermost node. The general solution of the node can be expressed in terms of that nodal unknowns, and can be updated using the nodal balance equation and the current continuity condition. For more realistic analysis of PBRs, we implemented em Marshak boundary condition to treat the incoming current zero boundary condition and the partial current translation (PCT) method to treat voids in the core. The TOPS code was verified in the various numerical tests derived from Dodds problem and PBMR-400 benchmark problem. The results of the TOPS code show high accuracy and fast computing time than the VENTURE code that is based on finite difference method (FDM)
Energy Technology Data Exchange (ETDEWEB)
Zmijarevic, I; Tomashevic, Dj [Institut za Nuklearne Nauke Boris Kidric, Belgrade (Yugoslavia)
1988-07-01
This paper presents Chebychev acceleration of outer iterations of a nodal diffusion code of high accuracy. Extrapolation parameters, unique for all moments are calculated using the node integrated distribution of fission source. Sample calculations are presented indicating the efficiency of method. (author)
International Nuclear Information System (INIS)
Zhou, Xiafeng; Guo, Jiong; Li, Fu
2015-01-01
Highlights: • NEMs are innovatively applied to solve convection diffusion equation. • Stability, accuracy and numerical diffusion for NEM are analyzed for the first time. • Stability and numerical diffusion depend on the NEM expansion order and its parity. • NEMs have higher accuracy than both second order upwind and QUICK scheme. • NEMs with different expansion orders are integrated into a unified discrete form. - Abstract: The traditional finite difference method or finite volume method (FDM or FVM) is used for HTGR thermal-hydraulic calculation at present. However, both FDM and FVM require the fine mesh sizes to achieve the desired precision and thus result in a limited efficiency. Therefore, a more efficient and accurate numerical method needs to be developed. Nodal expansion method (NEM) can achieve high accuracy even on the coarse meshes in the reactor physics analysis so that the number of spatial meshes and computational cost can be largely decreased. Because of higher efficiency and accuracy, NEM can be innovatively applied to thermal-hydraulic calculation. In the paper, NEMs with different orders of basis functions are successfully developed and applied to multi-dimensional steady convection diffusion equation. Numerical results show that NEMs with three or higher order basis functions can track the reference solutions very well and are superior to second order upwind scheme and QUICK scheme. However, the false diffusion and unphysical oscillation behavior are discovered for NEMs. To explain the reasons for the above-mentioned behaviors, the stability, accuracy and numerical diffusion properties of NEM are analyzed by the Fourier analysis, and by comparing with exact solutions of difference and differential equation. The theoretical analysis results show that the accuracy of NEM increases with the expansion order. However, the stability and numerical diffusion properties depend not only on the order of basis functions but also on the parity of
Energy Technology Data Exchange (ETDEWEB)
Zhou, Xiafeng, E-mail: zhou-xf11@mails.tsinghua.edu.cn; Guo, Jiong, E-mail: guojiong12@tsinghua.edu.cn; Li, Fu, E-mail: lifu@tsinghua.edu.cn
2015-12-15
Highlights: • NEMs are innovatively applied to solve convection diffusion equation. • Stability, accuracy and numerical diffusion for NEM are analyzed for the first time. • Stability and numerical diffusion depend on the NEM expansion order and its parity. • NEMs have higher accuracy than both second order upwind and QUICK scheme. • NEMs with different expansion orders are integrated into a unified discrete form. - Abstract: The traditional finite difference method or finite volume method (FDM or FVM) is used for HTGR thermal-hydraulic calculation at present. However, both FDM and FVM require the fine mesh sizes to achieve the desired precision and thus result in a limited efficiency. Therefore, a more efficient and accurate numerical method needs to be developed. Nodal expansion method (NEM) can achieve high accuracy even on the coarse meshes in the reactor physics analysis so that the number of spatial meshes and computational cost can be largely decreased. Because of higher efficiency and accuracy, NEM can be innovatively applied to thermal-hydraulic calculation. In the paper, NEMs with different orders of basis functions are successfully developed and applied to multi-dimensional steady convection diffusion equation. Numerical results show that NEMs with three or higher order basis functions can track the reference solutions very well and are superior to second order upwind scheme and QUICK scheme. However, the false diffusion and unphysical oscillation behavior are discovered for NEMs. To explain the reasons for the above-mentioned behaviors, the stability, accuracy and numerical diffusion properties of NEM are analyzed by the Fourier analysis, and by comparing with exact solutions of difference and differential equation. The theoretical analysis results show that the accuracy of NEM increases with the expansion order. However, the stability and numerical diffusion properties depend not only on the order of basis functions but also on the parity of
A robust and efficient stepwise regression method for building sparse polynomial chaos expansions
Energy Technology Data Exchange (ETDEWEB)
Abraham, Simon, E-mail: Simon.Abraham@ulb.ac.be [Vrije Universiteit Brussel (VUB), Department of Mechanical Engineering, Research Group Fluid Mechanics and Thermodynamics, Pleinlaan 2, 1050 Brussels (Belgium); Raisee, Mehrdad [School of Mechanical Engineering, College of Engineering, University of Tehran, P.O. Box: 11155-4563, Tehran (Iran, Islamic Republic of); Ghorbaniasl, Ghader; Contino, Francesco; Lacor, Chris [Vrije Universiteit Brussel (VUB), Department of Mechanical Engineering, Research Group Fluid Mechanics and Thermodynamics, Pleinlaan 2, 1050 Brussels (Belgium)
2017-03-01
Polynomial Chaos (PC) expansions are widely used in various engineering fields for quantifying uncertainties arising from uncertain parameters. The computational cost of classical PC solution schemes is unaffordable as the number of deterministic simulations to be calculated grows dramatically with the number of stochastic dimension. This considerably restricts the practical use of PC at the industrial level. A common approach to address such problems is to make use of sparse PC expansions. This paper presents a non-intrusive regression-based method for building sparse PC expansions. The most important PC contributions are detected sequentially through an automatic search procedure. The variable selection criterion is based on efficient tools relevant to probabilistic method. Two benchmark analytical functions are used to validate the proposed algorithm. The computational efficiency of the method is then illustrated by a more realistic CFD application, consisting of the non-deterministic flow around a transonic airfoil subject to geometrical uncertainties. To assess the performance of the developed methodology, a detailed comparison is made with the well established LAR-based selection technique. The results show that the developed sparse regression technique is able to identify the most significant PC contributions describing the problem. Moreover, the most important stochastic features are captured at a reduced computational cost compared to the LAR method. The results also demonstrate the superior robustness of the method by repeating the analyses using random experimental designs.
Energy Technology Data Exchange (ETDEWEB)
Kromar, M; Trkov, A [Institut Jozef Stefan, Ljubljana (Yugoslavia); Pregl, G [Tehnishka Fakulteta Maribor Univ. (Yugoslavia)
1988-07-01
Nodal expansion method (NEM) is one of the advanced coarse-mesh methods based on integral form of few-group diffusion equation. NEM can be characterized by high accuracy and computational efficiency. Method was tested by development of computer code NEXT. Validation of the code was performed by calculation of 2-D and 3-D IAEA benchmark problem. NEXT was compared with codes based on other methods (finite differences, finite elements) and has been found to be accurate as well as fast. (author)
Uncertainty propagation of p-boxes using sparse polynomial chaos expansions
Energy Technology Data Exchange (ETDEWEB)
Schöbi, Roland, E-mail: schoebi@ibk.baug.ethz.ch; Sudret, Bruno, E-mail: sudret@ibk.baug.ethz.ch
2017-06-15
In modern engineering, physical processes are modelled and analysed using advanced computer simulations, such as finite element models. Furthermore, concepts of reliability analysis and robust design are becoming popular, hence, making efficient quantification and propagation of uncertainties an important aspect. In this context, a typical workflow includes the characterization of the uncertainty in the input variables. In this paper, input variables are modelled by probability-boxes (p-boxes), accounting for both aleatory and epistemic uncertainty. The propagation of p-boxes leads to p-boxes of the output of the computational model. A two-level meta-modelling approach is proposed using non-intrusive sparse polynomial chaos expansions to surrogate the exact computational model and, hence, to facilitate the uncertainty quantification analysis. The capabilities of the proposed approach are illustrated through applications using a benchmark analytical function and two realistic engineering problem settings. They show that the proposed two-level approach allows for an accurate estimation of the statistics of the response quantity of interest using a small number of evaluations of the exact computational model. This is crucial in cases where the computational costs are dominated by the runs of high-fidelity computational models.
Efficient computation of global sensitivity indices using sparse polynomial chaos expansions
International Nuclear Information System (INIS)
Blatman, Geraud; Sudret, Bruno
2010-01-01
Global sensitivity analysis aims at quantifying the relative importance of uncertain input variables onto the response of a mathematical model of a physical system. ANOVA-based indices such as the Sobol' indices are well-known in this context. These indices are usually computed by direct Monte Carlo or quasi-Monte Carlo simulation, which may reveal hardly applicable for computationally demanding industrial models. In the present paper, sparse polynomial chaos (PC) expansions are introduced in order to compute sensitivity indices. An adaptive algorithm allows the analyst to build up a PC-based metamodel that only contains the significant terms whereas the PC coefficients are computed by least-square regression using a computer experimental design. The accuracy of the metamodel is assessed by leave-one-out cross validation. Due to the genuine orthogonality properties of the PC basis, ANOVA-based sensitivity indices are post-processed analytically. This paper also develops a bootstrap technique which eventually yields confidence intervals on the results. The approach is illustrated on various application examples up to 21 stochastic dimensions. Accurate results are obtained at a computational cost 2-3 orders of magnitude smaller than that associated with Monte Carlo simulation.
Du, Xiaosong; Leifsson, Leifur; Grandin, Robert; Meeker, William; Roberts, Ronald; Song, Jiming
2018-04-01
Probability of detection (POD) is widely used for measuring reliability of nondestructive testing (NDT) systems. Typically, POD is determined experimentally, while it can be enhanced by utilizing physics-based computational models in combination with model-assisted POD (MAPOD) methods. With the development of advanced physics-based methods, such as ultrasonic NDT testing, the empirical information, needed for POD methods, can be reduced. However, performing accurate numerical simulations can be prohibitively time-consuming, especially as part of stochastic analysis. In this work, stochastic surrogate models for computational physics-based measurement simulations are developed for cost savings of MAPOD methods while simultaneously ensuring sufficient accuracy. The stochastic surrogate is used to propagate the random input variables through the physics-based simulation model to obtain the joint probability distribution of the output. The POD curves are then generated based on those results. Here, the stochastic surrogates are constructed using non-intrusive polynomial chaos (NIPC) expansions. In particular, the NIPC methods used are the quadrature, ordinary least-squares (OLS), and least-angle regression sparse (LARS) techniques. The proposed approach is demonstrated on the ultrasonic testing simulation of a flat bottom hole flaw in an aluminum block. The results show that the stochastic surrogates have at least two orders of magnitude faster convergence on the statistics than direct Monte Carlo sampling (MCS). Moreover, the evaluation of the stochastic surrogate models is over three orders of magnitude faster than the underlying simulation model for this case, which is the UTSim2 model.
Polynomial expansion of the precoder for power minimization in large-scale MIMO systems
Sifaou, Houssem
2016-07-26
This work focuses on the downlink of a single-cell large-scale MIMO system in which the base station equipped with M antennas serves K single-antenna users. In particular, we are interested in reducing the implementation complexity of the optimal linear precoder (OLP) that minimizes the total power consumption while ensuring target user rates. As most precoding schemes, a major difficulty towards the implementation of OLP is that it requires fast inversions of large matrices at every new channel realizations. To overcome this issue, we aim at designing a linear precoding scheme providing the same performance of OLP but with lower complexity. This is achieved by applying the truncated polynomial expansion (TPE) concept on a per-user basis. To get a further leap in complexity reduction and allow for closed-form expressions of the per-user weighting coefficients, we resort to the asymptotic regime in which M and K grow large with a bounded ratio. Numerical results are used to show that the proposed TPE precoding scheme achieves the same performance of OLP with a significantly lower implementation complexity. © 2016 IEEE.
Uncertainty propagation of p-boxes using sparse polynomial chaos expansions
Schöbi, Roland; Sudret, Bruno
2017-06-01
In modern engineering, physical processes are modelled and analysed using advanced computer simulations, such as finite element models. Furthermore, concepts of reliability analysis and robust design are becoming popular, hence, making efficient quantification and propagation of uncertainties an important aspect. In this context, a typical workflow includes the characterization of the uncertainty in the input variables. In this paper, input variables are modelled by probability-boxes (p-boxes), accounting for both aleatory and epistemic uncertainty. The propagation of p-boxes leads to p-boxes of the output of the computational model. A two-level meta-modelling approach is proposed using non-intrusive sparse polynomial chaos expansions to surrogate the exact computational model and, hence, to facilitate the uncertainty quantification analysis. The capabilities of the proposed approach are illustrated through applications using a benchmark analytical function and two realistic engineering problem settings. They show that the proposed two-level approach allows for an accurate estimation of the statistics of the response quantity of interest using a small number of evaluations of the exact computational model. This is crucial in cases where the computational costs are dominated by the runs of high-fidelity computational models.
Efficient computation of global sensitivity indices using sparse polynomial chaos expansions
Energy Technology Data Exchange (ETDEWEB)
Blatman, Geraud, E-mail: geraud.blatman@edf.f [Clermont Universite, IFMA, EA 3867, Laboratoire de Mecanique et Ingenieries, BP 10448, F-63000 Clermont-Ferrand (France); EDF, R and D Division - Site des Renardieres, F-77818 Moret-sur-Loing (France); Sudret, Bruno, E-mail: sudret@phimeca.co [Clermont Universite, IFMA, EA 3867, Laboratoire de Mecanique et Ingenieries, BP 10448, F-63000 Clermont-Ferrand (France); Phimeca Engineering, Centre d' Affaires du Zenith, 34 rue de Sarlieve, F-63800 Cournon d' Auvergne (France)
2010-11-15
Global sensitivity analysis aims at quantifying the relative importance of uncertain input variables onto the response of a mathematical model of a physical system. ANOVA-based indices such as the Sobol' indices are well-known in this context. These indices are usually computed by direct Monte Carlo or quasi-Monte Carlo simulation, which may reveal hardly applicable for computationally demanding industrial models. In the present paper, sparse polynomial chaos (PC) expansions are introduced in order to compute sensitivity indices. An adaptive algorithm allows the analyst to build up a PC-based metamodel that only contains the significant terms whereas the PC coefficients are computed by least-square regression using a computer experimental design. The accuracy of the metamodel is assessed by leave-one-out cross validation. Due to the genuine orthogonality properties of the PC basis, ANOVA-based sensitivity indices are post-processed analytically. This paper also develops a bootstrap technique which eventually yields confidence intervals on the results. The approach is illustrated on various application examples up to 21 stochastic dimensions. Accurate results are obtained at a computational cost 2-3 orders of magnitude smaller than that associated with Monte Carlo simulation.
Schmidt-Kalman Filter with Polynomial Chaos Expansion for Orbit Determination of Space Objects
Yang, Y.; Cai, H.; Zhang, K.
2016-09-01
Parameter errors in orbital models can result in poor orbit determination (OD) using a traditional Kalman filter. One approach to account for these errors is to consider them in the so-called Schmidt-Kalman filter (SKF), by augmenting the state covariance matrix (CM) with additional parameter covariance rather than additively estimating these so-called "consider" parameters. This paper introduces a new SKF algorithm with polynomial chaos expansion (PCE-SKF). The PCE approach has been proved to be more efficient than Monte Carlo method for propagating the input uncertainties onto the system response without experiencing any constraints of linear dynamics, or Gaussian distributions of the uncertainty sources. The state and covariance needed in the orbit prediction step are propagated using PCE. An inclined geosynchronous orbit scenario is set up to test the proposed PCE-SKF based OD algorithm. The satellite orbit is propagated based on numerical integration, with the uncertain coefficient of solar radiation pressure considered. The PCE-SKF solutions are compared with extended Kalman filter (EKF), SKF and PCE-EKF (EKF with PCE) solutions. It is implied that the covariance propagation using PCE leads to more precise OD solutions in comparison with those based on linear propagation of covariance.
Energy Technology Data Exchange (ETDEWEB)
Kersaudy, Pierric, E-mail: pierric.kersaudy@orange.com [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); ESYCOM, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77700 Marne-la-Vallée (France); Sudret, Bruno [ETH Zürich, Chair of Risk, Safety and Uncertainty Quantification, Stefano-Franscini-Platz 5, 8093 Zürich (Switzerland); Varsier, Nadège [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Picon, Odile [ESYCOM, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77700 Marne-la-Vallée (France); Wiart, Joe [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France)
2015-04-01
In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem.
Dolgov, Sergey
2015-11-03
We apply the tensor train (TT) decomposition to construct the tensor product polynomial chaos expansion (PCE) of a random field, to solve the stochastic elliptic diffusion PDE with the stochastic Galerkin discretization, and to compute some quantities of interest (mean, variance, and exceedance probabilities). We assume that the random diffusion coefficient is given as a smooth transformation of a Gaussian random field. In this case, the PCE is delivered by a complicated formula, which lacks an analytic TT representation. To construct its TT approximation numerically, we develop the new block TT cross algorithm, a method that computes the whole TT decomposition from a few evaluations of the PCE formula. The new method is conceptually similar to the adaptive cross approximation in the TT format but is more efficient when several tensors must be stored in the same TT representation, which is the case for the PCE. In addition, we demonstrate how to assemble the stochastic Galerkin matrix and to compute the solution of the elliptic equation and its postprocessing, staying in the TT format. We compare our technique with the traditional sparse polynomial chaos and the Monte Carlo approaches. In the tensor product polynomial chaos, the polynomial degree is bounded for each random variable independently. This provides higher accuracy than the sparse polynomial set or the Monte Carlo method, but the cardinality of the tensor product set grows exponentially with the number of random variables. However, when the PCE coefficients are implicitly approximated in the TT format, the computations with the full tensor product polynomial set become possible. In the numerical experiments, we confirm that the new methodology is competitive in a wide range of parameters, especially where high accuracy and high polynomial degrees are required.
Directory of Open Access Journals (Sweden)
Mahmoud Paripour
2014-08-01
Full Text Available In this paper, the Bernstein polynomials are used to approximatethe solutions of linear integral equations with multiple time lags (IEMTL through expansion methods (collocation method, partition method, Galerkin method. The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is carried out
Qian, Ying-Jing; Yang, Xiao-Dong; Zhai, Guan-Qiao; Zhang, Wei
2017-08-01
Innovated by the nonlinear modes concept in the vibrational dynamics, the vertical periodic orbits around the triangular libration points are revisited for the Circular Restricted Three-body Problem. The ζ -component motion is treated as the dominant motion and the ξ and η -component motions are treated as the slave motions. The slave motions are in nature related to the dominant motion through the approximate nonlinear polynomial expansions with respect to the ζ -position and ζ -velocity during the one of the periodic orbital motions. By employing the relations among the three directions, the three-dimensional system can be transferred into one-dimensional problem. Then the approximate three-dimensional vertical periodic solution can be analytically obtained by solving the dominant motion only on ζ -direction. To demonstrate the effectiveness of the proposed method, an accuracy study was carried out to validate the polynomial expansion (PE) method. As one of the applications, the invariant nonlinear relations in polynomial expansion form are used as constraints to obtain numerical solutions by differential correction. The nonlinear relations among the directions provide an alternative point of view to explore the overall dynamics of periodic orbits around libration points with general rules.
Energy Technology Data Exchange (ETDEWEB)
Rising, M. E.; Prinja, A. K. [Univ. of New Mexico, Dept. of Chemical and Nuclear Engineering, Albuquerque, NM 87131 (United States)
2012-07-01
A critical neutron transport problem with random material properties is introduced. The total cross section and the average neutron multiplicity are assumed to be uncertain, characterized by the mean and variance with a log-normal distribution. The average neutron multiplicity and the total cross section are assumed to be uncorrected and the material properties for differing materials are also assumed to be uncorrected. The principal component analysis method is used to decompose the covariance matrix into eigenvalues and eigenvectors and then 'realizations' of the material properties can be computed. A simple Monte Carlo brute force sampling of the decomposed covariance matrix is employed to obtain a benchmark result for each test problem. In order to save computational time and to characterize the moments and probability density function of the multiplication factor the polynomial chaos expansion method is employed along with the stochastic collocation method. A Gauss-Hermite quadrature set is convolved into a multidimensional tensor product quadrature set and is successfully used to compute the polynomial chaos expansion coefficients of the multiplication factor. Finally, for a particular critical fuel pin assembly the appropriate number of random variables and polynomial expansion order are investigated. (authors)
Directory of Open Access Journals (Sweden)
Chi Yaodan
2017-08-01
Full Text Available Crosstalk in wiring harness has been studied extensively for its importance in the naval ships electromagnetic compatibility field. An effective and high-efficiency method is proposed in this paper for analyzing Statistical Characteristics of crosstalk in wiring harness with random variation of position based on Polynomial Chaos Expansion (PCE. A typical 14-cable wiring harness was simulated as the object of research. Distance among interfering cable, affected cable and GND is synthesized and analyzed in both frequency domain and time domain. The model of naval ships wiring harness distribution parameter was established by utilizing Legendre orthogonal polynomials as basis functions along with prediction model of statistical characters. Detailed mean value, mean square error, probability density function and reasonable varying range of crosstalk in naval ships wiring harness are described in both time domain and frequency domain. Numerical experiment proves that the method proposed in this paper, not only has good consistency with the MC method can be applied in the naval ships EMC research field to provide theoretical support for guaranteeing safety, but also has better time-efficiency than the MC method. Therefore, the Polynomial Chaos Expansion method.
A Posteriori Error Analysis of Stochastic Differential Equations Using Polynomial Chaos Expansions
Butler, T.; Dawson, C.; Wildey, T.
2011-01-01
We develop computable a posteriori error estimates for linear functionals of a solution to a general nonlinear stochastic differential equation with random model/source parameters. These error estimates are based on a variational analysis applied to stochastic Galerkin methods for forward and adjoint problems. The result is a representation for the error estimate as a polynomial in the random model/source parameter. The advantage of this method is that we use polynomial chaos representations for the forward and adjoint systems to cheaply produce error estimates by simple evaluation of a polynomial. By comparison, the typical method of producing such estimates requires repeated forward/adjoint solves for each new choice of random parameter. We present numerical examples showing that there is excellent agreement between these methods. © 2011 Society for Industrial and Applied Mathematics.
Linear precoding based on polynomial expansion: reducing complexity in massive MIMO
Mueller, Axel; Kammoun, Abla; Bjö rnson, Emil; Debbah, Mé rouane
2016-01-01
By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.
Energy Technology Data Exchange (ETDEWEB)
Cho, Nam Zin; Lee, Joo Hee; Lee, Jae Jun; Yu, Hui; Lee, Gil Soo [Korea Advanced Institute of Science and Tehcnology, Daejeon (Korea, Republic of)
2006-03-15
There is growing interest in developing Pebble Bed Reactors(PBRs) as a candidate of Very High Temperature gas-cooled Reactors(VHTRs). Until now, most existing methods of nuclear design analysis for this type of reactors are base on old finite-difference solvers or on statistical methods. And other existing nodal cannot be adapted for this kind of reactors because of transverse integration problem. In this project, we developed the TOPS code in three dimensional cylindrical geometry based on Analytic Function Expansion Nodal (AFEN) method developed at KAIST. The TOPS code showed better results in computing time than FDM and MCNP. Also TOPS showed very accurate results in reactor analysis.
International Nuclear Information System (INIS)
Cho, Nam Zin; Lee, Joo Hee; Lee, Jae Jun; Yu, Hui; Lee, Gil Soo
2006-03-01
There is growing interest in developing Pebble Bed Reactors(PBRs) as a candidate of Very High Temperature gas-cooled Reactors(VHTRs). Until now, most existing methods of nuclear design analysis for this type of reactors are base on old finite-difference solvers or on statistical methods. And other existing nodal cannot be adapted for this kind of reactors because of transverse integration problem. In this project, we developed the TOPS code in three dimensional cylindrical geometry based on Analytic Function Expansion Nodal (AFEN) method developed at KAIST. The TOPS code showed better results in computing time than FDM and MCNP. Also TOPS showed very accurate results in reactor analysis
International Nuclear Information System (INIS)
Conti Filho, P.; Oliveira Barroso, A.C. de
1985-01-01
It was developed a computer code to generate polynomial coefficients which represent homogenized microscopic cross sections in function of the local accumulated burnup and concentration of soluble boron, presented in fuel element, for each step of burnup reactor. Afterward, it was developed a coupling between LEOPARD-GERADOR DE POLINOMIOS - CITATION computer codes to interpret and build homogenized microscopic cross sections according with local characteristics of each fuel element during the burnup calculation of reactor core. (M.C.K.) [pt
Directory of Open Access Journals (Sweden)
Mohammadnia Meysam
2013-01-01
Full Text Available The flux expansion nodal method is a suitable method for considering nodalization effects in node corners. In this paper we used this method to solve the intra-nodal flux analytically. Then, a computer code, named MA.CODE, was developed using the C# programming language. The code is capable of reactor core calculations for hexagonal geometries in two energy groups and three dimensions. The MA.CODE imports two group constants from the WIMS code and calculates the effective multiplication factor, thermal and fast neutron flux in three dimensions, power density, reactivity, and the power peaking factor of each fuel assembly. Some of the code's merits are low calculation time and a user friendly interface. MA.CODE results showed good agreement with IAEA benchmarks, i. e. AER-FCM-101 and AER-FCM-001.
Development and validation of a nodal code for core calculation
International Nuclear Information System (INIS)
Nowakowski, Pedro Mariano
2004-01-01
The code RHENO solves the multigroup three-dimensional diffusion equation using a nodal method of polynomial expansion.A comparative study has been made between this code and present internationals nodal diffusion codes, resulting that the RHENO is up to date.The RHENO has been integrated to a calculation line and has been extend to make burnup calculations.Two methods for pin power reconstruction were developed: modulation and imbedded. The modulation method has been implemented in a program, while the implementation of the imbedded method will be concluded shortly.The validation carried out (that includes experimental data of a MPR) show very good results and calculation efficiency
International Nuclear Information System (INIS)
Doha, E H; Ahmed, H M
2005-01-01
Two formulae expressing explicitly the derivatives and moments of Al-Salam-Carlitz I polynomials of any degree and for any order in terms of Al-Salam-Carlitz I themselves are proved. Two other formulae for the expansion coefficients of general-order derivatives D p q f(x), and for the moments x l D p q f(x), of an arbitrary function f(x) in terms of its original expansion coefficients are also obtained. Application of these formulae for solving q-difference equations with varying coefficients, by reducing them to recurrence relations in the expansion coefficients of the solution, is explained. An algebraic symbolic approach (using Mathematica) in order to build and solve recursively for the connection coefficients between Al-Salam-Carlitz I polynomials and any system of basic hypergeometric orthogonal polynomials, belonging to the q-Hahn class, is described
International Nuclear Information System (INIS)
Putney, J.M.
1983-05-01
The characteristics of a simple parallel micro-processor (PMP) are reviewed and its software requirements discussed. One of the more immediate applications is the multi-spatial simulation of a nuclear reactor station. This is of particular interest because 3D reactor simulation might then be possible as part of operating procedure for PFR and CDFR. A major part of a multi-spatial reactor simulator is the solution of the neutron diffusion equation. A procedure is described for solving the equation on a PMP, which is applied to the nodal expansion method with modifications to the nodal expansion codes RECNEC and HEXNEC. Estimations of the micro-processor requirements for the simulation of both PFR and CDFR are given. (U.K.)
Jimenez, M. Navarro; Le Maî tre, O. P.; Knio, Omar
2017-01-01
A Galerkin polynomial chaos (PC) method was recently proposed to perform variance decomposition and sensitivity analysis in stochastic differential equations (SDEs), driven by Wiener noise and involving uncertain parameters. The present paper extends the PC method to nonintrusive approaches enabling its application to more complex systems hardly amenable to stochastic Galerkin projection methods. We also discuss parallel implementations and the variance decomposition of the derived quantity of interest within the framework of nonintrusive approaches. In particular, a novel hybrid PC-sampling-based strategy is proposed in the case of nonsmooth quantities of interest (QoIs) but smooth SDE solution. Numerical examples are provided that illustrate the decomposition of the variance of QoIs into contributions arising from the uncertain parameters, the inherent stochastic forcing, and joint effects. The simulations are also used to support a brief analysis of the computational complexity of the method, providing insight on the types of problems that would benefit from the present developments.
Jimenez, M. Navarro
2017-04-18
A Galerkin polynomial chaos (PC) method was recently proposed to perform variance decomposition and sensitivity analysis in stochastic differential equations (SDEs), driven by Wiener noise and involving uncertain parameters. The present paper extends the PC method to nonintrusive approaches enabling its application to more complex systems hardly amenable to stochastic Galerkin projection methods. We also discuss parallel implementations and the variance decomposition of the derived quantity of interest within the framework of nonintrusive approaches. In particular, a novel hybrid PC-sampling-based strategy is proposed in the case of nonsmooth quantities of interest (QoIs) but smooth SDE solution. Numerical examples are provided that illustrate the decomposition of the variance of QoIs into contributions arising from the uncertain parameters, the inherent stochastic forcing, and joint effects. The simulations are also used to support a brief analysis of the computational complexity of the method, providing insight on the types of problems that would benefit from the present developments.
An accurate solution of parabolic equations by expansion in ultraspherical polynomials
International Nuclear Information System (INIS)
Doha, E.H.
1986-11-01
An ultraspherical expansion technique is applied to obtain numerically the solution of the third boundary value problem for linear parabolic partial differential equation in one-space variable. The differential equation with its boundary and initial conditions is reduced to a system of ordinary differential equations for the coefficients of the expansion. This system may be solved analytically or numerically in a step-by-step manner. The method in its present form may be considered as a generalization of that of Dew and Scraton. The extension of the method to the polar-type equations is also considered. (author). 12 refs, 1 tab
International Nuclear Information System (INIS)
Fujimura, Toichiro; Okumura, Keisuke
2002-11-01
A prototype version of a diffusion code has been developed to analyze the hexagonal core as reduced moderation reactor and the applicability of some acceleration methods have been investigated to accelerate the convergence of the iterative solution method. The hexagonal core is divided into regular triangular prisms in the three-dimensional code MOSRA-Prism and a polynomial expansion nodal method is applied to approximate the neutron flux distribution by a cubic polynomial. The multi-group diffusion equation is solved iteratively with ordinal inner and outer iterations and the effectiveness of acceleration methods is ascertained by applying an adaptive acceleration method and a neutron source extrapolation method, respectively. The formulation of the polynomial expansion nodal method is outlined in the report and the local and global effectiveness of the acceleration methods is discussed with various sample calculations. A new general expression of vacuum boundary condition, derived in the formulation is also described. (author)
Waqas, Abi; Melati, Daniele; Manfredi, Paolo; Grassi, Flavia; Melloni, Andrea
2018-02-01
The Building Block (BB) approach has recently emerged in photonic as a suitable strategy for the analysis and design of complex circuits. Each BB can be foundry related and contains a mathematical macro-model of its functionality. As well known, statistical variations in fabrication processes can have a strong effect on their functionality and ultimately affect the yield. In order to predict the statistical behavior of the circuit, proper analysis of the uncertainties effects is crucial. This paper presents a method to build a novel class of Stochastic Process Design Kits for the analysis of photonic circuits. The proposed design kits directly store the information on the stochastic behavior of each building block in the form of a generalized-polynomial-chaos-based augmented macro-model obtained by properly exploiting stochastic collocation and Galerkin methods. Using this approach, we demonstrate that the augmented macro-models of the BBs can be calculated once and stored in a BB (foundry dependent) library and then used for the analysis of any desired circuit. The main advantage of this approach, shown here for the first time in photonics, is that the stochastic moments of an arbitrary photonic circuit can be evaluated by a single simulation only, without the need for repeated simulations. The accuracy and the significant speed-up with respect to the classical Monte Carlo analysis are verified by means of classical photonic circuit example with multiple uncertain variables.
Energy Technology Data Exchange (ETDEWEB)
Wu, Xu, E-mail: xuwu2@illinois.edu; Kozlowski, Tomasz
2017-03-15
Modeling and simulations are naturally augmented by extensive Uncertainty Quantification (UQ) and sensitivity analysis requirements in the nuclear reactor system design, in which uncertainties must be quantified in order to prove that the investigated design stays within acceptance criteria. Historically, expert judgment has been used to specify the nominal values, probability density functions and upper and lower bounds of the simulation code random input parameters for the forward UQ process. The purpose of this paper is to replace such ad-hoc expert judgment of the statistical properties of input model parameters with inverse UQ process. Inverse UQ seeks statistical descriptions of the model random input parameters that are consistent with the experimental data. Bayesian analysis is used to establish the inverse UQ problems based on experimental data, with systematic and rigorously derived surrogate models based on Polynomial Chaos Expansion (PCE). The methods developed here are demonstrated with the Point Reactor Kinetics Equation (PRKE) coupled with lumped parameter thermal-hydraulics feedback model. Three input parameters, external reactivity, Doppler reactivity coefficient and coolant temperature coefficient are modeled as uncertain input parameters. Their uncertainties are inversely quantified based on synthetic experimental data. Compared with the direct numerical simulation, surrogate model by PC expansion shows high efficiency and accuracy. In addition, inverse UQ with Bayesian analysis can calibrate the random input parameters such that the simulation results are in a better agreement with the experimental data.
Nguyen, Thuong T.; Székely, Eszter; Imbalzano, Giulio; Behler, Jörg; Csányi, Gábor; Ceriotti, Michele; Götz, Andreas W.; Paesani, Francesco
2018-06-01
The accurate representation of multidimensional potential energy surfaces is a necessary requirement for realistic computer simulations of molecular systems. The continued increase in computer power accompanied by advances in correlated electronic structure methods nowadays enables routine calculations of accurate interaction energies for small systems, which can then be used as references for the development of analytical potential energy functions (PEFs) rigorously derived from many-body (MB) expansions. Building on the accuracy of the MB-pol many-body PEF, we investigate here the performance of permutationally invariant polynomials (PIPs), neural networks, and Gaussian approximation potentials (GAPs) in representing water two-body and three-body interaction energies, denoting the resulting potentials PIP-MB-pol, Behler-Parrinello neural network-MB-pol, and GAP-MB-pol, respectively. Our analysis shows that all three analytical representations exhibit similar levels of accuracy in reproducing both two-body and three-body reference data as well as interaction energies of small water clusters obtained from calculations carried out at the coupled cluster level of theory, the current gold standard for chemical accuracy. These results demonstrate the synergy between interatomic potentials formulated in terms of a many-body expansion, such as MB-pol, that are physically sound and transferable, and machine-learning techniques that provide a flexible framework to approximate the short-range interaction energy terms.
Directory of Open Access Journals (Sweden)
Liang Yan
2018-03-01
Full Text Available In this paper, we examine two widely-used approaches, the polynomial chaos expansion (PCE and Gaussian process (GP regression, for the development of surrogate models. The theoretical differences between the PCE and GP approximations are discussed. A state-of-the-art PCE approach is constructed based on high precision quadrature points; however, the need for truncation may result in potential precision loss; the GP approach performs well on small datasets and allows a fine and precise trade-off between fitting the data and smoothing, but its overall performance depends largely on the training dataset. The reproducing kernel Hilbert space (RKHS and Mercer’s theorem are introduced to form a linkage between the two methods. The theorem has proven that the two surrogates can be embedded in two isomorphic RKHS, by which we propose a novel method named Gaussian process on polynomial chaos basis (GPCB that incorporates the PCE and GP. A theoretical comparison is made between the PCE and GPCB with the help of the Kullback–Leibler divergence. We present that the GPCB is as stable and accurate as the PCE method. Furthermore, the GPCB is a one-step Bayesian method that chooses the best subset of RKHS in which the true function should lie, while the PCE method requires an adaptive procedure. Simulations of 1D and 2D benchmark functions show that GPCB outperforms both the PCE and classical GP methods. In order to solve high dimensional problems, a random sample scheme with a constructive design (i.e., tensor product of quadrature points is proposed to generate a valid training dataset for the GPCB method. This approach utilizes the nature of the high numerical accuracy underlying the quadrature points while ensuring the computational feasibility. Finally, the experimental results show that our sample strategy has a higher accuracy than classical experimental designs; meanwhile, it is suitable for solving high dimensional problems.
International Nuclear Information System (INIS)
Mohanty, S.; Deo, B.B.; Mohapatra, J.K.
1986-01-01
A relatively stable method of phase shift analysis of hyperon-nucleon scattering is proposed and applied to Σ + p and Λp scattering. The analytic cut t-planes of analyticity of the helicity amplitudes are mapped into the interior of unifocal ellipses. The helicity amplitudes are then expressed as accelerated convergent expansions in the mapped variable. A definite economy is observed in the number of free parameters for fixed energy phase shift analysis of Σ + p and Λp scattering at 40 and 100 MeV and 100 MeV respectively. Twenty six more phase shifts and coupling parameters corresponding to higher J values are also predicted. (author)
International Nuclear Information System (INIS)
Turinsky, P.J.; Al-Chalabi, R.M.K.; Engrand, P.; Sarsour, H.N.; Faure, F.X.; Guo, W.
1994-06-01
NESTLE is a FORTRAN77 code that solves the few-group neutron diffusion equation utilizing the Nodal Expansion Method (NEM). NESTLE can solve the eigenvalue (criticality); eigenvalue adjoint; external fixed-source steady-state; or external fixed-source. or eigenvalue initiated transient problems. The code name NESTLE originates from the multi-problem solution capability, abbreviating Nodal Eigenvalue, Steady-state, Transient, Le core Evaluator. The eigenvalue problem allows criticality searches to be completed, and the external fixed-source steady-state problem can search to achieve a specified power level. Transient problems model delayed neutrons via precursor groups. Several core properties can be input as time dependent. Two or four energy groups can be utilized, with all energy groups being thermal groups (i.e. upscatter exits) if desired. Core geometries modelled include Cartesian and Hexagonal. Three, two and one dimensional models can be utilized with various symmetries. The non-linear iterative strategy associated with the NEM method is employed. An advantage of the non-linear iterative strategy is that NSTLE can be utilized to solve either the nodal or Finite Difference Method representation of the few-group neutron diffusion equation
International Nuclear Information System (INIS)
Deman, G.; Konakli, K.; Sudret, B.; Kerrou, J.; Perrochet, P.; Benabderrahmane, H.
2016-01-01
The study makes use of polynomial chaos expansions to compute Sobol' indices within the frame of a global sensitivity analysis of hydro-dispersive parameters in a simplified vertical cross-section of a segment of the subsurface of the Paris Basin. Applying conservative ranges, the uncertainty in 78 input variables is propagated upon the mean lifetime expectancy of water molecules departing from a specific location within a highly confining layer situated in the middle of the model domain. Lifetime expectancy is a hydrogeological performance measure pertinent to safety analysis with respect to subsurface contaminants, such as radionuclides. The sensitivity analysis indicates that the variability in the mean lifetime expectancy can be sufficiently explained by the uncertainty in the petrofacies, i.e. the sets of porosity and hydraulic conductivity, of only a few layers of the model. The obtained results provide guidance regarding the uncertainty modeling in future investigations employing detailed numerical models of the subsurface of the Paris Basin. Moreover, the study demonstrates the high efficiency of sparse polynomial chaos expansions in computing Sobol' indices for high-dimensional models. - Highlights: • Global sensitivity analysis of a 2D 15-layer groundwater flow model is conducted. • A high-dimensional random input comprising 78 parameters is considered. • The variability in the mean lifetime expectancy for the central layer is examined. • Sparse polynomial chaos expansions are used to compute Sobol' sensitivity indices. • The petrofacies of a few layers can sufficiently explain the response variance.
Investigation on generalized Variational Nodal Methods for heterogeneous nodes
International Nuclear Information System (INIS)
Wang, Yongping; Wu, Hongchun; Li, Yunzhao; Cao, Liangzhi; Shen, Wei
2017-01-01
Highlights: • We developed two heterogeneous nodal methods based on the Variational Nodal Method. • Four problems were solved to evaluate the two heterogeneous nodal methods. • The function expansion method is good at treating continuous-changing heterogeneity. • The finite sub-element method is good at treating discontinuous-changing heterogeneity. - Abstract: The Variational Nodal Method (VNM) is generalized for heterogeneous nodes and applied to four kinds of problems including Molten Salt Reactor (MSR) core problem with continuous cross section profile, Pressurized Water Reactor (PWR) control rod cusping effect problem, PWR whole-core pin-by-pin problem, and heterogeneous PWR core problem without fuel-coolant homogenization in each pin cell. Two approaches have been investigated for the treatment of the nodal heterogeneity in this paper. To concentrate on spatial heterogeneity, diffusion approximation was adopted for the angular variable in neutron transport equation. To provide demonstrative numerical results, the codes in this paper were developed in slab geometry. The first method, named as function expansion (FE) method, expands nodal flux by orthogonal polynomials and the nodal cross sections are also expressed as spatial depended functions. The second path, named as finite sub-element (FS) method, takes advantage of the finite-element method by dividing each node into numbers of homogeneous sub-elements and expanding nodal flux into the combination of linear sub-element trial functions. Numerical tests have been carried out to evaluate the ability of the two nodal (coarse-mesh) heterogeneous VNMs by comparing with the fine-mesh homogeneous VNM. It has been demonstrated that both heterogeneous approaches can handle heterogeneous nodes. The FE method is good at continuous-changing heterogeneity as in the MSR core problem, while the FS method is good at discontinuous-changing heterogeneity such as the PWR pin-by-pin problem and heterogeneous PWR core
Liu, Y.; Zheng, L.; Pau, G. S. H.
2016-12-01
A careful assessment of the risk associated with geologic CO2 storage is critical to the deployment of large-scale storage projects. While numerical modeling is an indispensable tool for risk assessment, there has been increasing need in considering and addressing uncertainties in the numerical models. However, uncertainty analyses have been significantly hindered by the computational complexity of the model. As a remedy, reduced-order models (ROM), which serve as computationally efficient surrogates for high-fidelity models (HFM), have been employed. The ROM is constructed at the expense of an initial set of HFM simulations, and afterwards can be relied upon to predict the model output values at minimal cost. The ROM presented here is part of National Risk Assessment Program (NRAP) and intends to predict the water quality change in groundwater in response to hypothetical CO2 and brine leakage. The HFM based on which the ROM is derived is a multiphase flow and reactive transport model, with 3-D heterogeneous flow field and complex chemical reactions including aqueous complexation, mineral dissolution/precipitation, adsorption/desorption via surface complexation and cation exchange. Reduced-order modeling techniques based on polynomial basis expansion, such as polynomial chaos expansion (PCE), are widely used in the literature. However, the accuracy of such ROMs can be affected by the sparse structure of the coefficients of the expansion. Failing to identify vanishing polynomial coefficients introduces unnecessary sampling errors, the accumulation of which deteriorates the accuracy of the ROMs. To address this issue, we treat the PCE as a sparse Bayesian learning (SBL) problem, and the sparsity is obtained by detecting and including only the non-zero PCE coefficients one at a time by iteratively selecting the most contributing coefficients. The computational complexity due to predicting the entire 3-D concentration fields is further mitigated by a dimension
Group-decoupled multi-group pin power reconstruction utilizing nodal solution 1D flux profiles
International Nuclear Information System (INIS)
Yu, Lulin; Lu, Dong; Zhang, Shaohong; Wang, Dezhong
2014-01-01
Highlights: • A direct fitting multi-group pin power reconstruction method is developed. • The 1D nodal solution flux profiles are used as the condition. • The least square fit problem is analytically solved. • A slowing down source improvement method is applied. • The method shows good accuracy for even challenging problems. - Abstract: A group-decoupled direct fitting method is developed for multi-group pin power reconstruction, which avoids both the complication of obtaining 2D analytic multi-group flux solution and any group-coupled iteration. A unique feature of the method is that in addition to nodal volume and surface average fluxes and corner fluxes, transversely-integrated 1D nodal solution flux profiles are also used as the condition to determine the 2D intra-nodal flux distribution. For each energy group, a two-dimensional expansion with a nine-term polynomial and eight hyperbolic functions is used to perform a constrained least square fit to the 1D intra-nodal flux solution profiles. The constraints are on the conservation of nodal volume and surface average fluxes and corner fluxes. Instead of solving the constrained least square fit problem numerically, we solve it analytically by fully utilizing the symmetry property of the expansion functions. Each of the 17 unknown expansion coefficients is expressed in terms of nodal volume and surface average fluxes, corner fluxes and transversely-integrated flux values. To determine the unknown corner fluxes, a set of linear algebraic equations involving corner fluxes is established via using the current conservation condition on all corners. Moreover, an optional slowing down source improvement method is also developed to further enhance the accuracy of the reconstructed flux distribution if needed. Two test examples are shown with very good results. One is a four-group BWR mini-core problem with all control blades inserted and the other is the seven-group OECD NEA MOX benchmark, C5G7
Complex models of nodal nuclear data
International Nuclear Information System (INIS)
Dufek, Jan
2011-01-01
During the core simulations, nuclear data are required at various nodal thermal-hydraulic and fuel burnup conditions. The nodal data are also partially affected by thermal-hydraulic and fuel burnup conditions in surrounding nodes as these change the neutron energy spectrum in the node. Therefore, the nodal data are functions of many parameters (state variables), and the more state variables are considered by the nodal data models the more accurate and flexible the models get. The existing table and polynomial regression models, however, cannot reflect the data dependences on many state variables. As for the table models, the number of mesh points (and necessary lattice calculations) grows exponentially with the number of variables. As for the polynomial regression models, the number of possible multivariate polynomials exceeds the limits of existing selection algorithms that should identify a few dozens of the most important polynomials. Also, the standard scheme of lattice calculations is not convenient for modelling the data dependences on various burnup conditions since it performs only a single or few burnup calculations at fixed nominal conditions. We suggest a new efficient algorithm for selecting the most important multivariate polynomials for the polynomial regression models so that dependences on many state variables can be considered. We also present a new scheme for lattice calculations where a large number of burnup histories are accomplished at varied nodal conditions. The number of lattice calculations being performed and the number of polynomials being analysed are controlled and minimised while building the nodal data models of a required accuracy. (author)
Freud, Géza
1971-01-01
Orthogonal Polynomials contains an up-to-date survey of the general theory of orthogonal polynomials. It deals with the problem of polynomials and reveals that the sequence of these polynomials forms an orthogonal system with respect to a non-negative m-distribution defined on the real numerical axis. Comprised of five chapters, the book begins with the fundamental properties of orthogonal polynomials. After discussing the momentum problem, it then explains the quadrature procedure, the convergence theory, and G. Szegő's theory. This book is useful for those who intend to use it as referenc
Efficient computation of Laguerre polynomials
A. Gil (Amparo); J. Segura (Javier); N.M. Temme (Nico)
2017-01-01
textabstractAn efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials . Ln(α)(z) are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for . n large and . α small, are used
A nodal collocation method for the calculation of the lambda modes of the P L equations
International Nuclear Information System (INIS)
Capilla, M.; Talavera, C.F.; Ginestar, D.; Verdu, G.
2005-01-01
P L equations are classical approximations to the neutron transport equation admitting a diffusive form. Using this property, a nodal collocation method is developed for the P L approximations, which is based on the expansion of the flux in terms of orthonormal Legendre polynomials. This method approximates the differential lambda modes problem by an algebraic eigenvalue problem from which the fundamental and the subcritical modes of the system can be calculated. To test the performance of this method, two problems have been considered, a homogeneous slab, which admits an analytical solution, and a seven-region slab corresponding to a more realistic problem
Nodal kinetics model upgrade in the Penn State coupled TRAC/NEM codes
International Nuclear Information System (INIS)
Beam, Tara M.; Ivanov, Kostadin N.; Baratta, Anthony J.; Finnemann, Herbert
1999-01-01
The Pennsylvania State University currently maintains and does development and verification work for its own versions of the coupled three-dimensional kinetics/thermal-hydraulics codes TRAC-PF1/NEM and TRAC-BF1/NEM. The subject of this paper is nodal model enhancements in the above mentioned codes. Because of the numerous validation studies that have been performed on almost every aspect of these codes, this upgrade is done without a major code rewrite. The upgrade consists of four steps. The first two steps are designed to improve the accuracy of the kinetics model, based on the nodal expansion method. The polynomial expansion solution of 1D transverse integrated diffusion equation is replaced with a solution, which uses a semi-analytic expansion. Further the standard parabolic polynomial representation of the transverse leakage in the above 1D equations is replaced with an improved approximation. The last two steps of the upgrade address the code efficiency by improving the solution of the time-dependent NEM equations and implementing a multi-grid solver. These four improvements are implemented into the standalone NEM kinetics code. Verification of this code was accomplished based on the original verification studies. The results show that the new methods improve the accuracy and efficiency of the code. The verification of the upgraded NEM model in the TRAC-PF1/NEM and TRAC-BF1/NEM coupled codes is underway
Polynomial expansions and transition strengths
International Nuclear Information System (INIS)
Draayer, J.P.
1980-01-01
The subject is statistical spectroscopy applied to determining strengths and strength sums of excitation processes in nuclei. The focus will be on a ds-shell isoscalar E2 study with detailed shell-model results providing the standard for comparison; similar results are available for isovector E2 and M1 and E4 transitions as well as for single-particle transfer and ν +- decay. The present study is intended to serve as a tutorial for applications where shell-model calculations are not feasible. The problem is posed and a schematic theory for strengths and sums is presented. The theory is extended to include the effect of correlations between H, the system Hamiltonian, and theta, the excitation operator. Associated with correlation measures is a geometry that can be used to anticipate the goodness of a symmetry. This is illustrated for pseudo SU(3) in the fp-shell. Some conclusions about fluctuations and collectivity that one can deduce from the statistical results for strengths are presented
Large degree asymptotics of generalized Bessel polynomials
J.L. López; N.M. Temme (Nico)
2011-01-01
textabstractAsymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given that is valid outside a compact neighborhood of the
Orthogonal polynomials in transport theories
International Nuclear Information System (INIS)
Dehesa, J.S.
1981-01-01
The asymptotical (k→infinity) behaviour of zeros of the polynomials gsub(k)sup((m)(ν)) encountered in the treatment of direct and inverse problems of scattering in neutron transport as well as radiative transfer theories is investigated in terms of the amplitude antiwsub(k) of the kth Legendre polynomial needed in the expansion of the scattering function. The parameters antiwsub(k) describe the anisotropy of scattering of the medium considered. In particular, it is shown that the asymptotical density of zeros of the polynomials gsub(k)sup(m)(ν) is an inverted semicircle for the anisotropic non-multiplying scattering medium
International Nuclear Information System (INIS)
Khericha, Soli T.
2000-01-01
One-energy group, two-dimensional computer code was developed to calculate the response of a detector to a vibrating absorber in a reactor core. A concept of local/global components, based on the frequency dependent detector adjoint function, and a nodalization technique were utilized. The frequency dependent detector adjoint functions presented by complex equations were expanded into real and imaginary parts. In the nodalization technique, the flux is expanded into polynomials about the center point of each node. The phase angle and the magnitude of the one-energy group detector adjoint function were calculated for a detector located in the center of a 200x200 cm reactor using a two-dimensional nodalization technique, the computer code EXTERMINATOR, and the analytical solution. The purpose of this research was to investigate the applicability of a polynomial nodal model technique to the calculations of the real and the imaginary parts of the detector adjoint function for one-energy group two-dimensional polynomial nodal model technique. From the results as discussed earlier, it is concluded that the nodal model technique can be used to calculate the detector adjoint function and the phase angle. Using the computer code developed for nodal model technique, the magnitude of one energy group frequency dependent detector adjoint function and the phase angle were calculated for the detector located in the center of a 200x200 cm homogenous reactor. The real part of the detector adjoint function was compared with the results obtained from the EXTERMINATOR computer code as well as the analytical solution based on a double sine series expansion using the classical Green's Function solution. The values were found to be less than 1% greater at 20 cm away from the source region and about 3% greater closer to the source compared to the values obtained from the analytical solution and the EXTERMINATOR code. The currents at the node interface matched within 1% of the average
Acceleration of the FERM nodal program
International Nuclear Information System (INIS)
Nakata, H.
1985-01-01
It was tested three acceleration methods trying to reduce the number of outer iterations in the FERM nodal program. The results obtained indicated that the Chebychev polynomial acceleration method with variable degree results in a economy of 50% in the computer time. Otherwise, the acceleration method by source asymptotic extrapolation or by zonal rebalance did not result in economy of the global computer time, however some acceleration had been verified in outer iterations. (M.C.K.) [pt
Two-dimensional semi-analytic nodal method for multigroup pin power reconstruction
International Nuclear Information System (INIS)
Seung Gyou, Baek; Han Gyu, Joo; Un Chul, Lee
2007-01-01
A pin power reconstruction method applicable to multigroup problems involving square fuel assemblies is presented. The method is based on a two-dimensional semi-analytic nodal solution which consists of eight exponential terms and 13 polynomial terms. The 13 polynomial terms represent the particular solution obtained under the condition of a 2-dimensional 13 term source expansion. In order to achieve better approximation of the source distribution, the least square fitting method is employed. The 8 exponential terms represent a part of the analytically obtained homogeneous solution and the 8 coefficients are determined by imposing constraints on the 4 surface average currents and 4 corner point fluxes. The surface average currents determined from a transverse-integrated nodal solution are used directly whereas the corner point fluxes are determined during the course of the reconstruction by employing an iterative scheme that would realize the corner point balance condition. The outgoing current based corner point flux determination scheme is newly introduced. The accuracy of the proposed method is demonstrated with the L336C5 benchmark problem. (authors)
International Nuclear Information System (INIS)
Capilla, M.; Talavera, C.F.; Ginestar, D.; Verdú, G.
2012-01-01
Highlights: ► The multidimensional P L approximation to the nuclear transport equation is reviewed. ► A nodal collocation method is developed for the spatial discretization of P L equations. ► Advantages of the method are lower dimension and good characterists of the associated algebraic eigenvalue problem. ► The P L nodal collocation method is implemented into the computer code SHNC. ► The SHNC code is verified with 2D and 3D benchmark eigenvalue problems from Takeda and Ikeda, giving satisfactory results. - Abstract: P L equations are classical approximations to the neutron transport equations, which are obtained expanding the angular neutron flux in terms of spherical harmonics. These approximations are useful to study the behavior of reactor cores with complex fuel assemblies, for the homogenization of nuclear cross-sections, etc., and most of these applications are in three-dimensional (3D) geometries. In this work, we review the multi-dimensional P L equations and describe a nodal collocation method for the spatial discretization of these equations for arbitrary odd order L, which is based on the expansion of the spatial dependence of the fields in terms of orthonormal Legendre polynomials. The performance of the nodal collocation method is studied by means of obtaining the k eff and the stationary power distribution of several 3D benchmark problems. The solutions are obtained are compared with a finite element method and a Monte Carlo method.
International Nuclear Information System (INIS)
Akiyama, Atsuyoshi; Katoh, Tadahiko; Kikutani, Eiji; Koiso, Haruyo; Kurokawa, Shin-ichi; Oide, Katsunobu.
1984-06-01
NODAL is an interpreter language for accelerator control developed at CERN SPS and has been used successfully since 1974. At present NODAL or NODAL-like languages are used at DESY PETRA and CERN CPS. At KEK, we have also adopted NODAL for the control of TRISTAN, a 30 GeV x 30 GeV electron-positron colliding beam facility. The KEK version of NODAL has the following improvements on the SPS NODAL: (1) the fast execution speed due to the compiler-interpreter scheme, and (2) the full-screen editing facility. This manual explains how to use the KEK NODAL. It is based on the manual of the SPS NODAL, THE NODAL SYSTEM FOR THE SPS, by M.C. Crowley-Milling and G.C. Shering, CERN 78-07. We have made some additions and modifications to make the manual more appropriate for the KEK NODAL system, paying attention to retaining the good features of the original SPS NODAL manual. We acknowledge Professor M.C. Crowley-Milling, Dr G.C. Shering and CERN for their kind permission for this modification. (author)
International Nuclear Information System (INIS)
Kurokawa, S.; Abe, K.; Akiyama, A.; Katoh, T.; Kikutani, E.; Koiso, H.; Kurihara, N.; Oide, K.; Shinomoto, M.
1985-01-01
The KEK NODAL system, which is based on the NODAL devised at the CERN SPS, works on an optical-fiber token ring network of twenty-four minicomputers (Hitachi HIDIC 80's) to control the TRISTAN accelerator complex, now being constructed at KEK. KEK NODAL retains main features of the original NODAL: the interpreting scheme, the multi-computer programming facility, and the data-module concept. In addition, it has the following characteristics: fast execution due to the compiler-interpreter method, a multicomputer file system, a full-screen editing facility, and a dynamic linkage scheme of data modules and NODAL functions. The structure of the KEK NODAL system under PMS, a real-time multitasking operating system of HIDIC 80, is described; the NODAL file system is also explained
Error estimates of Lagrange interpolation and orthonormal expansions for Freud weights
Kwon, K. H.; Lee, D. W.
2001-08-01
Let Sn[f] be the nth partial sum of the orthonormal polynomials expansion with respect to a Freud weight. Then we obtain sufficient conditions for the boundedness of Sn[f] and discuss the speed of the convergence of Sn[f] in weighted Lp space. We also find sufficient conditions for the boundedness of the Lagrange interpolation polynomial Ln[f], whose nodal points are the zeros of orthonormal polynomials with respect to a Freud weight. In particular, if W(x)=e-(1/2)x2 is the Hermite weight function, then we obtain sufficient conditions for the inequalities to hold:andwhere and k=0,1,2...,r.
A nodal collocation approximation for the multi-dimensional PL equations - 2D applications
International Nuclear Information System (INIS)
Capilla, M.; Talavera, C.F.; Ginestar, D.; Verdu, G.
2008-01-01
A classical approach to solve the neutron transport equation is to apply the spherical harmonics method obtaining a finite approximation known as the P L equations. In this work, the derivation of the P L equations for multi-dimensional geometries is reviewed and a nodal collocation method is developed to discretize these equations on a rectangular mesh based on the expansion of the neutronic fluxes in terms of orthogonal Legendre polynomials. The performance of the method and the dominant transport Lambda Modes are obtained for a homogeneous 2D problem, a heterogeneous 2D anisotropic scattering problem, a heterogeneous 2D problem and a benchmark problem corresponding to a MOX fuel reactor core
Energy Technology Data Exchange (ETDEWEB)
Duerigen, Susan
2013-05-15
The superior advantage of a nodal method for reactor cores with hexagonal fuel assemblies discretized as cells consisting of equilateral triangles is its mesh refinement capability. In this thesis, a diffusion and a simplified P{sub 3} (or SP{sub 3}) neutron transport nodal method are developed based on trigonal geometry. Both models are implemented in the reactor dynamics code DYN3D. As yet, no other well-established nodal core analysis code comprises an SP{sub 3} transport theory model based on trigonal meshes. The development of two methods based on different neutron transport approximations but using identical underlying spatial trigonal discretization allows a profound comparative analysis of both methods with regard to their mathematical derivations, nodal expansion approaches, solution procedures, and their physical performance. The developed nodal approaches can be regarded as a hybrid NEM/AFEN form. They are based on the transverse-integration procedure, which renders them computationally efficient, and they use a combination of polynomial and exponential functions to represent the neutron flux moments of the SP{sub 3} and diffusion equations, which guarantees high accuracy. The SP{sub 3} equations are derived in within-group form thus being of diffusion type. On this basis, the conventional diffusion solver structure can be retained also for the solution of the SP{sub 3} transport problem. The verification analysis provides proof of the methodological reliability of both trigonal DYN3D models. By means of diverse hexagonal academic benchmark and realistic detailed-geometry full-transport-theory problems, the superiority of the SP{sub 3} transport over the diffusion model is demonstrated in cases with pronounced anisotropy effects, which is, e.g., highly relevant to the modeling of fuel assemblies comprising absorber material.
Many-body orthogonal polynomial systems
International Nuclear Information System (INIS)
Witte, N.S.
1997-03-01
The fundamental methods employed in the moment problem, involving orthogonal polynomial systems, the Lanczos algorithm, continued fraction analysis and Pade approximants has been combined with a cumulant approach and applied to the extensive many-body problem in physics. This has yielded many new exact results for many-body systems in the thermodynamic limit - for the ground state energy, for excited state gaps, for arbitrary ground state avenges - and are of a nonperturbative nature. These results flow from a confluence property of the three-term recurrence coefficients arising and define a general class of many-body orthogonal polynomials. These theorems constitute an analytical solution to the Lanczos algorithm in that they are expressed in terms of the three-term recurrence coefficients α and β. These results can also be applied approximately for non-solvable models in the form of an expansion, in a descending series of the system size. The zeroth order order this expansion is just the manifestation of the central limit theorem in which a Gaussian measure and hermite polynomials arise. The first order represents the first non-trivial order, in which classical distribution functions like the binomial distributions arise and the associated class of orthogonal polynomials are Meixner polynomials. Amongst examples of systems which have infinite order in the expansion are q-orthogonal polynomials where q depends on the system size in a particular way. (author)
Energy Technology Data Exchange (ETDEWEB)
Amlouk, A. [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Boubaker, K., E-mail: mmbb11112000@yahoo.f [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Amlouk, M. [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Bouhafs, M. [Unite de Recherche MA2I, Ecole Nationale d' Ingenieurs de Tunis, B.P. 37 Le Belvedere, 1002 Tunis (Tunisia)
2009-10-19
In this work, ZnO thin films have been grown on glass substrates by using a solution of propanol (C{sub 3}H{sub 8}O), water (H{sub 2}O) and zinc acetate (Z{sub n}(CH{sub 3}CO{sub 2}){sub 2}) in acidified medium (pH 5). The obtained films were n doped with ytterbium (Yb) at the rates of 100, 200 and 300 ppm. The structural features of the doped films were investigated using XRD, atomic force microscopy and scanning electronic microscopy techniques. XRD analysis shows a strong (0 0 2) X-ray diffraction line for increasing Yb-doping amounts. This c-axis preferential orientation of ZnO crystallites is naturally required to use this oxide as transparent conductor in optoelectronic applications. Atomic force microscopy (AFM) analysis shows an enhancement in the surface roughness of the doped ZnO:Yb thin films. Optical measurements were performed in 300-1800 nm domain via transmittance T(lambda) and reflectance R(lambda) spectra. Conjoint optical and thermal properties were deduced from the optical measurements in reference to the Amlouk-Boubaker opto-thermal expansivity psi{sub AB}. Optically relevant ytterbium doping effects have been discussed. Finally, mechanical measurements have been carried out using Vickers standard disposal. The results confirmed the structural and functional changes that several recent studies attributed to ytterbium doping.
Irreducible multivariate polynomials obtained from polynomials in ...
Indian Academy of Sciences (India)
Hall, 1409 W. Green Street, Urbana, IL 61801, USA. E-mail: Nicolae. ... Theorem A. If we write an irreducible polynomial f ∈ K[X] as a sum of polynomials a0,..., an ..... This shows us that deg ai = (n − i) deg f2 for each i = 0,..., n, so min k>0.
Nodal approximations in space and time for neutron kinetics
International Nuclear Information System (INIS)
Grossman, L.M.; Hennart, J.P.
2005-01-01
A general formalism is described of the nodal type in time and space for the neutron kinetics equations. In space, several nodal methods are given of the Raviart-Thomas type (RT0 and RT1), of the Brezzi-Douglas-Marini type (BDM0 and BDM1) and of the Brezzi-Douglas-Fortin-Marini type (BDFM 1). In time, polynomial and analytical approximations are derived. In the analytical case, they are based on the inclusion of an exponential term in the basis function. They can be continuous or discontinuous in time, leading in particular to the well-known Crank-Nicolson, Backward Euler and θ schemes
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)
Branched polynomial covering maps
DEFF Research Database (Denmark)
Hansen, Vagn Lundsgaard
1999-01-01
A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere....
Bai , Shi; Bouvier , Cyril; Kruppa , Alexander; Zimmermann , Paul
2016-01-01
International audience; The general number field sieve (GNFS) is the most efficient algo-rithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be modelled in terms of size and root properties. We propose a new kind of polynomials for GNFS: with a new degree of freedom, we further improve the size property. We demonstrate the efficiency of our algorithm by exhibiting a better polynomial tha...
Global sensitivity analysis by polynomial dimensional decomposition
Energy Technology Data Exchange (ETDEWEB)
Rahman, Sharif, E-mail: rahman@engineering.uiowa.ed [College of Engineering, The University of Iowa, Iowa City, IA 52242 (United States)
2011-07-15
This paper presents a polynomial dimensional decomposition (PDD) method for global sensitivity analysis of stochastic systems subject to independent random input following arbitrary probability distributions. The method involves Fourier-polynomial expansions of lower-variate component functions of a stochastic response by measure-consistent orthonormal polynomial bases, analytical formulae for calculating the global sensitivity indices in terms of the expansion coefficients, and dimension-reduction integration for estimating the expansion coefficients. Due to identical dimensional structures of PDD and analysis-of-variance decomposition, the proposed method facilitates simple and direct calculation of the global sensitivity indices. Numerical results of the global sensitivity indices computed for smooth systems reveal significantly higher convergence rates of the PDD approximation than those from existing methods, including polynomial chaos expansion, random balance design, state-dependent parameter, improved Sobol's method, and sampling-based methods. However, for non-smooth functions, the convergence properties of the PDD solution deteriorate to a great extent, warranting further improvements. The computational complexity of the PDD method is polynomial, as opposed to exponential, thereby alleviating the curse of dimensionality to some extent.
International Nuclear Information System (INIS)
Ferri, A.A.
1986-01-01
Nodal methods applied in order to calculate the power distribution in a nuclear reactor core are presented. These methods have received special attention, because they yield accurate results in short computing times. Present nodal schemes contain several unknowns per node and per group. In the methods presented here, non linear feedback of the coupling coefficients has been applied to reduce this number to only one unknown per node and per group. The resulting algorithm is a 7- points formula, and the iterative process has proved stable in the response matrix scheme. The intranodal flux shape is determined by partial integration of the diffusion equations over two of the coordinates, leading to a set of three coupled one-dimensional equations. These can be solved by using a polynomial approximation or by integration (analytic solution). The tranverse net leakage is responsible for the coupling between the spatial directions, and two alternative methods are presented to evaluate its shape: direct parabolic approximation and local model expansion. Numerical results, which include the IAEA two-dimensional benchmark problem illustrate the efficiency of the developed methods. (M.E.L.) [es
Nodal methods for calculating nuclear reactor transients, control rod patterns, and fuel pin powers
International Nuclear Information System (INIS)
Cho, Byungoh.
1990-01-01
Nodal methods which are used to calculate reactor transients, control rod patterns, and fuel pin powers are investigated. The 3-D nodal code, STORM, has been modified to perform these calculations. Several numerical examples lead to the following conclusions: (1) By employing a thermal leakage-to-absorption ratio (TLAR) approximation for the spatial shape of the thermal fluxes for the 3-D Langenbuch-Maurer-Werner (LMW) and the superprompt critical transient problems, the convergence of the conventional two-group scheme is accelerated. (2) By employing the steepest-ascent hill climbing search with heuristic strategies, Optimum Control Rod Pattern Searcher (OCRPS) is developed for solving control rod positioning problem in BWRs. Using the method of approximation programming the objective function and the nuclear and thermal-hydraulic constraints are modified as heuristic functions that guide the search. The test calculations have demonstrated that, for the first cycle of the Edwin Hatch Unit number-sign 2 reactor, OCRPS shows excellent performance for finding a series of optimum control rod patterns for six burnup steps during the operating cycle. (3) For the modified two-dimensional EPRI-9R problem, the least square second-order polynomial flux expansion method was demonstrated to be computationally about 30 times faster than a fine-mesh finite difference calculation in order to achieve comparable accuracy for pin powers. The basic assumption of this method is that the reconstructed flux can be expressed as a product of an assembly form function and a second-order polynomial function
Branched polynomial covering maps
DEFF Research Database (Denmark)
Hansen, Vagn Lundsgaard
2002-01-01
A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch ...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere. (C) 2001 Elsevier Science B.V. All rights reserved.......A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...
SPANDOM - source projection analytic nodal discrete ordinates method
International Nuclear Information System (INIS)
Kim, Tae Hyeong; Cho, Nam Zin
1994-01-01
We describe a new discrete ordinates nodal method for the two-dimensional transport equation. We solve the discrete ordinates equation analytically after the source term is projected and represented in polynomials. The method is applied to two fast reactor benchmark problems and compared with the TWOHEX code. The results indicate that the present method accurately predicts not only multiplication factor but also flux distribution
Energy Technology Data Exchange (ETDEWEB)
Amlouk, A.; Boubaker, K. [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia); Amlouk, M., E-mail: mmbb11112000@yahoo.f [Unite de physique des dispositifs a semi-conducteurs, Faculte des sciences de Tunis, Universite de Tunis El Manar, 2092 Tunis (Tunisia)
2010-02-04
In this study, SnO{sub 2} thin films have been grown using spray pyrolysis technique on glass substrates under a substrate temperature (T{sub s} = 440 {sup o}C). The precursors were methanol CH{sub 4}O and anhydrous tin tetrachloride. XRD analyses yielded strong (1 1 0)-(1 0 1)-(2 0 0) X-ray diffraction peaks which are characteristics to tetragonal crystals. Atomic Force Microscopy (AFM) analyses showed the existence of clusters with particular pyramidal shapes. The main part of this study concerns the optical measurements of transmittance T({lambda}) and reflectance R({lambda}) spectra inside 250-1800 nm domain. Conjoint optical and thermal properties were deduced using the Amlouk-Boubaker Opto-Thermal Expansivity {psi}{sub AB}. The obtained value: {psi}{sub AB} {approx} 23.4 m{sup 3} s{sup -1} helped situating the performance of the as-grown SnO{sub 2} compound among most known PV-T oxides like ZnO and TiO{sub 2}.
Bzdušek, Tomáš; Wu, QuanSheng; Rüegg, Andreas; Sigrist, Manfred; Soluyanov, Alexey A
2016-10-06
The band theory of solids is arguably the most successful theory of condensed-matter physics, providing a description of the electronic energy levels in various materials. Electronic wavefunctions obtained from the band theory enable a topological characterization of metals for which the electronic spectrum may host robust, topologically protected, fermionic quasiparticles. Many of these quasiparticles are analogues of the elementary particles of the Standard Model, but others do not have a counterpart in relativistic high-energy theories. A complete list of possible quasiparticles in solids is lacking, even in the non-interacting case. Here we describe the possible existence of a hitherto unrecognized type of fermionic excitation in metals. This excitation forms a nodal chain-a chain of connected loops in momentum space-along which conduction and valence bands touch. We prove that the nodal chain is topologically distinct from previously reported excitations. We discuss the symmetry requirements for the appearance of this excitation and predict that it is realized in an existing material, iridium tetrafluoride (IrF 4 ), as well as in other compounds of this class of materials. Using IrF 4 as an example, we provide a discussion of the topological surface states associated with the nodal chain. We argue that the presence of the nodal-chain fermions will result in anomalous magnetotransport properties, distinct from those of materials exhibiting previously known excitations.
Experimental discovery of nodal chains
Yan, Qinghui; Liu, Rongjuan; Yan, Zhongbo; Liu, Boyuan; Chen, Hongsheng; Wang, Zhong; Lu, Ling
2018-05-01
Three-dimensional Weyl and Dirac nodal points1 have attracted widespread interest across multiple disciplines and in many platforms but allow for few structural variations. In contrast, nodal lines2-4 can have numerous topological configurations in momentum space, forming nodal rings5-9, nodal chains10-15, nodal links16-20 and nodal knots21,22. However, nodal lines are much less explored because of the lack of an ideal experimental realization23-25. For example, in condensed-matter systems, nodal lines are often fragile to spin-orbit coupling, located away from the Fermi level, coexist with energy-degenerate trivial bands or have a degeneracy line that disperses strongly in energy. Here, overcoming all these difficulties, we theoretically predict and experimentally observe nodal chains in a metallic-mesh photonic crystal having frequency-isolated linear band-touching rings chained across the entire Brillouin zone. These nodal chains are protected by mirror symmetry and have a frequency variation of less than 1%. We use angle-resolved transmission measurements to probe the projected bulk dispersion and perform Fourier-transformed field scans to map out the dispersion of the drumhead surface state. Our results establish an ideal nodal-line material for further study of topological line degeneracies with non-trivial connectivity and consequent wave dynamics that are richer than those in Weyl and Dirac materials.
Weierstrass polynomials for links
DEFF Research Database (Denmark)
Hansen, Vagn Lundsgaard
1997-01-01
There is a natural way of identifying links in3-space with polynomial covering spaces over thecircle. Thereby any link in 3-space can be definedby a Weierstrass polynomial over the circle. Theequivalence relation for covering spaces over thecircle is, however, completely different from...
Nonnegativity of uncertain polynomials
Directory of Open Access Journals (Sweden)
iljak Dragoslav D.
1998-01-01
Full Text Available The purpose of this paper is to derive tests for robust nonnegativity of scalar and matrix polynomials, which are algebraic, recursive, and can be completed in finite number of steps. Polytopic families of polynomials are considered with various characterizations of parameter uncertainty including affine, multilinear, and polynomic structures. The zero exclusion condition for polynomial positivity is also proposed for general parameter dependencies. By reformulating the robust stability problem of complex polynomials as positivity of real polynomials, we obtain new sufficient conditions for robust stability involving multilinear structures, which can be tested using only real arithmetic. The obtained results are applied to robust matrix factorization, strict positive realness, and absolute stability of multivariable systems involving parameter dependent transfer function matrices.
Polynomial Heisenberg algebras
International Nuclear Information System (INIS)
Carballo, Juan M; C, David J Fernandez; Negro, Javier; Nieto, Luis M
2004-01-01
Polynomial deformations of the Heisenberg algebra are studied in detail. Some of their natural realizations are given by the higher order susy partners (and not only by those of first order, as is already known) of the harmonic oscillator for even-order polynomials. Here, it is shown that the susy partners of the radial oscillator play a similar role when the order of the polynomial is odd. Moreover, it will be proved that the general systems ruled by such kinds of algebras, in the quadratic and cubic cases, involve Painleve transcendents of types IV and V, respectively
Generalizations of orthogonal polynomials
Bultheel, A.; Cuyt, A.; van Assche, W.; van Barel, M.; Verdonk, B.
2005-07-01
We give a survey of recent generalizations of orthogonal polynomials. That includes multidimensional (matrix and vector orthogonal polynomials) and multivariate versions, multipole (orthogonal rational functions) variants, and extensions of the orthogonality conditions (multiple orthogonality). Most of these generalizations are inspired by the applications in which they are applied. We also give a glimpse of these applications, which are usually generalizations of applications where classical orthogonal polynomials also play a fundamental role: moment problems, numerical quadrature, rational approximation, linear algebra, recurrence relations, and random matrices.
Avoided intersections of nodal lines
International Nuclear Information System (INIS)
Monastra, Alejandro G; Smilansky, Uzy; Gnutzmann, Sven
2003-01-01
We consider real eigenfunctions of the Schroedinger operator in 2D. The nodal lines of separable systems form a regular grid, and the number of nodal crossings equals the number of nodal domains. In contrast, for wavefunctions of non-integrable systems nodal intersections are rare, and for random waves, the expected number of intersections in any finite area vanishes. However, nodal lines display characteristic avoided crossings which we study in this work. We define a measure for the avoidance range and compute its distribution for the random wave ensemble. We show that the avoidance range distribution of wavefunctions of chaotic systems follows the expected random wave distributions, whereas for wavefunctions of classically integrable but quantum non-separable systems, the distribution is quite different. Thus, the study of the avoidance distribution provides more support to the conjecture that nodal structures of chaotic systems are reproduced by the predictions of the random wave ensemble
Superiority of legendre polynomials to Chebyshev polynomial in ...
African Journals Online (AJOL)
In this paper, we proved the superiority of Legendre polynomial to Chebyshev polynomial in solving first order ordinary differential equation with rational coefficient. We generated shifted polynomial of Chebyshev, Legendre and Canonical polynomials which deal with solving differential equation by first choosing Chebyshev ...
Polynomial chaos functions and stochastic differential equations
International Nuclear Information System (INIS)
Williams, M.M.R.
2006-01-01
The Karhunen-Loeve procedure and the associated polynomial chaos expansion have been employed to solve a simple first order stochastic differential equation which is typical of transport problems. Because the equation has an analytical solution, it provides a useful test of the efficacy of polynomial chaos. We find that the convergence is very rapid in some cases but that the increased complexity associated with many random variables can lead to very long computational times. The work is illustrated by exact and approximate solutions for the mean, variance and the probability distribution itself. The usefulness of a white noise approximation is also assessed. Extensive numerical results are given which highlight the weaknesses and strengths of polynomial chaos. The general conclusion is that the method is promising but requires further detailed study by application to a practical problem in transport theory
Extended biorthogonal matrix polynomials
Directory of Open Access Journals (Sweden)
Ayman Shehata
2017-01-01
Full Text Available The pair of biorthogonal matrix polynomials for commutative matrices were first introduced by Varma and Tasdelen in [22]. The main aim of this paper is to extend the properties of the pair of biorthogonal matrix polynomials of Varma and Tasdelen and certain generating matrix functions, finite series, some matrix recurrence relations, several important properties of matrix differential recurrence relations, biorthogonality relations and matrix differential equation for the pair of biorthogonal matrix polynomials J(A,B n (x, k and K(A,B n (x, k are discussed. For the matrix polynomials J(A,B n (x, k, various families of bilinear and bilateral generating matrix functions are constructed in the sequel.
Golden, Ryan; Cho, Ilwoo
2015-01-01
In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand generators of the algebras as perturbations. From such perturbations, define injective maps on generators, which induce algebra-monomorphisms (or embeddings) on the algebras. They provide inductive structure theorems on algebras of symmetric polynomials. As...
Chromatic polynomials for simplicial complexes
DEFF Research Database (Denmark)
Møller, Jesper Michael; Nord, Gesche
2016-01-01
In this note we consider s s -chromatic polynomials for finite simplicial complexes. When s=1 s=1 , the 1 1 -chromatic polynomial is just the usual graph chromatic polynomial of the 1 1 -skeleton. In general, the s s -chromatic polynomial depends on the s s -skeleton and its value at r...
International Nuclear Information System (INIS)
Skaali, T.B.
1980-10-01
NODAL is a high level programming language based on FOCAL and SNOBOL4, with some influence from BASIC. The language was developed to operate on the computer network controlling the SPS accelerator at CERN. NODAL is an interpretive language designed for interactive use. This is the most important aspect of the language, and is reflected in its structure. The interactive facilities make it possible to write, debug and modify programs much faster than with compiler based languages like FORTRAN and ALGOL. Apart from a few minor modifications, the basic part of the Oslo University NODAL system does not differ from the CERN version. However, the Oslo University implementation has been expanded with new functions which enable the user to execute many of the SINTRAN III monitor calls from the NODAL level. In particular the most important RT monitor calls have been implemented in this way, a property which renders possible the use of NODAL as a RT program administrator. (JIW)
Energy Technology Data Exchange (ETDEWEB)
Tomasevic, Dj; Altiparmarkov, D [Institut za Nuklearne Nauke Boris Kidric, Belgrade (Yugoslavia)
1988-07-01
A variational nodal diffusion method with accurate treatment of transverse leakage shape is developed and presented in this paper. Using Legendre expansion in transverse coordinates higher order quasi-one-dimensional nodal equations are formulated. Numerical solution has been carried out using analytical solutions in alternating directions assuming Legendre expansion of the RHS term. The method has been tested against 2D and 3D IAEA benchmark problem, as well as 2D CANDU benchmark problem. The results are highly accurate. The first order approximation yields to the same order of accuracy as the standard nodal methods with quadratic leakage approximation, while the second order reaches reference solution. (author)
Colouring and knot polynomials
International Nuclear Information System (INIS)
Welsh, D.J.A.
1991-01-01
These lectures will attempt to explain a connection between the recent advances in knot theory using the Jones and related knot polynomials with classical problems in combinatorics and statistical mechanics. The difficulty of some of these problems will be analysed in the context of their computational complexity. In particular we shall discuss colourings and groups valued flows in graphs, knots and the Jones and Kauffman polynomials, the Ising, Potts and percolation problems of statistical physics, computational complexity of the above problems. (author). 20 refs, 9 figs
Additive and polynomial representations
Krantz, David H; Suppes, Patrick
1971-01-01
Additive and Polynomial Representations deals with major representation theorems in which the qualitative structure is reflected as some polynomial function of one or more numerical functions defined on the basic entities. Examples are additive expressions of a single measure (such as the probability of disjoint events being the sum of their probabilities), and additive expressions of two measures (such as the logarithm of momentum being the sum of log mass and log velocity terms). The book describes the three basic procedures of fundamental measurement as the mathematical pivot, as the utiliz
Space-angle approximations in the variational nodal method
International Nuclear Information System (INIS)
Lewis, E. E.; Palmiotti, G.; Taiwo, T.
1999-01-01
The variational nodal method is formulated such that the angular and spatial approximations maybe examined separately. Spherical harmonic, simplified spherical harmonic, and discrete ordinate approximations are coupled to the primal hybrid finite element treatment of the spatial variables. Within this framework, two classes of spatial trial functions are presented: (1) orthogonal polynomials for the treatment of homogeneous nodes and (2) bilinear finite subelement trial functions for the treatment of fuel assembly sized nodes in which fuel-pin cell cross sections are represented explicitly. Polynomial and subelement trial functions are applied to benchmark water-reactor problems containing MOX fuel using spherical harmonic and simplified spherical harmonic approximations. The resulting accuracy and computing costs are compared
MOSRA-Light; high speed three-dimensional nodal diffusion code for vector computers
Energy Technology Data Exchange (ETDEWEB)
Okumura, Keisuke [Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment
1998-10-01
MOSRA-Light is a three-dimensional neutron diffusion calculation code for X-Y-Z geometry. It is based on the 4th order polynomial nodal expansion method (NEM). As the 4th order NEM is not sensitive to mesh sizes, accurate calculation is possible by the use of coarse meshes of about 20 cm. The drastic decrease of number of unknowns in a 3-dimensional problem results in very fast computation. Furthermore, it employs newly developed computation algorithm `boundary separated checkerboard sweep method` appropriate to vector computers. This method is very efficient because the speedup factor by vectorization increases, as a scale of problem becomes larger. Speed-up factor compared to the scalar calculation is from 20 to 40 in the case of PWR core calculation. Considering the both effects by the vectorization and the coarse mesh method, total speedup factor is more than 1000 as compared with conventional scalar code with the finite difference method. MOSRA-Light can be available on most of vector or scalar computers with the UNIX or it`s similar operating systems (e.g. freeware like Linux). Users can easily install it by the help of the conversation style installer. This report contains the general theory of NEM, the fast computation algorithm, benchmark calculation results and detailed information for usage of this code including input data instructions and sample input data. (author)
MOSRA-Light; high speed three-dimensional nodal diffusion code for vector computers
International Nuclear Information System (INIS)
Okumura, Keisuke
1998-10-01
MOSRA-Light is a three-dimensional neutron diffusion calculation code for X-Y-Z geometry. It is based on the 4th order polynomial nodal expansion method (NEM). As the 4th order NEM is not sensitive to mesh sizes, accurate calculation is possible by the use of coarse meshes of about 20 cm. The drastic decrease of number of unknowns in a 3-dimensional problem results in very fast computation. Furthermore, it employs newly developed computation algorithm 'boundary separated checkerboard sweep method' appropriate to vector computers. This method is very efficient because the speedup factor by vectorization increases, as a scale of problem becomes larger. Speed-up factor compared to the scalar calculation is from 20 to 40 in the case of PWR core calculation. Considering the both effects by the vectorization and the coarse mesh method, total speedup factor is more than 1000 as compared with conventional scalar code with the finite difference method. MOSRA-Light can be available on most of vector or scalar computers with the UNIX or it's similar operating systems (e.g. freeware like Linux). Users can easily install it by the help of the conversation style installer. This report contains the general theory of NEM, the fast computation algorithm, benchmark calculation results and detailed information for usage of this code including input data instructions and sample input data. (author)
On the Laurent polynomial rings
International Nuclear Information System (INIS)
Stefanescu, D.
1985-02-01
We describe some properties of the Laurent polynomial rings in a finite number of indeterminates over a commutative unitary ring. We study some subrings of the Laurent polynomial rings. We finally obtain two cancellation properties. (author)
Computing the Alexander Polynomial Numerically
DEFF Research Database (Denmark)
Hansen, Mikael Sonne
2006-01-01
Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically.......Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically....
Stochastic Estimation via Polynomial Chaos
2015-10-01
AFRL-RW-EG-TR-2015-108 Stochastic Estimation via Polynomial Chaos Douglas V. Nance Air Force Research...COVERED (From - To) 20-04-2015 – 07-08-2015 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Stochastic Estimation via Polynomial Chaos ...This expository report discusses fundamental aspects of the polynomial chaos method for representing the properties of second order stochastic
International Nuclear Information System (INIS)
Oide, Katsunobu.
1982-11-01
A NODAL interpreter which works under CP/M operating system is made for microcomputers. This interpreter language named NODAL-80 has a similar structure to the NODAL of SPS, but its commands, variables, and expressions are modified to increase the flexibility of programming. NODAL-80 also uses a simple intermediate code to make the execution speed fast without imposing any restriction on the dynamic feature of NODAL language. (author)
Polynomial optimization : Error analysis and applications
Sun, Zhao
2015-01-01
Polynomial optimization is the problem of minimizing a polynomial function subject to polynomial inequality constraints. In this thesis we investigate several hierarchies of relaxations for polynomial optimization problems. Our main interest lies in understanding their performance, in particular how
Complex Polynomial Vector Fields
DEFF Research Database (Denmark)
Dias, Kealey
vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...... of parameter spaces into structurally stable domains, and a description of the bifurcations. For this reason, the talk will focus on these questions for complex polynomial vector fields.......The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions...
Roots of the Chromatic Polynomial
DEFF Research Database (Denmark)
Perrett, Thomas
The chromatic polynomial of a graph G is a univariate polynomial whose evaluation at any positive integer q enumerates the proper q-colourings of G. It was introduced in connection with the famous four colour theorem but has recently found other applications in the field of statistical physics...... extend Thomassen’s technique to the Tutte polynomial and as a consequence, deduce a density result for roots of the Tutte polynomial. This partially answers a conjecture of Jackson and Sokal. Finally, we refocus our attention on the chromatic polynomial and investigate the density of chromatic roots...
Polynomials in algebraic analysis
Multarzyński, Piotr
2012-01-01
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \\cite{DPR}. One of the elegant results corresponding with that notion is a purely algebraic version of the Taylor formula, being a generalization of its usual counterpart, well known for functions of one variable. In quantum calculus there are some specific discrete derivations analyzed, which are right invertible linear ...
Quantum Hurwitz numbers and Macdonald polynomials
Harnad, J.
2016-11-01
Parametric families in the center Z(C[Sn]) of the group algebra of the symmetric group are obtained by identifying the indeterminates in the generating function for Macdonald polynomials as commuting Jucys-Murphy elements. Their eigenvalues provide coefficients in the double Schur function expansion of 2D Toda τ-functions of hypergeometric type. Expressing these in the basis of products of power sum symmetric functions, the coefficients may be interpreted geometrically as parametric families of quantum Hurwitz numbers, enumerating weighted branched coverings of the Riemann sphere. Combinatorially, they give quantum weighted sums over paths in the Cayley graph of Sn generated by transpositions. Dual pairs of bases for the algebra of symmetric functions with respect to the scalar product in which the Macdonald polynomials are orthogonal provide both the geometrical and combinatorial significance of these quantum weighted enumerative invariants.
Polynomial chaos representation of databases on manifolds
Energy Technology Data Exchange (ETDEWEB)
Soize, C., E-mail: christian.soize@univ-paris-est.fr [Université Paris-Est, Laboratoire Modélisation et Simulation Multi-Echelle, MSME UMR 8208 CNRS, 5 bd Descartes, 77454 Marne-La-Vallée, Cedex 2 (France); Ghanem, R., E-mail: ghanem@usc.edu [University of Southern California, 210 KAP Hall, Los Angeles, CA 90089 (United States)
2017-04-15
Characterizing the polynomial chaos expansion (PCE) of a vector-valued random variable with probability distribution concentrated on a manifold is a relevant problem in data-driven settings. The probability distribution of such random vectors is multimodal in general, leading to potentially very slow convergence of the PCE. In this paper, we build on a recent development for estimating and sampling from probabilities concentrated on a diffusion manifold. The proposed methodology constructs a PCE of the random vector together with an associated generator that samples from the target probability distribution which is estimated from data concentrated in the neighborhood of the manifold. The method is robust and remains efficient for high dimension and large datasets. The resulting polynomial chaos construction on manifolds permits the adaptation of many uncertainty quantification and statistical tools to emerging questions motivated by data-driven queries.
General Reducibility and Solvability of Polynomial Equations ...
African Journals Online (AJOL)
General Reducibility and Solvability of Polynomial Equations. ... Unlike quadratic, cubic, and quartic polynomials, the general quintic and higher degree polynomials cannot be solved algebraically in terms of finite number of additions, ... Galois Theory, Solving Polynomial Systems, Polynomial factorization, Polynomial Ring ...
Directory of Open Access Journals (Sweden)
Hjalmar Rosengren
2006-12-01
Full Text Available We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian matrices. Using their interpretation as reproducing kernels, we obtain simple proofs of Pfaffian and determinant formulas, as well as Schur polynomial expansions, for such kernels. In subsequent work, these results are applied in combinatorics (enumeration of marked shifted tableaux and number theory (representation of integers as sums of squares.
Hamed Kharrati; Sohrab Khanmohammadi; Witold Pedrycz; Ghasem Alizadeh
2012-01-01
This study presents an improved model and controller for nonlinear plants using polynomial fuzzy model-based (FMB) systems. To minimize mismatch between the polynomial fuzzy model and nonlinear plant, the suitable parameters of membership functions are determined in a systematic way. Defining an appropriate fitness function and utilizing Taylor series expansion, a genetic algorithm (GA) is used to form the shape of membership functions in polynomial forms, which are afterwards used in fuzzy m...
Nodal metastasis in thyroid cancer
International Nuclear Information System (INIS)
Samuel, A.M.
1999-01-01
The biological behavior and hence the prognosis of thyroid cancer (TC) depends among other factors on the extent of spread of the disease outside the thyroid bed. This effect is controversial, especially for nodal metastasis of well differentiated thyroid carcinoma (WDC). Nodal metastasis at the time of initial diagnosis behaves differently depending on the histology, age of the patient, presence of extrathyroidal extension, and the sex of the individual. The type of the surgery, administration of 131 I and thyroxin suppression also to some extent influence the rate of recurrence and mortality. Experience has shown that it is not as innocuous as a small intrathyroidal tumor without any invasion outside the thyroid bed and due consideration should be accorded to the management strategies for handling patients with nodal metastasis
The adjoint variational nodal method
International Nuclear Information System (INIS)
Laurin-Kovitz, K.; Lewis, E.E.
1993-01-01
The widespread use of nodal methods for reactor core calculations in both diffusion and transport approximations has created a demand for the corresponding adjoint solutions as a prerequisite for performing perturbation calculations. With some computational methods, however, the solution of the adjoint problem presents a difficulty; the physical adjoint obtained by discretizing the adjoint equation is not the same as the mathematical adjoint obtained by taking the transpose of the coefficient matrix, which results from the discretization of the forward equation. This difficulty arises, in particular, when interface current nodal methods based on quasi-one-dimensional solution of the diffusion or transport equation are employed. The mathematical adjoint is needed to perform perturbation calculations. The utilization of existing nodal computational algorithms, however, requires the physical adjoint. As a result, similarity transforms or related techniques must be utilized to relate physical and mathematical adjoints. Thus far, such techniques have been developed only for diffusion theory
The application of modern nodal methods to PWR reactor physics analysis
International Nuclear Information System (INIS)
Knight, M.P.
1988-06-01
The objective of this research is to develop efficient computational procedures for PWR reactor calculations, based on modern nodal methods. The analytic nodal method, which is characterised by the use of exact exponential expansions in transverse-integrated equations, is implemented within an existing finite-difference code. This shows considerable accuracy and efficiency on standard benchmark problems, very much in line with existing experience with nodal methods., Assembly powers can be calculated to within 2.0% with just one mesh per assembly. (author)
Building the nodal nuclear data dependences in a many-dimensional state-variable space
International Nuclear Information System (INIS)
Dufek, Jan
2011-01-01
Highlights: → The Abstract and Introduction are revised to reflect reviewers' comments. → Section is revised and simplified. → The third paragraph in Section is revised. → All typos are fixed. - Abstract: We present new methods for building the polynomial-regression based nodal nuclear data models. The data models can reflect dependences on a large number of state variables, and they can consider various history effects. Suitable multivariate polynomials that approximate the nodal data dependences are identified efficiently in an iterative manner. The history effects are analysed using a new sampling scheme for lattice calculations where the traditional base burnup and branch calculations are replaced by a large number of diverse burnup histories. The total number of lattice calculations is controlled so that the data models are built to a required accuracy.
A study of the literature on nodal methods in reactor physics calculations
International Nuclear Information System (INIS)
Van de Wetering, T.F.H.
1993-01-01
During the last few decades several calculation methods have been developed for the three-dimensional analysis of a reactor core. A literature survey was carried out to gain insights in the starting points and method of operation of the advanced nodal methods. These methods are applied in reactor core analyses of large nuclear power reactors, because of their high computing speed. The so-called Nodal-Expansion method is described in detail
Polynomial approximation on polytopes
Totik, Vilmos
2014-01-01
Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.
International Nuclear Information System (INIS)
Milks, Matthew M; Guise, Hubert de
2005-01-01
The construction of su(2) intelligent states is simplified using a polynomial representation of su(2). The cornerstone of the new construction is the diagonalization of a 2 x 2 matrix. The method is sufficiently simple to be easily extended to su(3), where one is required to diagonalize a single 3 x 3 matrix. For two perfectly general su(3) operators, this diagonalization is technically possible but the procedure loses much of its simplicity owing to the algebraic form of the roots of a cubic equation. Simplified expressions can be obtained by specializing the choice of su(3) operators. This simpler construction will be discussed in detail
The Kauffman bracket and the Jones polynomial in quantum gravity
International Nuclear Information System (INIS)
Griego, J.
1996-01-01
In the loop representation the quantum states of gravity are given by knot invariants. From general arguments concerning the loop transform of the exponential of the Chern-Simons form, a certain expansion of the Kauffman bracket knot polynomial can be formally viewed as a solution of the Hamiltonian constraint with a cosmological constant in the loop representation. The Kauffman bracket is closely related to the Jones polynomial. In this paper the operation of the Hamiltonian on the power expansions of the Kauffman bracket and Jones polynomials is analyzed. It is explicitly shown that the Kauffman bracket is a formal solution of the Hamiltonian constraint to third order in the cosmological constant. We make use of the extended loop representation of quantum gravity where the analytic calculation can be thoroughly accomplished. Some peculiarities of the extended loop calculus are considered and the significance of the results to the case of the conventional loop representation is discussed. (orig.)
International Nuclear Information System (INIS)
Noh, J. M.; Yoo, J. W.; Joo, H. K.
2004-01-01
In this study, we invented a method of component decomposition to derive the systematic inter-nodal coupled equations of the refined AFEN method and developed an object oriented nodal code to solve the derived coupled equations. The method of component decomposition decomposes the intra-nodal flux expansion of a nodal method into even and odd components in three dimensions to reduce the large coupled linear system equation into several small single equations. This method requires no additional technique to accelerate the iteration process to solve the inter-nodal coupled equations, since the derived equations can automatically act as the coarse mesh re-balance equations. By utilizing the object oriented programming concepts such as abstraction, encapsulation, inheritance and polymorphism, dynamic memory allocation, and operator overloading, we developed an object oriented nodal code that can facilitate the input/output and the dynamic control of the memories, and can make the maintenance easy. (authors)
An efficient coupled polynomial interpolation scheme for shear mode sandwich beam finite element
Directory of Open Access Journals (Sweden)
Litesh N. Sulbhewar
Full Text Available An efficient piezoelectric sandwich beam finite element is presented here. It employs the coupled polynomial field interpolation scheme for field variables which incorporates electromechanical coupling at interpolation level itself; unlike conventional sandwich beam theory (SBT based formulations available in the literature. A variational formulation is used to derive the governing equations, which are used to establish the relationships between field variables. These relations lead to the coupled polynomial field descriptions of variables, unlike conventional SBT formulations which use assumed independent polynomials. The relative axial displacement is expressed only by coupled terms containing contributions from other mechanical and electrical variables, thus eliminating use of the transverse displacement derivative as a degree of freedom. A set of coupled shape function based on these polynomials has shown the improvement in the convergence characteristics of the SBT based formulation. This improvement in the performance is achieved with one nodal degree of freedom lesser than the conventional SBT formulations.
Nodal in computerized control systems of accelerators
International Nuclear Information System (INIS)
Kagarmanov, A.A.; Koval'tsov, V.I.; Korobov, S.A.
1994-01-01
Brief description of the Nodal language programming structure is presented. Its possibilities as high-level programming language for accelerator control systems are considered. The status of the Nodal language in the HEPI is discussed. 3 refs
QCD analysis of structure functions in terms of Jacobi polynomials
International Nuclear Information System (INIS)
Krivokhizhin, V.G.; Kurlovich, S.P.; Savin, I.A.; Sidorov, A.V.; Skachkov, N.B.; Sanadze, V.V.
1987-01-01
A new method of QCD-analysis of singlet and nonsinglet structure functions based on their expansion in orthogonal Jacobi polynomials is proposed. An accuracy of the method is studied and its application is demonstrated using the structure function F 2 (x,Q 2 ) obtained by the EMC Collaboration from measurements with an iron target. (orig.)
A variational synthesis nodal discrete ordinates method
International Nuclear Information System (INIS)
Favorite, J.A.; Stacey, W.M.
1999-01-01
A self-consistent nodal approximation method for computing discrete ordinates neutron flux distributions has been developed from a variational functional for neutron transport theory. The advantage of the new nodal method formulation is that it is self-consistent in its definition of the homogenized nodal parameters, the construction of the global nodal equations, and the reconstruction of the detailed flux distribution. The efficacy of the method is demonstrated by two-dimensional test problems
Complex Polynomial Vector Fields
DEFF Research Database (Denmark)
The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions...... or meromorphic (allowing poles as singularities) functions. There already exists a well-developed theory for iterative holomorphic dynamical systems, and successful relations found between iteration theory and flows of vector fields have been one of the main motivations for the recent interest in holomorphic...... vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...
Polynomial methods in combinatorics
Guth, Larry
2016-01-01
This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdős's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book. Some of the greatest advances in geometric combinatorics and harmonic analysis in recent years have been accompl...
Polynomial representations of GLn
Green, James A; Erdmann, Karin
2007-01-01
The first half of this book contains the text of the first edition of LNM volume 830, Polynomial Representations of GLn. This classic account of matrix representations, the Schur algebra, the modular representations of GLn, and connections with symmetric groups, has been the basis of much research in representation theory. The second half is an Appendix, and can be read independently of the first. It is an account of the Littelmann path model for the case gln. In this case, Littelmann's 'paths' become 'words', and so the Appendix works with the combinatorics on words. This leads to the repesentation theory of the 'Littelmann algebra', which is a close analogue of the Schur algebra. The treatment is self- contained; in particular complete proofs are given of classical theorems of Schensted and Knuth.
Polynomial representations of GLN
Green, James A
1980-01-01
The first half of this book contains the text of the first edition of LNM volume 830, Polynomial Representations of GLn. This classic account of matrix representations, the Schur algebra, the modular representations of GLn, and connections with symmetric groups, has been the basis of much research in representation theory. The second half is an Appendix, and can be read independently of the first. It is an account of the Littelmann path model for the case gln. In this case, Littelmann's 'paths' become 'words', and so the Appendix works with the combinatorics on words. This leads to the repesentation theory of the 'Littelmann algebra', which is a close analogue of the Schur algebra. The treatment is self- contained; in particular complete proofs are given of classical theorems of Schensted and Knuth.
Optimization over polynomials : Selected topics
Laurent, M.; Jang, Sun Young; Kim, Young Rock; Lee, Dae-Woong; Yie, Ikkwon
2014-01-01
Minimizing a polynomial function over a region defined by polynomial inequalities models broad classes of hard problems from combinatorics, geometry and optimization. New algorithmic approaches have emerged recently for computing the global minimum, by combining tools from real algebra (sums of
International Nuclear Information System (INIS)
Al-Chalabi, R.M.; Turinsky, P.J.; Faure, F.-X.; Sarsour, H.N.; Engrand, P.R.
1993-01-01
The NESTLE nodal kinetics code has been developed for utilization as a stand-alone code for steady-state and transient reactor neutronic analysis and for incorporation into system transient codes, such as TRAC and RELAP. The latter is desirable to increase the simulation fidelity over that obtained from currently employed zero- and one-dimensional neutronic models and now feasible due to advances in computer performance and efficiency of nodal methods. As a stand-alone code, requirements are that it operate on a range of computing platforms from memory-limited personal computers (PCs) to supercomputers with vector processors. This paper summarizes the features of NESTLE that reflect the utilization and requirements just noted
The variational nodal method: history and recent accomplishments
International Nuclear Information System (INIS)
Lewis, E.E.
2004-01-01
The variational nodal method combines spherical harmonics expansions in angle with hybrid finite element techniques is space to obtain multigroup transport response matrix algorithms applicable to both deep penetration and reactor core physics problems. This survey briefly recounts the method's history and reviews its capabilities. The variational basis for the approach is presented and two methods for obtaining discretized equations in the form of response matrices are detailed. The first is that contained the widely used VARIANT code, while the second incorporates newly developed integral transport techniques into the variational nodal framework. The two approaches are combined with a finite sub element formulation to treat heterogeneous nodes. Applications are presented for both a deep penetration problem and to an OECD benchmark consisting of LWR MOX fuel assemblies. Ongoing work is discussed. (Author)
The variational nodal method: some history and recent activity
International Nuclear Information System (INIS)
Lewis, E.E.; Smith, M.A.; Palmiotti, G.
2005-01-01
The variational nodal method combines spherical harmonics expansions in angle with hybrid finite element techniques in space to obtain multigroup transport response matrix algorithms applicable to a wide variety of reactor physics problems. This survey briefly recounts the method's history and reviews its capabilities. Two methods for obtaining discretized equations in the form of response matrices are compared. The first is that contained the widely used VARIANT code, while the second incorporates more recently developed integral transport techniques into the variational nodal framework. The two approaches are combined with a finite sub-element formulation to treat heterogeneous nodes. Results are presented for application to a deep penetration problem and to an OECD benchmark consisting of LWR Mox fuel assemblies. Ongoing work is discussed. (authors)
Nodal lymphomas of the abdomen
International Nuclear Information System (INIS)
Bruneton, J.N.; Caramella, E.; Manzino, J.J.
1986-01-01
Modern imaging modalities have greatly contributed to current knowledge about intra-abdominal nodal lymphomas. Since both intra and retroperitoneal node involvement can be demonstrated by computed tomography (CT) and ultrasonography, it seems legitimate to treat these two sites together in the same chapter, particularly since the older separation between intraperitoneal and retroperitoneal nodal disease was based to a large degree on the limitations of lymphography. Hodgkin's disease (HD) has benefited less from recent technological advances. The diversity in the incidence of nodal involvement between HD and NHL, the diagnostic capabilities of modern imaging techniques, and the histopathological features of lymphomatous non-Hodgkin and Hodgkin nodes, justify adoption of an investigatory approach which takes all of these factors into account. Details of this investigative strategy are discussed in this paper following a review of available imaging modalities. In current practice, the four main methods for the exploration of abdominal lymph nodes are lymphography, ultrasonography, CT, and radionuclide studies. The first three techniques are also utilized to guide biopsies for staging purposes and for the evaluation of response to treatment
International Nuclear Information System (INIS)
Peng Hong Liem; Surian Pinem; Tagor Malem Sembiring; Tran Hoai Nam
2015-01-01
A coupled neutronics thermal-hydraulics code NODAL3 has been developed based on the nodal few-group neutron diffusion theory in 3-dimensional Cartesian geometry for a typical pressurized water reactor (PWR) static and transient analyses, especially for reactivity initiated accidents (RIA). The spatial variables are treated by using a polynomial nodal method (PNM) while for the neutron dynamic solver the adiabatic and improved quasi-static methods are adopted. A simple single channel thermal-hydraulics module and its steam table is implemented into the code. Verification works on static and transient benchmarks are being conducting to assess the accuracy of the code. For the static benchmark verification, the IAEA-2D, IAEA-3D, BIBLIS and KOEBERG light water reactor (LWR) benchmark problems were selected, while for the transient benchmark verification, the OECD NEACRP 3-D LWR Core Transient Benchmark and NEA-NSC 3-D/1-D PWR Core Transient Benchmark (Uncontrolled Withdrawal of Control Rods at Zero Power). Excellent agreement of the NODAL3 results with the reference solutions and other validated nodal codes was confirmed. (author)
An Adaptive Approach to Variational Nodal Diffusion Problems
International Nuclear Information System (INIS)
Zhang Hui; Lewis, E.E.
2001-01-01
An adaptive grid method is presented for the solution of neutron diffusion problems in two dimensions. The primal hybrid finite elements employed in the variational nodal method are used to reduce the diffusion equation to a coupled set of elemental response matrices. An a posteriori error estimator is developed to indicate the magnitude of local errors stemming from the low-order elemental interface approximations. An iterative procedure is implemented in which p refinement is applied locally by increasing the polynomial order of the interface approximations. The automated algorithm utilizes the a posteriori estimator to achieve local error reductions until an acceptable level of accuracy is reached throughout the problem domain. Application to a series of X-Y benchmark problems indicates the reduction of computational effort achievable by replacing uniform with adaptive refinement of the spatial approximations
On generalized Fibonacci and Lucas polynomials
Energy Technology Data Exchange (ETDEWEB)
Nalli, Ayse [Department of Mathematics, Faculty of Sciences, Selcuk University, 42075 Campus-Konya (Turkey)], E-mail: aysenalli@yahoo.com; Haukkanen, Pentti [Department of Mathematics, Statistics and Philosophy, 33014 University of Tampere (Finland)], E-mail: mapehau@uta.fi
2009-12-15
Let h(x) be a polynomial with real coefficients. We introduce h(x)-Fibonacci polynomials that generalize both Catalan's Fibonacci polynomials and Byrd's Fibonacci polynomials and also the k-Fibonacci numbers, and we provide properties for these h(x)-Fibonacci polynomials. We also introduce h(x)-Lucas polynomials that generalize the Lucas polynomials and present properties of these polynomials. In the last section we introduce the matrix Q{sub h}(x) that generalizes the Q-matrix whose powers generate the Fibonacci numbers.
Energy Technology Data Exchange (ETDEWEB)
Hernandez M, N. [CFE, Carretera Cardel-Nautla Km. 43.5, 91680 Veracruz (Mexico); Alonso V, G.; Valle G, E. del [IPN-ESFM, 07738 Mexico D.F. (Mexico)]. e-mail: nhmiranda@mexico.com
2003-07-01
In 1979, Hennart and collaborators applied several schemes of classic finite element in the numerical solution of the diffusion equations in X Y geometry and stationary state. Almost two decades then, in 1996, himself and other collaborators carried out a similar work but using nodal schemes type finite element. Continuing in this last direction, in this work a group it is described a set of several Hybrid Nodal schemes denominated (NH) as well as their application to solve the diffusion equations in multigroup in stationary state and X Y geometry. The term hybrid nodal it means that such schemes interpolate not only Legendre moments of face and of cell but also the values of the scalar flow of neutrons in the four corners of each cell or element of the spatial discretization of the domain of interest. All the schemes here considered are polynomials like they were it their predecessors. Particularly, its have developed and applied eight different hybrid nodal schemes that its are very nearby related with those developed by Hennart and collaborators in the past. It is treated of schemes in those that nevertheless that decreases the number of interpolation parameters it is conserved the accurate in relation to the bi-quadratic and bi-cubic schemes. Of these eight, three were described and applied in a previous work. It is the bi-lineal classic scheme as well as the hybrid nodal schemes, bi-quadratic and bi-cubic for that here only are described the other 5 hybrid nodal schemes although they are provided numerical results for several test problems with all them. (Author)
Parallel Construction of Irreducible Polynomials
DEFF Research Database (Denmark)
Frandsen, Gudmund Skovbjerg
Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic circuits over the finite prime field GF(p) of depth O(log^k (n + p)) and size polynomial in (n + p). We show that the problem of constructing an irreducible polynomial of specified degree over GF(p) ...... of polynomials is in arithmetic NC^3. Our algorithm works over any field and compared to other known algorithms it does not assume the ability to take p'th roots when the field has characteristic p....
Julia Sets of Orthogonal Polynomials
DEFF Research Database (Denmark)
Christiansen, Jacob Stordal; Henriksen, Christian; Petersen, Henrik Laurberg
2018-01-01
For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials fPng to properties of the support. More precisely we relate the Julia set of Pn to the outer boundary of the support, the lled Julia...... set to the polynomial convex hull K of the support, and the Green's function associated with Pn to the Green's function for the complement of K....
An introduction to orthogonal polynomials
Chihara, Theodore S
1978-01-01
Assuming no further prerequisites than a first undergraduate course in real analysis, this concise introduction covers general elementary theory related to orthogonal polynomials. It includes necessary background material of the type not usually found in the standard mathematics curriculum. Suitable for advanced undergraduate and graduate courses, it is also appropriate for independent study. Topics include the representation theorem and distribution functions, continued fractions and chain sequences, the recurrence formula and properties of orthogonal polynomials, special functions, and some
Scattering theory and orthogonal polynomials
International Nuclear Information System (INIS)
Geronimo, J.S.
1977-01-01
The application of the techniques of scattering theory to the study of polynomials orthogonal on the unit circle and a finite segment of the real line is considered. The starting point is the recurrence relations satisfied by the polynomials instead of the orthogonality condition. A set of two two terms recurrence relations for polynomials orthogonal on the real line is presented and used. These recurrence relations play roles analogous to those satisfied by polynomials orthogonal on unit circle. With these recurrence formulas a Wronskian theorem is proved and the Christoffel-Darboux formula is derived. In scattering theory a fundamental role is played by the Jost function. An analogy is deferred of this function and its analytic properties and the locations of its zeros investigated. The role of the analog Jost function in various properties of these orthogonal polynomials is investigated. The techniques of inverse scattering theory are also used. The discrete analogues of the Gelfand-Levitan and Marchenko equations are derived and solved. These techniques are used to calculate asymptotic formulas for the orthogonal polynomials. Finally Szego's theorem on toeplitz and Hankel determinants is proved using the recurrence formulas and some properties of the Jost function. The techniques of inverse scattering theory are used to calculate the correction terms
Bannai-Ito polynomials and dressing chains
Derevyagin, Maxim; Tsujimoto, Satoshi; Vinet, Luc; Zhedanov, Alexei
2012-01-01
Schur-Delsarte-Genin (SDG) maps and Bannai-Ito polynomials are studied. SDG maps are related to dressing chains determined by quadratic algebras. The Bannai-Ito polynomials and their kernel polynomials -- the complementary Bannai-Ito polynomials -- are shown to arise in the framework of the SDG maps.
Birth-death processes and associated polynomials
van Doorn, Erik A.
2003-01-01
We consider birth-death processes on the nonnegative integers and the corresponding sequences of orthogonal polynomials called birth-death polynomials. The sequence of associated polynomials linked with a sequence of birth-death polynomials and its orthogonalizing measure can be used in the analysis
SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
Energy Technology Data Exchange (ETDEWEB)
Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; Belkouchi, B.; Montomoli, F.
2016-09-01
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5
SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
International Nuclear Information System (INIS)
Ahlfeld, R.; Belkouchi, B.; Montomoli, F.
2016-01-01
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10
On Multiple Polynomials of Capelli Type
Directory of Open Access Journals (Sweden)
S.Y. Antonov
2016-03-01
Full Text Available This paper deals with the class of Capelli polynomials in free associative algebra F{Z} (where F is an arbitrary field, Z is a countable set generalizing the construction of multiple Capelli polynomials. The fundamental properties of the introduced Capelli polynomials are provided. In particular, decomposition of the Capelli polynomials by means of the same type of polynomials is shown. Furthermore, some relations between their T -ideals are revealed. A connection between double Capelli polynomials and Capelli quasi-polynomials is established.
International Nuclear Information System (INIS)
Delfin L, A.
1996-01-01
The purpose of this work is to solve the neutron transport equation in discrete-ordinates and X-Y geometry by developing and using the strong discontinuous and strong modified discontinuous nodal finite element schemes. The strong discontinuous and modified strong discontinuous nodal finite element schemes go from two to ten interpolation parameters per cell. They are describing giving a set D c and polynomial space S c corresponding for each scheme BDMO, RTO, BL, BDM1, HdV, BDFM1, RT1, BQ and BDM2. The solution is obtained solving the neutron transport equation moments for each nodal scheme by developing the basis functions defined by Pascal triangle and the Legendre moments giving in the polynomial space S c and, finally, looking for the non singularity of the resulting linear system. The linear system is numerically solved using a computer program for each scheme mentioned . It uses the LU method and forward and backward substitution and makes a partition of the domain in cells. The source terms and angular flux are calculated, using the directions and weights associated to the S N approximation and solving the angular flux moments to find the effective multiplication constant. The programs are written in Fortran language, using the dynamic allocation of memory to increase efficiently the available memory of the computing equipment. (Author)
Applications of a systematic homogenization theory for nodal diffusion methods
International Nuclear Information System (INIS)
Zhang, Hong-bin; Dorning, J.J.
1992-01-01
The authors recently have developed a self-consistent and systematic lattice cell and fuel bundle homogenization theory based on a multiple spatial scales asymptotic expansion of the transport equation in the ratio of the mean free path to the reactor characteristics dimension for use with nodal diffusion methods. The mathematical development leads naturally to self-consistent analytical expressions for homogenized diffusion coefficients and cross sections and flux discontinuity factors to be used in nodal diffusion calculations. The expressions for the homogenized nuclear parameters that follow from the systematic homogenization theory (SHT) are different from those for the traditional flux and volume-weighted (FVW) parameters. The calculations summarized here show that the systematic homogenization theory developed recently for nodal diffusion methods yields accurate values for k eff and assembly powers even when compared with the results of a fine mesh transport calculation. Thus, it provides a practical alternative to equivalence theory and GET (Ref. 3) and to simplified equivalence theory, which requires auxiliary fine-mesh calculations for assemblies embedded in a typical environment to determine the discontinuity factors and the equivalent diffusion coefficient for a homogenized assembly
Uniform approximations of Bernoulli and Euler polynomials in terms of hyperbolic functions
J.L. López; N.M. Temme (Nico)
1998-01-01
textabstractBernoulli and Euler polynomials are considered for large values of the order. Convergent expansions are obtained for $B_n(nz+1/2)$ and $E_n(nz+1/2)$ in powers of $n^{-1$, with coefficients being rational functions of $z$ and hyperbolic functions of argument $1/2z$. These expansions are
Directory of Open Access Journals (Sweden)
Tagor Malem Sembiring
2017-01-01
Full Text Available The in-house coupled neutronic and thermal-hydraulic (N/T-H code of BATAN (National Nuclear Energy Agency of Indonesia, NODAL3, based on the few-group neutron diffusion equation in 3-dimensional geometry using the polynomial nodal method, has been verified with static and transient PWR benchmark cases. This paper reports the verification of NODAL3 code in the NEA-NSC PWR uncontrolled control rods withdrawal at zero power benchmark. The objective of this paper is to determine the accuracy of NODAL3 code in solving the continuously slow and fast reactivity insertions due to single and group of control rod bank withdrawn while the power and temperature increment are limited by the Doppler coefficient. The benchmark is chosen since many organizations participated using various methods and approximations, so the calculation results of NODAL3 can be compared to other codes’ results. The calculated parameters are performed for the steady-state, transient core averaged, and transient hot pellet results. The influence of radial and axial nodes number was investigated for all cases. The results of NODAL3 code are in very good agreement with the reference solutions if the radial and axial nodes number is 2 × 2 and 2 × 18 (total axial layers, respectively.
Chromatic polynomials of random graphs
International Nuclear Information System (INIS)
Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian
2010-01-01
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.
Cosmographic analysis with Chebyshev polynomials
Capozziello, Salvatore; D'Agostino, Rocco; Luongo, Orlando
2018-05-01
The limits of standard cosmography are here revised addressing the problem of error propagation during statistical analyses. To do so, we propose the use of Chebyshev polynomials to parametrize cosmic distances. In particular, we demonstrate that building up rational Chebyshev polynomials significantly reduces error propagations with respect to standard Taylor series. This technique provides unbiased estimations of the cosmographic parameters and performs significatively better than previous numerical approximations. To figure this out, we compare rational Chebyshev polynomials with Padé series. In addition, we theoretically evaluate the convergence radius of (1,1) Chebyshev rational polynomial and we compare it with the convergence radii of Taylor and Padé approximations. We thus focus on regions in which convergence of Chebyshev rational functions is better than standard approaches. With this recipe, as high-redshift data are employed, rational Chebyshev polynomials remain highly stable and enable one to derive highly accurate analytical approximations of Hubble's rate in terms of the cosmographic series. Finally, we check our theoretical predictions by setting bounds on cosmographic parameters through Monte Carlo integration techniques, based on the Metropolis-Hastings algorithm. We apply our technique to high-redshift cosmic data, using the Joint Light-curve Analysis supernovae sample and the most recent versions of Hubble parameter and baryon acoustic oscillation measurements. We find that cosmography with Taylor series fails to be predictive with the aforementioned data sets, while turns out to be much more stable using the Chebyshev approach.
International Nuclear Information System (INIS)
Shih, Helen A.; Harisinghani, Mukesh; Zietman, Anthony L.; Wolfgang, John A.; Saksena, Mansi; Weissleder, Ralph
2005-01-01
Purpose: Toxicity from pelvic irradiation could be reduced if fields were limited to likely areas of nodal involvement rather than using the standard 'four-field box.' We employed a novel magnetic resonance lymphangiographic technique to highlight the likely sites of occult nodal metastasis from prostate cancer. Methods and Materials: Eighteen prostate cancer patients with pathologically confirmed node-positive disease had a total of 69 pathologic nodes identifiable by lymphotropic nanoparticle-enhanced MRI and semiquantitative nodal analysis. Fourteen of these nodes were in the para-aortic region, and 55 were in the pelvis. The position of each of these malignant nodes was mapped to a common template based on its relation to skeletal or vascular anatomy. Results: Relative to skeletal anatomy, nodes covered a diffuse volume from the mid lumbar spine to the superior pubic ramus and along the sacrum and pelvic side walls. In contrast, the nodal metastases mapped much more tightly relative to the large pelvic vessels. A proposed pelvic clinical target volume to encompass the region at greatest risk of containing occult nodal metastases would include a 2.0-cm radial expansion volume around the distal common iliac and proximal external and internal iliac vessels that would encompass 94.5% of the pelvic nodes at risk as defined by our node-positive prostate cancer patient cohort. Conclusions: Nodal metastases from prostate cancer are largely localized along the major pelvic vasculature. Defining nodal radiation treatment portals based on vascular rather than bony anatomy may allow for a significant decrease in normal pelvic tissue irradiation and its associated toxicities
The Nudo, Rollo, Melon codes and nodal correlations
International Nuclear Information System (INIS)
Perlado, J.M.; Aragones, J.M.; Minguez, E.; Pena, J.
1975-01-01
Analysis of nodal calculation and checking results by the reference reactor experimental data. Nudo code description, adapting experimental data to nodal calculations. Rollo, Melon codes as improvement in the cycle life calculations of albedos, mixing parameters and nodal correlations. (author)
Hybrid nodal methods in the solution of the diffusion equations in X Y geometry
International Nuclear Information System (INIS)
Hernandez M, N.; Alonso V, G.; Valle G, E. del
2003-01-01
In 1979, Hennart and collaborators applied several schemes of classic finite element in the numerical solution of the diffusion equations in X Y geometry and stationary state. Almost two decades then, in 1996, himself and other collaborators carried out a similar work but using nodal schemes type finite element. Continuing in this last direction, in this work a group it is described a set of several Hybrid Nodal schemes denominated (NH) as well as their application to solve the diffusion equations in multigroup in stationary state and X Y geometry. The term hybrid nodal it means that such schemes interpolate not only Legendre moments of face and of cell but also the values of the scalar flow of neutrons in the four corners of each cell or element of the spatial discretization of the domain of interest. All the schemes here considered are polynomials like they were it their predecessors. Particularly, its have developed and applied eight different hybrid nodal schemes that its are very nearby related with those developed by Hennart and collaborators in the past. It is treated of schemes in those that nevertheless that decreases the number of interpolation parameters it is conserved the accurate in relation to the bi-quadratic and bi-cubic schemes. Of these eight, three were described and applied in a previous work. It is the bi-lineal classic scheme as well as the hybrid nodal schemes, bi-quadratic and bi-cubic for that here only are described the other 5 hybrid nodal schemes although they are provided numerical results for several test problems with all them. (Author)
Heterogeneous treatment in the variational nodal method
International Nuclear Information System (INIS)
Fanning, T.H.
1995-01-01
The variational nodal transport method is reduced to its diffusion form and generalized for the treatment of heterogeneous nodes while maintaining nodal balances. Adapting variational methods to heterogeneous nodes requires the ability to integrate over a node with discontinuous cross sections. In this work, integrals are evaluated using composite gaussian quadrature rules, which permit accurate integration while minimizing computing time. Allowing structure within a nodal solution scheme avoids some of the necessity of cross section homogenization, and more accurately defines the intra-nodal flux shape. Ideally, any desired heterogeneity can be constructed within the node; but in reality, the finite set of basis functions limits the practical resolution to which fine detail can be defined within the node. Preliminary comparison tests show that the heterogeneous variational nodal method provides satisfactory results even if some improvements are needed for very difficult, configurations
Directory of Open Access Journals (Sweden)
Hamed Kharrati
2012-01-01
Full Text Available This study presents an improved model and controller for nonlinear plants using polynomial fuzzy model-based (FMB systems. To minimize mismatch between the polynomial fuzzy model and nonlinear plant, the suitable parameters of membership functions are determined in a systematic way. Defining an appropriate fitness function and utilizing Taylor series expansion, a genetic algorithm (GA is used to form the shape of membership functions in polynomial forms, which are afterwards used in fuzzy modeling. To validate the model, a controller based on proposed polynomial fuzzy systems is designed and then applied to both original nonlinear plant and fuzzy model for comparison. Additionally, stability analysis for the proposed polynomial FMB control system is investigated employing Lyapunov theory and a sum of squares (SOS approach. Moreover, the form of the membership functions is considered in stability analysis. The SOS-based stability conditions are attained using SOSTOOLS. Simulation results are also given to demonstrate the effectiveness of the proposed method.
Polynomial weights and code constructions
DEFF Research Database (Denmark)
Massey, J; Costello, D; Justesen, Jørn
1973-01-01
polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm.......For any nonzero elementcof a general finite fieldGF(q), it is shown that the polynomials(x - c)^i, i = 0,1,2,cdots, have the "weight-retaining" property that any linear combination of these polynomials with coefficients inGF(q)has Hamming weight at least as great as that of the minimum degree...
Orthogonal Polynomials and Special Functions
Assche, Walter
2003-01-01
The set of lectures from the Summer School held in Leuven in 2002 provide an up-to-date account of recent developments in orthogonal polynomials and special functions, in particular for algorithms for computer algebra packages, 3nj-symbols in representation theory of Lie groups, enumeration, multivariable special functions and Dunkl operators, asymptotics via the Riemann-Hilbert method, exponential asymptotics and the Stokes phenomenon. The volume aims at graduate students and post-docs working in the field of orthogonal polynomials and special functions, and in related fields interacting with orthogonal polynomials, such as combinatorics, computer algebra, asymptotics, representation theory, harmonic analysis, differential equations, physics. The lectures are self-contained requiring only a basic knowledge of analysis and algebra, and each includes many exercises.
Sraj, Ihab; Le Maî tre, Olivier P.; Knio, Omar; Hoteit, Ibrahim
2015-01-01
using a coordinate transformation to account for the dependence with respect to the covariance hyper-parameters. Polynomial Chaos expansions are employed for the acceleration of the Bayesian inference using similar coordinate transformations, enabling us
International Nuclear Information System (INIS)
Palmiotti, G.; Carrico, C.B.; Lewis, E.E.
1995-10-01
The theoretical basis, implementation information and numerical results are presented for VARIANT (VARIational Anisotropic Neutron Transport), a FORTRAN module of the DIF3D code system at Argonne National Laboratory. VARIANT employs the variational nodal method to solve multigroup steady-state neutron diffusion and transport problems. The variational nodal method is a hybrid finite element method that guarantees nodal balance and permits spatial refinement through the use of hierarchical complete polynomial trial functions. Angular variables are expanded with complete or simplified P 1 , P 3 or P 5 5 spherical harmonics approximations with full anisotropic scattering capability. Nodal response matrices are obtained, and the within-group equations are solved by red-black or four-color iteration, accelerated by a partitioned matrix algorithm. Fission source and upscatter iterations strategies follow those of DIF3D. Two- and three-dimensional Cartesian and hexagonal geometries are implemented. Forward and adjoint eigenvalue, fixed source, gamma heating, and criticality (concentration) search problems may be performed
Symmetric functions and orthogonal polynomials
Macdonald, I G
1997-01-01
One of the most classical areas of algebra, the theory of symmetric functions and orthogonal polynomials has long been known to be connected to combinatorics, representation theory, and other branches of mathematics. Written by perhaps the most famous author on the topic, this volume explains some of the current developments regarding these connections. It is based on lectures presented by the author at Rutgers University. Specifically, he gives recent results on orthogonal polynomials associated with affine Hecke algebras, surveying the proofs of certain famous combinatorial conjectures.
Reconstruction of pin burnup characteristics from nodal calculations in hexagonal geometry
International Nuclear Information System (INIS)
Yang, W.S.; Finck, P.J.; Khalil, H.S.
1990-01-01
A reconstruction method has been developed for recovering pin burnup characteristics from fuel cycle calculations performed in hexagonal-z geometry using the nodal diffusion option of the DIF3D/REBUS-3 code system. Intra-modal distributions of group fluxes, nuclide densities, power density, burnup, and fluence are efficiently computed using polynomial shapes constrained to satisfy nodal information. The accuracy of the method has been tested by performing several numerical benchmark calculations and by comparing predicted local burnups to values measured for experimental assemblies in EBR-11. The results indicate that the reconstruction methods are quite accurate, yielding maximum errors in power and nuclide densities that are less than 2% for driver assemblies and typically less than 5% for blanket assemblies. 14 refs., 2 figs., 5 tabs
An integral nodal variational method for multigroup criticality calculations
International Nuclear Information System (INIS)
Lewis, E.E.; Tsoulfanidis, N.
2003-01-01
An integral formulation of the variational nodal method is presented and applied to a series of benchmark critically problems. The method combines an integral transport treatment of the even-parity flux within the spatial node with an odd-parity spherical harmonics expansion of the Lagrange multipliers at the node interfaces. The response matrices that result from this formulation are compatible with those in the VARIANT code at Argonne National Laboratory. Either homogeneous or heterogeneous nodes may be employed. In general, for calculations requiring higher-order angular approximations, the integral method yields solutions with comparable accuracy while requiring substantially less CPU time and memory than the standard spherical harmonics expansion using the same spatial approximations. (author)
On the treatment of nonlinear local feedbacks within advanced nodal generalized perturbation theory
International Nuclear Information System (INIS)
Maldonado, G.I.; Turinsky, P.J.; Kropaczek, D.J.
1993-01-01
Recent efforts to upgrade the underlying neutronics formulations within the in-core nuclear fuel management optimization code FORMOSA (Ref. 1) have produced two important developments; first, a computationally efficient and second-order-accurate advanced nodal generalized perturbation theory (GPT) model [derived from the nonlinear iterative nodal expansion method (NEM)] for evaluating core attributes (i.e., k eff and power distribution versus cycle burnup), and second, an equally efficient and accurate treatment of local thermal-hydraulic and fission product feedbacks embedded within NEM GPT. The latter development is the focus of this paper
A self-consistent nodal method in response matrix formalism for the multigroup diffusion equations
International Nuclear Information System (INIS)
Malambu, E.M.; Mund, E.H.
1996-01-01
We develop a nodal method for the multigroup diffusion equations, based on the transverse integration procedure (TIP). The efficiency of the method rests upon the convergence properties of a high-order multidimensional nodal expansion and upon numerical implementation aspects. The discrete 1D equations are cast in response matrix formalism. The derivation of the transverse leakage moments is self-consistent i.e. does not require additional assumptions. An outstanding feature of the method lies in the linear spatial shape of the local transverse leakage for the first-order scheme. The method is described in the two-dimensional case. The method is validated on some classical benchmark problems. (author)
International Nuclear Information System (INIS)
Taylor, D.
1984-01-01
This paper gives regression data for a modified second order polynomial fitted to the expansion data of, and percentage expansions for dioxides with (a) the fluorite and antifluorite structure: AmO 2 , BkO 2 , CeO 2 , CmO 2 , HfO 2 , Li 2 O, NpO 2 , PrO 2 , PuO 2 , ThO 2 , UO 2 , ZrO 2 , and (b) the rutile structure: CrO 2 , GeO 2 , IrO 2 , MnO 2 , NbO 2 , PbO 2 , SiO 2 , SnO 2 , TeO 2 , TiO 2 and VO 2 . Reduced expansion curves for the dioxides showed only partial grouping into iso-electronic series for the fluorite structures and showed that the 'law of corresponding states' did not apply to the rutile structures. (author)
On genus expansion of superpolynomials
Energy Technology Data Exchange (ETDEWEB)
Mironov, Andrei, E-mail: mironov@itep.ru [Lebedev Physics Institute, Moscow 119991 (Russian Federation); ITEP, Moscow 117218 (Russian Federation); National Research Nuclear University MEPhI, Moscow 115409 (Russian Federation); Morozov, Alexei, E-mail: morozov@itep.ru [ITEP, Moscow 117218 (Russian Federation); National Research Nuclear University MEPhI, Moscow 115409 (Russian Federation); Sleptsov, Alexei, E-mail: sleptsov@itep.ru [ITEP, Moscow 117218 (Russian Federation); Laboratory of Quantum Topology, Chelyabinsk State University, Chelyabinsk 454001 (Russian Federation); KdVI, University of Amsterdam (Netherlands); Smirnov, Andrey, E-mail: asmirnov@math.columbia.edu [ITEP, Moscow 117218 (Russian Federation); Columbia University, Department of Mathematics, New York (United States)
2014-12-15
Recently it was shown that the (Ooguri–Vafa) generating function of HOMFLY polynomials is the Hurwitz partition function, i.e. that the dependence of the HOMFLY polynomials on representation R is naturally captured by symmetric group characters (cut-and-join eigenvalues). The genus expansion and expansion through Vassiliev invariants explicitly demonstrate this phenomenon. In the present paper we claim that the superpolynomials are not functions of such a type: symmetric group characters do not provide an adequate linear basis for their expansions. Deformation to superpolynomials is, however, straightforward in the multiplicative basis: the Casimir operators are β-deformed to Hamiltonians of the Calogero–Moser–Sutherland system. Applying this trick to the genus and Vassiliev expansions, we observe that the deformation is fully straightforward only for the thin knots. Beyond the family of thin knots additional algebraically independent terms appear in the Vassiliev and genus expansions. This can suggest that the superpolynomials do in fact contain more information about knots than the colored HOMFLY and Kauffman polynomials. However, even for the thin knots the beta-deformation is non-innocent: already in the simplest examples it seems inconsistent with the positivity of colored superpolynomials in non-(anti)symmetric representations, which also happens in I. Cherednik's (DAHA-based) approach to the torus knots.
A nondeterministic shock and vibration application using polynomial chaos expansions
Energy Technology Data Exchange (ETDEWEB)
FIELD JR.,RICHARD V.; RED-HORSE,JOHN R.; PAEZ,THOMAS L.
2000-03-28
In the current study, the generality of the key underpinnings of the Stochastic Finite Element (SFEM) method is exploited in a nonlinear shock and vibration application where parametric uncertainty enters through random variables with probabilistic descriptions assumed to be known. The system output is represented as a vector containing Shock Response Spectrum (SRS) data at a predetermined number of frequency points. In contrast to many reliability-based methods, the goal of the current approach is to provide a means to address more general (vector) output entities, to provide this output as a random process, and to assess characteristics of the response which allow one to avoid issues of statistical dependence among its vector components.
STABILITY SYSTEMS VIA HURWITZ POLYNOMIALS
Directory of Open Access Journals (Sweden)
BALTAZAR AGUIRRE HERNÁNDEZ
2017-01-01
Full Text Available To analyze the stability of a linear system of differential equations ẋ = Ax we can study the location of the roots of the characteristic polynomial pA(t associated with the matrix A. We present various criteria - algebraic and geometric - that help us to determine where the roots are located without calculating them directly.
On Modular Counting with Polynomials
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt
2006-01-01
For any integers m and l, where m has r sufficiently large (depending on l) factors, that are powers of r distinct primes, we give a construction of a (symmetric) polynomial over Z_m of degree O(\\sqrt n) that is a generalized representation (commonly also called weak representation) of the MODl f...
Global Polynomial Kernel Hazard Estimation
DEFF Research Database (Denmark)
Hiabu, Munir; Miranda, Maria Dolores Martínez; Nielsen, Jens Perch
2015-01-01
This paper introduces a new bias reducing method for kernel hazard estimation. The method is called global polynomial adjustment (GPA). It is a global correction which is applicable to any kernel hazard estimator. The estimator works well from a theoretical point of view as it asymptotically redu...
Congruences concerning Legendre polynomials III
Sun, Zhi-Hong
2010-01-01
Let $p>3$ be a prime, and let $R_p$ be the set of rational numbers whose denominator is coprime to $p$. Let $\\{P_n(x)\\}$ be the Legendre polynomials. In this paper we mainly show that for $m,n,t\\in R_p$ with $m\
Two polynomial division inequalities in
Directory of Open Access Journals (Sweden)
Goetgheluck P
1998-01-01
Full Text Available This paper is a first attempt to give numerical values for constants and , in classical estimates and where is an algebraic polynomial of degree at most and denotes the -metric on . The basic tools are Markov and Bernstein inequalities.
Dirichlet polynomials, majorization, and trumping
International Nuclear Information System (INIS)
Pereira, Rajesh; Plosker, Sarah
2013-01-01
Majorization and trumping are two partial orders which have proved useful in quantum information theory. We show some relations between these two partial orders and generalized Dirichlet polynomials, Mellin transforms, and completely monotone functions. These relations are used to prove a succinct generalization of Turgut’s characterization of trumping. (paper)
Nodal pricing in a coupled electricity market
Bjørndal, Endre; Bjørndal, Mette; Cai, Hong
2014-01-01
This paper investigates a pricing model for an electricity market with a hybrid congestion management method, i.e. part of the system applies a nodal pricing scheme and the rest applies a zonal pricing scheme. The model clears the zonal and nodal pricing areas simultaneously. The nodal pricing area is affected by the changes in the zonal pricing area since it is directly connected to the zonal pricing area by commercial trading. The model is tested on a 13-node power system. Within the area t...
The modified Gauss diagonalization of polynomial matrices
International Nuclear Information System (INIS)
Saeed, K.
1982-10-01
The Gauss algorithm for diagonalization of constant matrices is modified for application to polynomial matrices. Due to this modification the diagonal elements become pure polynomials rather than rational functions. (author)
Sheffer and Non-Sheffer Polynomial Families
Directory of Open Access Journals (Sweden)
G. Dattoli
2012-01-01
Full Text Available By using the integral transform method, we introduce some non-Sheffer polynomial sets. Furthermore, we show how to compute the connection coefficients for particular expressions of Appell polynomials.
The finite Fourier transform of classical polynomials
Dixit, Atul; Jiu, Lin; Moll, Victor H.; Vignat, Christophe
2014-01-01
The finite Fourier transform of a family of orthogonal polynomials $A_{n}(x)$, is the usual transform of the polynomial extended by $0$ outside their natural domain. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families.
Computation of rectangular source integral by rational parameter polynomial method
International Nuclear Information System (INIS)
Prabha, Hem
2001-01-01
Hubbell et al. (J. Res. Nat Bureau Standards 64C, (1960) 121) have obtained a series expansion for the calculation of the radiation field generated by a plane isotropic rectangular source (plaque), in which leading term is the integral H(a,b). In this paper another integral I(a,b), which is related with the integral H(a,b) has been solved by the rational parameter polynomial method. From I(a,b), we compute H(a,b). Using this method the integral I(a,b) is expressed in the form of a polynomial of a rational parameter. Generally, a function f (x) is expressed in terms of x. In this method this is expressed in terms of x/(1+x). In this way, the accuracy of the expression is good over a wide range of x as compared to the earlier approach. The results for I(a,b) and H(a,b) are given for a sixth degree polynomial and are found to be in good agreement with the results obtained by numerically integrating the integral. Accuracy could be increased either by increasing the degree of the polynomial or by dividing the range of integration. The results of H(a,b) and I(a,b) are given for values of b and a up to 2.0 and 20.0, respectively
Chromatic Derivatives, Chromatic Expansions and Associated Spaces
Ignjatovic, Aleksandar
2009-01-01
This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential operators which correspond to certain families of orthogonal polynomials. Chromatic expansions are series of the corresponding special functions, which possess the best features of both the Taylor and the Shannon expansions. This makes chromatic derivatives and ...
A Summation Formula for Macdonald Polynomials
de Gier, Jan; Wheeler, Michael
2016-03-01
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases {t = 1} and {q = 0}, we recover known expressions for the monomial symmetric and Hall-Littlewood polynomials, respectively. Other specializations of our formula give new expressions for the Jack and q-Whittaker polynomials.
A New Generalisation of Macdonald Polynomials
Garbali, Alexandr; de Gier, Jan; Wheeler, Michael
2017-06-01
We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters ( q, t) and polynomial in a further two parameters ( u, v). We evaluate these polynomials explicitly as a matrix product. At u = v = 0 they reduce to Macdonald polynomials, while at q = 0, u = v = s they recover a family of inhomogeneous symmetric functions originally introduced by Borodin.
Pseudo q -Engel expansions and Rogers-Ramanujan type identities ...
African Journals Online (AJOL)
Abstract. Andrews, Knopfmacher and Knopfmacher have used the Schur polynomials to consider the celebrated Rogers-Ramanujan identities in the context of q-Engel expansions. We extend this view using similar polynomials, provided by Sills, in the context of Slater's list of 130 Rogers-Ramanujan type identities.
Maternal Nodal inversely affects NODAL and STOX1 expression in the fetal placenta
Directory of Open Access Journals (Sweden)
Hari Krishna Thulluru
2013-08-01
Full Text Available Nodal, a secreted signaling protein from the TGFβ-super family plays a vital role during early embryonic development. Recently, it was found that maternal decidua-specific Nodal knockout mice show intrauterine growth restriction (IUGR and preterm birth. As the chromosomal location of NODAL is in the same linkage area as the susceptibility gene STOX1, associated with the familial form of early-onset, IUGR-complicated pre-eclampsia, their potential maternal-fetal interaction was investigated. Pre-eclamptic mothers with children who carried the STOX1 susceptibility allele themselves all carried the NODAL H165R SNP, which causes a 50% reduced activity. Surprisingly, in decidua Nodal knockout mice the fetal placenta showed up-regulation of STOX1 and NODAL expression. Conditioned media of human first trimester decidua and a human endometrial stromal cell line (T-HESC treated with siRNAs against NODAL or carrying the H165R SNP were also able to induce NODAL and STOX1 expression when added to SGHPL-5 first trimester extravillous trophoblast cells. Finally, a human TGFß-BMP-Signaling-Pathway PCR-Array on decidua and the T-HESC cell line with Nodal knockdown revealed upregulation of Activin-A, which was confirmed in conditioned media by ELISA. We show that maternal decidua Nodal knockdown gives upregulation of NODAL and STOX1 mRNA expression in fetal extravillous trophoblast cells, potentially via upregulation of Activin-A in the maternal decidua. As both Activin-A and Nodal have been implicated in pre-eclampsia, being increased in serum of pre-eclamptic women and upregulated in pre-eclamptic placentas respectively, this interaction at the maternal-fetal interface might play a substantial role in the development of pre-eclampsia.
Associated polynomials and birth-death processes
van Doorn, Erik A.
2001-01-01
We consider sequences of orthogonal polynomials with positive zeros, and pursue the question of how (partial) knowledge of the orthogonalizing measure for the {\\it associated polynomials} can lead to information about the orthogonalizing measure for the original polynomials, with a view to
Quantum oscillations in nodal line systems
Yang, Hui; Moessner, Roderich; Lim, Lih-King
2018-04-01
We study signatures of magnetic quantum oscillations in three-dimensional nodal line semimetals at zero temperature. The extended nature of the degenerate bands can result in a Fermi surface geometry with topological genus one, as well as a Fermi surface of electron and hole pockets encapsulating the nodal line. Moreover, the underlying two-band model to describe a nodal line is not unique, in that there are two classes of Hamiltonian with distinct band topology giving rise to the same Fermi-surface geometry. After identifying the extremal cyclotron orbits in various magnetic field directions, we study their concomitant Landau levels and resulting quantum oscillation signatures. By Landau-fan-diagram analyses, we extract the nontrivial π Berry phase signature for extremal orbits linking the nodal line.
Sensitivity of SBLOCA analysis to model nodalization
International Nuclear Information System (INIS)
Lee, C.; Ito, T.; Abramson, P.B.
1983-01-01
The recent Semiscale test S-UT-8 indicates the possibility for primary liquid to hang up in the steam generators during a SBLOCA, permitting core uncovery prior to loop-seal clearance. In analysis of Small Break Loss of Coolant Accidents with RELAP5, it is found that resultant transient behavior is quite sensitive to the selection of nodalization for the steam generators. Although global parameters such as integrated mass loss, primary inventory and primary pressure are relatively insensitive to the nodalization, it is found that the predicted distribution of inventory around the primary is significantly affected by nodalization. More detailed nodalization predicts that more of the inventory tends to remain in the steam generators, resulting in less inventory in the reactor vessel and therefore causing earlier and more severe core uncovery
Twisted Vector Bundles on Pointed Nodal Curves
Indian Academy of Sciences (India)
Abstract. Motivated by the quest for a good compactification of the moduli space of -bundles on a nodal curve we establish a striking relationship between Abramovich's and Vistoli's twisted bundles and Gieseker vector bundles.
Energy Technology Data Exchange (ETDEWEB)
Lawrence, R.D.
1983-03-01
A nodal method is developed for the solution of the neutron-diffusion equation in two- and three-dimensional hexagonal geometries. The nodal scheme has been incorporated as an option in the finite-difference diffusion-theory code DIF3D, and is intended for use in the analysis of current LMFBR designs. The nodal equations are derived using higher-order polynomial approximations to the spatial dependence of the flux within the hexagonal-z node. The final equations, which are cast in the form of inhomogeneous response-matrix equations for each energy group, involved spatial moments of the node-interior flux distribution plus surface-averaged partial currents across the faces of the node. These equations are solved using a conventional fission-source iteration accelerated by coarse-mesh rebalance and asymptotic source extrapolation. This report describes the mathematical development and numerical solution of the nodal equations, as well as the use of the nodal option and details concerning its programming structure. This latter information is intended to supplement the information provided in the separate documentation of the DIF3D code.
International Nuclear Information System (INIS)
Lawrence, R.D.
1983-03-01
A nodal method is developed for the solution of the neutron-diffusion equation in two- and three-dimensional hexagonal geometries. The nodal scheme has been incorporated as an option in the finite-difference diffusion-theory code DIF3D, and is intended for use in the analysis of current LMFBR designs. The nodal equations are derived using higher-order polynomial approximations to the spatial dependence of the flux within the hexagonal-z node. The final equations, which are cast in the form of inhomogeneous response-matrix equations for each energy group, involved spatial moments of the node-interior flux distribution plus surface-averaged partial currents across the faces of the node. These equations are solved using a conventional fission-source iteration accelerated by coarse-mesh rebalance and asymptotic source extrapolation. This report describes the mathematical development and numerical solution of the nodal equations, as well as the use of the nodal option and details concerning its programming structure. This latter information is intended to supplement the information provided in the separate documentation of the DIF3D code
Directory of Open Access Journals (Sweden)
Surian Pinem
2014-01-01
Full Text Available A coupled neutronics thermal-hydraulics code NODAL3 has been developed based on the few-group neutron diffusion equation in 3-dimensional geometry for typical PWR static and transient analyses. The spatial variables are treated by using a polynomial nodal method while for the neutron dynamic solver the adiabatic and improved quasistatic methods are adopted. In this paper we report the benchmark calculation results of the code against the OECD/NEA CRP PWR rod ejection cases. The objective of this work is to determine the accuracy of NODAL3 code in analysing the reactivity initiated accident due to the control rod ejection. The NEACRP PWR rod ejection cases are chosen since many organizations participated in the NEA project using various methods as well as approximations, so that, in addition to the reference solutions, the calculation results of NODAL3 code can also be compared to other codes’ results. The transient parameters to be verified are time of power peak, power peak, final power, final average Doppler temperature, maximum fuel temperature, and final coolant temperature. The results of NODAL3 code agree well with the PHANTHER reference solutions in 1993 and 1997 (revised. Comparison with other validated codes, DYN3D/R and ANCK, shows also a satisfactory agreement.
From Jack to Double Jack Polynomials via the Supersymmetric Bridge
Lapointe, Luc; Mathieu, Pierre
2015-07-01
The Calogero-Sutherland model occurs in a large number of physical contexts, either directly or via its eigenfunctions, the Jack polynomials. The supersymmetric counterpart of this model, although much less ubiquitous, has an equally rich structure. In particular, its eigenfunctions, the Jack superpolynomials, appear to share the very same remarkable combinatorial and structural properties as their non-supersymmetric version. These super-functions are parametrized by superpartitions with fixed bosonic and fermionic degrees. Now, a truly amazing feature pops out when the fermionic degree is sufficiently large: the Jack superpolynomials stabilize and factorize. Their stability is with respect to their expansion in terms of an elementary basis where, in the stable sector, the expansion coefficients become independent of the fermionic degree. Their factorization is seen when the fermionic variables are stripped off in a suitable way which results in a product of two ordinary Jack polynomials (somewhat modified by plethystic transformations), dubbed the double Jack polynomials. Here, in addition to spelling out these results, which were first obtained in the context of Macdonal superpolynomials, we provide a heuristic derivation of the Jack superpolynomial case by performing simple manipulations on the supersymmetric eigen-operators, rendering them independent of the number of particles and of the fermionic degree. In addition, we work out the expression of the Hamiltonian which characterizes the double Jacks. This Hamiltonian, which defines a new integrable system, involves not only the expected Calogero-Sutherland pieces but also combinations of the generators of an underlying affine {widehat{sl}_2} algebra.
International Nuclear Information System (INIS)
Crowley-Milling, M.C.; Shering, G.C.
1978-01-01
A comprehensive description is given of the NODAL system used for computer control of the CERN Super-Proton Synchrotron. Details are given of NODAL, a high-level programming language based on FOCAL and SNOBOL4, designed for interactive use. It is shown how this interpretive language is used with a network of computers and how it can be extended by adding machine-code modules. The report updates and replaces an earlier one published in 1974. (Auth.)
Nodal coupling by response matrix principles
International Nuclear Information System (INIS)
Ancona, A.; Becker, M.; Beg, M.D.; Harris, D.R.; Menezes, A.D.; VerPlanck, D.M.; Pilat, E.
1977-01-01
The response matrix approach has been used in viewing a reactor node in isolation and in characterizing the node by reflection and trans-emission factors. These are then used to generate invariant imbedding parameters, which in turn are used in a nodal reactor simulator code to compute core power distributions in two and three dimensions. Various nodal techniques are analyzed and converted into a single invariant imbedding formalism
Magnonic triply-degenerate nodal points
Owerre, S. A.
2017-12-01
We generalize the concept of triply-degenerate nodal points to non-collinear antiferromagnets. Here, we introduce this concept to insulating quantum antiferromagnets on the decorated honeycomb lattice, with spin-1 bosonic quasiparticle excitations known as magnons. We demonstrate the existence of magnonic surface states with constant energy contours that form pairs of magnonic arcs connecting the surface projection of the magnonic triple nodal points. The quasiparticle excitations near the triple nodal points represent three-component bosons beyond that of magnonic Dirac, Weyl, and nodal-line cases. They can be regarded as a direct reflection of the intrinsic spin carried by magnons. Furthermore, we show that the magnonic triple nodal points can split into magnonic Weyl points, as the system transits from a non-collinear spin structure to a non-coplanar one with a non-zero scalar spin chirality. Our results not only apply to insulating antiferromagnets, but also provide a platform to seek for triple nodal points in metallic antiferromagnets.
BSDEs with polynomial growth generators
Directory of Open Access Journals (Sweden)
Philippe Briand
2000-01-01
Full Text Available In this paper, we give existence and uniqueness results for backward stochastic differential equations when the generator has a polynomial growth in the state variable. We deal with the case of a fixed terminal time, as well as the case of random terminal time. The need for this type of extension of the classical existence and uniqueness results comes from the desire to provide a probabilistic representation of the solutions of semilinear partial differential equations in the spirit of a nonlinear Feynman-Kac formula. Indeed, in many applications of interest, the nonlinearity is polynomial, e.g, the Allen-Cahn equation or the standard nonlinear heat and Schrödinger equations.
Quantum entanglement via nilpotent polynomials
International Nuclear Information System (INIS)
Mandilara, Aikaterini; Akulin, Vladimir M.; Smilga, Andrei V.; Viola, Lorenza
2006-01-01
We propose a general method for introducing extensive characteristics of quantum entanglement. The method relies on polynomials of nilpotent raising operators that create entangled states acting on a reference vacuum state. By introducing the notion of tanglemeter, the logarithm of the state vector represented in a special canonical form and expressed via polynomials of nilpotent variables, we show how this description provides a simple criterion for entanglement as well as a universal method for constructing the invariants characterizing entanglement. We compare the existing measures and classes of entanglement with those emerging from our approach. We derive the equation of motion for the tanglemeter and, in representative examples of up to four-qubit systems, show how the known classes appear in a natural way within our framework. We extend our approach to qutrits and higher-dimensional systems, and make contact with the recently introduced idea of generalized entanglement. Possible future developments and applications of the method are discussed
Special polynomials associated with some hierarchies
International Nuclear Information System (INIS)
Kudryashov, Nikolai A.
2008-01-01
Special polynomials associated with rational solutions of a hierarchy of equations of Painleve type are introduced. The hierarchy arises by similarity reduction from the Fordy-Gibbons hierarchy of partial differential equations. Some relations for these special polynomials are given. Differential-difference hierarchies for finding special polynomials are presented. These formulae allow us to obtain special polynomials associated with the hierarchy studied. It is shown that rational solutions of members of the Schwarz-Sawada-Kotera, the Schwarz-Kaup-Kupershmidt, the Fordy-Gibbons, the Sawada-Kotera and the Kaup-Kupershmidt hierarchies can be expressed through special polynomials of the hierarchy studied
Space complexity in polynomial calculus
Czech Academy of Sciences Publication Activity Database
Filmus, Y.; Lauria, M.; Nordström, J.; Ron-Zewi, N.; Thapen, Neil
2015-01-01
Roč. 44, č. 4 (2015), s. 1119-1153 ISSN 0097-5397 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : proof complexity * polynomial calculus * lower bounds Subject RIV: BA - General Mathematics Impact factor: 0.841, year: 2015 http://epubs.siam.org/doi/10.1137/120895950
Codimensions of generalized polynomial identities
International Nuclear Information System (INIS)
Gordienko, Aleksei S
2010-01-01
It is proved that for every finite-dimensional associative algebra A over a field of characteristic zero there are numbers C element of Q + and t element of Z + such that gc n (A)∼Cn t d n as n→∞, where d=PI exp(A) element of Z + . Thus, Amitsur's and Regev's conjectures hold for the codimensions gc n (A) of the generalized polynomial identities. Bibliography: 6 titles.
Stable piecewise polynomial vector fields
Directory of Open Access Journals (Sweden)
Claudio Pessoa
2012-09-01
Full Text Available Let $N={y>0}$ and $S={y<0}$ be the semi-planes of $mathbb{R}^2$ having as common boundary the line $D={y=0}$. Let $X$ and $Y$ be polynomial vector fields defined in $N$ and $S$, respectively, leading to a discontinuous piecewise polynomial vector field $Z=(X,Y$. This work pursues the stability and the transition analysis of solutions of $Z$ between $N$ and $S$, started by Filippov (1988 and Kozlova (1984 and reformulated by Sotomayor-Teixeira (1995 in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields $Z_{epsilon}$, defined by averaging $X$ and $Y$. This family approaches $Z$ when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002 providing conditions on $(X,Y$ for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on $mathbb{R}^2$. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.
Eigenvalues of PT-symmetric oscillators with polynomial potentials
International Nuclear Information System (INIS)
Shin, Kwang C
2005-01-01
We study the eigenvalue problem -u''(z) - [(iz) m + P m-1 (iz)]u(z) λu(z) with the boundary condition that u(z) decays to zero as z tends to infinity along the rays arg z = -π/2 ± 2π/(m+2) in the complex plane, where P m-1 (z) = a 1 z m-1 + a 2 z m-2 + . . . + a m-1 z is a polynomial and integers m ≥ 3. We provide an asymptotic expansion of the eigenvalues λ n as n → +∞, and prove that for each real polynomial P m-1 , the eigenvalues are all real and positive, with only finitely many exceptions
Energy Technology Data Exchange (ETDEWEB)
Delfin L, A
1997-12-31
The purpose of this work is to solve the neutron transport equation in discrete-ordinates and X-Y geometry by developing and using the strong discontinuous and strong modified discontinuous nodal finite element schemes. The strong discontinuous and modified strong discontinuous nodal finite element schemes go from two to ten interpolation parameters per cell. They are describing giving a set D{sub c} and polynomial space S{sub c} corresponding for each scheme BDMO, RTO, BL, BDM1, HdV, BDFM1, RT1, BQ and BDM2. The solution is obtained solving the neutron transport equation moments for each nodal scheme by developing the basis functions defined by Pascal triangle and the Legendre moments giving in the polynomial space S{sub c} and, finally, looking for the non singularity of the resulting linear system. The linear system is numerically solved using a computer program for each scheme mentioned . It uses the LU method and forward and backward substitution and makes a partition of the domain in cells. The source terms and angular flux are calculated, using the directions and weights associated to the S{sub N} approximation and solving the angular flux moments to find the effective multiplication constant. The programs are written in Fortran language, using the dynamic allocation of memory to increase efficiently the available memory of the computing equipment. (Author).
The analytic nodal method in cylindrical geometry
International Nuclear Information System (INIS)
Prinsloo, Rian H.; Tomasevic, Djordje I.
2008-01-01
Nodal diffusion methods have been used extensively in nuclear reactor calculations, specifically for their performance advantage, but also for their superior accuracy. More specifically, the Analytic Nodal Method (ANM), utilising the transverse integration principle, has been applied to numerous reactor problems with much success. In this work, a nodal diffusion method is developed for cylindrical geometry. Application of this method to three-dimensional (3D) cylindrical geometry has never been satisfactorily addressed and we propose a solution which entails the use of conformal mapping. A set of 1D-equations with an adjusted, geometrically dependent, inhomogeneous source, is obtained. This work describes the development of the method and associated test code, as well as its application to realistic reactor problems. Numerical results are given for the PBMR-400 MW benchmark problem, as well as for a 'cylindrisized' version of the well-known 3D LWR IAEA benchmark. Results highlight the improved accuracy and performance over finite-difference core solutions and investigate the applicability of nodal methods to 3D PBMR type problems. Results indicate that cylindrical nodal methods definitely have a place within PBMR applications, yielding performance advantage factors of 10 and 20 for 2D and 3D calculations, respectively, and advantage factors of the order of 1000 in the case of the LWR problem
Encapsulation of nodal segments of lobelia chinensis
Directory of Open Access Journals (Sweden)
Weng Hing Thong
2015-04-01
Full Text Available Lobelia chinensis served as an important herb in traditional chinese medicine. It is rare in the field and infected by some pathogens. Therefore, encapsulation of axillary buds has been developed for in vitro propagation of L. chinensis. Nodal explants of L. chinensis were used as inclusion materials for encapsulation. Various combinations of calcium chloride and sodium alginate were tested. Encapsulation beads produced by mixing 50 mM calcium chloride and 3.5% sodium alginate supported the optimal in vitro conversion potential. The number of multiple shoots formed by encapsulated nodal segments was not significantly different from the average of shoots produced by non-encapsulated nodal segments. The encapsulated nodal segments regenerated in vitro on different medium. The optimal germination and regeneration medium was Murashige-Skoog medium. Plantlets regenerated from the encapsulated nodal segments were hardened, acclimatized and established well in the field, showing similar morphology with parent plants. This encapsulation technology would serve as an alternative in vitro regeneration system for L. chinensis.
ANDREA: Advanced nodal diffusion code for reactor analysis
International Nuclear Information System (INIS)
Belac, J.; Josek, R.; Klecka, L.; Stary, V.; Vocka, R.
2005-01-01
A new macro code is being developed at NRI which will allow coupling of the advanced thermal-hydraulics model with neutronics calculations as well as efficient use in core loading pattern optimization process. This paper describes the current stage of the macro code development. The core simulator is based on the nodal expansion method, Helios lattice code is used for few group libraries preparation. Standard features such as pin wise power reconstruction and feedback iterations on critical control rod position, boron concentration and reactor power are implemented. A special attention is paid to the system and code modularity in order to enable flexible and easy implementation of new features in future. Precision of the methods used in the macro code has been verified on available benchmarks. Testing against Temelin PWR operational data is under way (Authors)
International Nuclear Information System (INIS)
Verdu, G.; Capilla, M.; Talavera, C. F.; Ginestar, D.
2012-01-01
PL equations are classical high order approximations to the transport equations which are based on the expansion of the angular dependence of the angular neutron flux and the nuclear cross sections in terms of spherical harmonics. A nodal collocation method is used to discretize the PL equations associated with a neutron source transport problem. The performance of the method is tested solving two 1D problems with analytical solution for the transport equation and a classical 2D problem. (authors)
Energy Technology Data Exchange (ETDEWEB)
Verdu, G. [Departamento de Ingenieria Quimica Y Nuclear, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain); Capilla, M.; Talavera, C. F.; Ginestar, D. [Dept. of Nuclear Engineering, Departamento de Matematica Aplicada, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain)
2012-07-01
PL equations are classical high order approximations to the transport equations which are based on the expansion of the angular dependence of the angular neutron flux and the nuclear cross sections in terms of spherical harmonics. A nodal collocation method is used to discretize the PL equations associated with a neutron source transport problem. The performance of the method is tested solving two 1D problems with analytical solution for the transport equation and a classical 2D problem. (authors)
Polynomial Chaos Surrogates for Bayesian Inference
Le Maitre, Olivier
2016-01-06
The Bayesian inference is a popular probabilistic method to solve inverse problems, such as the identification of field parameter in a PDE model. The inference rely on the Bayes rule to update the prior density of the sought field, from observations, and derive its posterior distribution. In most cases the posterior distribution has no explicit form and has to be sampled, for instance using a Markov-Chain Monte Carlo method. In practice the prior field parameter is decomposed and truncated (e.g. by means of Karhunen- Lo´eve decomposition) to recast the inference problem into the inference of a finite number of coordinates. Although proved effective in many situations, the Bayesian inference as sketched above faces several difficulties requiring improvements. First, sampling the posterior can be a extremely costly task as it requires multiple resolutions of the PDE model for different values of the field parameter. Second, when the observations are not very much informative, the inferred parameter field can highly depends on its prior which can be somehow arbitrary. These issues have motivated the introduction of reduced modeling or surrogates for the (approximate) determination of the parametrized PDE solution and hyperparameters in the description of the prior field. Our contribution focuses on recent developments in these two directions: the acceleration of the posterior sampling by means of Polynomial Chaos expansions and the efficient treatment of parametrized covariance functions for the prior field. We also discuss the possibility of making such approach adaptive to further improve its efficiency.
Algebraic polynomials with random coefficients
Directory of Open Access Journals (Sweden)
K. Farahmand
2002-01-01
Full Text Available This paper provides an asymptotic value for the mathematical expected number of points of inflections of a random polynomial of the form a0(ω+a1(ω(n11/2x+a2(ω(n21/2x2+…an(ω(nn1/2xn when n is large. The coefficients {aj(w}j=0n, w∈Ω are assumed to be a sequence of independent normally distributed random variables with means zero and variance one, each defined on a fixed probability space (A,Ω,Pr. A special case of dependent coefficients is also studied.
Improved multivariate polynomial factoring algorithm
International Nuclear Information System (INIS)
Wang, P.S.
1978-01-01
A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known problems of the original algorithm, namely, the leading coefficient problem, the bad-zero problem and the occurrence of extraneous factors. It has an algorithm for correctly predetermining leading coefficients of the factors. A new and efficient p-adic algorithm named EEZ is described. Bascially it is a linearly convergent variable-by-variable parallel construction. The improved algorithm is generally faster and requires less store then the original algorithm. Machine examples with comparative timing are included
Fourier series and orthogonal polynomials
Jackson, Dunham
2004-01-01
This text for undergraduate and graduate students illustrates the fundamental simplicity of the properties of orthogonal functions and their developments in related series. Starting with a definition and explanation of the elements of Fourier series, the text follows with examinations of Legendre polynomials and Bessel functions. Boundary value problems consider Fourier series in conjunction with Laplace's equation in an infinite strip and in a rectangle, with a vibrating string, in three dimensions, in a sphere, and in other circumstances. An overview of Pearson frequency functions is followe
Killings, duality and characteristic polynomials
Álvarez, Enrique; Borlaf, Javier; León, José H.
1998-03-01
In this paper the complete geometrical setting of (lowest order) abelian T-duality is explored with the help of some new geometrical tools (the reduced formalism). In particular, all invariant polynomials (the integrands of the characteristic classes) can be explicitly computed for the dual model in terms of quantities pertaining to the original one and with the help of the canonical connection whose intrinsic characterization is given. Using our formalism the physically, and T-duality invariant, relevant result that top forms are zero when there is an isometry without fixed points is easily proved. © 1998
Orthogonal polynomials and random matrices
Deift, Percy
2000-01-01
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
Introduction to Real Orthogonal Polynomials
1992-06-01
uses Green’s functions. As motivation , consider the Dirichlet problem for the unit circle in the plane, which involves finding a harmonic function u(r...xv ; a, b ; q) - TO [q-N ab+’q ; q, xq b. Orthogoy RMotion O0 (bq :q)x p.(q* ; a, b ; q) pg(q’ ; a, b ; q) (q "q), (aq)x (q ; q), (I -abq) (bq ; q... motivation and justi- fication for continued study of the intrinsic structure of orthogonal polynomials. 99 LIST OF REFERENCES 1. Deyer, W. M., ed., CRC
A companion matrix for 2-D polynomials
International Nuclear Information System (INIS)
Boudellioua, M.S.
1995-08-01
In this paper, a matrix form analogous to the companion matrix which is often encountered in the theory of one dimensional (1-D) linear systems is suggested for a class of polynomials in two indeterminates and real coefficients, here referred to as two dimensional (2-D) polynomials. These polynomials arise in the context of 2-D linear systems theory. Necessary and sufficient conditions are also presented under which a matrix is equivalent to this companion form. (author). 6 refs
On polynomial solutions of the Heun equation
International Nuclear Information System (INIS)
Gurappa, N; Panigrahi, Prasanta K
2004-01-01
By making use of a recently developed method to solve linear differential equations of arbitrary order, we find a wide class of polynomial solutions to the Heun equation. We construct the series solution to the Heun equation before identifying the polynomial solutions. The Heun equation extended by the addition of a term, -σ/x, is also amenable for polynomial solutions. (letter to the editor)
A new Arnoldi approach for polynomial eigenproblems
Energy Technology Data Exchange (ETDEWEB)
Raeven, F.A.
1996-12-31
In this paper we introduce a new generalization of the method of Arnoldi for matrix polynomials. The new approach is compared with the approach of rewriting the polynomial problem into a linear eigenproblem and applying the standard method of Arnoldi to the linearised problem. The algorithm that can be applied directly to the polynomial eigenproblem turns out to be more efficient, both in storage and in computation.
Nodal Structure of the Electronic Wigner Function
DEFF Research Database (Denmark)
Schmider, Hartmut; Dahl, Jens Peder
1996-01-01
On the example of several atomic and small molecular systems, the regular behavior of nodal patterns in the electronic one-particle reduced Wigner function is demonstrated. An expression found earlier relates the nodal pattern solely to the dot-product of the position and the momentum vector......, if both arguments are large. An argument analogous to the ``bond-oscillatory principle'' for momentum densities links the nuclear framework in a molecule to an additional oscillatory term in momenta parallel to bonds. It is shown that these are visible in the Wigner function in terms of characteristic...
Bayer Demosaicking with Polynomial Interpolation.
Wu, Jiaji; Anisetti, Marco; Wu, Wei; Damiani, Ernesto; Jeon, Gwanggil
2016-08-30
Demosaicking is a digital image process to reconstruct full color digital images from incomplete color samples from an image sensor. It is an unavoidable process for many devices incorporating camera sensor (e.g. mobile phones, tablet, etc.). In this paper, we introduce a new demosaicking algorithm based on polynomial interpolation-based demosaicking (PID). Our method makes three contributions: calculation of error predictors, edge classification based on color differences, and a refinement stage using a weighted sum strategy. Our new predictors are generated on the basis of on the polynomial interpolation, and can be used as a sound alternative to other predictors obtained by bilinear or Laplacian interpolation. In this paper we show how our predictors can be combined according to the proposed edge classifier. After populating three color channels, a refinement stage is applied to enhance the image quality and reduce demosaicking artifacts. Our experimental results show that the proposed method substantially improves over existing demosaicking methods in terms of objective performance (CPSNR, S-CIELAB E, and FSIM), and visual performance.
Bayesian inference of earthquake parameters from buoy data using a polynomial chaos-based surrogate
Giraldi, Loic; Le Maî tre, Olivier P.; Mandli, Kyle T.; Dawson, Clint N.; Hoteit, Ibrahim; Knio, Omar
2017-01-01
on polynomial chaos expansion to construct a surrogate model of the wave height at the buoy location. A correlated noise model is first proposed in order to represent the discrepancy between the computational model and the data. This step is necessary, as a
Sraj, Ihab; Mandli, Kyle T.; Knio, Omar; Dawson, Clint N.; Hoteit, Ibrahim
2017-01-01
. Polynomial chaos (PC) expansions were used to build an inexpensive surrogate for the numerical model GeoClaw, which were then used to perform a sensitivity analysis in addition to the inversion. In this paper, a new analysis is performed with the goal
Fermionic formula for double Kostka polynomials
Liu, Shiyuan
2016-01-01
The $X=M$ conjecture asserts that the $1D$ sum and the fermionic formula coincide up to some constant power. In the case of type $A,$ both the $1D$ sum and the fermionic formula are closely related to Kostka polynomials. Double Kostka polynomials $K_{\\Bla,\\Bmu}(t),$ indexed by two double partitions $\\Bla,\\Bmu,$ are polynomials in $t$ introduced as a generalization of Kostka polynomials. In the present paper, we consider $K_{\\Bla,\\Bmu}(t)$ in the special case where $\\Bmu=(-,\\mu'').$ We formula...
Polynomial sequences generated by infinite Hessenberg matrices
Directory of Open Access Journals (Sweden)
Verde-Star Luis
2017-01-01
Full Text Available We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz the polynomial sequences turn out to be of interpolatory type and we obtain additional results. For example, we show that every nonderogative finite square matrix is similar to a unique Toeplitz-Hessenberg matrix.
Improvement of neutron kinetics module in TRAC-BF1code: one-dimensional nodal collocation method
Energy Technology Data Exchange (ETDEWEB)
Jambrina, Ana; Barrachina, Teresa; Miro, Rafael; Verdu, Gumersindo, E-mail: ajambrina@iqn.upv.es, E-mail: tbarrachina@iqn.upv.es, E-mail: rmiro@iqn.upv.es, E-mail: gverdu@iqn.upv.es [Universidade Politecnica de Valencia (UPV), Valencia (Spain); Soler, Amparo, E-mail: asoler@iberdrola.es [SEA Propulsion S.L., Madrid (Spain); Concejal, Alberto, E-mail: acbe@iberdrola.es [Iberdrola Ingenieria y Construcion S.A.U., Madrid (Spain)
2013-07-01
The TRAC-BF1 one-dimensional kinetic model is a formulation of the neutron diffusion equation in the two energy groups' approximation, based on the analytical nodal method (ANM). The advantage compared with a zero-dimensional kinetic model is that the axial power profile may vary with time due to thermal-hydraulic parameter changes and/or actions of the control systems but at has the disadvantages that in unusual situations it fails to converge. The nodal collocation method developed for the neutron diffusion equation and applied to the kinetics resolution of TRAC-BF1 thermal-hydraulics, is an adaptation of the traditional collocation methods for the discretization of partial differential equations, based on the development of the solution as a linear combination of analytical functions. It has chosen to use a nodal collocation method based on a development of Legendre polynomials of neutron fluxes in each cell. The qualification is carried out by the analysis of the turbine trip transient from the NEA benchmark in Peach Bottom NPP using both the original 1D kinetics implemented in TRAC-BF1 and the 1D nodal collocation method. (author)
Isospectral graphs with identical nodal counts
International Nuclear Information System (INIS)
Oren, Idan; Band, Ram
2012-01-01
According to a recent conjecture, isospectral objects have different nodal count sequences (Gnutzmann et al 2005 J. Phys. A: Math. Gen. 38 8921–33). We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counterexamples to this conjecture. In addition, these examples demonstrate a surprising connection between isospectral discrete and quantum graphs. (paper)
Comparison of neutronic transport equation resolution nodal methods
International Nuclear Information System (INIS)
Zamonsky, O.M.; Gho, C.J.
1990-01-01
In this work, some transport equation resolution nodal methods are comparatively studied: the constant-constant (CC), linear-nodal (LN) and the constant-quadratic (CQ). A nodal scheme equivalent to finite differences has been used for its programming, permitting its inclusion in existing codes. Some bidimensional problems have been solved, showing that linear-nodal (LN) are, in general, obtained with accuracy in CPU shorter times. (Author) [es
Polynomials formalism of quantum numbers
International Nuclear Information System (INIS)
Kazakov, K.V.
2005-01-01
Theoretical aspects of the recently suggested perturbation formalism based on the method of quantum number polynomials are considered in the context of the general anharmonicity problem. Using a biatomic molecule by way of example, it is demonstrated how the theory can be extrapolated to the case of vibrational-rotational interactions. As a result, an exact expression for the first coefficient of the Herman-Wallis factor is derived. In addition, the basic notions of the formalism are phenomenologically generalized and expanded to the problem of spin interaction. The concept of magneto-optical anharmonicity is introduced. As a consequence, an exact analogy is drawn with the well-known electro-optical theory of molecules, and a nonlinear dependence of the magnetic dipole moment of the system on the spin and wave variables is established [ru
Polynomial solutions of nonlinear integral equations
International Nuclear Information System (INIS)
Dominici, Diego
2009-01-01
We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of Bender and Ben-Naim (2007 J. Phys. A: Math. Theor. 40 F9, 2008 J. Nonlinear Math. Phys. 15 (Suppl. 3) 73). We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel polynomials
Sibling curves of quadratic polynomials | Wiggins | Quaestiones ...
African Journals Online (AJOL)
Sibling curves were demonstrated in [1, 2] as a novel way to visualize the zeroes of real valued functions. In [3] it was shown that a polynomial of degree n has n sibling curves. This paper focuses on the algebraic and geometric properites of the sibling curves of real and complex quadratic polynomials. Key words: Quadratic ...
Topological string partition functions as polynomials
International Nuclear Information System (INIS)
Yamaguchi, Satoshi; Yau Shingtung
2004-01-01
We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also compute the explicit polynomial forms of the partition functions for genus 2, 3, and 4. Moreover, some coefficients are written down for all genus. (author)
Polynomial solutions of nonlinear integral equations
Energy Technology Data Exchange (ETDEWEB)
Dominici, Diego [Department of Mathematics, State University of New York at New Paltz, 1 Hawk Dr. Suite 9, New Paltz, NY 12561-2443 (United States)], E-mail: dominicd@newpaltz.edu
2009-05-22
We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of Bender and Ben-Naim (2007 J. Phys. A: Math. Theor. 40 F9, 2008 J. Nonlinear Math. Phys. 15 (Suppl. 3) 73). We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel polynomials.
A generalization of the Bernoulli polynomials
Directory of Open Access Journals (Sweden)
Pierpaolo Natalini
2003-01-01
Full Text Available A generalization of the Bernoulli polynomials and, consequently, of the Bernoulli numbers, is defined starting from suitable generating functions. Furthermore, the differential equations of these new classes of polynomials are derived by means of the factorization method introduced by Infeld and Hull (1951.
The Bessel polynomials and their differential operators
International Nuclear Information System (INIS)
Onyango Otieno, V.P.
1987-10-01
Differential operators associated with the ordinary and the generalized Bessel polynomials are defined. In each case the commutator bracket is constructed and shows that the differential operators associated with the Bessel polynomials and their generalized form are not commutative. Some applications of these operators to linear differential equations are also discussed. (author). 4 refs
Exceptional polynomials and SUSY quantum mechanics
Indian Academy of Sciences (India)
Abstract. We show that for the quantum mechanical problem which admit classical Laguerre/. Jacobi polynomials as solutions for the Schrödinger equations (SE), will also admit exceptional. Laguerre/Jacobi polynomials as solutions having the same eigenvalues but with the ground state missing after a modification of the ...
Connections between the matching and chromatic polynomials
Directory of Open Access Journals (Sweden)
E. J. Farrell
1992-01-01
Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.
Laguerre polynomials by a harmonic oscillator
Baykal, Melek; Baykal, Ahmet
2014-09-01
The study of an isotropic harmonic oscillator, using the factorization method given in Ohanian's textbook on quantum mechanics, is refined and some collateral extensions of the method related to the ladder operators and the associated Laguerre polynomials are presented. In particular, some analytical properties of the associated Laguerre polynomials are derived using the ladder operators.
Laguerre polynomials by a harmonic oscillator
International Nuclear Information System (INIS)
Baykal, Melek; Baykal, Ahmet
2014-01-01
The study of an isotropic harmonic oscillator, using the factorization method given in Ohanian's textbook on quantum mechanics, is refined and some collateral extensions of the method related to the ladder operators and the associated Laguerre polynomials are presented. In particular, some analytical properties of the associated Laguerre polynomials are derived using the ladder operators. (paper)
On Generalisation of Polynomials in Complex Plane
Directory of Open Access Journals (Sweden)
Maslina Darus
2010-01-01
Full Text Available The generalised Bell and Laguerre polynomials of fractional-order in complex z-plane are defined. Some properties are studied. Moreover, we proved that these polynomials are univalent solutions for second order differential equations. Also, the Laguerre-type of some special functions are introduced.
Dual exponential polynomials and linear differential equations
Wen, Zhi-Tao; Gundersen, Gary G.; Heittokangas, Janne
2018-01-01
We study linear differential equations with exponential polynomial coefficients, where exactly one coefficient is of order greater than all the others. The main result shows that a nontrivial exponential polynomial solution of such an equation has a certain dual relationship with the maximum order coefficient. Several examples illustrate our results and exhibit possibilities that can occur.
Technique for image interpolation using polynomial transforms
Escalante Ramírez, B.; Martens, J.B.; Haskell, G.G.; Hang, H.M.
1993-01-01
We present a new technique for image interpolation based on polynomial transforms. This is an image representation model that analyzes an image by locally expanding it into a weighted sum of orthogonal polynomials. In the discrete case, the image segment within every window of analysis is
Factoring polynomials over arbitrary finite fields
Lange, T.; Winterhof, A.
2000-01-01
We analyse an extension of Shoup's (Inform. Process. Lett. 33 (1990) 261–267) deterministic algorithm for factoring polynomials over finite prime fields to arbitrary finite fields. In particular, we prove the existence of a deterministic algorithm which completely factors all monic polynomials of
Application of polynomial preconditioners to conservation laws
Geurts, Bernardus J.; van Buuren, R.; Lu, H.
2000-01-01
Polynomial preconditioners which are suitable in implicit time-stepping methods for conservation laws are reviewed and analyzed. The preconditioners considered are either based on a truncation of a Neumann series or on Chebyshev polynomials for the inverse of the system-matrix. The latter class of
On the number of polynomial solutions of Bernoulli and Abel polynomial differential equations
Cima, A.; Gasull, A.; Mañosas, F.
2017-12-01
In this paper we determine the maximum number of polynomial solutions of Bernoulli differential equations and of some integrable polynomial Abel differential equations. As far as we know, the tools used to prove our results have not been utilized before for studying this type of questions. We show that the addressed problems can be reduced to know the number of polynomial solutions of a related polynomial equation of arbitrary degree. Then we approach to these equations either applying several tools developed to study extended Fermat problems for polynomial equations, or reducing the question to the computation of the genus of some associated planar algebraic curves.
Matrix product formula for Macdonald polynomials
Cantini, Luigi; de Gier, Jan; Wheeler, Michael
2015-09-01
We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik-Zamolodchikov equations, which arise by considering representations of the Zamolodchikov-Faddeev and Yang-Baxter algebras in terms of t-deformed bosonic operators. These solutions are generalized probabilities for particle configurations of the multi-species asymmetric exclusion process, and form a basis of the ring of polynomials in n variables whose elements are indexed by compositions. For weakly increasing compositions (anti-dominant weights), these basis elements coincide with non-symmetric Macdonald polynomials. Our formulas imply a natural combinatorial interpretation in terms of solvable lattice models. They also imply that normalizations of stationary states of multi-species exclusion processes are obtained as Macdonald polynomials at q = 1.
Matrix product formula for Macdonald polynomials
International Nuclear Information System (INIS)
Cantini, Luigi; Gier, Jan de; Michael Wheeler
2015-01-01
We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik–Zamolodchikov equations, which arise by considering representations of the Zamolodchikov–Faddeev and Yang–Baxter algebras in terms of t-deformed bosonic operators. These solutions are generalized probabilities for particle configurations of the multi-species asymmetric exclusion process, and form a basis of the ring of polynomials in n variables whose elements are indexed by compositions. For weakly increasing compositions (anti-dominant weights), these basis elements coincide with non-symmetric Macdonald polynomials. Our formulas imply a natural combinatorial interpretation in terms of solvable lattice models. They also imply that normalizations of stationary states of multi-species exclusion processes are obtained as Macdonald polynomials at q = 1. (paper)
Arabic text classification using Polynomial Networks
Directory of Open Access Journals (Sweden)
Mayy M. Al-Tahrawi
2015-10-01
Full Text Available In this paper, an Arabic statistical learning-based text classification system has been developed using Polynomial Neural Networks. Polynomial Networks have been recently applied to English text classification, but they were never used for Arabic text classification. In this research, we investigate the performance of Polynomial Networks in classifying Arabic texts. Experiments are conducted on a widely used Arabic dataset in text classification: Al-Jazeera News dataset. We chose this dataset to enable direct comparisons of the performance of Polynomial Networks classifier versus other well-known classifiers on this dataset in the literature of Arabic text classification. Results of experiments show that Polynomial Networks classifier is a competitive algorithm to the state-of-the-art ones in the field of Arabic text classification.
Directory of Open Access Journals (Sweden)
Litesh N. Sulbhewar
Full Text Available The convergence characteristic of the conventional two-noded Euler-Bernoulli piezoelectric beam finite element depends on the configuration of the beam cross-section. The element shows slower convergence for the asymmetric material distribution in the beam cross-section due to 'material-locking' caused by extension-bending coupling. Hence, the use of conventional Euler-Bernoulli beam finite element to analyze piezoelectric beams which are generally made of the host layer with asymmetrically surface bonded piezoelectric layers/patches, leads to increased computational effort to yield converged results. Here, an efficient coupled polynomial interpolation scheme is proposed to improve the convergence of the Euler-Bernoulli piezoelectric beam finite elements, by eliminating ill-effects of material-locking. The equilibrium equations, derived using a variational formulation, are used to establish relationships between field variables. These relations are used to find a coupled quadratic polynomial for axial displacement, having contributions from an assumed cubic polynomial for transverse displacement and assumed linear polynomials for layerwise electric potentials. A set of coupled shape functions derived using these polynomials efficiently handles extension-bending and electromechanical couplings at the field interpolation level itself in a variationally consistent manner, without increasing the number of nodal degrees of freedom. The comparison of results obtained from numerical simulation of test problems shows that the convergence characteristic of the proposed element is insensitive to the material configuration of the beam cross-section.
Directory of Open Access Journals (Sweden)
V. P. Gribkova
2014-01-01
Full Text Available The paper offers a new method for approximate solution of one type of singular integral equations for elasticity theory which have been studied by other authors. The approximate solution is found in the form of asymptotic polynomial function of a low degree (first approximation based on the Chebyshev second order polynomial. Other authors have obtained a solution (only in separate points using a method of mechanical quadrature and though they used also the Chebyshev polynomial of the second order they applied another system of junctures which were used for the creation of the required formulas.The suggested method allows not only to find an approximate solution for the whole interval in the form of polynomial, but it also makes it possible to obtain a remainder term in the form of infinite expansion where coefficients are linear functional of the given integral equation and basis functions are the Chebyshev polynomial of the second order. Such presentation of the remainder term of the first approximation permits to find a summand of the infinite series, which will serve as a start for fulfilling the given solution accuracy. This number is a degree of the asymptotic polynomial (second approximation, which will give the approximation to the exact solution with the given accuracy. The examined polynomial functions tend asymptotically to the polynomial of the best uniform approximation in the space C, created for the given operator.The paper demonstrates a convergence of the approximate solution to the exact one and provides an error estimation. The proposed algorithm for obtaining of the approximate solution and error estimation is easily realized with the help of computing technique and does not require considerable preliminary preparation during programming.
The Role of Orthogonal Polynomials in Tailoring Spherical Distributions to Kurtosis Requirements
Directory of Open Access Journals (Sweden)
Luca Bagnato
2016-08-01
Full Text Available This paper carries out an investigation of the orthogonal-polynomial approach to reshaping symmetric distributions to fit in with data requirements so as to cover the multivariate case. With this objective in mind, reference is made to the class of spherical distributions, given that they provide a natural multivariate generalization of univariate even densities. After showing how to tailor a spherical distribution via orthogonal polynomials to better comply with kurtosis requirements, we provide operational conditions for the positiveness of the resulting multivariate Gram–Charlier-like expansion, together with its kurtosis range. Finally, the approach proposed here is applied to some selected spherical distributions.
Directory of Open Access Journals (Sweden)
Arun Kaintura
2018-02-01
Full Text Available Advances in manufacturing process technology are key ensembles for the production of integrated circuits in the sub-micrometer region. It is of paramount importance to assess the effects of tolerances in the manufacturing process on the performance of modern integrated circuits. The polynomial chaos expansion has emerged as a suitable alternative to standard Monte Carlo-based methods that are accurate, but computationally cumbersome. This paper provides an overview of the most recent developments and challenges in the application of polynomial chaos-based techniques for uncertainty quantification in integrated circuits, with particular focus on high-dimensional problems.
on the performance of Autoregressive Moving Average Polynomial
African Journals Online (AJOL)
Timothy Ademakinwa
Distributed Lag (PDL) model, Autoregressive Polynomial Distributed Lag ... Moving Average Polynomial Distributed Lag (ARMAPDL) model. ..... Global Journal of Mathematics and Statistics. Vol. 1. ... Business and Economic Research Center.
Pathology of nodal marginal zone lymphomas.
Pileri, Stefano; Ponzoni, Maurilio
Nodal marginal zone B cell lymphomas (NMZLs) are a rare group of lymphoid disorders part of the spectrum of marginal zone B-cell lymphomas, which encompass splenic marginal one B-cell lymphoma (SMZL) and extra nodal marginal zone of B-cell lymphoma (EMZL), often of MALT-type. Two clinicopathological forms of NMZL are recognized: adult-type and pediatric-type, respectively. NMZLs show overlapping features with other types of MZ, but distinctive features as well. In this review, we will focus on the salient distinguishing features of NMZL mostly under morphological/immunophenotypical/molecular perspectives in views of the recent acquisitions and forthcoming updated 2016 WHO classification of lymphoid malignancies. Copyright © 2016 Elsevier Ltd. All rights reserved.
Quantum anomalies in nodal line semimetals
Burkov, A. A.
2018-04-01
Topological semimetals are a new class of condensed matter systems with nontrivial electronic structure topology. Their unusual observable properties may often be understood in terms of quantum anomalies. In particular, Weyl and Dirac semimetals, which have point band-touching nodes, are characterized by the chiral anomaly, which leads to the Fermi arc surface states, anomalous Hall effect, negative longitudinal magnetoresistance, and planar Hall effect. In this paper, we explore analogous phenomena in nodal line semimetals. We demonstrate that such semimetals realize a three-dimensional analog of the parity anomaly, which is a known property of two-dimensional Dirac semimetals arising, for example, on the surface of a three-dimensional topological insulator. We relate one of the characteristic properties of nodal line semimetals, namely, the drumhead surface states, to this anomaly, and derive the field theory, which encodes the corresponding anomalous response.
Acceleration of the nodal program FERM
International Nuclear Information System (INIS)
Nakata, H.
1985-01-01
Acceleration of the nodal FERM was tried by three acceleration schemes. Results of the calculations showed the best acceleration with the Tchebyshev method where the savings in the computing time were of the order of 50%. Acceleration with the Assymptotic Source Extrapoltation Method and with the Coarse-Mesh Rebalancing Method did not result in any improvement on the global computational time, although a reduction in the number of outer iterations was observed. (Author) [pt
Nodal method for fast reactor analysis
International Nuclear Information System (INIS)
Shober, R.A.
1979-01-01
In this paper, a nodal method applicable to fast reactor diffusion theory analysis has been developed. This method has been shown to be accurate and efficient in comparison to highly optimized finite difference techniques. The use of an analytic solution to the diffusion equation as a means of determining accurate coupling relationships between nodes has been shown to be highly accurate and efficient in specific two-group applications, as well as in the current multigroup method
Neck curve polynomials in neck rupture model
International Nuclear Information System (INIS)
Kurniadi, Rizal; Perkasa, Yudha S.; Waris, Abdul
2012-01-01
The Neck Rupture Model is a model that explains the scission process which has smallest radius in liquid drop at certain position. Old fashion of rupture position is determined randomly so that has been called as Random Neck Rupture Model (RNRM). The neck curve polynomials have been employed in the Neck Rupture Model for calculation the fission yield of neutron induced fission reaction of 280 X 90 with changing of order of polynomials as well as temperature. The neck curve polynomials approximation shows the important effects in shaping of fission yield curve.
Nodal methods in numerical reactor calculations
International Nuclear Information System (INIS)
Hennart, J.P.; Valle, E. del
2004-01-01
The present work describes the antecedents, developments and applications started in 1972 with Prof. Hennart who was invited to be part of the staff of the Nuclear Engineering Department at the School of Physics and Mathematics of the National Polytechnic Institute. Since that time and up to 1981, several master theses based on classical finite element methods were developed with applications in point kinetics and in the steady state as well as the time dependent multigroup diffusion equations. After this period the emphasis moved to nodal finite elements in 1, 2 and 3D cartesian geometries. All the thesis were devoted to the numerical solution of the neutron multigroup diffusion and transport equations, few of them including the time dependence, most of them related with steady state diffusion equations. The main contributions were as follows: high order nodal schemes for the primal and mixed forms of the diffusion equations, block-centered finite-differences methods, post-processing, composite nodal finite elements for hexagons, and weakly and strongly discontinuous schemes for the transport equation. Some of these are now being used by several researchers involved in nuclear fuel management. (Author)
Nodal methods in numerical reactor calculations
Energy Technology Data Exchange (ETDEWEB)
Hennart, J P [UNAM, IIMAS, A.P. 20-726, 01000 Mexico D.F. (Mexico); Valle, E del [National Polytechnic Institute, School of Physics and Mathematics, Department of Nuclear Engineering, Mexico, D.F. (Mexico)
2004-07-01
The present work describes the antecedents, developments and applications started in 1972 with Prof. Hennart who was invited to be part of the staff of the Nuclear Engineering Department at the School of Physics and Mathematics of the National Polytechnic Institute. Since that time and up to 1981, several master theses based on classical finite element methods were developed with applications in point kinetics and in the steady state as well as the time dependent multigroup diffusion equations. After this period the emphasis moved to nodal finite elements in 1, 2 and 3D cartesian geometries. All the thesis were devoted to the numerical solution of the neutron multigroup diffusion and transport equations, few of them including the time dependence, most of them related with steady state diffusion equations. The main contributions were as follows: high order nodal schemes for the primal and mixed forms of the diffusion equations, block-centered finite-differences methods, post-processing, composite nodal finite elements for hexagons, and weakly and strongly discontinuous schemes for the transport equation. Some of these are now being used by several researchers involved in nuclear fuel management. (Author)
Nodal DG-FEM solution of high-order Boussinesq-type equations
DEFF Research Database (Denmark)
Engsig-Karup, Allan Peter; Hesthaven, Jan S.; Bingham, Harry B.
2006-01-01
We present a discontinuous Galerkin finite element method (DG-FEM) solution to a set of high-order Boussinesq-type equations for modelling highly nonlinear and dispersive water waves in one and two horizontal dimensions. The continuous equations are discretized using nodal polynomial basis...... functions of arbitrary order in space on each element of an unstructured computational domain. A fourth order explicit Runge-Kutta scheme is used to advance the solution in time. Methods for introducing artificial damping to control mild nonlinear instabilities are also discussed. The accuracy...... and convergence of the model with both h (grid size) and p (order) refinement are verified for the linearized equations, and calculations are provided for two nonlinear test cases in one horizontal dimension: harmonic generation over a submerged bar; and reflection of a steep solitary wave from a vertical wall...
Semiclassical expansions on and near caustics
International Nuclear Information System (INIS)
Meetz, K.
1984-09-01
We show that the standard WKB expansion can be generalized so that it reproduces the behavior of the wave function on and near a caustic in two-dimensional space time. The expansion is related to the unfolding polynomials of the elementary catastrophes occurring in two dimensions: the fold and the cusp catastrophe. The method determines control parameters and transport coefficients in a self-consistent way from differential equations and does not refer to the asymptotic expansion of Feynman path integrals. The lowest order equations are solved explicitly in terms of the multivalued classical action. The result is a generalized semiclassical approximation on and beyond a caustic. (orig.)
Multilevel weighted least squares polynomial approximation
Haji-Ali, Abdul-Lateef; Nobile, Fabio; Tempone, Raul; Wolfers, Sö ren
2017-01-01
, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose
Polynomials in finite geometries and combinatorics
Blokhuis, A.; Walker, K.
1993-01-01
It is illustrated how elementary properties of polynomials can be used to attack extremal problems in finite and euclidean geometry, and in combinatorics. Also a new result, related to the problem of neighbourly cylinders is presented.
Polynomial analysis of ambulatory blood pressure measurements
Zwinderman, A. H.; Cleophas, T. A.; Cleophas, T. J.; van der Wall, E. E.
2001-01-01
In normotensive subjects blood pressures follow a circadian rhythm. A circadian rhythm in hypertensive patients is less well established, and may be clinically important, particularly with rigorous treatments of daytime blood pressures. Polynomial analysis of ambulatory blood pressure monitoring
Handbook on semidefinite, conic and polynomial optimization
Anjos, Miguel F
2012-01-01
This book offers the reader a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization and polynomial optimization. It covers theory, algorithms, software and applications.
Transversals of Complex Polynomial Vector Fields
DEFF Research Database (Denmark)
Dias, Kealey
Vector fields in the complex plane are defined by assigning the vector determined by the value P(z) to each point z in the complex plane, where P is a polynomial of one complex variable. We consider special families of so-called rotated vector fields that are determined by a polynomial multiplied...... by rotational constants. Transversals are a certain class of curves for such a family of vector fields that represent the bifurcation states for this family of vector fields. More specifically, transversals are curves that coincide with a homoclinic separatrix for some rotation of the vector field. Given...... a concrete polynomial, it seems to take quite a bit of work to prove that it is generic, i.e. structurally stable. This has been done for a special class of degree d polynomial vector fields having simple equilibrium points at the d roots of unity, d odd. In proving that such vector fields are generic...
Generalized catalan numbers, sequences and polynomials
KOÇ, Cemal; GÜLOĞLU, İsmail; ESİN, Songül
2010-01-01
In this paper we present an algebraic interpretation for generalized Catalan numbers. We describe them as dimensions of certain subspaces of multilinear polynomials. This description is of utmost importance in the investigation of annihilators in exterior algebras.
Schur Stability Regions for Complex Quadratic Polynomials
Cheng, Sui Sun; Huang, Shao Yuan
2010-01-01
Given a quadratic polynomial with complex coefficients, necessary and sufficient conditions are found in terms of the coefficients such that all its roots have absolute values less than 1. (Contains 3 figures.)
On the non-uniqueness of the nodal mathematical adjoint
International Nuclear Information System (INIS)
Müller, Erwin
2014-01-01
Highlights: • We evaluate three CMFD schemes for computing the nodal mathematical adjoint. • The nodal mathematical adjoint is not unique and can be non-positive (nonphysical). • Adjoint and forward eigenmodes are compatible if produced by the same CMFD method. • In nodal applications the excited eigenmodes are purely mathematical entities. - Abstract: Computation of the neutron adjoint flux within the framework of modern nodal diffusion methods is often facilitated by reducing the nodal equation system for the forward flux into a simpler coarse-mesh finite-difference form and then transposing the resultant matrix equations. The solution to the transposed problem is known as the nodal mathematical adjoint. Since the coarse-mesh finite-difference reduction of a given nodal formulation can be obtained in a number of ways, different nodal mathematical adjoint solutions can be computed. This non-uniqueness of the nodal mathematical adjoint challenges the credibility of the reduction strategy and demands a verdict as to its suitability in practical applications. This is the matter under consideration in this paper. A selected number of coarse-mesh finite-difference reduction schemes are described and compared. Numerical calculations are utilised to illustrate the differences in the adjoint solutions as well as to appraise the impact on such common applications as the computation of core point kinetics parameters. Recommendations are made for the proper application of the coarse-mesh finite-difference reduction approach to the nodal mathematical adjoint problem
About the solvability of matrix polynomial equations
Netzer, Tim; Thom, Andreas
2016-01-01
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd degree with non-degenerate leading form can be solved in self-adjoint matrices. We also study equations of even degree and equations in many variables.
Two polynomial representations of experimental design
Notari, Roberto; Riccomagno, Eva; Rogantin, Maria-Piera
2007-01-01
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the literature: Groebner bases and indicator functions. We briefly describe them both, how they are used in the analysis and planning of a design and how to switch between them. Examples include fractions of full factorial designs and designs for mixture experiments.
Rotation of 2D orthogonal polynomials
Czech Academy of Sciences Publication Activity Database
Yang, B.; Flusser, Jan; Kautský, J.
2018-01-01
Roč. 102, č. 1 (2018), s. 44-49 ISSN 0167-8655 R&D Projects: GA ČR GA15-16928S Institutional support: RVO:67985556 Keywords : Rotation invariants * Orthogonal polynomials * Recurrent relation * Hermite-like polynomials * Hermite moments Subject RIV: JD - Computer Applications, Robotics Impact factor: 1.995, year: 2016 http://library.utia.cas.cz/separaty/2017/ZOI/flusser-0483250.pdf
Stability analysis of polynomial fuzzy models via polynomial fuzzy Lyapunov functions
Bernal Reza, Miguel Ángel; Sala, Antonio; JAADARI, ABDELHAFIDH; Guerra, Thierry-Marie
2011-01-01
In this paper, the stability of continuous-time polynomial fuzzy models by means of a polynomial generalization of fuzzy Lyapunov functions is studied. Fuzzy Lyapunov functions have been fruitfully used in the literature for local analysis of Takagi-Sugeno models, a particular class of the polynomial fuzzy ones. Based on a recent Taylor-series approach which allows a polynomial fuzzy model to exactly represent a nonlinear model in a compact set of the state space, it is shown that a refinemen...
Vertex models, TASEP and Grothendieck polynomials
International Nuclear Information System (INIS)
Motegi, Kohei; Sakai, Kazumitsu
2013-01-01
We examine the wavefunctions and their scalar products of a one-parameter family of integrable five-vertex models. At a special point of the parameter, the model investigated is related to an irreversible interacting stochastic particle system—the so-called totally asymmetric simple exclusion process (TASEP). By combining the quantum inverse scattering method with a matrix product representation of the wavefunctions, the on-/off-shell wavefunctions of the five-vertex models are represented as a certain determinant form. Up to some normalization factors, we find that the wavefunctions are given by Grothendieck polynomials, which are a one-parameter deformation of Schur polynomials. Introducing a dual version of the Grothendieck polynomials, and utilizing the determinant representation for the scalar products of the wavefunctions, we derive a generalized Cauchy identity satisfied by the Grothendieck polynomials and their duals. Several representation theoretical formulae for the Grothendieck polynomials are also presented. As a byproduct, the relaxation dynamics such as Green functions for the periodic TASEP are found to be described in terms of the Grothendieck polynomials. (paper)
DEFF Research Database (Denmark)
Zhao, Qian; Wang, Peng; Goel, Lalit
2013-01-01
The deregulation of power systems allows customers to participate in power market operation. In deregulated power systems, nodal price and nodal reliability are adopted to represent locational operation cost and reliability performance. Since contingency reserve (CR) plays an important role...... in reliable operation, the CR commitment should be considered in operational reliability analysis. In this paper, a CR model based on customer reliability requirements has been formulated and integrated into power market settlement. A two-step market clearing process has been proposed to determine generation...
Relations between Möbius and coboundary polynomials
Jurrius, R.P.M.J.
2012-01-01
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do not determine each other. Less is known about more specific cases. In this paper, we will investigate if it is possible that the Möbius polynomial of a matroid, together with the Möbius polynomial of
Wielandt method applied to the diffusion equations discretized by finite element nodal methods
International Nuclear Information System (INIS)
Mugica R, A.; Valle G, E. del
2003-01-01
Nowadays the numerical methods of solution to the diffusion equation by means of algorithms and computer programs result so extensive due to the great number of routines and calculations that should carry out, this rebounds directly in the execution times of this programs, being obtained results in relatively long times. This work shows the application of an acceleration method of the convergence of the classic method of those powers that it reduces notably the number of necessary iterations for to obtain reliable results, what means that the compute times they see reduced in great measure. This method is known in the literature like Wielandt method and it has incorporated to a computer program that is based on the discretization of the neutron diffusion equations in plate geometry and stationary state by polynomial nodal methods. In this work the neutron diffusion equations are described for several energy groups and their discretization by means of those called physical nodal methods, being illustrated in particular the quadratic case. It is described a model problem widely described in the literature which is solved for the physical nodal grade schemes 1, 2, 3 and 4 in three different ways: to) with the classic method of the powers, b) method of the powers with the Wielandt acceleration and c) method of the powers with the Wielandt modified acceleration. The results for the model problem as well as for two additional problems known as benchmark problems are reported. Such acceleration method can also be implemented to problems of different geometry to the proposal in this work, besides being possible to extend their application to problems in 2 or 3 dimensions. (Author)
International Nuclear Information System (INIS)
Cooling, C.M.; Williams, M.M.R.; Nygaard, E.T.; Eaton, M.D.
2013-01-01
Highlights: • A point kinetics model for the Medical Isotope Production Reactor is formulated. • Reactivity insertions are simulated using this model. • Polynomial chaos is used to simulate uncertainty in reactor parameters. • The computational efficiency of polynomial chaos is compared to that of Monte Carlo. -- Abstract: This paper models a conceptual Medical Isotope Production Reactor (MIPR) using a point kinetics model which is used to explore power excursions in the event of a reactivity insertion. The effect of uncertainty of key parameters is modelled using intrusive polynomial chaos. It is found that the system is stable against reactivity insertions and power excursions are all bounded and tend towards a new equilibrium state due to the negative feedbacks inherent in Aqueous Homogeneous Reactors (AHRs). The Polynomial Chaos Expansion (PCE) method is found to be much more computationally efficient than that of Monte Carlo simulation in this application
Directory of Open Access Journals (Sweden)
Masjed-Jamei Mohammad
2005-01-01
Full Text Available From the main equation ( a x 2 +bx+c y ″ n ( x +( dx+e y ′ n ( x −n( ( n−1 a+d y n ( x =0 , n∈ ℤ + , six finite and infinite classes of orthogonal polynomials can be extracted. In this work, first we have a survey on these classes, particularly on finite classes, and their corresponding rational orthogonal polynomials, which are generated by Mobius transform x=p z −1 +q , p≠0 , q∈ℝ . Some new integral relations are also given in this section for the Jacobi, Laguerre, and Bessel orthogonal polynomials. Then we show that the rational orthogonal polynomials can be a very suitable tool to compute the inverse Laplace transform directly, with no additional calculation for finding their roots. In this way, by applying infinite and finite rational classical orthogonal polynomials, we give three basic expansions of six ones as a sample for computation of inverse Laplace transform.
International Nuclear Information System (INIS)
Yun, Y.
2015-01-01
Thermal expansion of fuel pellet is an important property which limits the lifetime of the fuels in reactors, because it affects both the pellet and cladding mechanical interaction and the gap conductivity. By fitting a number of available measured data, recommended equations have been presented and successfully used to estimate thermal expansion coefficient of the nuclear fuel pellet. However, due to large scatter of the measured data, non-consensus data have been omitted in formulating the equations. Also, the equation is strongly governed by the lack of appropriate experimental data. For those reasons, it is important to develop theoretical methodologies to better describe thermal expansion behaviour of nuclear fuel. In particular, first-principles and molecular dynamics simulations have been certainly contributed to predict reliable thermal expansion without fitting the measured data. Furthermore, the two theoretical techniques have improved on understanding the change of fuel dimension by describing the atomic-scale processes associated with lattice expansion in the fuels. (author)
Topological surface states in nodal superconductors.
Schnyder, Andreas P; Brydon, Philip M R
2015-06-24
Topological superconductors have become a subject of intense research due to their potential use for technical applications in device fabrication and quantum information. Besides fully gapped superconductors, unconventional superconductors with point or line nodes in their order parameter can also exhibit nontrivial topological characteristics. This article reviews recent progress in the theoretical understanding of nodal topological superconductors, with a focus on Weyl and noncentrosymmetric superconductors and their protected surface states. Using selected examples, we review the bulk topological properties of these systems, study different types of topological surface states, and examine their unusual properties. Furthermore, we survey some candidate materials for topological superconductivity and discuss different experimental signatures of topological surface states.
Twisted vector bundles on pointed nodal curves
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
by identifying the points p1 and p2. If m ≥ 2, let R1,...,Rm−1 be m − 1 copies of the projective line P1 and let xi,yi be two distinct points in Ri. Let R be the nodal curve which arises from the union. R0 ⊔ R1 ⊔···⊔ Rm−1 ⊔ Rm by identifying p1 ∈ R0 and p2 ∈ Rm with x1 ∈ R1 and ym−1 ∈ Rm−1 respectively and by identifying ...
Special polynomials associated with rational solutions of some hierarchies
International Nuclear Information System (INIS)
Kudryashov, Nikolai A.
2009-01-01
New special polynomials associated with rational solutions of the Painleve hierarchies are introduced. The Hirota relations for these special polynomials are found. Differential-difference hierarchies to find special polynomials are presented. These formulae allow us to search special polynomials associated with the hierarchies. It is shown that rational solutions of the Caudrey-Dodd-Gibbon, the Kaup-Kupershmidt and the modified hierarchy for these ones can be obtained using new special polynomials.
On the Connection Coefficients of the Chebyshev-Boubaker Polynomials
Directory of Open Access Journals (Sweden)
Paul Barry
2013-01-01
Full Text Available The Chebyshev-Boubaker polynomials are the orthogonal polynomials whose coefficient arrays are defined by ordinary Riordan arrays. Examples include the Chebyshev polynomials of the second kind and the Boubaker polynomials. We study the connection coefficients of this class of orthogonal polynomials, indicating how Riordan array techniques can lead to closed-form expressions for these connection coefficients as well as recurrence relations that define them.
New polynomial-based molecular descriptors with low degeneracy.
Directory of Open Access Journals (Sweden)
Matthias Dehmer
Full Text Available In this paper, we introduce a novel graph polynomial called the 'information polynomial' of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set. By using the zeros of the obtained polynomial, we additionally define some novel spectral descriptors. Compared with those based on computing the ordinary characteristic polynomial of a graph, we perform a numerical study using real chemical databases. We obtain that the novel descriptors do have a high discrimination power.
Miller, W., Jr.; Li, Q.
2015-04-01
The Wilson and Racah polynomials can be characterized as basis functions for irreducible representations of the quadratic symmetry algebra of the quantum superintegrable system on the 2-sphere, HΨ = EΨ, with generic 3-parameter potential. Clearly, the polynomials are expansion coefficients for one eigenbasis of a symmetry operator L2 of H in terms of an eigenbasis of another symmetry operator L1, but the exact relationship appears not to have been made explicit. We work out the details of the expansion to show, explicitly, how the polynomials arise and how the principal properties of these functions: the measure, 3-term recurrence relation, 2nd order difference equation, duality of these relations, permutation symmetry, intertwining operators and an alternate derivation of Wilson functions - follow from the symmetry of this quantum system. This paper is an exercise to show that quantum mechancal concepts and recurrence relations for Gausian hypergeometrc functions alone suffice to explain these properties; we make no assumptions about the structure of Wilson polynomial/functions, but derive them from quantum principles. There is active interest in the relation between multivariable Wilson polynomials and the quantum superintegrable system on the n-sphere with generic potential, and these results should aid in the generalization. Contracting function space realizations of irreducible representations of this quadratic algebra to the other superintegrable systems one can obtain the full Askey scheme of orthogonal hypergeometric polynomials. All of these contractions of superintegrable systems with potential are uniquely induced by Wigner Lie algebra contractions of so(3, C) and e(2,C). All of the polynomials produced are interpretable as quantum expansion coefficients. It is important to extend this process to higher dimensions.
International Nuclear Information System (INIS)
Miller, W Jr; Li, Q
2015-01-01
The Wilson and Racah polynomials can be characterized as basis functions for irreducible representations of the quadratic symmetry algebra of the quantum superintegrable system on the 2-sphere, HΨ = EΨ, with generic 3-parameter potential. Clearly, the polynomials are expansion coefficients for one eigenbasis of a symmetry operator L 2 of H in terms of an eigenbasis of another symmetry operator L 1 , but the exact relationship appears not to have been made explicit. We work out the details of the expansion to show, explicitly, how the polynomials arise and how the principal properties of these functions: the measure, 3-term recurrence relation, 2nd order difference equation, duality of these relations, permutation symmetry, intertwining operators and an alternate derivation of Wilson functions - follow from the symmetry of this quantum system. This paper is an exercise to show that quantum mechancal concepts and recurrence relations for Gausian hypergeometrc functions alone suffice to explain these properties; we make no assumptions about the structure of Wilson polynomial/functions, but derive them from quantum principles. There is active interest in the relation between multivariable Wilson polynomials and the quantum superintegrable system on the n-sphere with generic potential, and these results should aid in the generalization. Contracting function space realizations of irreducible representations of this quadratic algebra to the other superintegrable systems one can obtain the full Askey scheme of orthogonal hypergeometric polynomials. All of these contractions of superintegrable systems with potential are uniquely induced by Wigner Lie algebra contractions of so(3, C) and e(2,C). All of the polynomials produced are interpretable as quantum expansion coefficients. It is important to extend this process to higher dimensions. (paper)
Uncertainty Analysis via Failure Domain Characterization: Polynomial Requirement Functions
Crespo, Luis G.; Munoz, Cesar A.; Narkawicz, Anthony J.; Kenny, Sean P.; Giesy, Daniel P.
2011-01-01
This paper proposes an uncertainty analysis framework based on the characterization of the uncertain parameter space. This characterization enables the identification of worst-case uncertainty combinations and the approximation of the failure and safe domains with a high level of accuracy. Because these approximations are comprised of subsets of readily computable probability, they enable the calculation of arbitrarily tight upper and lower bounds to the failure probability. A Bernstein expansion approach is used to size hyper-rectangular subsets while a sum of squares programming approach is used to size quasi-ellipsoidal subsets. These methods are applicable to requirement functions whose functional dependency on the uncertainty is a known polynomial. Some of the most prominent features of the methodology are the substantial desensitization of the calculations from the uncertainty model assumed (i.e., the probability distribution describing the uncertainty) as well as the accommodation for changes in such a model with a practically insignificant amount of computational effort.
A new class of generalized polynomials associated with Hermite and Bernoulli polynomials
Directory of Open Access Journals (Sweden)
M. A. Pathan
2015-05-01
Full Text Available In this paper, we introduce a new class of generalized polynomials associated with the modified Milne-Thomson's polynomials Φ_{n}^{(α}(x,ν of degree n and order α introduced by Derre and Simsek.The concepts of Bernoulli numbers B_n, Bernoulli polynomials B_n(x, generalized Bernoulli numbers B_n(a,b, generalized Bernoulli polynomials B_n(x;a,b,c of Luo et al, Hermite-Bernoulli polynomials {_HB}_n(x,y of Dattoli et al and {_HB}_n^{(α} (x,y of Pathan are generalized to the one {_HB}_n^{(α}(x,y,a,b,c which is called the generalized polynomial depending on three positive real parameters. Numerous properties of these polynomials and some relationships between B_n, B_n(x, B_n(a,b, B_n(x;a,b,c and {}_HB_n^{(α}(x,y;a,b,c are established. Some implicit summation formulae and general symmetry identities are derived by using different analytical means and applying generating functions. These results extend some known summations and identities of generalized Bernoulli numbers and polynomials
Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
Ait-Haddou, Rachid; Goldman, Ron
2015-01-01
We show that a weighted least squares approximation of q-Bézier coefficients provides the best polynomial degree reduction in the q-L2-norm. We also provide a finite analogue of this result with respect to finite q-lattices and we present applications of these results to q-orthogonal polynomials. © 2015 Elsevier Inc. All rights reserved.
Certain non-linear differential polynomials sharing a non zero polynomial
Directory of Open Access Journals (Sweden)
Majumder Sujoy
2015-10-01
functions sharing a nonzero polynomial and obtain two results which improves and generalizes the results due to L. Liu [Uniqueness of meromorphic functions and differential polynomials, Comput. Math. Appl., 56 (2008, 3236-3245.] and P. Sahoo [Uniqueness and weighted value sharing of meromorphic functions, Applied. Math. E-Notes., 11 (2011, 23-32.].
Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
Ait-Haddou, Rachid
2015-06-07
We show that a weighted least squares approximation of q-Bézier coefficients provides the best polynomial degree reduction in the q-L2-norm. We also provide a finite analogue of this result with respect to finite q-lattices and we present applications of these results to q-orthogonal polynomials. © 2015 Elsevier Inc. All rights reserved.
Robust doubly charged nodal lines and nodal surfaces in centrosymmetric systems
Bzdušek, Tomáš; Sigrist, Manfred
2017-10-01
Weyl points in three spatial dimensions are characterized by a Z -valued charge—the Chern number—which makes them stable against a wide range of perturbations. A set of Weyl points can mutually annihilate only if their net charge vanishes, a property we refer to as robustness. While nodal loops are usually not robust in this sense, it has recently been shown using homotopy arguments that in the centrosymmetric extension of the AI symmetry class they nevertheless develop a Z2 charge analogous to the Chern number. Nodal loops carrying a nontrivial value of this Z2 charge are robust, i.e., they can be gapped out only by a pairwise annihilation and not on their own. As this is an additional charge independent of the Berry π -phase flowing along the band degeneracy, such nodal loops are, in fact, doubly charged. In this manuscript, we generalize the homotopy discussion to the centrosymmetric extensions of all Atland-Zirnbauer classes. We develop a tailored mathematical framework dubbed the AZ +I classification and show that in three spatial dimensions such robust and multiply charged nodes appear in four of such centrosymmetric extensions, namely, AZ +I classes CI and AI lead to doubly charged nodal lines, while D and BDI support doubly charged nodal surfaces. We remark that no further crystalline symmetries apart from the spatial inversion are necessary for their stability. We provide a description of the corresponding topological charges, and develop simple tight-binding models of various semimetallic and superconducting phases that exhibit these nodes. We also indicate how the concept of robust and multiply charged nodes generalizes to other spatial dimensions.
Discrete-time state estimation for stochastic polynomial systems over polynomial observations
Hernandez-Gonzalez, M.; Basin, M.; Stepanov, O.
2018-07-01
This paper presents a solution to the mean-square state estimation problem for stochastic nonlinear polynomial systems over polynomial observations confused with additive white Gaussian noises. The solution is given in two steps: (a) computing the time-update equations and (b) computing the measurement-update equations for the state estimate and error covariance matrix. A closed form of this filter is obtained by expressing conditional expectations of polynomial terms as functions of the state estimate and error covariance. As a particular case, the mean-square filtering equations are derived for a third-degree polynomial system with second-degree polynomial measurements. Numerical simulations show effectiveness of the proposed filter compared to the extended Kalman filter.
Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach
Nasiri, Alireza; Nguang, Sing Kiong; Swain, Akshya; Almakhles, Dhafer
2018-02-01
This paper deals with the problem of designing a controller for a class of discrete-time nonlinear systems which is represented by discrete-time polynomial fuzzy model. Most of the existing control design methods for discrete-time fuzzy polynomial systems cannot guarantee their Lyapunov function to be a radially unbounded polynomial function, hence the global stability cannot be assured. The proposed control design in this paper guarantees a radially unbounded polynomial Lyapunov functions which ensures global stability. In the proposed design, state feedback structure is considered and non-convexity problem is solved by incorporating an integrator into the controller. Sufficient conditions of stability are derived in terms of polynomial matrix inequalities which are solved via SOSTOOLS in MATLAB. A numerical example is presented to illustrate the effectiveness of the proposed controller.
Vortices and polynomials: non-uniqueness of the Adler–Moser polynomials for the Tkachenko equation
International Nuclear Information System (INIS)
Demina, Maria V; Kudryashov, Nikolai A
2012-01-01
Stationary and translating relative equilibria of point vortices in the plane are studied. It is shown that stationary equilibria of any system containing point vortices with arbitrary choice of circulations can be described with the help of the Tkachenko equation. It is also obtained that translating relative equilibria of point vortices with arbitrary circulations can be constructed using a generalization of the Tkachenko equation. Roots of any pair of polynomials solving the Tkachenko equation and the generalized Tkachenko equation are proved to give positions of point vortices in stationary and translating relative equilibria accordingly. These results are valid even if the polynomials in a pair have multiple or common roots. It is obtained that the Adler–Moser polynomial provides non-unique polynomial solutions of the Tkachenko equation. It is shown that the generalized Tkachenko equation possesses polynomial solutions with degrees that are not triangular numbers. (paper)
Remarks on determinants and the classical polynomials
International Nuclear Information System (INIS)
Henning, J.J.; Kranold, H.U.; Louw, D.F.B.
1986-01-01
As motivation for this formal analysis the problem of Landau damping of Bernstein modes is discussed. It is shown that in the case of a weak but finite constant external magnetic field, the analytical structure of the dispersion relations is of such a nature that longitudinal waves propagating orthogonal to the external magnetic field are also damped, contrary to normal belief. In the treatment of the linearized Vlasov equation it is found convenient to generate certain polynomials by the problem at hand and to explicitly write down expressions for these polynomials. In the course of this study methods are used that relate to elementary but fairly unknown functional relationships between power sums and coefficients of polynomials. These relationships, also called Waring functions, are derived. They are then used in other applications to give explicit expressions for the generalized Laguerre polynomials in terms of determinant functions. The properties of polynomials generated by a wide class of generating functions are investigated. These relationships are also used to obtain explicit forms for the cumulants of a distribution in terms of its moments. It is pointed out that cumulants (or moments, for that matter) do not determine a distribution function
Multilevel weighted least squares polynomial approximation
Haji-Ali, Abdul-Lateef
2017-06-30
Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.
Arun Kaintura; Tom Dhaene; Domenico Spina
2018-01-01
Advances in manufacturing process technology are key ensembles for the production of integrated circuits in the sub-micrometer region. It is of paramount importance to assess the effects of tolerances in the manufacturing process on the performance of modern integrated circuits. The polynomial chaos expansion has emerged as a suitable alternative to standard Monte Carlo-based methods that are accurate, but computationally cumbersome. This paper provides an overview of the most recent developm...
Radiotherapy of adult nodal non Hodgkin's lymphoma
International Nuclear Information System (INIS)
Gamen, G.; Thirion, P.
1999-01-01
The role of radiotherapy in the treatment of nodal non-Hodgkin's lymphoma has been modified by the introduction of efficient chemotherapy and the development of different pathological classifications. The recommended treatment of early-stage aggressive lymphomas is primarily a combination chemotherapy. The interest of adjuvant radiotherapy remains unclear and has to be established through large prospective trials. If radiation therapy has to be delivered, the historical results of exclusive radiation therapy showed that involved-fields and a dose of 35-40 Gy (daily fraction of 1.8 Gy, 5 days a week) are the optimal schedule. The interest of radiotherapy in the treatment of advanced-stage aggressive lymphoma is yet to be proven. Further studies had to stratify localized stages according to the factors of the International Prognostic Index. For easy-stage low-grade lymphoma, radiotherapy remains the standard treatment. However, the appropriate technique to use is controversial. Involved-field irradiation at a dose of 35 Gy seems to be the optimal schedule, providing a 10 year disease-free survival rate of 50 % and no major toxicity. There is no standard indication of radiotherapy in the treatment advanced-stage low-grade lymphoma. For 'new' nodal lymphoma's types, the indication of radiotherapy cannot be established (mantle-zone lymphoma, marginal zone B-cell lymphoma) or must take into account the natural history (Burkitt's lymphoma, peripheral T-cell lymphoma) and the sensibility to others therapeutic methods. (authors)
Error estimation for variational nodal calculations
International Nuclear Information System (INIS)
Zhang, H.; Lewis, E.E.
1998-01-01
Adaptive grid methods are widely employed in finite element solutions to both solid and fluid mechanics problems. Either the size of the element is reduced (h refinement) or the order of the trial function is increased (p refinement) locally to improve the accuracy of the solution without a commensurate increase in computational effort. Success of these methods requires effective local error estimates to determine those parts of the problem domain where the solution should be refined. Adaptive methods have recently been applied to the spatial variables of the discrete ordinates equations. As a first step in the development of adaptive methods that are compatible with the variational nodal method, the authors examine error estimates for use in conjunction with spatial variables. The variational nodal method lends itself well to p refinement because the space-angle trial functions are hierarchical. Here they examine an error estimator for use with spatial p refinement for the diffusion approximation. Eventually, angular refinement will also be considered using spherical harmonics approximations
Orthogonal Expansions for VIX Options Under Affine Jump Diffusions
DEFF Research Database (Denmark)
Barletta, Andrea; Nicolato, Elisa
2017-01-01
In this work we derive new closed–form pricing formulas for VIX options in the jump-diffusion SVJJ model proposed by Duffie et al. (2000). Our approach is based on the classic methodology of approximating a density function with an orthogonal expansion of polynomials weighted by a kernel. Orthogo......In this work we derive new closed–form pricing formulas for VIX options in the jump-diffusion SVJJ model proposed by Duffie et al. (2000). Our approach is based on the classic methodology of approximating a density function with an orthogonal expansion of polynomials weighted by a kernel...
Hermite Polynomials and the Inverse Problem for Collisionless Equilibria
Allanson, O.; Neukirch, T.; Troscheit, S.; Wilson, F.
2017-12-01
It is long established that Hermite polynomial expansions in either velocity or momentum space can elegantly encode the non-Maxwellian velocity-space structure of a collisionless plasma distribution function (DF). In particular, Hermite polynomials in the canonical momenta naturally arise in the consideration of the 'inverse problem in collisionless equilibria' (IPCE): "for a given macroscopic/fluid equilibrium, what are the self-consistent Vlasov-Maxwell equilibrium DFs?". This question is of particular interest for the equilibrium and stability properties of a given macroscopic configuration, e.g. a current sheet. It can be relatively straightforward to construct a formal solution to IPCE by a Hermite expansion method, but several important questions remain regarding the use of this method. We present recent work that considers the necessary conditions of non-negativity, convergence, and the existence of all moments of an equilibrium DF solution found for IPCE. We also establish meaningful analogies between the equations that link the microscopic and macrosopic descriptions of the Vlasov-Maxwell equilibrium, and those that solve the initial value problem for the heat equation. In the language of the heat equation, IPCE poses the pressure tensor as the 'present' heat distribution over an infinite domain, and the non-Maxwellian features of the DF as the 'past' distribution. We find sufficient conditions for the convergence of the Hermite series representation of the DF, and prove that the non-negativity of the DF can be dependent on the magnetisation of the plasma. For DFs that decay at least as quickly as exp(-v^2/4), we show non-negativity is guaranteed for at least a finite range of magnetisation values, as parameterised by the ratio of the Larmor radius to the gradient length scale. 1. O. Allanson, T. Neukirch, S. Troscheit & F. Wilson: From one-dimensional fields to Vlasov equilibria: theory and application of Hermite polynomials, Journal of Plasma Physics, 82
Minimal residual method stronger than polynomial preconditioning
Energy Technology Data Exchange (ETDEWEB)
Faber, V.; Joubert, W.; Knill, E. [Los Alamos National Lab., NM (United States)] [and others
1994-12-31
Two popular methods for solving symmetric and nonsymmetric systems of equations are the minimal residual method, implemented by algorithms such as GMRES, and polynomial preconditioning methods. In this study results are given on the convergence rates of these methods for various classes of matrices. It is shown that for some matrices, such as normal matrices, the convergence rates for GMRES and for the optimal polynomial preconditioning are the same, and for other matrices such as the upper triangular Toeplitz matrices, it is at least assured that if one method converges then the other must converge. On the other hand, it is shown that matrices exist for which restarted GMRES always converges but any polynomial preconditioning of corresponding degree makes no progress toward the solution for some initial error. The implications of these results for these and other iterative methods are discussed.
Fast beampattern evaluation by polynomial rooting
Häcker, P.; Uhlich, S.; Yang, B.
2011-07-01
Current automotive radar systems measure the distance, the relative velocity and the direction of objects in their environment. This information enables the car to support the driver. The direction estimation capabilities of a sensor array depend on its beampattern. To find the array configuration leading to the best angle estimation by a global optimization algorithm, a huge amount of beampatterns have to be calculated to detect their maxima. In this paper, a novel algorithm is proposed to find all maxima of an array's beampattern fast and reliably, leading to accelerated array optimizations. The algorithm works for arrays having the sensors on a uniformly spaced grid. We use a general version of the gcd (greatest common divisor) function in order to write the problem as a polynomial. We differentiate and root the polynomial to get the extrema of the beampattern. In addition, we show a method to reduce the computational burden even more by decreasing the order of the polynomial.
Twisted Polynomials and Forgery Attacks on GCM
DEFF Research Database (Denmark)
Abdelraheem, Mohamed Ahmed A. M. A.; Beelen, Peter; Bogdanov, Andrey
2015-01-01
Polynomial hashing as an instantiation of universal hashing is a widely employed method for the construction of MACs and authenticated encryption (AE) schemes, the ubiquitous GCM being a prominent example. It is also used in recent AE proposals within the CAESAR competition which aim at providing...... in an improved key recovery algorithm. As cryptanalytic applications of our twisted polynomials, we develop the first universal forgery attacks on GCM in the weak-key model that do not require nonce reuse. Moreover, we present universal weak-key forgeries for the nonce-misuse resistant AE scheme POET, which...
Polynomial Vector Fields in One Complex Variable
DEFF Research Database (Denmark)
Branner, Bodil
In recent years Adrien Douady was interested in polynomial vector fields, both in relation to iteration theory and as a topic on their own. This talk is based on his work with Pierrette Sentenac, work of Xavier Buff and Tan Lei, and my own joint work with Kealey Dias.......In recent years Adrien Douady was interested in polynomial vector fields, both in relation to iteration theory and as a topic on their own. This talk is based on his work with Pierrette Sentenac, work of Xavier Buff and Tan Lei, and my own joint work with Kealey Dias....
The chromatic polynomial and list colorings
DEFF Research Database (Denmark)
Thomassen, Carsten
2009-01-01
We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph.......We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph....
Complex centers of polynomial differential equations
Directory of Open Access Journals (Sweden)
Mohamad Ali M. Alwash
2007-07-01
Full Text Available We present some results on the existence and nonexistence of centers for polynomial first order ordinary differential equations with complex coefficients. In particular, we show that binomial differential equations without linear terms do not have complex centers. Classes of polynomial differential equations, with more than two terms, are presented that do not have complex centers. We also study the relation between complex centers and the Pugh problem. An algorithm is described to solve the Pugh problem for equations without complex centers. The method of proof involves phase plane analysis of the polar equations and a local study of periodic solutions.
Differential recurrence formulae for orthogonal polynomials
Directory of Open Access Journals (Sweden)
Anton L. W. von Bachhaus
1995-11-01
Full Text Available Part I - By combining a general 2nd-order linear homogeneous ordinary differential equation with the three-term recurrence relation possessed by all orthogonal polynomials, it is shown that sequences of orthogonal polynomials which satisfy a differential equation of the above mentioned type necessarily have a differentiation formula of the type: gn(xY'n(x=fn(xYn(x+Yn-1(x. Part II - A recurrence formula of the form: rn(xY'n(x+sn(xY'n+1(x+tn(xY'n-1(x=0, is derived using the result of Part I.
Torsionfree Sheaves over a Nodal Curve of Arithmetic Genus One
Indian Academy of Sciences (India)
We classify all isomorphism classes of stable torsionfree sheaves on an irreducible nodal curve of arithmetic genus one defined over C C . Let be a nodal curve of arithmetic genus one defined over R R , with exactly one node, such that does not have any real points apart from the node. We classify all isomorphism ...
Moments expansion densities for quantifying financial risk
Ñíguez, T.M.; Perote, J.
2017-01-01
We propose a novel semi-nonparametric distribution that is feasibly parameterized to represent the non-Gaussianities of the asset return distributions. Our Moments Expansion (ME) density presents gains in simplicity attributable to its innovative polynomials, which are defined by the difference between the nth power of the random variable and the nth moment of the density used as the basis. We show that the Gram-Charlier distribution is a particular case of the ME-type of densities. The latte...
Polynomial regression analysis and significance test of the regression function
International Nuclear Information System (INIS)
Gao Zhengming; Zhao Juan; He Shengping
2012-01-01
In order to analyze the decay heating power of a certain radioactive isotope per kilogram with polynomial regression method, the paper firstly demonstrated the broad usage of polynomial function and deduced its parameters with ordinary least squares estimate. Then significance test method of polynomial regression function is derived considering the similarity between the polynomial regression model and the multivariable linear regression model. Finally, polynomial regression analysis and significance test of the polynomial function are done to the decay heating power of the iso tope per kilogram in accord with the authors' real work. (authors)
A nodalization study of steam separator in real time simulation
International Nuclear Information System (INIS)
Horugshyang, Lein; Luh, R.T.J.; Zen-Yow, Wang
1999-01-01
The motive of this paper is to investigate the influence of steam separator nodalization on reactor thermohydraulics in terms of stability and level response. Three different nodalizations of steam separator are studied by using THEATRE and REMARK Code in a BWR simulator. The first nodalization is the traditional one with two nodes for steam separator. In this nodalization, the steam separation is modeled in the outer node, i.e., upper downcomer. Separated steam enters the Steen dome node and the liquid goes to the feedwater node. The second nodalization is similar to the first one with the steam separation modeled in the inner node. There is one additional junction connecting steam dome node and the inner node. The liquid fallback junction connects the inner node and feedwater node. The third nodalization is a combination of the former two with an integrated node for steam separator. Boundary conditions in this study are provided by a simplified feedwater and main steam driver. For comparison purpose, three tests including full power steady state initialisation, recirculation pumps runback and reactor scram are conducted. Major parameters such as reactor pressure, reactor level, void fractions, neutronic power and junction flows are recorded for analysis. Test results clearly show that the first nodalization is stable for steady state initialisation. However it has too responsive level performance in core flow reduction transients. The second nodalization is the closest representation of real plant structure, but not the performance. Test results show that an instability occurs in the separator region for both steady state initialisation and transients. This instability is caused by an unbalanced momentum in the dual loop configuration. The magnitude of the oscillation reduces as the power decreases. No superiority to the other nodalizations is shown in the test results. The third nodalization shows both stability and responsiveness in the tests. (author)
Energy Technology Data Exchange (ETDEWEB)
Leal, Andre Luiz do Carmo
2008-07-01
In this work we evaluate polynomial approximations to obtain the transfer functions that appear in SGF auxiliary equations (Green's Functions) for monoenergetic linearly anisotropic scattering SN equations in one-dimensional Cartesian geometry. For this task we use Lagrange Polynomials in order to compare the numerical results with the ones generated by the standard SGF method applied to SN problems in heterogeneous domains. This work is a preliminary investigation of a new proposal for handling the transverse leakage terms that appear in the transverse-integrated one-dimensional SN equations when we use the SGF - exponential nodal method (SGF-ExpN) in multidimensional rectangular geometry. (author)
Energy Technology Data Exchange (ETDEWEB)
Degroote, M. [Rice Univ., Houston, TX (United States); Henderson, T. M. [Rice Univ., Houston, TX (United States); Zhao, J. [Rice Univ., Houston, TX (United States); Dukelsky, J. [Consejo Superior de Investigaciones Cientificas (CSIC), Madrid (Spain). Inst. de Estructura de la Materia; Scuseria, G. E. [Rice Univ., Houston, TX (United States)
2018-01-03
We present a similarity transformation theory based on a polynomial form of a particle-hole pair excitation operator. In the weakly correlated limit, this polynomial becomes an exponential, leading to coupled cluster doubles. In the opposite strongly correlated limit, the polynomial becomes an extended Bessel expansion and yields the projected BCS wavefunction. In between, we interpolate using a single parameter. The e ective Hamiltonian is non-hermitian and this Polynomial Similarity Transformation Theory follows the philosophy of traditional coupled cluster, left projecting the transformed Hamiltonian onto subspaces of the Hilbert space in which the wave function variance is forced to be zero. Similarly, the interpolation parameter is obtained through minimizing the next residual in the projective hierarchy. We rationalize and demonstrate how and why coupled cluster doubles is ill suited to the strongly correlated limit whereas the Bessel expansion remains well behaved. The model provides accurate wave functions with energy errors that in its best variant are smaller than 1% across all interaction stengths. The numerical cost is polynomial in system size and the theory can be straightforwardly applied to any realistic Hamiltonian.
Topological surface states in nodal superconductors
International Nuclear Information System (INIS)
Schnyder, Andreas P; Brydon, Philip M R
2015-01-01
Topological superconductors have become a subject of intense research due to their potential use for technical applications in device fabrication and quantum information. Besides fully gapped superconductors, unconventional superconductors with point or line nodes in their order parameter can also exhibit nontrivial topological characteristics. This article reviews recent progress in the theoretical understanding of nodal topological superconductors, with a focus on Weyl and noncentrosymmetric superconductors and their protected surface states. Using selected examples, we review the bulk topological properties of these systems, study different types of topological surface states, and examine their unusual properties. Furthermore, we survey some candidate materials for topological superconductivity and discuss different experimental signatures of topological surface states. (topical review)
Nodal aberration theory applied to freeform surfaces
Fuerschbach, Kyle; Rolland, Jannick P.; Thompson, Kevin P.
2014-12-01
When new three-dimensional packages are developed for imaging optical systems, the rotational symmetry of the optical system is often broken, changing its imaging behavior and making the optical performance worse. A method to restore the performance is to use freeform optical surfaces that compensate directly the aberrations introduced from tilting and decentering the optical surfaces. In order to effectively optimize the shape of a freeform surface to restore optical functionality, it is helpful to understand the aberration effect the surface may induce. Using nodal aberration theory the aberration fields induced by a freeform surface in an optical system are explored. These theoretical predications are experimentally validated with the design and implementation of an aberration generating telescope.
Delineation of Internal Mammary Nodal Target Volumes in Breast Cancer Radiation Therapy
Energy Technology Data Exchange (ETDEWEB)
Jethwa, Krishan R.; Kahila, Mohamed M. [Department of Radiation Oncology, Mayo Clinic, Rochester, Minnesota (United States); Hunt, Katie N. [Department of Radiology, Mayo Clinic, Rochester, Minnesota (United States); Brown, Lindsay C.; Corbin, Kimberly S.; Park, Sean S.; Yan, Elizabeth S. [Department of Radiation Oncology, Mayo Clinic, Rochester, Minnesota (United States); Boughey, Judy C. [Department of Surgery, Mayo Clinic, Rochester, Minnesota (United States); Mutter, Robert W., E-mail: mutter.robert@mayo.edu [Department of Radiation Oncology, Mayo Clinic, Rochester, Minnesota (United States)
2017-03-15
Purpose: The optimal clinical target volume for internal mammary (IM) node irradiation is uncertain in an era of increasingly conformal volume-based treatment planning for breast cancer. We mapped the location of gross internal mammary lymph node (IMN) metastases to identify areas at highest risk of harboring occult disease. Methods and Materials: Patients with axial imaging of IMN disease were identified from a breast cancer registry. The IMN location was transferred onto the corresponding anatomic position on representative axial computed tomography images of a patient in the treatment position and compared with consensus group guidelines of IMN target delineation. Results: The IMN location in 67 patients with 130 IMN metastases was mapped. The location was in the first 3 intercostal spaces in 102 of 130 nodal metastases (78%), whereas 18 of 130 IMNs (14%) were located caudal to the third intercostal space and 10 of 130 IMNs (8%) were located cranial to the first intercostal space. Of the 102 nodal metastases within the first 3 intercostal spaces, 54 (53%) were located within the Radiation Therapy Oncology Group consensus volume. Relative to the IM vessels, 19 nodal metastases (19%) were located medially with a mean distance of 2.2 mm (SD, 2.9 mm) whereas 29 (28%) were located laterally with a mean distance of 3.6 mm (SD, 2.5 mm). Ninety percent of lymph nodes within the first 3 intercostal spaces would have been encompassed within a 4-mm medial and lateral expansion on the IM vessels. Conclusions: In women with indications for elective IMN irradiation, a 4-mm medial and lateral expansion on the IM vessels may be appropriate. In women with known IMN involvement, cranial extension to the confluence of the IM vein with the brachiocephalic vein with or without caudal extension to the fourth or fifth interspace may be considered provided that normal tissue constraints are met.
Nonclassical Orthogonal Polynomials and Corresponding Quadratures
Fukuda, H; Alt, E O; Matveenko, A V
2004-01-01
We construct nonclassical orthogonal polynomials and calculate abscissas and weights of Gaussian quadrature for arbitrary weight and interval. The program is written by Mathematica and it works if moment integrals are given analytically. The result is a FORTRAN subroutine ready to utilize the quadrature.
Intrinsic Diophantine approximation on general polynomial surfaces
DEFF Research Database (Denmark)
Tiljeset, Morten Hein
2017-01-01
We study the Hausdorff measure and dimension of the set of intrinsically simultaneously -approximable points on a curve, surface, etc, given as a graph of integer polynomials. We obtain complete answers to these questions for algebraically “nice” manifolds. This generalizes earlier work done...
Quantum Hilbert matrices and orthogonal polynomials
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Berg, Christian
2009-01-01
Using the notion of quantum integers associated with a complex number q≠0 , we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q -Jacobi polynomials when |q|<1 , and for the special value they are closely related to Hankel matrice...
Algebraic polynomial system solving and applications
Bleylevens, I.W.M.
2010-01-01
The problem of computing the solutions of a system of multivariate polynomial equations can be approached by the Stetter-Möller matrix method which casts the problem into a large eigenvalue problem. This Stetter-Möller matrix method forms the starting point for the development of computational
Information-theoretic lengths of Jacobi polynomials
Energy Technology Data Exchange (ETDEWEB)
Guerrero, A; Dehesa, J S [Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, Granada (Spain); Sanchez-Moreno, P, E-mail: agmartinez@ugr.e, E-mail: pablos@ugr.e, E-mail: dehesa@ugr.e [Instituto ' Carlos I' de Fisica Teorica y Computacional, Universidad de Granada, Granada (Spain)
2010-07-30
The information-theoretic lengths of the Jacobi polynomials P{sup ({alpha}, {beta})}{sub n}(x), which are information-theoretic measures (Renyi, Shannon and Fisher) of their associated Rakhmanov probability density, are investigated. They quantify the spreading of the polynomials along the orthogonality interval [- 1, 1] in a complementary but different way as the root-mean-square or standard deviation because, contrary to this measure, they do not refer to any specific point of the interval. The explicit expressions of the Fisher length are given. The Renyi lengths are found by the use of the combinatorial multivariable Bell polynomials in terms of the polynomial degree n and the parameters ({alpha}, {beta}). The Shannon length, which cannot be exactly calculated because of its logarithmic functional form, is bounded from below by using sharp upper bounds to general densities on [- 1, +1] given in terms of various expectation values; moreover, its asymptotics is also pointed out. Finally, several computational issues relative to these three quantities are carefully analyzed.
Indecomposability of polynomials via Jacobian matrix
International Nuclear Information System (INIS)
Cheze, G.; Najib, S.
2007-12-01
Uni-multivariate decomposition of polynomials is a special case of absolute factorization. Recently, thanks to the Ruppert's matrix some effective results about absolute factorization have been improved. Here we show that with a jacobian matrix we can get sharper bounds for the special case of uni-multivariate decomposition. (author)
On selfadjoint functors satisfying polynomial relations
DEFF Research Database (Denmark)
Agerholm, Troels; Mazorchuk, Volodomyr
2011-01-01
We study selfadjoint functors acting on categories of finite dimen- sional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint func- tors satisfying several easy relations, in particular, idempotents and square roots of a sum...
Polynomial Variables and the Jacobian Problem
Indian Academy of Sciences (India)
algebra and algebraic geometry, and ... algebraically, to making the change of variables (X, Y) r--t. (X +p, Y ... aX + bY + p and eX + dY + q are linear polynomials in X, Y. ..... [5] T T Moh, On the Jacobian conjecture and the confipration of roots,.
Function approximation with polynomial regression slines
International Nuclear Information System (INIS)
Urbanski, P.
1996-01-01
Principles of the polynomial regression splines as well as algorithms and programs for their computation are presented. The programs prepared using software package MATLAB are generally intended for approximation of the X-ray spectra and can be applied in the multivariate calibration of radiometric gauges. (author)
Polynomial stabilization of some dissipative hyperbolic systems
Czech Academy of Sciences Publication Activity Database
Ammari, K.; Feireisl, Eduard; Nicaise, S.
2014-01-01
Roč. 34, č. 11 (2014), s. 4371-4388 ISSN 1078-0947 R&D Projects: GA ČR GA201/09/0917 Institutional support: RVO:67985840 Keywords : exponential stability * polynomial stability * observability inequality Subject RIV: BA - General Mathematics Impact factor: 0.826, year: 2014 http://www.aimsciences.org/journals/displayArticlesnew.jsp?paperID=9924
Polynomial Asymptotes of the Second Kind
Dobbs, David E.
2011-01-01
This note uses the analytic notion of asymptotic functions to study when a function is asymptotic to a polynomial function. Along with associated existence and uniqueness results, this kind of asymptotic behaviour is related to the type of asymptote that was recently defined in a more geometric way. Applications are given to rational functions and…
Characteristic polynomials of linear polyacenes and their ...
Indian Academy of Sciences (India)
Coefficients of characteristic polynomials (CP) of linear polyacenes (LP) have been shown to be obtainable from Pascal's triangle by using a graph factorisation and squaring technique. Strong subspectrality existing among the members of the linear polyacene series has been shown from the derivation of the CP's. Thus it ...
Coherent states for polynomial su(2) algebra
International Nuclear Information System (INIS)
Sadiq, Muhammad; Inomata, Akira
2007-01-01
A class of generalized coherent states is constructed for a polynomial su(2) algebra in a group-free manner. As a special case, the coherent states for the cubic su(2) algebra are discussed. The states so constructed reduce to the usual SU(2) coherent states in the linear limit
Bernoulli Polynomials, Fourier Series and Zeta Numbers
DEFF Research Database (Denmark)
Scheufens, Ernst E
2013-01-01
Fourier series for Bernoulli polynomials are used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent...
Euler Polynomials, Fourier Series and Zeta Numbers
DEFF Research Database (Denmark)
Scheufens, Ernst E
2012-01-01
Fourier series for Euler polynomials is used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent series....
Automatic Control Systems Modeling by Volterra Polynomials
Directory of Open Access Journals (Sweden)
S. V. Solodusha
2012-01-01
Full Text Available The problem of the existence of the solutions of polynomial Volterra integral equations of the first kind of the second degree is considered. An algorithm of the numerical solution of one class of Volterra nonlinear systems of the first kind is developed. Numerical results for test examples are presented.
Spectral properties of birth-death polynomials
van Doorn, Erik A.
2015-01-01
We consider sequences of polynomials that are defined by a three-terms recurrence relation and orthogonal with respect to a positive measure on the nonnegative axis. By a famous result of Karlin and McGregor such sequences are instrumental in the analysis of birth-death processes. Inspired by
Spectral properties of birth-death polynomials
van Doorn, Erik A.
We consider sequences of polynomials that are defined by a three-terms recurrence relation and orthogonal with respect to a positive measure on the nonnegative axis. By a famous result of Karlin and McGregor such sequences are instrumental in the analysis of birth-death processes. Inspired by
Optimization of Cubic Polynomial Functions without Calculus
Taylor, Ronald D., Jr.; Hansen, Ryan
2008-01-01
In algebra and precalculus courses, students are often asked to find extreme values of polynomial functions in the context of solving an applied problem; but without the notion of derivative, something is lost. Either the functions are reduced to quadratics, since students know the formula for the vertex of a parabola, or solutions are…
transformation of independent variables in polynomial regression ...
African Journals Online (AJOL)
Ada
preferable when possible to work with a simple functional form in transformed variables rather than with a more complicated form in the original variables. In this paper, it is shown that linear transformations applied to independent variables in polynomial regression models affect the t ratio and hence the statistical ...
Inequalities for a Polynomial and its Derivative
Indian Academy of Sciences (India)
Annual Meetings · Mid Year Meetings · Discussion Meetings · Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 110; Issue 2. Inequalities for a Polynomial and its Derivative. V K Jain. Volume 110 Issue 2 May 2000 pp 137- ...
Integral Inequalities for Self-Reciprocal Polynomials
Indian Academy of Sciences (India)
Annual Meetings · Mid Year Meetings · Discussion Meetings · Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 120; Issue 2. Integral Inequalities for Self-Reciprocal Polynomials. Horst Alzer. Volume 120 Issue 2 April 2010 ...
Density of Real Zeros of the Tutte Polynomial
DEFF Research Database (Denmark)
Ok, Seongmin; Perrett, Thomas
2018-01-01
The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...
Density of Real Zeros of the Tutte Polynomial
DEFF Research Database (Denmark)
Ok, Seongmin; Perrett, Thomas
2017-01-01
The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...
Some Polynomials Associated with the r-Whitney Numbers
Indian Academy of Sciences (India)
26
Abstract. In the present article we study three families of polynomials associated with ... [29, 39] for their relations with the Bernoulli and generalized Bernoulli polynomials and ... generating functions in a similar way as in the classical cases.
On an Inequality Concerning the Polar Derivative of a Polynomial
Indian Academy of Sciences (India)
Abstract. In this paper, we present a correct proof of an -inequality concerning the polar derivative of a polynomial with restricted zeros. We also extend Zygmund's inequality to the polar derivative of a polynomial.
International Nuclear Information System (INIS)
Knoll, J.
1985-10-01
A quantum dynamical model is suggested which describes the expansion and disassembly phase of highly excited compounds formed in energetic heavy-ion collisions. First applications in two space and one time dimensional model world are discussed and qualitatively compared to standard freeze-out concepts. (orig.)
Indian Academy of Sciences (India)
of a system under investigation is to model the system in terms of some ... The organization of the paper is as follows: In §2, a brief account of the (G /G)- expansion ...... It is interesting to note that from the general results, one can easily recover.
Benchmarking with high-order nodal diffusion methods
International Nuclear Information System (INIS)
Tomasevic, D.; Larsen, E.W.
1993-01-01
Significant progress in the solution of multidimensional neutron diffusion problems was made in the late 1970s with the introduction of nodal methods. Modern nodal reactor analysis codes provide significant improvements in both accuracy and computing speed over earlier codes based on fine-mesh finite difference methods. In the past, the performance of advanced nodal methods was determined by comparisons with fine-mesh finite difference codes. More recently, the excellent spatial convergence of nodal methods has permitted their use in establishing reference solutions for some important bench-mark problems. The recent development of the self-consistent high-order nodal diffusion method and its subsequent variational formulation has permitted the calculation of reference solutions with one node per assembly mesh size. In this paper, we compare results for four selected benchmark problems to those obtained by high-order response matrix methods and by two well-known state-of-the-art nodal methods (the open-quotes analyticalclose quotes and open-quotes nodal expansionclose quotes methods)
On the optimal polynomial approximation of stochastic PDEs by galerkin and collocation methods
Beck, Joakim; Tempone, Raul; Nobile, Fabio; Tamellini, Lorenzo
2012-01-01
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with stochastic coefficients. The problem is rewritten as a parametric PDE and the functional dependence of the solution on the parameters is approximated by multivariate polynomials. We first consider the stochastic Galerkin method, and rely on sharp estimates for the decay of the Fourier coefficients of the spectral expansion of u on an orthogonal polynomial basis to build a sequence of polynomial subspaces that features better convergence properties, in terms of error versus number of degrees of freedom, than standard choices such as Total Degree or Tensor Product subspaces. We consider then the Stochastic Collocation method, and use the previous estimates to introduce a new class of Sparse Grids, based on the idea of selecting a priori the most profitable hierarchical surpluses, that, again, features better convergence properties compared to standard Smolyak or tensor product grids. Numerical results show the effectiveness of the newly introduced polynomial spaces and sparse grids. © 2012 World Scientific Publishing Company.
Roquet, F.; Madec, G.; McDougall, Trevor J.; Barker, Paul M.
2015-06-01
A new set of approximations to the standard TEOS-10 equation of state are presented. These follow a polynomial form, making it computationally efficient for use in numerical ocean models. Two versions are provided, the first being a fit of density for Boussinesq ocean models, and the second fitting specific volume which is more suitable for compressible models. Both versions are given as the sum of a vertical reference profile (6th-order polynomial) and an anomaly (52-term polynomial, cubic in pressure), with relative errors of ∼0.1% on the thermal expansion coefficients. A 75-term polynomial expression is also presented for computing specific volume, with a better accuracy than the existing TEOS-10 48-term rational approximation, especially regarding the sound speed, and it is suggested that this expression represents a valuable approximation of the TEOS-10 equation of state for hydrographic data analysis. In the last section, practical aspects about the implementation of TEOS-10 in ocean models are discussed.
Hong, X; Harris, C J
2000-01-01
This paper introduces a new neurofuzzy model construction algorithm for nonlinear dynamic systems based upon basis functions that are Bézier-Bernstein polynomial functions. This paper is generalized in that it copes with n-dimensional inputs by utilising an additive decomposition construction to overcome the curse of dimensionality associated with high n. This new construction algorithm also introduces univariate Bézier-Bernstein polynomial functions for the completeness of the generalized procedure. Like the B-spline expansion based neurofuzzy systems, Bézier-Bernstein polynomial function based neurofuzzy networks hold desirable properties such as nonnegativity of the basis functions, unity of support, and interpretability of basis function as fuzzy membership functions, moreover with the additional advantages of structural parsimony and Delaunay input space partition, essentially overcoming the curse of dimensionality associated with conventional fuzzy and RBF networks. This new modeling network is based on additive decomposition approach together with two separate basis function formation approaches for both univariate and bivariate Bézier-Bernstein polynomial functions used in model construction. The overall network weights are then learnt using conventional least squares methods. Numerical examples are included to demonstrate the effectiveness of this new data based modeling approach.
On the optimal polynomial approximation of stochastic PDEs by galerkin and collocation methods
Beck, Joakim
2012-09-01
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with stochastic coefficients. The problem is rewritten as a parametric PDE and the functional dependence of the solution on the parameters is approximated by multivariate polynomials. We first consider the stochastic Galerkin method, and rely on sharp estimates for the decay of the Fourier coefficients of the spectral expansion of u on an orthogonal polynomial basis to build a sequence of polynomial subspaces that features better convergence properties, in terms of error versus number of degrees of freedom, than standard choices such as Total Degree or Tensor Product subspaces. We consider then the Stochastic Collocation method, and use the previous estimates to introduce a new class of Sparse Grids, based on the idea of selecting a priori the most profitable hierarchical surpluses, that, again, features better convergence properties compared to standard Smolyak or tensor product grids. Numerical results show the effectiveness of the newly introduced polynomial spaces and sparse grids. © 2012 World Scientific Publishing Company.
2-variable Laguerre matrix polynomials and Lie-algebraic techniques
International Nuclear Information System (INIS)
Khan, Subuhi; Hassan, Nader Ali Makboul
2010-01-01
The authors introduce 2-variable forms of Laguerre and modified Laguerre matrix polynomials and derive their special properties. Further, the representations of the special linear Lie algebra sl(2) and the harmonic oscillator Lie algebra G(0,1) are used to derive certain results involving these polynomials. Furthermore, the generating relations for the ordinary as well as matrix polynomials related to these matrix polynomials are derived as applications.
Algebraic limit cycles in polynomial systems of differential equations
International Nuclear Information System (INIS)
Llibre, Jaume; Zhao Yulin
2007-01-01
Using elementary tools we construct cubic polynomial systems of differential equations with algebraic limit cycles of degrees 4, 5 and 6. We also construct a cubic polynomial system of differential equations having an algebraic homoclinic loop of degree 3. Moreover, we show that there are polynomial systems of differential equations of arbitrary degree that have algebraic limit cycles of degree 3, as well as give an example of a cubic polynomial system of differential equations with two algebraic limit cycles of degree 4
The generalized Yablonskii-Vorob'ev polynomials and their properties
International Nuclear Information System (INIS)
Kudryashov, Nikolai A.; Demina, Maria V.
2008-01-01
Rational solutions of the generalized second Painleve hierarchy are classified. Representation of the rational solutions in terms of special polynomials, the generalized Yablonskii-Vorob'ev polynomials, is introduced. Differential-difference relations satisfied by the polynomials are found. Hierarchies of differential equations related to the generalized second Painleve hierarchy are derived. One of these hierarchies is a sequence of differential equations satisfied by the generalized Yablonskii-Vorob'ev polynomials
Polynomial selection in number field sieve for integer factorization
Directory of Open Access Journals (Sweden)
Gireesh Pandey
2016-09-01
Full Text Available The general number field sieve (GNFS is the fastest algorithm for factoring large composite integers which is made up by two prime numbers. Polynomial selection is an important step of GNFS. The asymptotic runtime depends on choice of good polynomial pairs. In this paper, we present polynomial selection algorithm that will be modelled with size and root properties. The correlations between polynomial coefficient and number of relations have been explored with experimental findings.
Contributions to fuzzy polynomial techniques for stability analysis and control
Pitarch Pérez, José Luis
2014-01-01
The present thesis employs fuzzy-polynomial control techniques in order to improve the stability analysis and control of nonlinear systems. Initially, it reviews the more extended techniques in the field of Takagi-Sugeno fuzzy systems, such as the more relevant results about polynomial and fuzzy polynomial systems. The basic framework uses fuzzy polynomial models by Taylor series and sum-of-squares techniques (semidefinite programming) in order to obtain stability guarantees...
Directory of Open Access Journals (Sweden)
Waleed M. Abd-Elhameed
2016-09-01
Full Text Available Herein, two numerical algorithms for solving some linear and nonlinear fractional-order differential equations are presented and analyzed. For this purpose, a novel operational matrix of fractional-order derivatives of Fibonacci polynomials was constructed and employed along with the application of the tau and collocation spectral methods. The convergence and error analysis of the suggested Fibonacci expansion were carefully investigated. Some numerical examples with comparisons are presented to ensure the efficiency, applicability and high accuracy of the proposed algorithms. Two accurate semi-analytic polynomial solutions for linear and nonlinear fractional differential equations are the result.
Interlacing of zeros of quasi-orthogonal meixner polynomials | Driver ...
African Journals Online (AJOL)
... interlacing of zeros of quasi-orthogonal Meixner polynomials Mn(x;β; c) with the zeros of their nearest orthogonal counterparts Mt(x;β + k; c), l; n ∈ ℕ, k ∈ {1; 2}; is also discussed. Mathematics Subject Classication (2010): 33C45, 42C05. Key words: Discrete orthogonal polynomials, quasi-orthogonal polynomials, Meixner
Strong result for real zeros of random algebraic polynomials
Directory of Open Access Journals (Sweden)
T. Uno
2001-01-01
Full Text Available An estimate is given for the lower bound of real zeros of random algebraic polynomials whose coefficients are non-identically distributed dependent Gaussian random variables. Moreover, our estimated measure of the exceptional set, which is independent of the degree of the polynomials, tends to zero as the degree of the polynomial tends to infinity.
On the Lorentz degree of a product of polynomials
Ait-Haddou, Rachid
2015-01-01
In this note, we negatively answer two questions of T. Erdélyi (1991, 2010) on possible lower bounds on the Lorentz degree of product of two polynomials. We show that the correctness of one question for degree two polynomials is a direct consequence of a result of Barnard et al. (1991) on polynomials with nonnegative coefficients.
A Determinant Expression for the Generalized Bessel Polynomials
Directory of Open Access Journals (Sweden)
Sheng-liang Yang
2013-01-01
Full Text Available Using the exponential Riordan arrays, we show that a variation of the generalized Bessel polynomial sequence is of Sheffer type, and we obtain a determinant formula for the generalized Bessel polynomials. As a result, the Bessel polynomial is represented as determinant the entries of which involve Catalan numbers.
On the estimation of the degree of regression polynomial
International Nuclear Information System (INIS)
Toeroek, Cs.
1997-01-01
The mathematical functions most commonly used to model curvature in plots are polynomials. Generally, the higher the degree of the polynomial, the more complex is the trend that its graph can represent. We propose a new statistical-graphical approach based on the discrete projective transformation (DPT) to estimating the degree of polynomial that adequately describes the trend in the plot
Zeros and uniqueness of Q-difference polynomials of meromorphic ...
Indian Academy of Sciences (India)
Meromorphic functions; Nevanlinna theory; logarithmic order; uniqueness problem; difference-differential polynomial. Abstract. In this paper, we investigate the value distribution of -difference polynomials of meromorphic function of finite logarithmic order, and study the zero distribution of difference-differential polynomials ...
Uniqueness and zeros of q-shift difference polynomials
Indian Academy of Sciences (India)
In this paper, we consider the zero distributions of -shift difference polynomials of meromorphic functions with zero order, and obtain two theorems that extend the classical Hayman results on the zeros of differential polynomials to -shift difference polynomials. We also investigate the uniqueness problem of -shift ...
Polynomially Riesz elements | Živković-Zlatanović | Quaestiones ...
African Journals Online (AJOL)
A Banach algebra element ɑ ∈ A is said to be "polynomially Riesz", relative to the homomorphism T : A → B, if there exists a nonzero complex polynomial p(z) such that the image Tp ∈ B is quasinilpotent. Keywords: Homomorphism of Banach algebras, polynomially Riesz element, Fredholm spectrum, Browder element, ...
Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials
International Nuclear Information System (INIS)
Tratnik, M.V.
1990-01-01
Several families of multivariable, biorthogonal, partly continuous and partly discrete, Wilson polynomials are presented. These yield limit cases that are purely continuous in some of the variables and purely discrete in the others, or purely discrete in all the variables. The latter are referred to as the multivariable biorthogonal Racah polynomials. Interesting further limit cases include the multivariable biorthogonal Hahn and dual Hahn polynomials
Commutators with idempotent values on multilinear polynomials in ...
Indian Academy of Sciences (India)
Multilinear polynomial; derivations; generalized polynomial identity; prime ring; right ideal. Abstract. Let R be a prime ring of characteristic different from 2, C its extended centroid, d a nonzero derivation of R , f ( x 1 , … , x n ) a multilinear polynomial over C , ϱ a nonzero right ideal of R and m > 1 a fixed integer such that.
Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation
Gordon, Sheldon P.; Yang, Yajun
2017-01-01
This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…
Degenerate r-Stirling Numbers and r-Bell Polynomials
Kim, T.; Yao, Y.; Kim, D. S.; Jang, G.-W.
2018-01-01
The purpose of this paper is to exploit umbral calculus in order to derive some properties, recurrence relations, and identities related to the degenerate r-Stirling numbers of the second kind and the degenerate r-Bell polynomials. Especially, we will express the degenerate r-Bell polynomials as linear combinations of many well-known families of special polynomials.
A Hennart nodal method for the diffusion equation
International Nuclear Information System (INIS)
Lesaint, P.; Noceir, S.; Verwaerde, D.
1995-01-01
A modification of the Hennart nodal method for neutron diffusion problems is presented. The final system of equations obtained by this method is not positive definite. However, a flux elimination technique leads to a simple positive definite system, which can be solved by the traditional iterative methods. Calculations of a two-dimensional International Atomic Energy Agency benchmark problem are performed and compared with results of the original Hennart nodal method and some finite element methods. The high computational efficiency of this modified nodal method is clearly demonstrated
Modifying nodal pricing method considering market participants optimality and reliability
Directory of Open Access Journals (Sweden)
A. R. Soofiabadi
2015-06-01
Full Text Available This paper develops a method for nodal pricing and market clearing mechanism considering reliability of the system. The effects of components reliability on electricity price, market participants’ profit and system social welfare is considered. This paper considers reliability both for evaluation of market participant’s optimality as well as for fair pricing and market clearing mechanism. To achieve fair pricing, nodal price has been obtained through a two stage optimization problem and to achieve fair market clearing mechanism, comprehensive criteria has been introduced for optimality evaluation of market participant. Social welfare of the system and system efficiency are increased under proposed modified nodal pricing method.
International Nuclear Information System (INIS)
Perko, Z.; Gilli, L.; Lathouwers, D.; Kloosterman, J. L.
2013-01-01
Uncertainty quantification plays an increasingly important role in the nuclear community, especially with the rise of Best Estimate Plus Uncertainty methodologies. Sensitivity analysis, surrogate models, Monte Carlo sampling and several other techniques can be used to propagate input uncertainties. In recent years however polynomial chaos expansion has become a popular alternative providing high accuracy at affordable computational cost. This paper presents such polynomial chaos (PC) methods using adaptive sparse grids and adaptive basis set construction, together with an application to a Gas Cooled Fast Reactor transient. Comparison is made between a new sparse grid algorithm and the traditionally used technique proposed by Gerstner. An adaptive basis construction method is also introduced and is proved to be advantageous both from an accuracy and a computational point of view. As a demonstration the uncertainty quantification of a 50% loss of flow transient in the GFR2400 Gas Cooled Fast Reactor design was performed using the CATHARE code system. The results are compared to direct Monte Carlo sampling and show the superior convergence and high accuracy of the polynomial chaos expansion. Since PC techniques are easy to implement, they can offer an attractive alternative to traditional techniques for the uncertainty quantification of large scale problems. (authors)
Using Taylor Expansions to Prepare Students for Calculus
Lutzer, Carl V.
2011-01-01
We propose an alternative to the standard introduction to the derivative. Instead of using limits of difference quotients, students develop Taylor expansions of polynomials. This alternative allows students to develop many of the central ideas about the derivative at an intuitive level, using only skills and concepts from precalculus, and…
Large level crossings of a random polynomial
Directory of Open Access Journals (Sweden)
Kambiz Farahmand
1987-01-01
Full Text Available We know the expected number of times that a polynomial of degree n with independent random real coefficients asymptotically crosses the level K, when K is any real value such that (K2/nÃ¢Â†Â’0 as nÃ¢Â†Â’Ã¢ÂˆÂž. The present paper shows that, when K is allowed to be large, this expected number of crossings reduces to only one. The coefficients of the polynomial are assumed to be normally distributed. It is shown that it is sufficient to let KÃ¢Â‰Â¥exp(nf where f is any function of n such that fÃ¢Â†Â’Ã¢ÂˆÂž as nÃ¢Â†Â’Ã¢ÂˆÂž.
Sparse DOA estimation with polynomial rooting
DEFF Research Database (Denmark)
Xenaki, Angeliki; Gerstoft, Peter; Fernandez Grande, Efren
2015-01-01
Direction-of-arrival (DOA) estimation involves the localization of a few sources from a limited number of observations on an array of sensors. Thus, DOA estimation can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve highresol......Direction-of-arrival (DOA) estimation involves the localization of a few sources from a limited number of observations on an array of sensors. Thus, DOA estimation can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve...... highresolution imaging. Utilizing the dual optimal variables of the CS optimization problem, it is shown with Monte Carlo simulations that the DOAs are accurately reconstructed through polynomial rooting (Root-CS). Polynomial rooting is known to improve the resolution in several other DOA estimation methods...
On factorization of generalized Macdonald polynomials
International Nuclear Information System (INIS)
Kononov, Ya.; Morozov, A.
2016-01-01
A remarkable feature of Schur functions - the common eigenfunctions of cut-and-join operators from W ∞ - is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U q (SL N ) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization - on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding. (orig.)
Polynomial structures in one-loop amplitudes
International Nuclear Information System (INIS)
Britto, Ruth; Feng Bo; Yang Gang
2008-01-01
A general one-loop scattering amplitude may be expanded in terms of master integrals. The coefficients of the master integrals can be obtained from tree-level input in a two-step process. First, use known formulas to write the coefficients of (4-2ε)-dimensional master integrals; these formulas depend on an additional variable, u, which encodes the dimensional shift. Second, convert the u-dependent coefficients of (4-2ε)-dimensional master integrals to explicit coefficients of dimensionally shifted master integrals. This procedure requires the initial formulas for coefficients to have polynomial dependence on u. Here, we give a proof of this property in the case of massless propagators. The proof is constructive. Thus, as a byproduct, we produce different algebraic expressions for the scalar integral coefficients, in which the polynomial property is apparent. In these formulas, the box and pentagon contributions are separated explicitly.
Link polynomial, crossing multiplier and surgery formula
International Nuclear Information System (INIS)
Deguchi, Tetsuo; Yamada, Yasuhiko.
1989-01-01
Relations between link polynomials constructed from exactly solvable lattice models and topological field theory are reviewed. It is found that the surgery formula for a three-sphere S 3 with Wilson lines corresponds to the Markov trace constructed from the exactly solvable models. This indicates that knot theory intimately relates various important subjects such as exactly solvable models, conformal field theories and topological quantum field theories. (author)
Completeness of the ring of polynomials
DEFF Research Database (Denmark)
Thorup, Anders
2015-01-01
Consider the polynomial ring R:=k[X1,…,Xn]R:=k[X1,…,Xn] in n≥2n≥2 variables over an uncountable field k. We prove that R is complete in its adic topology, that is, the translation invariant topology in which the non-zero ideals form a fundamental system of neighborhoods of 0. In addition we pro...
Moments, positive polynomials and their applications
Lasserre, Jean Bernard
2009-01-01
Many important applications in global optimization, algebra, probability and statistics, applied mathematics, control theory, financial mathematics, inverse problems, etc. can be modeled as a particular instance of the Generalized Moment Problem (GMP) . This book introduces a new general methodology to solve the GMP when its data are polynomials and basic semi-algebraic sets. This methodology combines semidefinite programming with recent results from real algebraic geometry to provide a hierarchy of semidefinite relaxations converging to the desired optimal value. Applied on appropriate cones,
Polynomials and identities on real Banach spaces
Czech Academy of Sciences Publication Activity Database
Hájek, Petr Pavel; Kraus, M.
2012-01-01
Roč. 385, č. 2 (2012), s. 1015-1026 ISSN 0022-247X R&D Projects: GA ČR(CZ) GAP201/11/0345 Institutional research plan: CEZ:AV0Z10190503 Keywords : Polynomials on Banach spaces Subject RIV: BA - General Mathematics Impact factor: 1.050, year: 2012 http://www.sciencedirect.com/science/article/pii/S0022247X11006743
CT simulation in nodal positive breast cancer
International Nuclear Information System (INIS)
Horst, E.; Schuck, A.; Moustakis, C.; Schaefer, U.; Micke, O.; Kronholz, H.L.; Willich, N.
2001-01-01
Background: A variety of solutions are used to match tangential fields and opposed lymph node fields in irradiation of nodal positive breast cancer. The choice is depending on the technical equipment which is available and the clinical situation. The CT simulation of a non-monoisocentric technique was evaluated in terms of accuracy and reproducibility. Patients, Material and Methods: The field match parameters were adjusted virtually at CT simulation and were compared with parameters derived mathematically. The coordinate transfer from the CT simulator to the conventional simulator was analyzed in 25 consecutive patients. Results: The angles adjusted virtually for a geometrically exact coplanar field match corresponded with the angles calculated for each set-up. The mean isocenter displacement was 5.7 mm and the total uncertainty of the coordinate transfer was 6.7 mm (1 SD). Limitations in the patient set-up became obvious because of the steep arm abduction necessary to fit the 70 cm CT gantry aperture. Required modifications of the arm position and coordinate transfer errors led to a significant shift of the marked matchline of >1.0 cm in eight of 25 patients (32%). Conclusion: The virtual CT simulation allows a precise and graphic definition of the field match parameters. However, modifications of the virtual set-up basically due to technical limitations were required in a total of 32% of cases, so that a hybrid technique was adapted at present that combines virtual adjustment of the ideal field alignment parameters with conventional simulation. (orig.) [de
Present Status of GNF New Nodal Simulator
International Nuclear Information System (INIS)
Iwamoto, T.; Tamitani, M.; Moore, B.
2001-01-01
This paper presents core simulator consolidation work done at Global Nuclear Fuel (GNF). The unified simulator needs to supercede the capabilities of past simulator packages from the original GNF partners: GE, Hitachi, and Toshiba. At the same time, an effort is being made to produce a simulation package that will be a state-of-the-art analysis tool when released, in terms of the physics solution methodology and functionality. The core simulator will be capable and qualified for (a) high-energy cycles in the U.S. markets, (b) mixed-oxide (MOX) introduction in Japan, and (c) high-power density plants in Europe, etc. The unification of the lattice physics code is also in progress based on a transport model with collision probability methods. The AETNA core simulator is built upon the PANAC11 software base. The goal is to essentially replace the 1.5-energy-group model with a higher-order multigroup nonlinear nodal solution capable of the required modeling fidelity, while keeping highly automated library generation as well as functionality. All required interfaces to PANAC11 will be preserved, which minimizes the impact on users and process automation. Preliminary results show statistical accuracy improvement over the 1.5-group model
BEACON: An application of nodal methods for operational support
International Nuclear Information System (INIS)
Boyd, W.A.; Nguyen, T.Q.
1992-01-01
A practical application of nodal methods is on-line plant operational support. However, to enable plant personnel to take full advantage of a nodal model to support plant operations, (a) a core nodal model must always be up to date with the current core history and conditions, (b) the nodal methods must be fast enough to allow numerous core calculations to be performed in minutes to support engineering decisions, and (c) the system must be easily accessible to engineering personnel at the reactor, their offices, or any other location considered appropriate. A core operational support package developed by Westinghouse called BEACON (best estimate analysis of core operations - nuclear) has been installed at several plants. Results from these plants and numerous in-core flux maps analyzed have demonstrated the accuracy of the model and the effectiveness of the methodology
Aircraft Nodal Data Acquisition System (ANDAS), Phase II
National Aeronautics and Space Administration — Development of an Aircraft Nodal Data Acquisition System (ANDAS) based upon the short haul Zigbee networking standard is proposed. It employs a very thin (135 um)...
Hybrid nodal loop metal: Unconventional magnetoresponse and material realization
Zhang, Xiaoming; Yu, Zhi-Ming; Lu, Yunhao; Sheng, Xian-Lei; Yang, Hui Ying; Yang, Shengyuan A.
2018-03-01
A nodal loop is formed by a band crossing along a one-dimensional closed manifold, with each point on the loop a linear nodal point in the transverse dimensions, and can be classified as type I or type II depending on the band dispersion. Here, we propose a class of nodal loops composed of both type-I and type-II points, which are hence termed as hybrid nodal loops. Based on first-principles calculations, we predict the realization of such loops in the existing electride material Ca2As . For a hybrid loop, the Fermi surface consists of coexisting electron and hole pockets that touch at isolated points for an extended range of Fermi energies, without the need for fine-tuning. This leads to unconventional magnetic responses, including the zero-field magnetic breakdown and the momentum-space Klein tunneling observable in the magnetic quantum oscillations, as well as the peculiar anisotropy in the cyclotron resonance.
A nodal method based on matrix-response method
International Nuclear Information System (INIS)
Rocamora Junior, F.D.; Menezes, A.
1982-01-01
A nodal method based in the matrix-response method, is presented, and its application to spatial gradient problems, such as those that exist in fast reactors, near the core - blanket interface, is investigated. (E.G.) [pt
Nodal prices determination with wind integration for radial ...
African Journals Online (AJOL)
With competitive electricity market operation, open access to the transmission and distribution network is essential ... The results have been obtained for IEEE 33 ...... The value of intermittent wind DG under nodal prices and amp – mile tariffs.
Nodal aberration theory for wild-filed asymmetric optical systems
Chen, Yang; Cheng, Xuemin; Hao, Qun
2016-10-01
Nodal Aberration Theory (NAT) was used to calculate the zero field position in Full Field Display (FFD) for the given aberration term. Aiming at wide-filed non-rotational symmetric decentered optical systems, we have presented the nodal geography behavior of the family of third-order and fifth-order aberrations. Meanwhile, we have calculated the wavefront aberration expressions when one optical element in the system is tilted, which was not at the entrance pupil. By using a three-piece-cellphone lens example in optical design software CodeV, the nodal geography is testified under several situations; and the wavefront aberrations are calculated when the optical element is tilted. The properties of the nodal aberrations are analyzed by using Fringe Zernike coefficients, which are directly related with the wavefront aberration terms and usually obtained by real ray trace and wavefront surface fitting.
International Nuclear Information System (INIS)
Maldonado, G.I.; Turinsky, P.J.; Kropaczek, D.J.
1993-01-01
The computational capability of efficiently and accurately evaluate reactor core attributes (i.e., k eff and power distributions as a function of cycle burnup) utilizing a second-order accurate advanced nodal Generalized Perturbation Theory (GPT) model has been developed. The GPT model is derived from the forward non-linear iterative Nodal Expansion Method (NEM) strategy, thereby extending its inherent savings in memory storage and high computational efficiency to also encompass GPT via the preservation of the finite-difference matrix structure. The above development was easily implemented into the existing coarse-mesh finite-difference GPT-based in-core fuel management optimization code FORMOSA-P, thus combining the proven robustness of its adaptive Simulated Annealing (SA) multiple-objective optimization algorithm with a high-fidelity NEM GPT neutronics model to produce a powerful computational tool used to generate families of near-optimum loading patterns for PWRs. (orig.)
Eye aberration analysis with Zernike polynomials
Molebny, Vasyl V.; Chyzh, Igor H.; Sokurenko, Vyacheslav M.; Pallikaris, Ioannis G.; Naoumidis, Leonidas P.
1998-06-01
New horizons for accurate photorefractive sight correction, afforded by novel flying spot technologies, require adequate measurements of photorefractive properties of an eye. Proposed techniques of eye refraction mapping present results of measurements for finite number of points of eye aperture, requiring to approximate these data by 3D surface. A technique of wave front approximation with Zernike polynomials is described, using optimization of the number of polynomial coefficients. Criterion of optimization is the nearest proximity of the resulted continuous surface to the values calculated for given discrete points. Methodology includes statistical evaluation of minimal root mean square deviation (RMSD) of transverse aberrations, in particular, varying consecutively the values of maximal coefficient indices of Zernike polynomials, recalculating the coefficients, and computing the value of RMSD. Optimization is finished at minimal value of RMSD. Formulas are given for computing ametropia, size of the spot of light on retina, caused by spherical aberration, coma, and astigmatism. Results are illustrated by experimental data, that could be of interest for other applications, where detailed evaluation of eye parameters is needed.
Extension of the analytic nodal method to four energy groups
International Nuclear Information System (INIS)
Parsons, D.K.; Nigg, D.W.
1985-01-01
The Analytic Nodal Method is one of several recently-developed coarse mesh numerical methods for efficiently and accurately solving the multidimensional static and transient neutron diffusion equations. This summary describes a mathematically rigorous extension of the Analytic Nodal Method to the frequently more physically realistic four-group case. A few general theoretical considerations are discussed, followed by some calculated results for a typical steady-state two-dimensional PWR quarter core application. 8 refs
International Nuclear Information System (INIS)
Almeida Ferreira, A.C. de.
1984-01-01
For problems with azimuthal symmetry in velocity space, the distribution function depends only on the speed and on the pitch angle. The angular dependence of the distribution function is expanded in Legendre polynomials, and the expansions of the collision integrals describing two-body Coulomb interactions in a plasma are determined through the use of the Rosenbluth potentials. The electron distribution function is written as a Maxwellian plus a deviation, and the representation in Legendre polynomials of the electron-electron collision term is given for both its linear and nonlinear part. To determine the representation of the electron-ion collision term it is assumed that the ion distribution is much narrower in velocity space than the electron distribution, and shifted from the origin by a flow velocity. The equations are presented in a form that is suitable for their use in a computer. (Author) [pt
International Nuclear Information System (INIS)
Ceolin, C.; Schramm, M.; Bodmann, B.E.J.; Vilhena, M.T.
2015-01-01
Recently the stationary neutron diffusion equation in heterogeneous rectangular geometry was solved by the expansion of the scalar fluxes in polynomials in terms of the spatial variables (x; y), considering the two-group energy model. The focus of the present discussion consists in the study of an error analysis of the aforementioned solution. More specifically we show how the spatial subdomain segmentation is related to the degree of the polynomial and the Lipschitz constant. This relation allows to solve the 2-D neutron diffusion problem for second degree polynomials in each subdomain. This solution is exact at the knots where the Lipschitz cone is centered. Moreover, the solution has an analytical representation in each subdomain with supremum and infimum functions that shows the convergence of the solution. We illustrate the analysis with a selection of numerical case studies. (author)
Energy Technology Data Exchange (ETDEWEB)
Ceolin, C., E-mail: celina.ceolin@gmail.com [Universidade Federal de Santa Maria (UFSM), Frederico Westphalen, RS (Brazil). Centro de Educacao Superior Norte; Schramm, M.; Bodmann, B.E.J.; Vilhena, M.T., E-mail: celina.ceolin@gmail.com [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica
2015-07-01
Recently the stationary neutron diffusion equation in heterogeneous rectangular geometry was solved by the expansion of the scalar fluxes in polynomials in terms of the spatial variables (x; y), considering the two-group energy model. The focus of the present discussion consists in the study of an error analysis of the aforementioned solution. More specifically we show how the spatial subdomain segmentation is related to the degree of the polynomial and the Lipschitz constant. This relation allows to solve the 2-D neutron diffusion problem for second degree polynomials in each subdomain. This solution is exact at the knots where the Lipschitz cone is centered. Moreover, the solution has an analytical representation in each subdomain with supremum and infimum functions that shows the convergence of the solution. We illustrate the analysis with a selection of numerical case studies. (author)
Bilinear nodal transport method in weighted diamond difference form
International Nuclear Information System (INIS)
Azmy, Y.Y.
1987-01-01
Nodal methods have been developed and implemented for the numerical solution of the discrete ordinates neutron transport equation. Numerical testing of these methods and comparison of their results to those obtained by conventional methods have established the high accuracy of nodal methods. Furthermore, it has been suggested that the linear-linear approximation is the most computationally efficient, practical nodal approximation. Indeed, this claim has been substantiated by comparing the accuracy in the solution, and the CPU time required to achieve convergence to that solution by several nodal approximations, as well as the diamond difference scheme. Two types of linear-linear nodal methods have been developed in the literature: analytic linear-linear (NLL) methods, in which the transverse-leakage terms are derived analytically, and approximate linear-linear (PLL) methods, in which these terms are approximated. In spite of their higher accuracy, NLL methods result in very complicated discrete-variable equations that exhibit a high degree of coupling, thus requiring special solution algorithms. On the other hand, the sacrificed accuracy in PLL methods is compensated for by the simple discrete-variable equations and diamond-difference-like solution algorithm. In this paper the authors outline the development of an NLL nodal method, the bilinear method, which can be written in a weighted diamond difference form with one spatial weight per dimension that is analytically derived rather than preassigned in an ad hoc fashion
STEP- A three-dimensional nodal diffusion code for LMR's
Energy Technology Data Exchange (ETDEWEB)
Kim, Yeong Il; Kim, Taek Kyum [Korea Atomic Energy Research Institute, Taejon (Korea)
1999-12-01
STEP is a three-dimensional multigroup nodal diffusion code for the neutronics analysis of the LMR core. STEP employs DIF3D and HEXNOD nodal methods. In DIF3D, one-dimensional fluxes are approximated by polynomials while HEXNOD analytically solves transverse-integrated one-dimensional diffusion equations. The nodal equations are solved using a conventional fission source iteration procedure accelerated by coarse-mesh rebalancing and asymptotic extrapolation. At each fission source iteration, the interface currents for each group are computed by solving the response matrix equations with a known group source term. These partial currents are used to updata flux moments. This solution is accomplished by inner iteration, a series of sweeps through the spatial mesh. Inner iterations are performed by sweeping the axial mesh plane in a standard red-black checkerboard ordering, i.e. the odd-numbered planes are processed during the first pass, followed by the even-numbered planes on the second pass. On each plane, the nodes are swept in the four-color checkerboard ordering. STEP accepts microscopic cross section data from the CCCC standard interface file ISOTXS currently used for the neutronics analysis of LMR's at KAERI as well as macroscopic cross section data. Material cross sections are obtained by summing the product of atom densities and microscopic cross sections over all isotopes comprising the material. Energy is released from both fission ad capture. The thermal-hydraulics model calculates average fuel and coolant temperatures. STEP takes account of feedback effects from both fuel temperature and coolant temperature changes. The thermal-hydraulics model is a conservative, single channel model where there is no heat transfer between assemblies. Thus, STEP gives conservative results which, however, are of useful information for core design and can be useful tool for neutronics analysis of LMR core design and will be used for the base program of a future
Uniqueness Theorem for the Inverse Aftereffect Problem and Representation the Nodal Points Form
Directory of Open Access Journals (Sweden)
A. Neamaty
2015-03-01
Full Text Available In this paper, we consider a boundary value problem with aftereffect on a finite interval. Then, the asymptotic behavior of the solutions, eigenvalues, the nodal points and the associated nodal length are studied. We also calculate the numerical values of the nodal points and the nodal length. Finally, we prove the uniqueness theorem for the inverse aftereffect problem by applying any dense subset of the nodal points.
Uniqueness Theorem for the Inverse Aftereffect Problem and Representation the Nodal Points Form
A. Neamaty; Sh. Akbarpoor; A. Dabbaghian
2015-01-01
In this paper, we consider a boundary value problem with aftereffect on a finite interval. Then, the asymptotic behavior of the solutions, eigenvalues, the nodal points and the associated nodal length are studied. We also calculate the numerical values of the nodal points and the nodal length. Finally, we prove the uniqueness theorem for the inverse aftereffect problem by applying any dense subset of the nodal points.
Energy Technology Data Exchange (ETDEWEB)
Mugica R, A.; Valle G, E. del [IPN, ESFM, 07738 Mexico D.F. (Mexico)]. e-mail: mugica@esfm.ipn.mx
2003-07-01
Nowadays the numerical methods of solution to the diffusion equation by means of algorithms and computer programs result so extensive due to the great number of routines and calculations that should carry out, this rebounds directly in the execution times of this programs, being obtained results in relatively long times. This work shows the application of an acceleration method of the convergence of the classic method of those powers that it reduces notably the number of necessary iterations for to obtain reliable results, what means that the compute times they see reduced in great measure. This method is known in the literature like Wielandt method and it has incorporated to a computer program that is based on the discretization of the neutron diffusion equations in plate geometry and stationary state by polynomial nodal methods. In this work the neutron diffusion equations are described for several energy groups and their discretization by means of those called physical nodal methods, being illustrated in particular the quadratic case. It is described a model problem widely described in the literature which is solved for the physical nodal grade schemes 1, 2, 3 and 4 in three different ways: to) with the classic method of the powers, b) method of the powers with the Wielandt acceleration and c) method of the powers with the Wielandt modified acceleration. The results for the model problem as well as for two additional problems known as benchmark problems are reported. Such acceleration method can also be implemented to problems of different geometry to the proposal in this work, besides being possible to extend their application to problems in 2 or 3 dimensions. (Author)
Durant, Bradford; Hackl, Jason; Balachandar, Sivaramakrishnan
2017-11-01
Nodal discontinuous Galerkin schemes present an attractive approach to robust high-order solution of the equations of fluid mechanics, but remain accompanied by subtle challenges in their consistent stabilization. The effect of quadrature choices (full mass matrix vs spectral elements), over-integration to manage aliasing errors, and explicit artificial viscosity on the numerical solution of a steady homentropic vortex are assessed over a wide range of resolutions and polynomial orders using quadrilateral elements. In both stagnant and advected vortices in periodic and non-periodic domains the need arises for explicit stabilization beyond the numerical surface fluxes of discontinuous Galerkin spectral elements. Artificial viscosity via the entropy viscosity method is assessed as a stabilizing mechanism. It is shown that the regularity of the artificial viscosity field is essential to its use for long-time stabilization of small-scale features in nodal discontinuous Galerkin solutions of the Euler equations of gas dynamics. Supported by the Department of Energy Predictive Science Academic Alliance Program Contract DE-NA0002378.
Energy Technology Data Exchange (ETDEWEB)
Xolocostli M, J V
2002-07-01
The main objective of this work is to solve the neutron transport equation in one and two dimensions (slab geometry and X Y geometry, respectively), with no time dependence, for BWR assemblies using nodal methods. In slab geometry, the nodal methods here used are the polynomial continuous (CMPk) and discontinuous (DMPk) families but only the Linear Continuous (also known as Diamond Difference), the Quadratic Continuous (QC), the Cubic Continuous (CC), the Step Discontinuous (also known as Backward Euler), the Linear Discontinuous (LD) and the Quadratic Discontinuous (QD) were considered. In all these schemes the unknown function, the angular neutron flux, is approximated as a sum of basis functions in terms of Legendre polynomials, associated to the values of the neutron flux in the edges (left, right, or both) and the Legendre moments in the cell, depending on the nodal scheme used. All these schemes were implemented in a computer program developed in previous thesis works and known with the name TNX. This program was modified for the purposes of this work. The program discreetizes the domain of concern in one dimension and determines numerically the angular neutron flux for each point of the discretization when the number of energy groups and regions are known starting from an initial approximation for the angular neutron flux being consistent with the boundary condition imposed for a given problem. Although only problems with two-energy groups were studied the computer program does not have limitations regarding the number of energy groups and the number of regions. The two problems analyzed with the program TNX have practically the same characteristics (fuel and water), with the difference that one of them has a control rod. In the part corresponding to two-dimensional problems, the implemented nodal methods were those designated as hybrids that consider not only the edge and cell Legendre moments, but also the values of the neutron flux in the corner points
Energy Technology Data Exchange (ETDEWEB)
Xolocostli M, J.V
2002-07-01
The main objective of this work is to solve the neutron transport equation in one and two dimensions (slab geometry and X Y geometry, respectively), with no time dependence, for BWR assemblies using nodal methods. In slab geometry, the nodal methods here used are the polynomial continuous (CMPk) and discontinuous (DMPk) families but only the Linear Continuous (also known as Diamond Difference), the Quadratic Continuous (QC), the Cubic Continuous (CC), the Step Discontinuous (also known as Backward Euler), the Linear Discontinuous (LD) and the Quadratic Discontinuous (QD) were considered. In all these schemes the unknown function, the angular neutron flux, is approximated as a sum of basis functions in terms of Legendre polynomials, associated to the values of the neutron flux in the edges (left, right, or both) and the Legendre moments in the cell, depending on the nodal scheme used. All these schemes were implemented in a computer program developed in previous thesis works and known with the name TNX. This program was modified for the purposes of this work. The program discreetizes the domain of concern in one dimension and determines numerically the angular neutron flux for each point of the discretization when the number of energy groups and regions are known starting from an initial approximation for the angular neutron flux being consistent with the boundary condition imposed for a given problem. Although only problems with two-energy groups were studied the computer program does not have limitations regarding the number of energy groups and the number of regions. The two problems analyzed with the program TNX have practically the same characteristics (fuel and water), with the difference that one of them has a control rod. In the part corresponding to two-dimensional problems, the implemented nodal methods were those designated as hybrids that consider not only the edge and cell Legendre moments, but also the values of the neutron flux in the corner points
International Nuclear Information System (INIS)
Lee, M.W.; Bigeleisen, J.
1978-01-01
The MINIMAX finite polynomial approximation to an arbitrary function has been generalized to include a weighting function (WINIMAX). It is suggested that an exponential is a reasonable weighting function for the logarithm of the reduced partition function of a harmonic oscillator. Comparison of the error function for finite orthogonal polynomial (FOP), MINIMAX, and WINIMAX expansions of the logarithm of the reduced vibrational partition function show WINIMAX to be the best of the three approximations. A condensed table of WINIMAX coefficients is presented. The FOP, MINIMAX, and WINIMAX approximations are compared with exact calculations of the logarithm of the reduced partition function ratios for isotopic substitution in H 2 O, CH 4 , CH 2 O, C 2 H 4 , and C 2 H 6 at 300 0 K. Both deuterium and heavy atom isotope substitution are studied. Except for a third order expansion involving deuterium substitution, the WINIMAX method is superior to FOP and MINIMAX. At the level of a second order expansion WINIMAX approximations to ln(s/s')f are good to 2.5% and 6.5% for deuterium and heavy atom substitution, respectively
Response matrix properties and convergence implications for an interface-current nodal formulation
International Nuclear Information System (INIS)
Yang, W.S.
1995-01-01
An analytic study was performed of the properties and the associated convergence implications of the response matrix equations derived via the widely used nodal expansion method. By using the DIF3D nodal formulation in hexagonal-z geometry as a concrete example, an analytic expression for the response matrix is first derived by using the hexagonal prism symmetry transformations. The spectral radius of the local response matrix is shown to be always 2 -norm of the response matrix is shown to be ∞ -norm is not always 2 - and l ∞ -norms of the response matrix are found to increase as the removal cross section decreases. On the other hand, for a given removal cross section, each of these matrix norms takes its minimum at a certain diffusion coefficient and increases as the diffusion coefficient deviates from this value. Based on these matrix norms, sufficient conditions for the convergence of the iteration schemes for solving the response matrix equations are discussed. The range of node-height-to-hexagon-pitch ratios that guarantees a positive solution is derived as a function of the diffusion coefficient and the removal cross section
International Nuclear Information System (INIS)
Maldonado, G.I.; Turinsky, P.J.
1995-01-01
The determination of the family of optimum core loading patterns for pressurized water reactors (PWRs) involves the assessment of the core attributes for thousands of candidate loading patterns. For this reason, the computational capability to efficiently and accurately evaluate a reactor core's eigenvalue and power distribution versus burnup using a nodal diffusion generalized perturbation theory (GPT) model is developed. The GPT model is derived from the forward nonlinear iterative nodal expansion method (NEM) to explicitly enable the preservation of the finite difference matrix structure. This key feature considerably simplifies the mathematical formulation of NEM GPT and results in reduced memory storage and CPU time requirements versus the traditional response-matrix approach to NEM. In addition, a treatment within NEM GPT can account for localized nonlinear feedbacks, such as that due to fission product buildup and thermal-hydraulic effects. When compared with a standard nonlinear iterative NEM forward flux solve with feedbacks, the NEM GPT model can execute between 8 and 12 times faster. These developments are implemented within the PWR in-core nuclear fuel management optimization code FORMOSA-P, combining the robustness of its adaptive simulated annealing stochastic optimization algorithm with an NEM GPT neutronics model that efficiently and accurately evaluates core attributes associated with objective functions and constraints of candidate loading patterns
Development of a New core/reflector model for coarse-mesh nodal methods
International Nuclear Information System (INIS)
Pogosbekyan, Leonid; Cho, Jin Young; Kim, Young Il; Kim, Young Jin; Joo, Hyung Kuk; Chang, Moon Hee.
1997-10-01
This work presents two approaches for reflector simulation in coarse-mesh nodal methods. The first approach is called Interface Matrix Technique (IMT), which simulates the baffle as a banishingly thin layer having the property of reflection and transmission. We applied this technique within the frame of AFEN (Analytic Function Expansion Nodal) method, and developed the AFEN-IM (Interface Matrix) method. AFEN-IM method shows 1.24% and 0.42 % in maximum and RMS (Root Mean Square) assemblywise power error for ZION-1 benchmark problem. The second approach is L-shaped reflector homogenization method. This method is based on the integral response conservation along the L-shaped core-reflector interface. The reference reflector response is calculated from 2-dimensional spectral calculation and the response of the homogenized reflector is derived from the one-node 2-dimensional AFEN problem solution. This method shows 5 times better accuracy than the 1-dimensional homogenization technique in the assemblywise power. Also, the concept of shroud/reflector homogenization for hexagonal core have been developed. The 1-dimensional spectral calculation was used for the determination of 2 group cross sections. The essence of homogenization concept consists in the calculation of equivalent shroud width, which preserve albedo for the fast neutrons in 2-dimensional reflector. This method shows a relative error less than 0.42% in assemblywise power and a difference of 9x10 -5 in multiplication factor for full-core model. (author). 9 refs., 3 tabs., 28 figs
Efficient modeling of photonic crystals with local Hermite polynomials
International Nuclear Information System (INIS)
Boucher, C. R.; Li, Zehao; Albrecht, J. D.; Ram-Mohan, L. R.
2014-01-01
Developing compact algorithms for accurate electrodynamic calculations with minimal computational cost is an active area of research given the increasing complexity in the design of electromagnetic composite structures such as photonic crystals, metamaterials, optical interconnects, and on-chip routing. We show that electric and magnetic (EM) fields can be calculated using scalar Hermite interpolation polynomials as the numerical basis functions without having to invoke edge-based vector finite elements to suppress spurious solutions or to satisfy boundary conditions. This approach offers several fundamental advantages as evidenced through band structure solutions for periodic systems and through waveguide analysis. Compared with reciprocal space (plane wave expansion) methods for periodic systems, advantages are shown in computational costs, the ability to capture spatial complexity in the dielectric distributions, the demonstration of numerical convergence with scaling, and variational eigenfunctions free of numerical artifacts that arise from mixed-order real space basis sets or the inherent aberrations from transforming reciprocal space solutions of finite expansions. The photonic band structure of a simple crystal is used as a benchmark comparison and the ability to capture the effects of spatially complex dielectric distributions is treated using a complex pattern with highly irregular features that would stress spatial transform limits. This general method is applicable to a broad class of physical systems, e.g., to semiconducting lasers which require simultaneous modeling of transitions in quantum wells or dots together with EM cavity calculations, to modeling plasmonic structures in the presence of EM field emissions, and to on-chip propagation within monolithic integrated circuits
A Polynomial Estimate of Railway Line Delay
DEFF Research Database (Denmark)
Cerreto, Fabrizio; Harrod, Steven; Nielsen, Otto Anker
2017-01-01
Railway service may be measured by the aggregate delay over a time horizon or due to an event. Timetables for railway service may dampen aggregate delay by addition of additional process time, either supplement time or buffer time. The evaluation of these variables has previously been performed...... by numerical analysis with simulation. This paper proposes an analytical estimate of aggregate delay with a polynomial form. The function returns the aggregate delay of a railway line resulting from an initial, primary, delay. Analysis of the function demonstrates that there should be a balance between the two...
Conditional Density Approximations with Mixtures of Polynomials
DEFF Research Database (Denmark)
Varando, Gherardo; López-Cruz, Pedro L.; Nielsen, Thomas Dyhre
2015-01-01
Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one- and multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce...... two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities...
International Nuclear Information System (INIS)
Xolocostli M, J.V.
2002-01-01
The main objective of this work is to solve the neutron transport equation in one and two dimensions (slab geometry and X Y geometry, respectively), with no time dependence, for BWR assemblies using nodal methods. In slab geometry, the nodal methods here used are the polynomial continuous (CMPk) and discontinuous (DMPk) families but only the Linear Continuous (also known as Diamond Difference), the Quadratic Continuous (QC), the Cubic Continuous (CC), the Step Discontinuous (also known as Backward Euler), the Linear Discontinuous (LD) and the Quadratic Discontinuous (QD) were considered. In all these schemes the unknown function, the angular neutron flux, is approximated as a sum of basis functions in terms of Legendre polynomials, associated to the values of the neutron flux in the edges (left, right, or both) and the Legendre moments in the cell, depending on the nodal scheme used. All these schemes were implemented in a computer program developed in previous thesis works and known with the name TNX. This program was modified for the purposes of this work. The program discreetizes the domain of concern in one dimension and determines numerically the angular neutron flux for each point of the discretization when the number of energy groups and regions are known starting from an initial approximation for the angular neutron flux being consistent with the boundary condition imposed for a given problem. Although only problems with two-energy groups were studied the computer program does not have limitations regarding the number of energy groups and the number of regions. The two problems analyzed with the program TNX have practically the same characteristics (fuel and water), with the difference that one of them has a control rod. In the part corresponding to two-dimensional problems, the implemented nodal methods were those designated as hybrids that consider not only the edge and cell Legendre moments, but also the values of the neutron flux in the corner points
Lambrecht, L.; Lamert, A.; Friederich, W.; Möller, T.; Boxberg, M. S.
2018-03-01
A nodal discontinuous Galerkin (NDG) approach is developed and implemented for the computation of viscoelastic wavefields in complex geological media. The NDG approach combines unstructured tetrahedral meshes with an element-wise, high-order spatial interpolation of the wavefield based on Lagrange polynomials. Numerical fluxes are computed from an exact solution of the heterogeneous Riemann problem. Our implementation offers capabilities for modelling viscoelastic wave propagation in 1-D, 2-D and 3-D settings of very different spatial scale with little logistical overhead. It allows the import of external tetrahedral meshes provided by independent meshing software and can be run in a parallel computing environment. Computation of adjoint wavefields and an interface for the computation of waveform sensitivity kernels are offered. The method is validated in 2-D and 3-D by comparison to analytical solutions and results from a spectral element method. The capabilities of the NDG method are demonstrated through a 3-D example case taken from tunnel seismics which considers high-frequency elastic wave propagation around a curved underground tunnel cutting through inclined and faulted sedimentary strata. The NDG method was coded into the open-source software package NEXD and is available from GitHub.
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)
Parallel multigrid smoothing: polynomial versus Gauss-Seidel
International Nuclear Information System (INIS)
Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray
2003-01-01
Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines
Parallel multigrid smoothing: polynomial versus Gauss-Seidel
Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray
2003-07-01
Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines.
Polynomial solutions of the Monge-Ampère equation
Energy Technology Data Exchange (ETDEWEB)
Aminov, Yu A [B.Verkin Institute for Low Temperature Physics and Engineering, National Academy of Sciences of Ukraine, Khar' kov (Ukraine)
2014-11-30
The question of the existence of polynomial solutions to the Monge-Ampère equation z{sub xx}z{sub yy}−z{sub xy}{sup 2}=f(x,y) is considered in the case when f(x,y) is a polynomial. It is proved that if f is a polynomial of the second degree, which is positive for all values of its arguments and has a positive squared part, then no polynomial solution exists. On the other hand, a solution which is not polynomial but is analytic in the whole of the x, y-plane is produced. Necessary and sufficient conditions for the existence of polynomial solutions of degree up to 4 are found and methods for the construction of such solutions are indicated. An approximation theorem is proved. Bibliography: 10 titles.
Linear operator pencils on Lie algebras and Laurent biorthogonal polynomials
International Nuclear Information System (INIS)
Gruenbaum, F A; Vinet, Luc; Zhedanov, Alexei
2004-01-01
We study operator pencils on generators of the Lie algebras sl 2 and the oscillator algebra. These pencils are linear in a spectral parameter λ. The corresponding generalized eigenvalue problem gives rise to some sets of orthogonal polynomials and Laurent biorthogonal polynomials (LBP) expressed in terms of the Gauss 2 F 1 and degenerate 1 F 1 hypergeometric functions. For special choices of the parameters of the pencils, we identify the resulting polynomials with the Hendriksen-van Rossum LBP which are widely believed to be the biorthogonal analogues of the classical orthogonal polynomials. This places these examples under the umbrella of the generalized bispectral problem which is considered here. Other (non-bispectral) cases give rise to some 'nonclassical' orthogonal polynomials including Tricomi-Carlitz and random-walk polynomials. An application to solutions of relativistic Toda chain is considered
Least squares orthogonal polynomial approximation in several independent variables
International Nuclear Information System (INIS)
Caprari, R.S.
1992-06-01
This paper begins with an exposition of a systematic technique for generating orthonormal polynomials in two independent variables by application of the Gram-Schmidt orthogonalization procedure of linear algebra. It is then demonstrated how a linear least squares approximation for experimental data or an arbitrary function can be generated from these polynomials. The least squares coefficients are computed without recourse to matrix arithmetic, which ensures both numerical stability and simplicity of implementation as a self contained numerical algorithm. The Gram-Schmidt procedure is then utilised to generate a complete set of orthogonal polynomials of fourth degree. A theory for the transformation of the polynomial representation from an arbitrary basis into the familiar sum of products form is presented, together with a specific implementation for fourth degree polynomials. Finally, the computational integrity of this algorithm is verified by reconstructing arbitrary fourth degree polynomials from their values at randomly chosen points in their domain. 13 refs., 1 tab
Analysis of fractional non-linear diffusion behaviors based on Adomian polynomials
Directory of Open Access Journals (Sweden)
Wu Guo-Cheng
2017-01-01
Full Text Available A time-fractional non-linear diffusion equation of two orders is considered to investigate strong non-linearity through porous media. An equivalent integral equation is established and Adomian polynomials are adopted to linearize non-linear terms. With the Taylor expansion of fractional order, recurrence formulae are proposed and novel numerical solutions are obtained to depict the diffusion behaviors more accurately. The result shows that the method is suitable for numerical simulation of the fractional diffusion equations of multi-orders.
Czech Academy of Sciences Publication Activity Database
Knížek, J.; Tichý, Petr; Beránek, L.; Šindelář, Jan; Vojtěšek, B.; Bouchal, P.; Nenutil, R.; Dedík, O.
2010-01-01
Roč. 7, č. 10 (2010), s. 48-60 ISSN 0974-5718 Grant - others:GA MZd(CZ) NS9812; GA ČR(CZ) GAP304/10/0868 Institutional research plan: CEZ:AV0Z10300504; CEZ:AV0Z10750506 Keywords : polynomial regression * orthogonalization * numerical methods * markers * biomarkers Subject RIV: BA - General Mathematics
Implications of inaccurate clinical nodal staging in pancreatic adenocarcinoma.
Swords, Douglas S; Firpo, Matthew A; Johnson, Kirsten M; Boucher, Kenneth M; Scaife, Courtney L; Mulvihill, Sean J
2017-07-01
Many patients with stage I-II pancreatic adenocarcinoma do not undergo resection. We hypothesized that (1) clinical staging underestimates nodal involvement, causing stage IIB to have a greater percent of resected patients and (2) this stage-shift causes discrepancies in observed survival. The Surveillance, Epidemiology, and End Results (SEER) research database was used to evaluate cause-specific survival in patients with pancreatic adenocarcinoma from 2004-2012. Survival was compared using the log-rank test. Single-center data on 105 patients who underwent resection of pancreatic adenocarcinoma without neoadjuvant treatment were used to compare clinical and pathologic nodal staging. In SEER data, medium-term survival in stage IIB was superior to IB and IIA, with median cause-specific survival of 14, 9, and 11 months, respectively (P < .001). Seventy-two percent of stage IIB patients underwent resection vs 28% in IB and 36% in IIA (P < .001). In our institutional data, 12.4% of patients had clinical evidence of nodal involvement vs 69.5% by pathologic staging (P < .001). Among clinical stage IA-IIA patients, 71.6% had nodal involvement by pathologic staging. Both SEER and institutional data support substantial underestimation of nodal involvement by clinical staging. This finding has implications in decisions regarding neoadjuvant therapy and analysis of outcomes in the absence of pathologic staging. Copyright © 2017 Elsevier Inc. All rights reserved.
Nodal methods for problems in fluid mechanics and neutron transport
International Nuclear Information System (INIS)
Azmy, Y.Y.
1985-01-01
A new high-accuracy, coarse-mesh, nodal integral approach is developed for the efficient numerical solution of linear partial differential equations. It is shown that various special cases of this general nodal integral approach correspond to several high efficiency nodal methods developed recently for the numerical solution of neutron diffusion and neutron transport problems. The new approach is extended to the nonlinear Navier-Stokes equations of fluid mechanics; its extension to these equations leads to a new computational method, the nodal integral method which is implemented for the numerical solution of these equations. Application to several test problems demonstrates the superior computational efficiency of this new method over previously developed methods. The solutions obtained for several driven cavity problems are compared with the available experimental data and are shown to be in very good agreement with experiment. Additional comparisons also show that the coarse-mesh, nodal integral method results agree very well with the results of definitive ultra-fine-mesh, finite-difference calculations for the driven cavity problem up to fairly high Reynolds numbers
Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians
Ndayiragije, François; Van Assche, Walter
2013-01-01
Multiple Meixner polynomials are polynomials in one variable which satisfy orthogonality relations with respect to $r>1$ different negative binomial distributions (Pascal distributions). There are two kinds of multiple Meixner polynomials, depending on the selection of the parameters in the negative binomial distribution. We recall their definition and some formulas and give generating functions and explicit expressions for the coefficients in the nearest neighbor recurrence relation. Followi...
On Roots of Polynomials and Algebraically Closed Fields
Directory of Open Access Journals (Sweden)
Schwarzweller Christoph
2017-10-01
Full Text Available In this article we further extend the algebraic theory of polynomial rings in Mizar [1, 2, 3]. We deal with roots and multiple roots of polynomials and show that both the real numbers and finite domains are not algebraically closed [5, 7]. We also prove the identity theorem for polynomials and that the number of multiple roots is bounded by the polynomial’s degree [4, 6].
Open Problems Related to the Hurwitz Stability of Polynomials Segments
Directory of Open Access Journals (Sweden)
Baltazar Aguirre-Hernández
2018-01-01
Full Text Available In the framework of robust stability analysis of linear systems, the development of techniques and methods that help to obtain necessary and sufficient conditions to determine stability of convex combinations of polynomials is paramount. In this paper, knowing that Hurwitz polynomials set is not a convex set, a brief overview of some results and open problems concerning the stability of the convex combinations of Hurwitz polynomials is then provided.
General quantum polynomials: irreducible modules and Morita equivalence
International Nuclear Information System (INIS)
Artamonov, V A
1999-01-01
In this paper we continue the investigation of the structure of finitely generated modules over rings of general quantum (Laurent) polynomials. We obtain a description of the lattice of submodules of periodic finitely generated modules and describe the irreducible modules. We investigate the problem of Morita equivalence of rings of general quantum polynomials, consider properties of division rings of fractions, and solve Zariski's problem for quantum polynomials
Applications of polynomial optimization in financial risk investment
Zeng, Meilan; Fu, Hongwei
2017-09-01
Recently, polynomial optimization has many important applications in optimization, financial economics and eigenvalues of tensor, etc. This paper studies the applications of polynomial optimization in financial risk investment. We consider the standard mean-variance risk measurement model and the mean-variance risk measurement model with transaction costs. We use Lasserre's hierarchy of semidefinite programming (SDP) relaxations to solve the specific cases. The results show that polynomial optimization is effective for some financial optimization problems.
Root and Critical Point Behaviors of Certain Sums of Polynomials
Indian Academy of Sciences (India)
13
There is an extensive literature concerning roots of sums of polynomials. Many papers and books([5], [6],. [7]) have written about these polynomials. Perhaps the most immediate question of sums of polynomials,. A + B = C, is “given bounds for the roots of A and B, what bounds can be given for the roots of C?” By. Fell [3], if ...
Simulation of aspheric tolerance with polynomial fitting
Li, Jing; Cen, Zhaofeng; Li, Xiaotong
2018-01-01
The shape of the aspheric lens changes caused by machining errors, resulting in a change in the optical transfer function, which affects the image quality. At present, there is no universally recognized tolerance criterion standard for aspheric surface. To study the influence of aspheric tolerances on the optical transfer function, the tolerances of polynomial fitting are allocated on the aspheric surface, and the imaging simulation is carried out by optical imaging software. Analysis is based on a set of aspheric imaging system. The error is generated in the range of a certain PV value, and expressed as a form of Zernike polynomial, which is added to the aspheric surface as a tolerance term. Through optical software analysis, the MTF of optical system can be obtained and used as the main evaluation index. Evaluate whether the effect of the added error on the MTF of the system meets the requirements of the current PV value. Change the PV value and repeat the operation until the acceptable maximum allowable PV value is obtained. According to the actual processing technology, consider the error of various shapes, such as M type, W type, random type error. The new method will provide a certain development for the actual free surface processing technology the reference value.
Quadratic polynomial interpolation on triangular domain
Li, Ying; Zhang, Congcong; Yu, Qian
2018-04-01
In the simulation of natural terrain, the continuity of sample points are not in consonance with each other always, traditional interpolation methods often can't faithfully reflect the shape information which lie in data points. So, a new method for constructing the polynomial interpolation surface on triangular domain is proposed. Firstly, projected the spatial scattered data points onto a plane and then triangulated them; Secondly, A C1 continuous piecewise quadric polynomial patch was constructed on each vertex, all patches were required to be closed to the line-interpolation one as far as possible. Lastly, the unknown quantities were gotten by minimizing the object functions, and the boundary points were treated specially. The result surfaces preserve as many properties of data points as possible under conditions of satisfying certain accuracy and continuity requirements, not too convex meantime. New method is simple to compute and has a good local property, applicable to shape fitting of mines and exploratory wells and so on. The result of new surface is given in experiments.
On factorization of generalized Macdonald polynomials
Energy Technology Data Exchange (ETDEWEB)
Kononov, Ya. [Landau Institute for Theoretical Physics, Chernogolovka (Russian Federation); HSE, Math Department, Moscow (Russian Federation); Morozov, A. [ITEP, Moscow (Russian Federation); Institute for Information Transmission Problems, Moscow (Russian Federation); National Research Nuclear University MEPhI, Moscow (Russian Federation)
2016-08-15
A remarkable feature of Schur functions - the common eigenfunctions of cut-and-join operators from W{sub ∞} - is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U{sub q}(SL{sub N}) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization - on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding. (orig.)
Positive trigonometric polynomials and signal processing applications
Dumitrescu, Bogdan
2017-01-01
This revised edition is made up of two parts: theory and applications. Though many of the fundamental results are still valid and used, new and revised material is woven throughout the text. As with the original book, the theory of sum-of-squares trigonometric polynomials is presented unitarily based on the concept of Gram matrix (extended to Gram pair or Gram set). The programming environment has also evolved, and the books examples are changed accordingly. The applications section is organized as a collection of related problems that use systematically the theoretical results. All the problems are brought to a semi-definite programming form, ready to be solved with algorithms freely available, like those from the libraries SeDuMi, CVX and Pos3Poly. A new chapter discusses applications in super-resolution theory, where Bounded Real Lemma for trigonometric polynomials is an important tool. This revision is written to be more appealing and easier to use for new readers. < Features updated information on LMI...
On factorization of generalized Macdonald polynomials
Kononov, Ya.; Morozov, A.
2016-08-01
A remarkable feature of Schur functions—the common eigenfunctions of cut-and-join operators from W_∞ —is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U_q(SL_N) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization—on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding.
International Nuclear Information System (INIS)
Ren Xiaoan; Wu Wenquan; Xanthis, Leonidas S.
2011-01-01
Highlights: → New approach for stochastic computations based on polynomial chaos. → Development of dynamically adaptive wavelet multiscale solver using space refinement. → Accurate capture of steep gradients and multiscale features in stochastic problems. → All scales of each random mode are captured on independent grids. → Numerical examples demonstrate the need for different space resolutions per mode. - Abstract: In stochastic computations, or uncertainty quantification methods, the spectral approach based on the polynomial chaos expansion in random space leads to a coupled system of deterministic equations for the coefficients of the expansion. The size of this system increases drastically when the number of independent random variables and/or order of polynomial chaos expansions increases. This is invariably the case for large scale simulations and/or problems involving steep gradients and other multiscale features; such features are variously reflected on each solution component or random/uncertainty mode requiring the development of adaptive methods for their accurate resolution. In this paper we propose a new approach for treating such problems based on a dynamically adaptive wavelet methodology involving space-refinement on physical space that allows all scales of each solution component to be refined independently of the rest. We exemplify this using the convection-diffusion model with random input data and present three numerical examples demonstrating the salient features of the proposed method. Thus we establish a new, elegant and flexible approach for stochastic problems with steep gradients and multiscale features based on polynomial chaos expansions.
From sequences to polynomials and back, via operator orderings
Energy Technology Data Exchange (ETDEWEB)
Amdeberhan, Tewodros, E-mail: tamdeber@tulane.edu; Dixit, Atul, E-mail: adixit@tulane.edu; Moll, Victor H., E-mail: vhm@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118 (United States); De Angelis, Valerio, E-mail: vdeangel@xula.edu [Department of Mathematics, Xavier University of Louisiana, New Orleans, Louisiana 70125 (United States); Vignat, Christophe, E-mail: vignat@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118, USA and L.S.S. Supelec, Universite d' Orsay (France)
2013-12-15
Bender and Dunne [“Polynomials and operator orderings,” J. Math. Phys. 29, 1727–1731 (1988)] showed that linear combinations of words q{sup k}p{sup n}q{sup n−k}, where p and q are subject to the relation qp − pq = ı, may be expressed as a polynomial in the symbol z=1/2 (qp+pq). Relations between such polynomials and linear combinations of the transformed coefficients are explored. In particular, examples yielding orthogonal polynomials are provided.
On Multiple Interpolation Functions of the -Genocchi Polynomials
Directory of Open Access Journals (Sweden)
Jin Jeong-Hee
2010-01-01
Full Text Available Abstract Recently, many mathematicians have studied various kinds of the -analogue of Genocchi numbers and polynomials. In the work (New approach to q-Euler, Genocchi numbers and their interpolation functions, "Advanced Studies in Contemporary Mathematics, vol. 18, no. 2, pp. 105–112, 2009.", Kim defined new generating functions of -Genocchi, -Euler polynomials, and their interpolation functions. In this paper, we give another definition of the multiple Hurwitz type -zeta function. This function interpolates -Genocchi polynomials at negative integers. Finally, we also give some identities related to these polynomials.
Generalized Pseudospectral Method and Zeros of Orthogonal Polynomials
Directory of Open Access Journals (Sweden)
Oksana Bihun
2018-01-01
Full Text Available Via a generalization of the pseudospectral method for numerical solution of differential equations, a family of nonlinear algebraic identities satisfied by the zeros of a wide class of orthogonal polynomials is derived. The generalization is based on a modification of pseudospectral matrix representations of linear differential operators proposed in the paper, which allows these representations to depend on two, rather than one, sets of interpolation nodes. The identities hold for every polynomial family pνxν=0∞ orthogonal with respect to a measure supported on the real line that satisfies some standard assumptions, as long as the polynomials in the family satisfy differential equations Apν(x=qν(xpν(x, where A is a linear differential operator and each qν(x is a polynomial of degree at most n0∈N; n0 does not depend on ν. The proposed identities generalize known identities for classical and Krall orthogonal polynomials, to the case of the nonclassical orthogonal polynomials that belong to the class described above. The generalized pseudospectral representations of the differential operator A for the case of the Sonin-Markov orthogonal polynomials, also known as generalized Hermite polynomials, are presented. The general result is illustrated by new algebraic relations satisfied by the zeros of the Sonin-Markov polynomials.
Energy Technology Data Exchange (ETDEWEB)
Ortega J, R.; Valle G, E. del [IPN-ESFM, 07738 Mexico D.F. (Mexico)]. e-mail: roj@correo.azc.uam.mx
2003-07-01
There are carried out charge and energy calculations deposited due to the interaction of electrons with a plate of a certain material, solving numerically the electron transport equation for the Boltzmann-Fokker-Planck approach of first order in plate geometry with a computer program denominated TEOD-NodExp (Transport of Electrons in Discreet Ordinates, Nodal Exponentials), using the proposed method by the Dr. J. E. Morel to carry out the discretization of the variable energy and several spatial discretization schemes, denominated exponentials nodal. It is used the Fokker-Planck equation since it represents an approach of the Boltzmann transport equation that is been worth whenever it is predominant the dispersion of small angles, that is to say, resulting dispersion in small dispersion angles and small losses of energy in the transport of charged particles. Such electrons could be those that they face with a braking plate in a device of thermonuclear fusion. In the present work its are considered electrons of 1 MeV that impact isotropically on an aluminum plate. They were considered three different thickness of plate that its were designated as problems 1, 2 and 3. In the calculations it was used the discrete ordinate method S{sub 4} with expansions of the dispersion cross sections until P{sub 3} order. They were considered 25 energy groups of uniform size between the minimum energy of 0.1 MeV and the maximum of 1.0 MeV; the one spatial intervals number it was considered variable and it was assigned the values of 10, 20 and 30. (Author)
International Nuclear Information System (INIS)
Sugino, Kazuteru
1998-07-01
As a tool to perform a fast reactor core calculations with high accuracy, NSHEX the nodal transport calculation code for three-dimensional hexagonal-Z geometry is under development. To improve the practical applicability of NSHEX, for instance, in its application to safety analysis and commercial reactor core design studies, we investigated the basic theory used in it, improved the program performance, and evaluated its applicability to the analysis of commercial reactor cores. The current studies show the following: (1) An improvement in the treatment of radial leakage in the radial nodal coupling equation bettered calculational convergence for safety analysis calculation, so the applicability of NSHEX to safety analysis was improved. (2) As a result of comparison of results from NSHEX and the standard core calculation code, it was confirmed that there was consistency between them. (3) According to the evaluation of the effect due to the difference of calculational condition, it was found that the calculation under appropriate nodal expansion orders and Sn orders correspond to the one under most detailed condition. However further investigation is required to reduce the uncertainty in calculational results due to the treatment of high order flux moments. (4) A whole core version of NSHEX enabling calculation for any FBR core geometry has been developed, this improved general applicability of NSHEX. (5) An investigation of the applicability of the rebalance method to acceleration clarified that this improved calculational convergence and it was effective. (J.P.N.)
Nobile, Fabio
2015-01-07
We consider a general problem F(u, y) = 0 where u is the unknown solution, possibly Hilbert space valued, and y a set of uncertain parameters. We specifically address the situation in which the parameterto-solution map u(y) is smooth, however y could be very high (or even infinite) dimensional. In particular, we are interested in cases in which F is a differential operator, u a Hilbert space valued function and y a distributed, space and/or time varying, random field. We aim at reconstructing the parameter-to-solution map u(y) from random noise-free or noisy observations in random points by discrete least squares on polynomial spaces. The noise-free case is relevant whenever the technique is used to construct metamodels, based on polynomial expansions, for the output of computer experiments. In the case of PDEs with random parameters, the metamodel is then used to approximate statistics of the output quantity. We discuss the stability of discrete least squares on random points show convergence estimates both in expectation and probability. We also present possible strategies to select, either a-priori or by adaptive algorithms, sequences of approximating polynomial spaces that allow to reduce, and in some cases break, the curse of dimensionality
Directory of Open Access Journals (Sweden)
Tsugio Fukuchi
2014-06-01
Full Text Available The finite difference method (FDM based on Cartesian coordinate systems can be applied to numerical analyses over any complex domain. A complex domain is usually taken to mean that the geometry of an immersed body in a fluid is complex; here, it means simply an analytical domain of arbitrary configuration. In such an approach, we do not need to treat the outer and inner boundaries differently in numerical calculations; both are treated in the same way. Using a method that adopts algebraic polynomial interpolations in the calculation around near-wall elements, all the calculations over irregular domains reduce to those over regular domains. Discretization of the space differential in the FDM is usually derived using the Taylor series expansion; however, if we use the polynomial interpolation systematically, exceptional advantages are gained in deriving high-order differences. In using the polynomial interpolations, we can numerically solve the Poisson equation freely over any complex domain. Only a particular type of partial differential equation, Poisson's equations, is treated; however, the arguments put forward have wider generality in numerical calculations using the FDM.
On the Nodal Lines of Eisenstein Series on Schottky Surfaces
Jakobson, Dmitry; Naud, Frédéric
2017-04-01
On convex co-compact hyperbolic surfaces {X=Γ backslash H2}, we investigate the behavior of nodal curves of real valued Eisenstein series {F_λ(z,ξ)}, where {λ} is the spectral parameter, {ξ} the direction at infinity. Eisenstein series are (non-{L^2}) eigenfunctions of the Laplacian {Δ_X} satisfying {Δ_X F_λ=(1/4+λ^2)F_λ}. As {λ} goes to infinity (the high energy limit), we show that, for generic {ξ}, the number of intersections of nodal lines with any compact segment of geodesic grows like {λ}, up to multiplicative constants. Applications to the number of nodal domains inside the convex core of the surface are then derived.
A computational study of nodal-based tetrahedral element behavior.
Energy Technology Data Exchange (ETDEWEB)
Gullerud, Arne S.
2010-09-01
This report explores the behavior of nodal-based tetrahedral elements on six sample problems, and compares their solution to that of a corresponding hexahedral mesh. The problems demonstrate that while certain aspects of the solution field for the nodal-based tetrahedrons provide good quality results, the pressure field tends to be of poor quality. Results appear to be strongly affected by the connectivity of the tetrahedral elements. Simulations that rely on the pressure field, such as those which use material models that are dependent on the pressure (e.g. equation-of-state models), can generate erroneous results. Remeshing can also be strongly affected by these issues. The nodal-based test elements as they currently stand need to be used with caution to ensure that their numerical deficiencies do not adversely affect critical values of interest.
A theoretical study on a convergence problem of nodal methods
Energy Technology Data Exchange (ETDEWEB)
Shaohong, Z.; Ziyong, L. [Shanghai Jiao Tong Univ., 1954 Hua Shan Road, Shanghai, 200030 (China); Chao, Y. A. [Westinghouse Electric Company, P. O. Box 355, Pittsburgh, PA 15230-0355 (United States)
2006-07-01
The effectiveness of modern nodal methods is largely due to its use of the information from the analytical flux solution inside a homogeneous node. As a result, the nodal coupling coefficients depend explicitly or implicitly on the evolving Eigen-value of a problem during its solution iteration process. This poses an inherently non-linear matrix Eigen-value iteration problem. This paper points out analytically that, whenever the half wave length of an evolving node interior analytic solution becomes smaller than the size of that node, this non-linear iteration problem can become inherently unstable and theoretically can always be non-convergent or converge to higher order harmonics. This phenomenon is confirmed, demonstrated and analyzed via the simplest 1-D problem solved by the simplest analytic nodal method, the Analytic Coarse Mesh Finite Difference (ACMFD, [1]) method. (authors)
Super-nodal methods for space-time kinetics
Mertyurek, Ugur
The purpose of this research has been to develop an advanced Super-Nodal method to reduce the run time of 3-D core neutronics models, such as in the NESTLE reactor core simulator and FORMOSA nuclear fuel management optimization codes. Computational performance of the neutronics model is increased by reducing the number of spatial nodes used in the core modeling. However, as the number of spatial nodes decreases, the error in the solution increases. The Super-Nodal method reduces the error associated with the use of coarse nodes in the analyses by providing a new set of cross sections and ADFs (Assembly Discontinuity Factors) for the new nodalization. These so called homogenization parameters are obtained by employing consistent collapsing technique. During this research a new type of singularity, namely "fundamental mode singularity", is addressed in the ANM (Analytical Nodal Method) solution. The "Coordinate Shifting" approach is developed as a method to address this singularity. Also, the "Buckling Shifting" approach is developed as an alternative and more accurate method to address the zero buckling singularity, which is a more common and well known singularity problem in the ANM solution. In the course of addressing the treatment of these singularities, an effort was made to provide better and more robust results from the Super-Nodal method by developing several new methods for determining the transverse leakage and collapsed diffusion coefficient, which generally are the two main approximations in the ANM methodology. Unfortunately, the proposed new transverse leakage and diffusion coefficient approximations failed to provide a consistent improvement to the current methodology. However, improvement in the Super-Nodal solution is achieved by updating the homogenization parameters at several time points during a transient. The update is achieved by employing a refinement technique similar to pin-power reconstruction. A simple error analysis based on the relative
A comparison of Nodal methods in neutron diffusion calculations
Energy Technology Data Exchange (ETDEWEB)
Tavron, Barak [Israel Electric Company, Haifa (Israel) Nuclear Engineering Dept. Research and Development Div.
1996-12-01
The nuclear engineering department at IEC uses in the reactor analysis three neutron diffusion codes based on nodal methods. The codes, GNOMERl, ADMARC2 and NOXER3 solve the neutron diffusion equation to obtain flux and power distributions in the core. The resulting flux distributions are used for the furl cycle analysis and for fuel reload optimization. This work presents a comparison of the various nodal methods employed in the above codes. Nodal methods (also called Coarse-mesh methods) have been designed to solve problems that contain relatively coarse areas of homogeneous composition. In the nodal method parts of the equation that present the state in the homogeneous area are solved analytically while, according to various assumptions and continuity requirements, a general solution is sought out. Thus efficiency of the method for this kind of problems, is very high compared with the finite element and finite difference methods. On the other hand, using this method one can get only approximate information about the node vicinity (or coarse-mesh area, usually a feel assembly of a 20 cm size). These characteristics of the nodal method make it suitable for feel cycle analysis and reload optimization. This analysis requires many subsequent calculations of the flux and power distributions for the feel assemblies while there is no need for detailed distribution within the assembly. For obtaining detailed distribution within the assembly methods of power reconstruction may be applied. However homogenization of feel assembly properties, required for the nodal method, may cause difficulties when applied to fuel assemblies with many absorber rods, due to exciting strong neutron properties heterogeneity within the assembly. (author).
Nodal spectrum method for solving neutron diffusion equation
International Nuclear Information System (INIS)
Sanchez, D.; Garcia, C. R.; Barros, R. C. de; Milian, D.E.
1999-01-01
Presented here is a new numerical nodal method for solving static multidimensional neutron diffusion equation in rectangular geometry. Our method is based on a spectral analysis of the nodal diffusion equations. These equations are obtained by integrating the diffusion equation in X, Y directions and then considering flat approximations for the current. These flat approximations are the only approximations that are considered in this method, as a result the numerical solutions are completely free from truncation errors. We show numerical results to illustrate the methods accuracy for coarse mesh calculations
Oddness of least energy nodal solutions on radial domains
Directory of Open Access Journals (Sweden)
Christopher Grumiau
2010-07-01
Full Text Available In this article, we consider the Lane-Emden problem $$displaylines{ Delta u(x + |{u(x}mathclose|^{p-2}u(x=0, quad hbox{for } xinOmega,cr u(x=0, quad hbox{for } xinpartialOmega, }$$ where $2 < p < 2^{*}$ and $Omega$ is a ball or an annulus in $mathbb{R}^{N}$, $Ngeq 2$. We show that, for p close to 2, least energy nodal solutions are odd with respect to an hyperplane -- which is their nodal surface. The proof ingredients are a constrained implicit function theorem and the fact that the second eigenvalue is simple up to rotations.
Nodal algorithm derived from a new variational principle
International Nuclear Information System (INIS)
Watson, Fernando V.
1995-01-01
As a by-product of the research being carried on by the author on methods of recovering pin power distribution of PWR cores, a nodal algorithm based on a modified variational principle for the two group diffusion equations has been obtained. The main feature of the new algorithm is the low dimensionality achieved by the reduction of the original diffusion equations to a system of algebraic Eigen equations involving the average sources only, instead of sources and interface group currents used in conventional nodal methods. The advantage of this procedure is discussed and results generated by the new algorithm and by a finite difference code are compared. (author). 2 refs, 7 tabs