WorldWideScience

Sample records for polynomial chaos expansions

  1. 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

  2. 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.

  3. Polynomial chaos expansion with random and fuzzy variables

    Science.gov (United States)

    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.

  4. 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.

  5. 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

  6. 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

  7. 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

  8. 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.

  9. Non-intrusive uncertainty quantification in structural-acoustic systems using polynomial chaos expansion method

    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.

  10. Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format

    KAUST Repository

    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

  11. 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

  12. Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies

    Science.gov (United States)

    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.

  13. 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.

  14. 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.

  15. Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

    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

  16. Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

    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

  17. 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.

  18. Stochastic Estimation via Polynomial Chaos

    Science.gov (United States)

    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

  19. 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.

  20. 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.

  1. Model-assisted probability of detection of flaws in aluminum blocks using polynomial chaos expansions

    Science.gov (United States)

    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.

  2. Uncertainty propagation of p-boxes using sparse polynomial chaos expansions

    Science.gov (United States)

    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.

  3. 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.

  4. Schmidt-Kalman Filter with Polynomial Chaos Expansion for Orbit Determination of Space Objects

    Science.gov (United States)

    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.

  5. A new surrogate modeling technique combining Kriging and polynomial chaos expansions – Application to uncertainty analysis in computational dosimetry

    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.

  6. Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format

    KAUST Repository

    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.

  7. A Posteriori Error Analysis of Stochastic Differential Equations Using Polynomial Chaos Expansions

    KAUST Repository

    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.

  8. The principal component analysis method used with polynomial Chaos expansion to propagate uncertainties through critical transport problems

    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)

  9. Research on the Statistical Characteristics of Crosstalk in Naval Ships Wiring Harness Based on Polynomial Chaos Expansion Method

    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.

  10. Nonintrusive Polynomial Chaos Expansions for Sensitivity Analysis in Stochastic Differential Equations

    KAUST Repository

    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.

  11. Nonintrusive Polynomial Chaos Expansions for Sensitivity Analysis in Stochastic Differential Equations

    KAUST Repository

    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.

  12. A polynomial-chaos-expansion-based building block approach for stochastic analysis of photonic circuits

    Science.gov (United States)

    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.

  13. 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

  14. Gaussian Processes and Polynomial Chaos Expansion for Regression Problem: Linkage via the RKHS and Comparison via the KL Divergence

    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.

  15. Inverse uncertainty quantification of reactor simulations under the Bayesian framework using surrogate models constructed by polynomial chaos expansion

    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.

  16. Using sparse polynomial chaos expansions for the global sensitivity analysis of groundwater lifetime expectancy in a multi-layered hydrogeological model

    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.

  17. 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.

  18. Reduced-order modeling with sparse polynomial chaos expansion and dimension reduction for evaluating the impact of CO2 and brine leakage on groundwater

    Science.gov (United States)

    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

  19. 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

  20. 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

  1. Polynomial Chaos Surrogates for Bayesian Inference

    KAUST Repository

    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.

  2. Coordinate transformation and Polynomial Chaos for the Bayesian inference of a Gaussian process with parametrized prior covariance function

    KAUST Repository

    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

  3. Bayesian inference of earthquake parameters from buoy data using a polynomial chaos-based surrogate

    KAUST Repository

    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

  4. Quantifying uncertainties in fault slip distribution during the Tōhoku tsunami using polynomial chaos

    KAUST Repository

    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

  5. Review of Polynomial Chaos-Based Methods for Uncertainty Quantification in Modern Integrated Circuits

    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.

  6. vs. a polynomial chaos-based MCMC

    KAUST Repository

    Siripatana, Adil

    2014-08-01

    Bayesian Inference of Manning\\'s n coefficient in a Storm Surge Model Framework: comparison between Kalman lter and polynomial based method Adil Siripatana Conventional coastal ocean models solve the shallow water equations, which describe the conservation of mass and momentum when the horizontal length scale is much greater than the vertical length scale. In this case vertical pressure gradients in the momentum equations are nearly hydrostatic. The outputs of coastal ocean models are thus sensitive to the bottom stress terms de ned through the formulation of Manning\\'s n coefficients. This thesis considers the Bayesian inference problem of the Manning\\'s n coefficient in the context of storm surge based on the coastal ocean ADCIRC model. In the first part of the thesis, we apply an ensemble-based Kalman filter, the singular evolutive interpolated Kalman (SEIK) filter to estimate both a constant Manning\\'s n coefficient and a 2-D parameterized Manning\\'s coefficient on one ideal and one of more realistic domain using observation system simulation experiments (OSSEs). We study the sensitivity of the system to the ensemble size. we also access the benefits from using an in ation factor on the filter performance. To study the limitation of the Guassian restricted assumption on the SEIK lter, 5 we also implemented in the second part of this thesis a Markov Chain Monte Carlo (MCMC) method based on a Generalized Polynomial chaos (gPc) approach for the estimation of the 1-D and 2-D Mannning\\'s n coe cient. The gPc is used to build a surrogate model that imitate the ADCIRC model in order to make the computational cost of implementing the MCMC with the ADCIRC model reasonable. We evaluate the performance of the MCMC-gPc approach and study its robustness to di erent OSSEs scenario. we also compare its estimates with those resulting from SEIK in term of parameter estimates and full distributions. we present a full analysis of the solution of these two methods, of the

  7. The application of polynomial chaos methods to a point kinetics model of MIPR: An Aqueous Homogeneous Reactor

    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

  8. Review of Polynomial Chaos-Based Methods for Uncertainty Quantification in Modern Integrated Circuits

    OpenAIRE

    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...

  9. Uncertainty Quantification in Simulations of Epidemics Using Polynomial Chaos

    Directory of Open Access Journals (Sweden)

    F. Santonja

    2012-01-01

    Full Text Available Mathematical models based on ordinary differential equations are a useful tool to study the processes involved in epidemiology. Many models consider that the parameters are deterministic variables. But in practice, the transmission parameters present large variability and it is not possible to determine them exactly, and it is necessary to introduce randomness. In this paper, we present an application of the polynomial chaos approach to epidemiological mathematical models based on ordinary differential equations with random coefficients. Taking into account the variability of the transmission parameters of the model, this approach allows us to obtain an auxiliary system of differential equations, which is then integrated numerically to obtain the first-and the second-order moments of the output stochastic processes. A sensitivity analysis based on the polynomial chaos approach is also performed to determine which parameters have the greatest influence on the results. As an example, we will apply the approach to an obesity epidemic model.

  10. Adaptive polynomial chaos techniques for uncertainty quantification of a gas cooled fast reactor transient

    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)

  11. 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

  12. Bayesian inference of earthquake parameters from buoy data using a polynomial chaos-based surrogate

    KAUST Repository

    Giraldi, Loic

    2017-04-07

    This work addresses the estimation of the parameters of an earthquake model by the consequent tsunami, with an application to the Chile 2010 event. We are particularly interested in the Bayesian inference of the location, the orientation, and the slip of an Okada-based model of the earthquake ocean floor displacement. The tsunami numerical model is based on the GeoClaw software while the observational data is provided by a single DARTⓇ buoy. We propose in this paper a methodology based 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 classical independent Gaussian noise is shown to be unsuitable for modeling the error, and to prevent convergence of the Markov Chain Monte Carlo sampler. Second, the polynomial chaos model is subsequently improved to handle the variability of the arrival time of the wave, using a preconditioned non-intrusive spectral method. Finally, the construction of a reduced model dedicated to Bayesian inference is proposed. Numerical results are presented and discussed.

  13. A polynomial chaos ensemble hydrologic prediction system for efficient parameter inference and robust uncertainty assessment

    Science.gov (United States)

    Wang, S.; Huang, G. H.; Baetz, B. W.; Huang, W.

    2015-11-01

    This paper presents a polynomial chaos ensemble hydrologic prediction system (PCEHPS) for an efficient and robust uncertainty assessment of model parameters and predictions, in which possibilistic reasoning is infused into probabilistic parameter inference with simultaneous consideration of randomness and fuzziness. The PCEHPS is developed through a two-stage factorial polynomial chaos expansion (PCE) framework, which consists of an ensemble of PCEs to approximate the behavior of the hydrologic model, significantly speeding up the exhaustive sampling of the parameter space. Multiple hypothesis testing is then conducted to construct an ensemble of reduced-dimensionality PCEs with only the most influential terms, which is meaningful for achieving uncertainty reduction and further acceleration of parameter inference. The PCEHPS is applied to the Xiangxi River watershed in China to demonstrate its validity and applicability. A detailed comparison between the HYMOD hydrologic model, the ensemble of PCEs, and the ensemble of reduced PCEs is performed in terms of accuracy and efficiency. Results reveal temporal and spatial variations in parameter sensitivities due to the dynamic behavior of hydrologic systems, and the effects (magnitude and direction) of parametric interactions depending on different hydrological metrics. The case study demonstrates that the PCEHPS is capable not only of capturing both expert knowledge and probabilistic information in the calibration process, but also of implementing an acceleration of more than 10 times faster than the hydrologic model without compromising the predictive accuracy.

  14. Single-site Lennard-Jones models via polynomial chaos surrogates of Monte Carlo molecular simulation

    KAUST Repository

    Kadoura, Ahmad Salim; Siripatana, Adil; Sun, Shuyu; Knio, Omar; Hoteit, Ibrahim

    2016-01-01

    In this work, two Polynomial Chaos (PC) surrogates were generated to reproduce Monte Carlo (MC) molecular simulation results of the canonical (single-phase) and the NVT-Gibbs (two-phase) ensembles for a system of normalized structureless Lennard

  15. Multi-model polynomial chaos surrogate dictionary for Bayesian inference in elasticity problems

    KAUST Repository

    Contreras, Andres A.; Le Maî tre, Olivier P.; Aquino, Wilkins; Knio, Omar

    2016-01-01

    of stiff inclusions embedded in a soft matrix, mimicking tumors in soft tissues. We rely on a polynomial chaos (PC) surrogate to accelerate the inference process. The PC surrogate predicts the dependence of the displacements field with the random elastic

  16. Efficient Bayesian inference of subsurface flow models using nested sampling and sparse polynomial chaos surrogates

    KAUST Repository

    Elsheikh, Ahmed H.; Hoteit, Ibrahim; Wheeler, Mary Fanett

    2014-01-01

    An efficient Bayesian calibration method based on the nested sampling (NS) algorithm and non-intrusive polynomial chaos method is presented. Nested sampling is a Bayesian sampling algorithm that builds a discrete representation of the posterior

  17. A dynamically adaptive wavelet approach to stochastic computations based on polynomial chaos - capturing all scales of random modes on independent grids

    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.

  18. Polynomial Chaos Characterization of Uncertainty in Multiscale Models and Behavior of Carbon Reinforced Composites

    Energy Technology Data Exchange (ETDEWEB)

    Mehrez, Loujaine [University of Southern California; Ghanem, Roger [University of Southern California; Aitharaju, Venkat [General Motors; Rodgers, William [General Motors

    2017-10-23

    Design of non-crimp fabric (NCF) composites entails major challenges pertaining to (1) the complex fine-scale morphology of the constituents, (2) the manufacturing-produced inconsistency of this morphology spatially, and thus (3) the ability to build reliable, robust, and efficient computational surrogate models to account for this complex nature. Traditional approaches to construct computational surrogate models have been to average over the fluctuations of the material properties at different scale lengths. This fails to account for the fine-scale features and fluctuations in morphology, material properties of the constituents, as well as fine-scale phenomena such as damage and cracks. In addition, it fails to accurately predict the scatter in macroscopic properties, which is vital to the design process and behavior prediction. In this work, funded in part by the Department of Energy, we present an approach for addressing these challenges by relying on polynomial chaos representations of both input parameters and material properties at different scales. Moreover, we emphasize the efficiency and robustness of integrating the polynomial chaos expansion with multiscale tools to perform multiscale assimilation, characterization, propagation, and prediction, all of which are necessary to construct the data-driven surrogate models required to design under the uncertainty of composites. These data-driven constructions provide an accurate map from parameters (and their uncertainties) at all scales and the system-level behavior relevant for design. While this perspective is quite general and applicable to all multiscale systems, NCF composites present a particular hierarchy of scales that permits the efficient implementation of these concepts.

  19. Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

    Energy Technology Data Exchange (ETDEWEB)

    Perkó, Zoltán, E-mail: Z.Perko@tudelft.nl; Gilli, Luca, E-mail: Gilli@nrg.eu; Lathouwers, Danny, E-mail: D.Lathouwers@tudelft.nl; Kloosterman, Jan Leen, E-mail: J.L.Kloosterman@tudelft.nl

    2014-03-01

    The demand for accurate and computationally affordable sensitivity and uncertainty techniques is constantly on the rise and has become especially pressing in the nuclear field with the shift to Best Estimate Plus Uncertainty methodologies in the licensing of nuclear installations. Besides traditional, already well developed methods – such as first order perturbation theory or Monte Carlo sampling – Polynomial Chaos Expansion (PCE) has been given a growing emphasis in recent years due to its simple application and good performance. This paper presents new developments of the research done at TU Delft on such Polynomial Chaos (PC) techniques. Our work is focused on the Non-Intrusive Spectral Projection (NISP) approach and adaptive methods for building the PCE of responses of interest. Recent efforts resulted in a new adaptive sparse grid algorithm designed for estimating the PC coefficients. The algorithm is based on Gerstner's procedure for calculating multi-dimensional integrals but proves to be computationally significantly cheaper, while at the same it retains a similar accuracy as the original method. More importantly the issue of basis adaptivity has been investigated and two techniques have been implemented for constructing the sparse PCE of quantities of interest. Not using the traditional full PC basis set leads to further reduction in computational time since the high order grids necessary for accurately estimating the near zero expansion coefficients of polynomial basis vectors not needed in the PCE can be excluded from the calculation. Moreover the sparse PC representation of the response is easier to handle when used for sensitivity analysis or uncertainty propagation due to the smaller number of basis vectors. The developed grid and basis adaptive methods have been implemented in Matlab as the Fully Adaptive Non-Intrusive Spectral Projection (FANISP) algorithm and were tested on four analytical problems. These show consistent good performance

  20. Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

    International Nuclear Information System (INIS)

    Perkó, Zoltán; Gilli, Luca; Lathouwers, Danny; Kloosterman, Jan Leen

    2014-01-01

    The demand for accurate and computationally affordable sensitivity and uncertainty techniques is constantly on the rise and has become especially pressing in the nuclear field with the shift to Best Estimate Plus Uncertainty methodologies in the licensing of nuclear installations. Besides traditional, already well developed methods – such as first order perturbation theory or Monte Carlo sampling – Polynomial Chaos Expansion (PCE) has been given a growing emphasis in recent years due to its simple application and good performance. This paper presents new developments of the research done at TU Delft on such Polynomial Chaos (PC) techniques. Our work is focused on the Non-Intrusive Spectral Projection (NISP) approach and adaptive methods for building the PCE of responses of interest. Recent efforts resulted in a new adaptive sparse grid algorithm designed for estimating the PC coefficients. The algorithm is based on Gerstner's procedure for calculating multi-dimensional integrals but proves to be computationally significantly cheaper, while at the same it retains a similar accuracy as the original method. More importantly the issue of basis adaptivity has been investigated and two techniques have been implemented for constructing the sparse PCE of quantities of interest. Not using the traditional full PC basis set leads to further reduction in computational time since the high order grids necessary for accurately estimating the near zero expansion coefficients of polynomial basis vectors not needed in the PCE can be excluded from the calculation. Moreover the sparse PC representation of the response is easier to handle when used for sensitivity analysis or uncertainty propagation due to the smaller number of basis vectors. The developed grid and basis adaptive methods have been implemented in Matlab as the Fully Adaptive Non-Intrusive Spectral Projection (FANISP) algorithm and were tested on four analytical problems. These show consistent good performance both

  1. Adaptive method for multi-dimensional integration and selection of a base of chaos polynomials

    International Nuclear Information System (INIS)

    Crestaux, T.

    2011-01-01

    This research thesis addresses the propagation of uncertainty in numerical simulations and its processing within a probabilistic framework by a functional approach based on random variable functions. The author reports the use of the spectral method to represent random variables by development in polynomial chaos. More precisely, the author uses the method of non-intrusive projection which uses the orthogonality of Chaos Polynomials to compute the development coefficients by approximation of scalar products. The approach is applied to a cavity and to waste storage [fr

  2. Quantifying uncertainties in fault slip distribution during the Tōhoku tsunami using polynomial chaos

    KAUST Repository

    Sraj, Ihab

    2017-10-14

    An efficient method for inferring Manning’s n coefficients using water surface elevation data was presented in Sraj et al. (Ocean Modell 83:82–97 2014a) focusing on a test case based on data collected during the Tōhoku earthquake and tsunami. 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 of inferring the fault slip distribution of the Tōhoku earthquake using a similar problem setup. The same approach to constructing the PC surrogate did not lead to a converging expansion; however, an alternative approach based on basis pursuit denoising was found to be suitable. Our result shows that the fault slip distribution can be inferred using water surface elevation data whereas the inferred values minimize the error between observations and the numerical model. The numerical approach and the resulting inversion are presented in this work.

  3. Application of Least-Squares Spectral Element Methods to Polynomial Chaos

    NARCIS (Netherlands)

    Vos, P.E.J.; Gerritsma, M.I.

    2006-01-01

    This papers describes the use of the Least-Squares Spectral Element Method to polynomial Chaos to solve stochastic partial differential equations. The method will be described in detail and a comparison will be presented between the least-squares projection and the conventional Galerkin projection.

  4. 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].

  5. Time-Dependent Global Sensitivity Analysis for Long-Term Degeneracy Model Using Polynomial Chaos

    Directory of Open Access Journals (Sweden)

    Jianbin Guo

    2014-07-01

    Full Text Available Global sensitivity is used to quantify the influence of uncertain model inputs on the output variability of static models in general. However, very few approaches can be applied for the sensitivity analysis of long-term degeneracy models, as far as time-dependent reliability is concerned. The reason is that the static sensitivity may not reflect the completed sensitivity during the entire life circle. This paper presents time-dependent global sensitivity analysis for long-term degeneracy models based on polynomial chaos expansion (PCE. Sobol’ indices are employed as the time-dependent global sensitivity since they provide accurate information on the selected uncertain inputs. In order to compute Sobol’ indices more efficiently, this paper proposes a moving least squares (MLS method to obtain the time-dependent PCE coefficients with acceptable simulation effort. Then Sobol’ indices can be calculated analytically as a postprocessing of the time-dependent PCE coefficients with almost no additional cost. A test case is used to show how to conduct the proposed method, then this approach is applied to an engineering case, and the time-dependent global sensitivity is obtained for the long-term degeneracy mechanism model.

  6. Reliability-based trajectory optimization using nonintrusive polynomial chaos for Mars entry mission

    Science.gov (United States)

    Huang, Yuechen; Li, Haiyang

    2018-06-01

    This paper presents the reliability-based sequential optimization (RBSO) method to settle the trajectory optimization problem with parametric uncertainties in entry dynamics for Mars entry mission. First, the deterministic entry trajectory optimization model is reviewed, and then the reliability-based optimization model is formulated. In addition, the modified sequential optimization method, in which the nonintrusive polynomial chaos expansion (PCE) method and the most probable point (MPP) searching method are employed, is proposed to solve the reliability-based optimization problem efficiently. The nonintrusive PCE method contributes to the transformation between the stochastic optimization (SO) and the deterministic optimization (DO) and to the approximation of trajectory solution efficiently. The MPP method, which is used for assessing the reliability of constraints satisfaction only up to the necessary level, is employed to further improve the computational efficiency. The cycle including SO, reliability assessment and constraints update is repeated in the RBSO until the reliability requirements of constraints satisfaction are satisfied. Finally, the RBSO is compared with the traditional DO and the traditional sequential optimization based on Monte Carlo (MC) simulation in a specific Mars entry mission to demonstrate the effectiveness and the efficiency of the proposed method.

  7. Global sensitivity analysis using sparse grid interpolation and polynomial chaos

    International Nuclear Information System (INIS)

    Buzzard, Gregery T.

    2012-01-01

    Sparse grid interpolation is widely used to provide good approximations to smooth functions in high dimensions based on relatively few function evaluations. By using an efficient conversion from the interpolating polynomial provided by evaluations on a sparse grid to a representation in terms of orthogonal polynomials (gPC representation), we show how to use these relatively few function evaluations to estimate several types of sensitivity coefficients and to provide estimates on local minima and maxima. First, we provide a good estimate of the variance-based sensitivity coefficients of Sobol' (1990) [1] and then use the gradient of the gPC representation to give good approximations to the derivative-based sensitivity coefficients described by Kucherenko and Sobol' (2009) [2]. Finally, we use the package HOM4PS-2.0 given in Lee et al. (2008) [3] to determine the critical points of the interpolating polynomial and use these to determine the local minima and maxima of this polynomial. - Highlights: ► Efficient estimation of variance-based sensitivity coefficients. ► Efficient estimation of derivative-based sensitivity coefficients. ► Use of homotopy methods for approximation of local maxima and minima.

  8. Control design and robustness analysis of a ball and plate system by using polynomial chaos

    Energy Technology Data Exchange (ETDEWEB)

    Colón, Diego [University of São Paulo, Polytechnic School, LAC -PTC, São Paulo (Brazil); Balthazar, José M. [São Paulo State University - Rio Claro Campus, Rio Claro (Brazil); Reis, Célia A. dos [São Paulo State University - Bauru Campus, Bauru (Brazil); Bueno, Átila M.; Diniz, Ivando S. [São Paulo State University - Sorocaba Campus, Sorocaba (Brazil); Rosa, Suelia de S. R. F. [University of Brasilia, Brasilia (Brazil)

    2014-12-10

    In this paper, we present a mathematical model of a ball and plate system, a control law and analyze its robustness properties by using the polynomial chaos method. The ball rolls without slipping. There is an auxiliary robot vision system that determines the bodies' positions and velocities, and is used for control purposes. The actuators are to orthogonal DC motors, that changes the plate's angles with the ground. The model is a extension of the ball and beam system and is highly nonlinear. The system is decoupled in two independent equations for coordinates x and y. Finally, the resulting nonlinear closed loop systems are analyzed by the polynomial chaos methodology, which considers that some system parameters are random variables, and generates statistical data that can be used in the robustness analysis.

  9. 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

  10. Polynomial Chaos Acceleration for the Bayesian Inference of Random Fields with Gaussian Priors and Uncertain Covariance Hyper-Parameters

    KAUST Repository

    Le Maitre, Olivier

    2015-01-07

    We address model dimensionality reduction in the Bayesian inference of Gaussian fields, considering prior covariance function with unknown hyper-parameters. The Karhunen-Loeve (KL) expansion of a prior Gaussian process is traditionally derived assuming fixed covariance function with pre-assigned hyperparameter values. Thus, the modes strengths of the Karhunen-Loeve expansion inferred using available observations, as well as the resulting inferred process, dependent on the pre-assigned values for the covariance hyper-parameters. Here, we seek to infer the process and its the covariance hyper-parameters in a single Bayesian inference. To this end, the uncertainty in the hyper-parameters is treated by means of a coordinate transformation, leading to a KL-type expansion on a fixed reference basis of spatial modes, but with random coordinates conditioned on the hyper-parameters. A Polynomial Chaos (PC) expansion of the model prediction is also introduced to accelerate the Bayesian inference and the sampling of the posterior distribution with MCMC method. The PC expansion of the model prediction also rely on a coordinates transformation, enabling us to avoid expanding the dependence of the prediction with respect to the covariance hyper-parameters. We demonstrate the efficiency of the proposed method on a transient diffusion equation by inferring spatially-varying log-diffusivity fields from noisy data.

  11. A generalized polynomial chaos based ensemble Kalman filter with high accuracy

    International Nuclear Information System (INIS)

    Li Jia; Xiu Dongbin

    2009-01-01

    As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.

  12. Asymptotic chaos expansions in finance theory and practice

    CERN Document Server

    Nicolay, David

    2014-01-01

    Stochastic instantaneous volatility models such as Heston, SABR or SV-LMM have mostly been developed to control the shape and joint dynamics of the implied volatility surface. In principle, they are well suited for pricing and hedging vanilla and exotic options, for relative value strategies or for risk management. In practice however, most SV models lack a closed form valuation for European options. This book presents the recently developed Asymptotic Chaos Expansions methodology (ACE) which addresses that issue. Indeed its generic algorithm provides, for any regular SV model, the pure asymptotes at any order for both the static and dynamic maps of the implied volatility surface. Furthermore, ACE is programmable and can complement other approximation methods. Hence it allows a systematic approach to designing, parameterising, calibrating and exploiting SV models, typically for Vega hedging or American Monte-Carlo. Asymptotic Chaos Expansions in Finance illustrates the ACE approach for single underlyings (suc...

  13. 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.

  14. Coordinate transformation and Polynomial Chaos for the Bayesian inference of a Gaussian process with parametrized prior covariance function

    KAUST Repository

    Sraj, Ihab

    2015-10-22

    This paper addresses model dimensionality reduction for Bayesian inference based on prior Gaussian fields with uncertainty in the covariance function hyper-parameters. The dimensionality reduction is traditionally achieved using the Karhunen-Loève expansion of a prior Gaussian process assuming covariance function with fixed hyper-parameters, despite the fact that these are uncertain in nature. The posterior distribution of the Karhunen-Loève coordinates is then inferred using available observations. The resulting inferred field is therefore dependent on the assumed hyper-parameters. Here, we seek to efficiently estimate both the field and covariance hyper-parameters using Bayesian inference. To this end, a generalized Karhunen-Loève expansion is derived 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 to avoid expanding explicitly the solution dependence on the uncertain hyper-parameters. We demonstrate the feasibility of the proposed method on a transient diffusion equation by inferring spatially-varying log-diffusivity fields from noisy data. The inferred profiles were found closer to the true profiles when including the hyper-parameters’ uncertainty in the inference formulation.

  15. Efficient Bayesian inference of subsurface flow models using nested sampling and sparse polynomial chaos surrogates

    KAUST Repository

    Elsheikh, Ahmed H.

    2014-02-01

    An efficient Bayesian calibration method based on the nested sampling (NS) algorithm and non-intrusive polynomial chaos method is presented. Nested sampling is a Bayesian sampling algorithm that builds a discrete representation of the posterior distributions by iteratively re-focusing a set of samples to high likelihood regions. NS allows representing the posterior probability density function (PDF) with a smaller number of samples and reduces the curse of dimensionality effects. The main difficulty of the NS algorithm is in the constrained sampling step which is commonly performed using a random walk Markov Chain Monte-Carlo (MCMC) algorithm. In this work, we perform a two-stage sampling using a polynomial chaos response surface to filter out rejected samples in the Markov Chain Monte-Carlo method. The combined use of nested sampling and the two-stage MCMC based on approximate response surfaces provides significant computational gains in terms of the number of simulation runs. The proposed algorithm is applied for calibration and model selection of subsurface flow models. © 2013.

  16. A polynomial chaos approach to the analysis of vehicle dynamics under uncertainty

    Science.gov (United States)

    Kewlani, Gaurav; Crawford, Justin; Iagnemma, Karl

    2012-05-01

    The ability of ground vehicles to quickly and accurately analyse their dynamic response to a given input is critical to their safety and efficient autonomous operation. In field conditions, significant uncertainty is associated with terrain and/or vehicle parameter estimates, and this uncertainty must be considered in the analysis of vehicle motion dynamics. Here, polynomial chaos approaches that explicitly consider parametric uncertainty during modelling of vehicle dynamics are presented. They are shown to be computationally more efficient than the standard Monte Carlo scheme, and experimental results compared with the simulation results performed on ANVEL (a vehicle simulator) indicate that the method can be utilised for efficient and accurate prediction of vehicle motion in realistic scenarios.

  17. A convergence study for SPDEs using combined Polynomial Chaos and Dynamically-Orthogonal schemes

    International Nuclear Information System (INIS)

    Choi, Minseok; Sapsis, Themistoklis P.; Karniadakis, George Em

    2013-01-01

    We study the convergence properties of the recently developed Dynamically Orthogonal (DO) field equations [1] in comparison with the Polynomial Chaos (PC) method. To this end, we consider a series of one-dimensional prototype SPDEs, whose solution can be expressed analytically, and which are associated with both linear (advection equation) and nonlinear (Burgers equation) problems with excitations that lead to unimodal and strongly bi-modal distributions. We also propose a hybrid approach to tackle the singular limit of the DO equations for the case of deterministic initial conditions. The results reveal that the DO method converges exponentially fast with respect to the number of modes (for the problems considered) giving same levels of computational accuracy comparable with the PC method but (in many cases) with substantially smaller computational cost compared to stochastic collocation, especially when the involved parametric space is high-dimensional

  18. Multifidelity, Multidisciplinary Design Under Uncertainty with Non-Intrusive Polynomial Chaos

    Science.gov (United States)

    West, Thomas K., IV; Gumbert, Clyde

    2017-01-01

    The primary objective of this work is to develop an approach for multifidelity uncertainty quantification and to lay the framework for future design under uncertainty efforts. In this study, multifidelity is used to describe both the fidelity of the modeling of the physical systems, as well as the difference in the uncertainty in each of the models. For computational efficiency, a multifidelity surrogate modeling approach based on non-intrusive polynomial chaos using the point-collocation technique is developed for the treatment of both multifidelity modeling and multifidelity uncertainty modeling. Two stochastic model problems are used to demonstrate the developed methodologies: a transonic airfoil model and multidisciplinary aircraft analysis model. The results of both showed the multifidelity modeling approach was able to predict the output uncertainty predicted by the high-fidelity model as a significant reduction in computational cost.

  19. Classification of Normal and Apoptotic Cells from Fluorescence Microscopy Images Using Generalized Polynomial Chaos and Level Set Function.

    Science.gov (United States)

    Du, Yuncheng; Budman, Hector M; Duever, Thomas A

    2016-06-01

    Accurate automated quantitative analysis of living cells based on fluorescence microscopy images can be very useful for fast evaluation of experimental outcomes and cell culture protocols. In this work, an algorithm is developed for fast differentiation of normal and apoptotic viable Chinese hamster ovary (CHO) cells. For effective segmentation of cell images, a stochastic segmentation algorithm is developed by combining a generalized polynomial chaos expansion with a level set function-based segmentation algorithm. This approach provides a probabilistic description of the segmented cellular regions along the boundary, from which it is possible to calculate morphological changes related to apoptosis, i.e., the curvature and length of a cell's boundary. These features are then used as inputs to a support vector machine (SVM) classifier that is trained to distinguish between normal and apoptotic viable states of CHO cell images. The use of morphological features obtained from the stochastic level set segmentation of cell images in combination with the trained SVM classifier is more efficient in terms of differentiation accuracy as compared with the original deterministic level set method.

  20. A Generalized Polynomial Chaos-Based Approach to Analyze the Impacts of Process Deviations on MEMS Beams.

    Science.gov (United States)

    Gao, Lili; Zhou, Zai-Fa; Huang, Qing-An

    2017-11-08

    A microstructure beam is one of the fundamental elements in MEMS devices like cantilever sensors, RF/optical switches, varactors, resonators, etc. It is still difficult to precisely predict the performance of MEMS beams with the current available simulators due to the inevitable process deviations. Feasible numerical methods are required and can be used to improve the yield and profits of the MEMS devices. In this work, process deviations are considered to be stochastic variables, and a newly-developed numerical method, i.e., generalized polynomial chaos (GPC), is applied for the simulation of the MEMS beam. The doubly-clamped polybeam has been utilized to verify the accuracy of GPC, compared with our Monte Carlo (MC) approaches. Performance predictions have been made on the residual stress by achieving its distributions in GaAs Monolithic Microwave Integrated Circuit (MMIC)-based MEMS beams. The results show that errors are within 1% for the results of GPC approximations compared with the MC simulations. Appropriate choices of the 4-order GPC expansions with orthogonal terms have also succeeded in reducing the MC simulation labor. The mean value of the residual stress, concluded from experimental tests, shares an error about 1.1% with that of the 4-order GPC method. It takes a probability around 54.3% for the 4-order GPC approximation to attain the mean test value of the residual stress. The corresponding yield occupies over 90 percent around the mean within the twofold standard deviations.

  1. Study of the influence of the orientation of a 50-Hz magnetic field on fetal exposure using polynomial chaos decomposition.

    Science.gov (United States)

    Liorni, Ilaria; Parazzini, Marta; Fiocchi, Serena; Ravazzani, Paolo

    2015-05-27

    Human exposure modelling is a complex topic, because in a realistic exposure scenario, several parameters (e.g., the source, the orientation of incident fields, the morphology of subjects) vary and influence the dose. Deterministic dosimetry, so far used to analyze human exposure to electromagnetic fields (EMF), is highly time consuming if the previously-mentioned variations are considered. Stochastic dosimetry is an alternative method to build analytical approximations of exposure at a lower computational cost. In this study, it was used to assess the influence of magnetic flux density (B) orientation on fetal exposure at 50 Hz by polynomial chaos (PC). A PC expansion of induced electric field (E) in each fetal tissue at different gestational ages (GA) was built as a function of B orientation. Maximum E in each fetal tissue and at each GA was estimated for different exposure configurations and compared with the limits of the International Commission of Non-Ionising Radiation Protection (ICNIRP) Guidelines 2010. PC theory resulted in an efficient tool to build accurate approximations of E in each fetal tissue. B orientation strongly influenced E, with a variability across tissues from 10% to 43% with respect to the mean value. However, varying B orientation, maximum E in each fetal tissue was below the limits of ICNIRP 2010 at all GAs.

  2. A Generalized Polynomial Chaos-Based Approach to Analyze the Impacts of Process Deviations on MEMS Beams

    Directory of Open Access Journals (Sweden)

    Lili Gao

    2017-11-01

    Full Text Available A microstructure beam is one of the fundamental elements in MEMS devices like cantilever sensors, RF/optical switches, varactors, resonators, etc. It is still difficult to precisely predict the performance of MEMS beams with the current available simulators due to the inevitable process deviations. Feasible numerical methods are required and can be used to improve the yield and profits of the MEMS devices. In this work, process deviations are considered to be stochastic variables, and a newly-developed numerical method, i.e., generalized polynomial chaos (GPC, is applied for the simulation of the MEMS beam. The doubly-clamped polybeam has been utilized to verify the accuracy of GPC, compared with our Monte Carlo (MC approaches. Performance predictions have been made on the residual stress by achieving its distributions in GaAs Monolithic Microwave Integrated Circuit (MMIC-based MEMS beams. The results show that errors are within 1% for the results of GPC approximations compared with the MC simulations. Appropriate choices of the 4-order GPC expansions with orthogonal terms have also succeeded in reducing the MC simulation labor. The mean value of the residual stress, concluded from experimental tests, shares an error about 1.1% with that of the 4-order GPC method. It takes a probability around 54.3% for the 4-order GPC approximation to attain the mean test value of the residual stress. The corresponding yield occupies over 90 percent around the mean within the twofold standard deviations.

  3. Assessing an ensemble Kalman filter inference of Manning’s n coefficient of an idealized tidal inlet against a polynomial chaos-based MCMC

    KAUST Repository

    Siripatana, Adil; Mayo, Talea; Sraj, Ihab; Knio, Omar; Dawson, Clint; Le Maitre, Olivier; Hoteit, Ibrahim

    2017-01-01

    an ensemble Kalman-based data assimilation method for parameter estimation of a coastal ocean model against an MCMC polynomial chaos (PC)-based scheme. We focus on quantifying the uncertainties of a coastal ocean ADvanced CIRCulation (ADCIRC) model

  4. Investigation on imperfection sensitivity of composite cylindrical shells using the nonlinearity reduction technique and the polynomial chaos method

    Science.gov (United States)

    Liang, Ke; Sun, Qin; Liu, Xiaoran

    2018-05-01

    The theoretical buckling load of a perfect cylinder must be reduced by a knock-down factor to account for structural imperfections. The EU project DESICOS proposed a new robust design for imperfection-sensitive composite cylindrical shells using the combination of deterministic and stochastic simulations, however the high computational complexity seriously affects its wider application in aerospace structures design. In this paper, the nonlinearity reduction technique and the polynomial chaos method are implemented into the robust design process, to significantly lower computational costs. The modified Newton-type Koiter-Newton approach which largely reduces the number of degrees of freedom in the nonlinear finite element model, serves as the nonlinear buckling solver to trace the equilibrium paths of geometrically nonlinear structures efficiently. The non-intrusive polynomial chaos method provides the buckling load with an approximate chaos response surface with respect to imperfections and uses buckling solver codes as black boxes. A fast large-sample study can be applied using the approximate chaos response surface to achieve probability characteristics of buckling loads. The performance of the method in terms of reliability, accuracy and computational effort is demonstrated with an unstiffened CFRP cylinder.

  5. Single-site Lennard-Jones models via polynomial chaos surrogates of Monte Carlo molecular simulation

    Energy Technology Data Exchange (ETDEWEB)

    Kadoura, Ahmad, E-mail: ahmad.kadoura@kaust.edu.sa, E-mail: adil.siripatana@kaust.edu.sa, E-mail: shuyu.sun@kaust.edu.sa, E-mail: omar.knio@kaust.edu.sa; Sun, Shuyu, E-mail: ahmad.kadoura@kaust.edu.sa, E-mail: adil.siripatana@kaust.edu.sa, E-mail: shuyu.sun@kaust.edu.sa, E-mail: omar.knio@kaust.edu.sa [Computational Transport Phenomena Laboratory, The Earth Sciences and Engineering Department, The Physical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900 (Saudi Arabia); Siripatana, Adil, E-mail: ahmad.kadoura@kaust.edu.sa, E-mail: adil.siripatana@kaust.edu.sa, E-mail: shuyu.sun@kaust.edu.sa, E-mail: omar.knio@kaust.edu.sa; Hoteit, Ibrahim, E-mail: ibrahim.hoteit@kaust.edu.sa [Earth Fluid Modeling and Predicting Group, The Earth Sciences and Engineering Department, The Physical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900 (Saudi Arabia); Knio, Omar, E-mail: ahmad.kadoura@kaust.edu.sa, E-mail: adil.siripatana@kaust.edu.sa, E-mail: shuyu.sun@kaust.edu.sa, E-mail: omar.knio@kaust.edu.sa [Uncertainty Quantification Center, The Applied Mathematics and Computational Science Department, The Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900 (Saudi Arabia)

    2016-06-07

    In this work, two Polynomial Chaos (PC) surrogates were generated to reproduce Monte Carlo (MC) molecular simulation results of the canonical (single-phase) and the NVT-Gibbs (two-phase) ensembles for a system of normalized structureless Lennard-Jones (LJ) particles. The main advantage of such surrogates, once generated, is the capability of accurately computing the needed thermodynamic quantities in a few seconds, thus efficiently replacing the computationally expensive MC molecular simulations. Benefiting from the tremendous computational time reduction, the PC surrogates were used to conduct large-scale optimization in order to propose single-site LJ models for several simple molecules. Experimental data, a set of supercritical isotherms, and part of the two-phase envelope, of several pure components were used for tuning the LJ parameters (ε, σ). Based on the conducted optimization, excellent fit was obtained for different noble gases (Ar, Kr, and Xe) and other small molecules (CH{sub 4}, N{sub 2}, and CO). On the other hand, due to the simplicity of the LJ model used, dramatic deviations between simulation and experimental data were observed, especially in the two-phase region, for more complex molecules such as CO{sub 2} and C{sub 2} H{sub 6}.

  6. Single-site Lennard-Jones models via polynomial chaos surrogates of Monte Carlo molecular simulation

    KAUST Repository

    Kadoura, Ahmad Salim

    2016-06-01

    In this work, two Polynomial Chaos (PC) surrogates were generated to reproduce Monte Carlo (MC) molecular simulation results of the canonical (single-phase) and the NVT-Gibbs (two-phase) ensembles for a system of normalized structureless Lennard-Jones (LJ) particles. The main advantage of such surrogates, once generated, is the capability of accurately computing the needed thermodynamic quantities in a few seconds, thus efficiently replacing the computationally expensive MC molecular simulations. Benefiting from the tremendous computational time reduction, the PC surrogates were used to conduct large-scale optimization in order to propose single-site LJ models for several simple molecules. Experimental data, a set of supercritical isotherms, and part of the two-phase envelope, of several pure components were used for tuning the LJ parameters (ε, σ). Based on the conducted optimization, excellent fit was obtained for different noble gases (Ar, Kr, and Xe) and other small molecules (CH4, N2, and CO). On the other hand, due to the simplicity of the LJ model used, dramatic deviations between simulation and experimental data were observed, especially in the two-phase region, for more complex molecules such as CO2 and C2 H6.

  7. Multi-model polynomial chaos surrogate dictionary for Bayesian inference in elasticity problems

    KAUST Repository

    Contreras, Andres A.

    2016-09-19

    A method is presented for inferring the presence of an inclusion inside a domain; the proposed approach is suitable to be used in a diagnostic device with low computational power. Specifically, we use the Bayesian framework for the inference of stiff inclusions embedded in a soft matrix, mimicking tumors in soft tissues. We rely on a polynomial chaos (PC) surrogate to accelerate the inference process. The PC surrogate predicts the dependence of the displacements field with the random elastic moduli of the materials, and are computed by means of the stochastic Galerkin (SG) projection method. Moreover, the inclusion\\'s geometry is assumed to be unknown, and this is addressed by using a dictionary consisting of several geometrical models with different configurations. A model selection approach based on the evidence provided by the data (Bayes factors) is used to discriminate among the different geometrical models and select the most suitable one. The idea of using a dictionary of pre-computed geometrical models helps to maintain the computational cost of the inference process very low, as most of the computational burden is carried out off-line for the resolution of the SG problems. Numerical tests are used to validate the methodology, assess its performance, and analyze the robustness to model errors. © 2016 Elsevier Ltd

  8. Asymptotics and Numerics of Polynomials Used in Tricomi and Buchholz Expansions of Kummer functions

    NARCIS (Netherlands)

    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

  9. Polynomial Chaos decomposition applied to stochastic dosimetry: study of the influence of the magnetic field orientation on the pregnant woman exposure at 50 Hz.

    Science.gov (United States)

    Liorni, I; Parazzini, M; Fiocchi, S; Guadagnin, V; Ravazzani, P

    2014-01-01

    Polynomial Chaos (PC) is a decomposition method used to build a meta-model, which approximates the unknown response of a model. In this paper the PC method is applied to the stochastic dosimetry to assess the variability of human exposure due to the change of the orientation of the B-field vector respect to the human body. In detail, the analysis of the pregnant woman exposure at 7 months of gestational age is carried out, to build-up a statistical meta-model of the induced electric field for each fetal tissue and in the fetal whole-body by means of the PC expansion as a function of the B-field orientation, considering a uniform exposure at 50 Hz.

  10. 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

  11. Stochastic Simulation and Forecast of Hydrologic Time Series Based on Probabilistic Chaos Expansion

    Science.gov (United States)

    Li, Z.; Ghaith, M.

    2017-12-01

    Hydrological processes are characterized by many complex features, such as nonlinearity, dynamics and uncertainty. How to quantify and address such complexities and uncertainties has been a challenging task for water engineers and managers for decades. To support robust uncertainty analysis, an innovative approach for the stochastic simulation and forecast of hydrologic time series is developed is this study. Probabilistic Chaos Expansions (PCEs) are established through probabilistic collocation to tackle uncertainties associated with the parameters of traditional hydrological models. The uncertainties are quantified in model outputs as Hermite polynomials with regard to standard normal random variables. Sequentially, multivariate analysis techniques are used to analyze the complex nonlinear relationships between meteorological inputs (e.g., temperature, precipitation, evapotranspiration, etc.) and the coefficients of the Hermite polynomials. With the established relationships between model inputs and PCE coefficients, forecasts of hydrologic time series can be generated and the uncertainties in the future time series can be further tackled. The proposed approach is demonstrated using a case study in China and is compared to a traditional stochastic simulation technique, the Markov-Chain Monte-Carlo (MCMC) method. Results show that the proposed approach can serve as a reliable proxy to complicated hydrological models. It can provide probabilistic forecasting in a more computationally efficient manner, compared to the traditional MCMC method. This work provides technical support for addressing uncertainties associated with hydrological modeling and for enhancing the reliability of hydrological modeling results. Applications of the developed approach can be extended to many other complicated geophysical and environmental modeling systems to support the associated uncertainty quantification and risk analysis.

  12. Recurrences and explicit formulae for the expansion and connection coefficients in series of Bessel polynomials

    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

  13. 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

  14. SU-F-BRCD-08: Uncertainty Quantification by Generalized Polynomial Chaos for MR-Guided Laser Induced Thermal Therapy.

    Science.gov (United States)

    Fahrenholtz, S; Fuentes, D; Stafford, R; Hazle, J

    2012-06-01

    Magnetic resonance-guided laser induced thermal therapy (MRgLITT) is a minimally invasive thermal treatment for metastatic brain lesions, offering an alternative to conventional surgery. The purpose of this investigation is to incorporate uncertainty quantification (UQ) into the biothermal parameters used in the Pennes bioheat transfer equation (BHT), in order to account for imprecise values available in the literature. The BHT is a partial differential equation commonly used in thermal therapy models. MRgLITT was performed on an in vivo canine brain in a previous investigation. The canine MRgLITT was modeled using the BHT. The BHT has four parameters'" microperfusion, conductivity, optical absorption, and optical scattering'"which lack precise measurements in living brain and tumor. The uncertainties in the parameters were expressed as probability distribution functions derived from literature values. A univariate generalized polynomial chaos (gPC) expansion was applied to the stochastic BHT. The gPC approach to UQ provides a novel methodology to calculate spatio-temporal voxel-wise means and variances of the predicted temperature distributions. The performance of the gPC predictions were evaluated retrospectively by comparison with MR thermal imaging (MRTI) acquired during the MRgLITT procedure in the canine model. The comparison was evaluated with root mean square difference (RMSD), isotherm contours, spatial profiles, and z-tests. The peak RMSD was ∼1.5 standard deviations for microperfusion, conductivity, and optical absorption, while optical scattering was ∼2.2 standard deviations. Isotherm contours and spatial profiles of the simulation's predicted mean plus or minus two standard deviations demonstrate the MRTI temperature was enclosed by the model's isotherm confidence interval predictions. An a = 0.01 z-test demonstrates agreement. The application of gPC for UQ is a potentially powerful means for providing predictive simulations despite poorly known

  15. Method for calculating anisotropic neutron transport using scattering kernel without polynomial expansion

    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)

  16. Two-energy group solution of the diffusion equation by the multidimensional nodal polynomial expansion method

    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

  17. FORTRAN programs for transient eddy current calculations using a perturbation-polynomial expansion technique

    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

  18. Polynomial chaos methods for hyperbolic partial differential equations numerical techniques for fluid dynamics problems in the presence of uncertainties

    CERN Document Server

    Pettersson, Mass Per; Nordström, Jan

    2015-01-01

    This monograph presents computational techniques and numerical analysis to study conservation laws under uncertainty using the stochastic Galerkin formulation. With the continual growth of computer power, these methods are becoming increasingly popular as an alternative to more classical sampling-based techniques. The approach described in the text takes advantage of stochastic Galerkin projections applied to the original conservation laws to produce a large system of modified partial differential equations, the solutions to which directly provide a full statistical characterization of the effect of uncertainties. Polynomial Chaos Methods of Hyperbolic Partial Differential Equations focuses on the analysis of stochastic Galerkin systems obtained for linear and non-linear convection-diffusion equations and for a systems of conservation laws; a detailed well-posedness and accuracy analysis is presented to enable the design of robust and stable numerical methods. The exposition is restricted to one spatial dime...

  19. Lattice Boltzmann method for bosons and fermions and the fourth-order Hermite polynomial expansion.

    Science.gov (United States)

    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.

  20. Use of orthonormal polynomial expansion method to the description of the energy spectra of biological liquids

    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.

  1. Efficient linear precoding for massive MIMO systems using truncated polynomial expansion

    KAUST Repository

    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.

  2. Linear precoding based on polynomial expansion: reducing complexity in massive MIMO

    KAUST Repository

    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.

  3. 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

  4. Assessing an ensemble Kalman filter inference of Manning’s n coefficient of an idealized tidal inlet against a polynomial chaos-based MCMC

    KAUST Repository

    Siripatana, Adil

    2017-06-08

    Bayesian estimation/inversion is commonly used to quantify and reduce modeling uncertainties in coastal ocean model, especially in the framework of parameter estimation. Based on Bayes rule, the posterior probability distribution function (pdf) of the estimated quantities is obtained conditioned on available data. It can be computed either directly, using a Markov chain Monte Carlo (MCMC) approach, or by sequentially processing the data following a data assimilation approach, which is heavily exploited in large dimensional state estimation problems. The advantage of data assimilation schemes over MCMC-type methods arises from the ability to algorithmically accommodate a large number of uncertain quantities without significant increase in the computational requirements. However, only approximate estimates are generally obtained by this approach due to the restricted Gaussian prior and noise assumptions that are generally imposed in these methods. This contribution aims at evaluating the effectiveness of utilizing an ensemble Kalman-based data assimilation method for parameter estimation of a coastal ocean model against an MCMC polynomial chaos (PC)-based scheme. We focus on quantifying the uncertainties of a coastal ocean ADvanced CIRCulation (ADCIRC) model with respect to the Manning’s n coefficients. Based on a realistic framework of observation system simulation experiments (OSSEs), we apply an ensemble Kalman filter and the MCMC method employing a surrogate of ADCIRC constructed by a non-intrusive PC expansion for evaluating the likelihood, and test both approaches under identical scenarios. We study the sensitivity of the estimated posteriors with respect to the parameters of the inference methods, including ensemble size, inflation factor, and PC order. A full analysis of both methods, in the context of coastal ocean model, suggests that an ensemble Kalman filter with appropriate ensemble size and well-tuned inflation provides reliable mean estimates and

  5. Assessing an ensemble Kalman filter inference of Manning's n coefficient of an idealized tidal inlet against a polynomial chaos-based MCMC

    Science.gov (United States)

    Siripatana, Adil; Mayo, Talea; Sraj, Ihab; Knio, Omar; Dawson, Clint; Le Maitre, Olivier; Hoteit, Ibrahim

    2017-08-01

    Bayesian estimation/inversion is commonly used to quantify and reduce modeling uncertainties in coastal ocean model, especially in the framework of parameter estimation. Based on Bayes rule, the posterior probability distribution function (pdf) of the estimated quantities is obtained conditioned on available data. It can be computed either directly, using a Markov chain Monte Carlo (MCMC) approach, or by sequentially processing the data following a data assimilation approach, which is heavily exploited in large dimensional state estimation problems. The advantage of data assimilation schemes over MCMC-type methods arises from the ability to algorithmically accommodate a large number of uncertain quantities without significant increase in the computational requirements. However, only approximate estimates are generally obtained by this approach due to the restricted Gaussian prior and noise assumptions that are generally imposed in these methods. This contribution aims at evaluating the effectiveness of utilizing an ensemble Kalman-based data assimilation method for parameter estimation of a coastal ocean model against an MCMC polynomial chaos (PC)-based scheme. We focus on quantifying the uncertainties of a coastal ocean ADvanced CIRCulation (ADCIRC) model with respect to the Manning's n coefficients. Based on a realistic framework of observation system simulation experiments (OSSEs), we apply an ensemble Kalman filter and the MCMC method employing a surrogate of ADCIRC constructed by a non-intrusive PC expansion for evaluating the likelihood, and test both approaches under identical scenarios. We study the sensitivity of the estimated posteriors with respect to the parameters of the inference methods, including ensemble size, inflation factor, and PC order. A full analysis of both methods, in the context of coastal ocean model, suggests that an ensemble Kalman filter with appropriate ensemble size and well-tuned inflation provides reliable mean estimates and

  6. 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

  7. Uncertainty quantification for criticality problems using non-intrusive and adaptive Polynomial Chaos techniques

    International Nuclear Information System (INIS)

    Gilli, L.; Lathouwers, D.; Kloosterman, J.L.; Hagen, T.H.J.J. van der; Koning, A.J.; Rochman, D.

    2013-01-01

    Highlights: ► Non-intrusive spectral techniques are applied to perform UQ of criticality problems. ► A new adaptive algorithm based on the definition of sparse grid is derived. ► The method is applied to two reference criticality problems. - Abstract: In this paper we present the implementation and the application of non-intrusive spectral techniques for uncertainty analysis of criticality problems. Spectral techniques can be used to reconstruct stochastic quantities of interest by means of a Fourier-like expansion. Their application to uncertainty propagation problems can be performed in a non-intrusive fashion by evaluating a set of projection integrals that are used to reconstruct the spectral expansion. This can be done either by using standard Monte Carlo integration approaches or by adopting numerical quadrature rules. We present the derivation of a new adaptive quadrature algorithm, based on the definition of a sparse grid, which can be used to reduce the computational cost associated with non-intrusive spectral techniques. This new adaptive algorithm and the Monte Carlo integration alternative are then applied to two reference problems. First, a stochastic multigroup diffusion problem is introduced by considering the microscopic cross-sections of the system to be random quantities. Then a criticality benchmark is defined for which a set of resonance parameters in the resolved region are assumed to be stochastic

  8. 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

  9. A Proposed Stochastic Finite Difference Approach Based on Homogenous Chaos Expansion

    Directory of Open Access Journals (Sweden)

    O. H. Galal

    2013-01-01

    Full Text Available This paper proposes a stochastic finite difference approach, based on homogenous chaos expansion (SFDHC. The said approach can handle time dependent nonlinear as well as linear systems with deterministic or stochastic initial and boundary conditions. In this approach, included stochastic parameters are modeled as second-order stochastic processes and are expanded using Karhunen-Loève expansion, while the response function is approximated using homogenous chaos expansion. Galerkin projection is used in converting the original stochastic partial differential equation (PDE into a set of coupled deterministic partial differential equations and then solved using finite difference method. Two well-known equations were used for efficiency validation of the method proposed. First one being the linear diffusion equation with stochastic parameter and the second is the nonlinear Burger's equation with stochastic parameter and stochastic initial and boundary conditions. In both of these examples, the probability distribution function of the response manifested close conformity to the results obtained from Monte Carlo simulation with optimized computational cost.

  10. Polynomial expansion of the precoder for power minimization in large-scale MIMO systems

    KAUST Repository

    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.

  11. Expansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind

    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

  12. Analytical and numerical construction of vertical periodic orbits about triangular libration points based on polynomial expansion relations among directions

    Science.gov (United States)

    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.

  13. Linear precoding based on polynomial expansion: reducing complexity in massive MIMO

    KAUST Repository

    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.

  14. 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.

  15. Polynomial expansion methodology for microscopic cross sections to use in spatial burnup calculations

    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

  16. Efficient algorithms for construction of recurrence relations for the expansion and connection coefficients in series of Al-Salam-Carlitz I polynomials

    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

  17. Defining chaos.

    Science.gov (United States)

    Hunt, Brian R; Ott, Edward

    2015-09-01

    In this paper, we propose, discuss, and illustrate a computationally feasible definition of chaos which can be applied very generally to situations that are commonly encountered, including attractors, repellers, and non-periodically forced systems. This definition is based on an entropy-like quantity, which we call "expansion entropy," and we define chaos as occurring when this quantity is positive. We relate and compare expansion entropy to the well-known concept of topological entropy to which it is equivalent under appropriate conditions. We also present example illustrations, discuss computational implementations, and point out issues arising from attempts at giving definitions of chaos that are not entropy-based.

  18. 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

  19. Comparison of permutationally invariant polynomials, neural networks, and Gaussian approximation potentials in representing water interactions through many-body expansions

    Science.gov (United States)

    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.

  20. CHAOS EXPANSION FOR MULTIFRACTIONAL L ´EVY PROCESSES%多分数L´evy过程的混沌展开

    Institute of Scientific and Technical Information of China (English)

    吕学斌; 马树建

    2016-01-01

    In this paper, we study the chaos expansion for multifractional L´evy processes. By using the white noise analysis, we give the chaos expansion of multifractional L´evy Processes. Moreover, we derive their L´evy-Hermite transforms and Malliavin derivatives.%本文研究了多分数L´evy过程的混沌展开。利用白噪声分析方法,给出了多分数L´evy过程的混沌展开。进一步地,给出其L´evy-Hermite变换和Malliavin导数。

  1. Exposure assessment of one-year-old child to 3G tablet in uplink mode and to 3G femtocell in downlink mode using polynomial chaos decomposition

    International Nuclear Information System (INIS)

    Liorni, I; Parazzini, M; Ravazzani, P; Varsier, N; Hadjem, A; Wiart, J

    2016-01-01

    So far, the assessment of the exposure of children, in the ages 0–2 years old, to relatively new radio-frequency (RF) technologies, such as tablets and femtocells, remains an open issue. This study aims to analyse the exposure of a one year-old child to these two sources, tablets and femtocells, operating in uplink (tablet) and downlink (femtocell) modes, respectively. In detail, a realistic model of an infant has been used to model separately the exposures due to (i) a 3G tablet emitting at the frequency of 1940 MHz (uplink mode) placed close to the body and (ii) a 3G femtocell emitting at 2100 MHz (downlink mode) placed at a distance of at least 1 m from the infant body. For both RF sources, the input power was set to 250 mW. The variability of the exposure due to the variation of the position of the RF sources with respect to the infant body has been studied by stochastic dosimetry, based on polynomial chaos to build surrogate models of both whole-body and tissue specific absorption rate (SAR), which makes it easy and quick to investigate the exposure in a full range of possible positions of the sources. The major outcomes of the study are: (1) the maximum values of the whole-body SAR (WB SAR) have been found to be 9.5 mW kg −1 in uplink mode and 65 μW kg −1 in downlink mode, i.e. within the limits of the ICNIRP 1998 Guidelines; (2) in both uplink and downlink mode the highest SAR values were approximately found in the same tissues, i.e. in the skin, eye and penis for the whole-tissue SAR and in the bone, skin and muscle for the peak SAR; (3) the change in the position of both the 3G tablet and the 3G femtocell significantly influences the infant exposure. (paper)

  2. Exposure assessment of one-year-old child to 3G tablet in uplink mode and to 3G femtocell in downlink mode using polynomial chaos decomposition

    Science.gov (United States)

    Liorni, I.; Parazzini, M.; Varsier, N.; Hadjem, A.; Ravazzani, P.; Wiart, J.

    2016-04-01

    So far, the assessment of the exposure of children, in the ages 0-2 years old, to relatively new radio-frequency (RF) technologies, such as tablets and femtocells, remains an open issue. This study aims to analyse the exposure of a one year-old child to these two sources, tablets and femtocells, operating in uplink (tablet) and downlink (femtocell) modes, respectively. In detail, a realistic model of an infant has been used to model separately the exposures due to (i) a 3G tablet emitting at the frequency of 1940 MHz (uplink mode) placed close to the body and (ii) a 3G femtocell emitting at 2100 MHz (downlink mode) placed at a distance of at least 1 m from the infant body. For both RF sources, the input power was set to 250 mW. The variability of the exposure due to the variation of the position of the RF sources with respect to the infant body has been studied by stochastic dosimetry, based on polynomial chaos to build surrogate models of both whole-body and tissue specific absorption rate (SAR), which makes it easy and quick to investigate the exposure in a full range of possible positions of the sources. The major outcomes of the study are: (1) the maximum values of the whole-body SAR (WB SAR) have been found to be 9.5 mW kg-1 in uplink mode and 65 μW kg-1 in downlink mode, i.e. within the limits of the ICNIRP 1998 Guidelines; (2) in both uplink and downlink mode the highest SAR values were approximately found in the same tissues, i.e. in the skin, eye and penis for the whole-tissue SAR and in the bone, skin and muscle for the peak SAR; (3) the change in the position of both the 3G tablet and the 3G femtocell significantly influences the infant exposure.

  3. Phase shift analysis of hyperon-nucleon elastic scattering using optimized polynomial expansion techniques

    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)

  4. An optimization method for the distance between exits of buildings considering uncertainties based on arbitrary polynomial chaos expansion

    NARCIS (Netherlands)

    Xie, Qimiao; Wang, Jinhui; Lu, Shouxiang; Hensen, J.L.M.

    2016-01-01

    The distance between exits is an important design parameter in fire safety design of buildings. In order to find the optimal distance between exits under uncertainties with a low computational cost, the surrogate model (i.e. approximation model) of evacuation time is constructed by the arbitrary

  5. Orthogonal polynomials

    CERN Document Server

    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

  6. Efficient computation of Laguerre polynomials

    NARCIS (Netherlands)

    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

  7. 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

  8. Large degree asymptotics of generalized Bessel polynomials

    NARCIS (Netherlands)

    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

  9. Polynomiography and Chaos

    Science.gov (United States)

    Kalantari, Bahman

    Polynomiography is the algorithmic visualization of iterative systems for computing roots of a complex polynomial. It is well known that iterations of a rational function in the complex plane result in chaotic behavior near its Julia set. In one scheme of computing polynomiography for a given polynomial p(z), we select an individual member from the Basic Family, an infinite fundamental family of rational iteration functions that in particular include Newton's. Polynomiography is an excellent means for observing, understanding, and comparing chaotic behavior for variety of iterative systems. Other iterative schemes in polynomiography are possible and result in chaotic behavior of different kinds. In another scheme, the Basic Family is collectively applied to p(z) and the iterates for any seed in the Voronoi cell of a root converge to that root. Polynomiography reveals chaotic behavior of another kind near the boundary of the Voronoi diagram of the roots. We also describe a novel Newton-Ellipsoid iterative system with its own chaos and exhibit images demonstrating polynomiographies of chaotic behavior of different kinds. Finally, we consider chaos for the more general case of polynomiography of complex analytic functions. On the one hand polynomiography is a powerful medium capable of demonstrating chaos in different forms, it is educationally instructive to students and researchers, also it gives rise to numerous research problems. On the other hand, it is a medium resulting in images with enormous aesthetic appeal to general audiences.

  10. Polynomial Chaos Surrogates for Bayesian Inference

    KAUST Repository

    Le Maitre, Olivier

    2016-01-01

    , 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

  11. 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

  12. Quantum chaos

    International Nuclear Information System (INIS)

    Steiner, F.

    1994-01-01

    A short historical overview is given on the development of our knowledge of complex dynamical systems with special emphasis on ergodicity and chaos, and on the semiclassical quantization of integrable and chaotic systems. The general trace formular is discussed as a sound mathematical basis for the semiclassical quantization of chaos. Two conjectures are presented on the basis of which it is argued that there are unique fluctuation properties in quantum mechanics which are universal and, in a well defined sense, maximally random if the corresponding classical system is strongly chaotic. These properties constitute the quantum mechanical analogue of the phenomenon of chaos in classical mechanics. Thus quantum chaos has been found. (orig.)

  13. Colored chaos

    International Nuclear Information System (INIS)

    Mueller, B.

    1997-01-01

    The report contains viewgraphs on the following: ergodicity and chaos; Hamiltonian dynamics; metric properties; Lyapunov exponents; KS entropy; dynamical realization; lattice formulation; and numerical results

  14. Colored chaos

    Energy Technology Data Exchange (ETDEWEB)

    Mueller, B.

    1997-09-22

    The report contains viewgraphs on the following: ergodicity and chaos; Hamiltonian dynamics; metric properties; Lyapunov exponents; KS entropy; dynamical realization; lattice formulation; and numerical results.

  15. Path and semimartingale properties of chaos processes

    DEFF Research Database (Denmark)

    Basse-O'Connor, Andreas; Graversen, Svend-Erik

    2010-01-01

    The present paper characterizes various properties of chaos processes which in particular include processes where all time variables admit a Wiener chaos expansion of a fixed finite order. The main focus is on the semimartingale property, p-variation and continuity. The general results obtained...

  16. Quantum chaos

    International Nuclear Information System (INIS)

    Cejnar, P.

    2007-01-01

    Chaos is a name given in physics to a branch which, within classical mechanics, studies the consequences of sensitive dependences of the behavior of physical systems on the starting conditions, i.e., the 'butterfly wing effect'. However, how to describe chaotic behavior in the world of quantum particles? It appears that quantum mechanics does not admit the sensitive dependence on the starting conditions, and moreover, predicts a substantial suppression of chaos also at the macroscopic level. Still, the quantum properties of systems that are chaotic in terms of classical mechanics differ basically from the properties of classically arranged systems. This topic is studied by a field of physics referred to as quantum chaos. (author)

  17. Subharmonic Oscillations and Chaos in Dynamic Atomic Force Microscopy

    Science.gov (United States)

    Cantrell, John H.; Cantrell, Sean A.

    2015-01-01

    The increasing use of dynamic atomic force microscopy (d-AFM) for nanoscale materials characterization calls for a deeper understanding of the cantilever dynamics influencing scan stability, predictability, and image quality. Model development is critical to such understanding. Renormalization of the equations governing d- AFM provides a simple interpretation of cantilever dynamics as a single spring and mass system with frequency dependent cantilever stiffness and damping parameters. The renormalized model is sufficiently robust to predict the experimentally observed splitting of the free-space cantilever resonance into multiple resonances upon cantilever-sample contact. Central to the model is the representation of the cantilever sample interaction force as a polynomial expansion with coefficients F(sub ij) (i,j = 0, 1, 2) that account for the effective interaction stiffness parameter, the cantilever-to-sample energy transfer, and the amplitude of cantilever oscillation. Application of the Melnikov method to the model equation is shown to predict a homoclinic bifurcation of the Smale horseshoe type leading to a cascade of period doublings with increasing drive displacement amplitude culminating in chaos and loss of image quality. The threshold value of the drive displacement amplitude necessary to initiate subharmonic generation depends on the acoustic drive frequency, the effective damping coefficient, and the nonlinearity of the cantilever-sample interaction force. For parameter values leading to displacement amplitudes below threshold for homoclinic bifurcation other bifurcation scenarios can occur, some of which lead to chaos.

  18. 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)

  19. Study of ytterbium doping effects on structural, mechanical and opto-thermal properties of sprayed ZnO thin films using the Boubaker Polynomials Expansion Scheme (BPES)

    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.

  20. 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.

  1. Polynomial Chaos–Based Bayesian Inference of K-Profile Parameterization in a General Circulation Model of the Tropical Pacific

    KAUST Repository

    Sraj, Ihab; Zedler, Sarah E.; Knio, Omar; Jackson, Charles S.; Hoteit, Ibrahim

    2016-01-01

    The authors present a polynomial chaos (PC)-based Bayesian inference method for quantifying the uncertainties of the K-profile parameterization (KPP) within the MIT general circulation model (MITgcm) of the tropical Pacific. The inference

  2. 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....

  3. Better polynomials for GNFS

    OpenAIRE

    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...

  4. Iani Chaos

    Science.gov (United States)

    2005-01-01

    [figure removed for brevity, see original site] Context image for PIA03200 Iani Chaos This VIS image of Iani Chaos shows the layered deposit that occurs on the floor. It appears that the layers were deposited after the chaos was formed. Image information: VIS instrument. Latitude 2.3S, Longitude 342.3E. 17 meter/pixel resolution. Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time. NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS) was developed by Arizona State University, Tempe, in collaboration with Raytheon Santa Barbara Remote Sensing. The THEMIS investigation is led by Dr. Philip Christensen at Arizona State University. Lockheed Martin Astronautics, Denver, is the prime contractor for the Odyssey project, and developed and built the orbiter. Mission operations are conducted jointly from Lockheed Martin and from JPL, a division of the California Institute of Technology in Pasadena.

  5. 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...

  6. SnO{sub 2} thin films morphological and optical properties in terms of the Boubaker Polynomials Expansion Scheme BPES-related Opto-Thermal Expansivity {psi}{sub AB}

    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}.

  7. Quantum Chaos

    Energy Technology Data Exchange (ETDEWEB)

    Bohigas, Oriol [Laboratoire de Physique Theorique et Modeles Statistiques, Orsay (France)

    2005-04-18

    Are there quantum signatures, for instance in the spectral properties, of the underlying regular or chaotic nature of the corresponding classical motion? Are there universality classes? Within this framework the merging of two at first sight seemingly disconnected fields, namely random matrix theories (RMT) and quantum chaos (QC), is briefly described. Periodic orbit theory (POT) plays a prominent role. Emphasis is given to compound nucleus resonances and binding energies, whose shell effects are examined from this perspective. Several aspects are illustrated with Riemann's {zeta}-function, which has become a testing ground for RMT, QC, POT, and their relationship.

  8. Quantum Chaos

    International Nuclear Information System (INIS)

    Bohigas, Oriol

    2005-01-01

    Are there quantum signatures, for instance in the spectral properties, of the underlying regular or chaotic nature of the corresponding classical motion? Are there universality classes? Within this framework the merging of two at first sight seemingly disconnected fields, namely random matrix theories (RMT) and quantum chaos (QC), is briefly described. Periodic orbit theory (POT) plays a prominent role. Emphasis is given to compound nucleus resonances and binding energies, whose shell effects are examined from this perspective. Several aspects are illustrated with Riemann's ζ-function, which has become a testing ground for RMT, QC, POT, and their relationship

  9. Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

    International Nuclear Information System (INIS)

    Tang, Kunkun; Congedo, Pietro M.; Abgrall, Rémi

    2016-01-01

    The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

  10. Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

    Energy Technology Data Exchange (ETDEWEB)

    Tang, Kunkun, E-mail: ktg@illinois.edu [The Center for Exascale Simulation of Plasma-Coupled Combustion (XPACC), University of Illinois at Urbana–Champaign, 1308 W Main St, Urbana, IL 61801 (United States); Inria Bordeaux – Sud-Ouest, Team Cardamom, 200 avenue de la Vieille Tour, 33405 Talence (France); Congedo, Pietro M. [Inria Bordeaux – Sud-Ouest, Team Cardamom, 200 avenue de la Vieille Tour, 33405 Talence (France); Abgrall, Rémi [Institut für Mathematik, Universität Zürich, Winterthurerstrasse 190, CH-8057 Zürich (Switzerland)

    2016-06-01

    The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

  11. 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...

  12. Aureum Chaos

    Science.gov (United States)

    2003-01-01

    [figure removed for brevity, see original site] Released 11 November 2003Aureum Chaos is a large crater that was filled with sediment after its formation. After the infilling of sediment, something occurred that caused the sediment to be broken up into large, slumped blocks and smaller knobs. Currently, it is believed that the blocks and knobs form when material is removed from the subsurface, creating void space. Subsurface ice was probably heated, and the water burst out to the surface, maybe forming a temporary lake. Other areas of chaos terrain have large outflow channels that emanate from them, indicating that a tremendous amount of water was released.Image information: VIS instrument. Latitude -3.2, Longitude 331 East (29 West). 19 meter/pixel resolution.Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time. NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS) was developed by Arizona State University, Tempe, in collaboration with Raytheon Santa Barbara Remote Sensing. The THEMIS investigation is led by Dr. Philip Christensen at Arizona State University. Lockheed Martin Astronautics, Denver, is the prime contractor for the Odyssey project, and developed and built the orbiter. Mission operations are conducted jointly from Lockheed Martin and from JPL, a division of the California Institute of Technology in Pasadena.

  13. Arsinoes Chaos

    Science.gov (United States)

    2003-01-01

    [figure removed for brevity, see original site] At the easternmost end of Valles Marineris, a rugged, jumbled terrain known as chaos displays a stratigraphy that could be described as precarious. Perched on top of the jumbled blocks is another layer of sedimentary material that is in the process of being eroded off the top. This material is etched by the wind into yardangs before it ultimately is stripped off to reveal the existing chaos.Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time.NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS) was developed by Arizona State University, Tempe, in collaboration with Raytheon Santa Barbara Remote Sensing. The THEMIS investigation is led by Dr. Philip Christensen at Arizona State University. Lockheed Martin Astronautics, Denver, is the prime contractor for the Odyssey project, and developed and built the orbiter. Mission operations are conducted jointly from Lockheed Martin and from JPL, a division of the California Institute of Technology in Pasadena.Image information: VIS instrument. Latitude -7.8, Longitude 19.1 East (340.9 West). 19 meter/pixel resolution.

  14. 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.

  15. Quantum signatures of chaos or quantum chaos?

    Energy Technology Data Exchange (ETDEWEB)

    Bunakov, V. E., E-mail: bunakov@VB13190.spb.edu [St. Petersburg State University (Russian Federation)

    2016-11-15

    A critical analysis of the present-day concept of chaos in quantum systems as nothing but a “quantum signature” of chaos in classical mechanics is given. In contrast to the existing semi-intuitive guesses, a definition of classical and quantum chaos is proposed on the basis of the Liouville–Arnold theorem: a quantum chaotic system featuring N degrees of freedom should have M < N independent first integrals of motion (good quantum numbers) specified by the symmetry of the Hamiltonian of the system. Quantitative measures of quantum chaos that, in the classical limit, go over to the Lyapunov exponent and the classical stability parameter are proposed. The proposed criteria of quantum chaos are applied to solving standard problems of modern dynamical chaos theory.

  16. Quantum signatures of chaos or quantum chaos?

    International Nuclear Information System (INIS)

    Bunakov, V. E.

    2016-01-01

    A critical analysis of the present-day concept of chaos in quantum systems as nothing but a “quantum signature” of chaos in classical mechanics is given. In contrast to the existing semi-intuitive guesses, a definition of classical and quantum chaos is proposed on the basis of the Liouville–Arnold theorem: a quantum chaotic system featuring N degrees of freedom should have M < N independent first integrals of motion (good quantum numbers) specified by the symmetry of the Hamiltonian of the system. Quantitative measures of quantum chaos that, in the classical limit, go over to the Lyapunov exponent and the classical stability parameter are proposed. The proposed criteria of quantum chaos are applied to solving standard problems of modern dynamical chaos theory.

  17. 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

  18. Generalizations of orthogonal polynomials

    Science.gov (United States)

    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.

  19. Hydaspis Chaos

    Science.gov (United States)

    2002-01-01

    [figure removed for brevity, see original site] Collapsed terrain in Hydapsis Chaos.This is the source terrain for several outflow channels. Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time.NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS) was developed by Arizona State University, Tempe, in collaboration with Raytheon Santa Barbara Remote Sensing. The THEMIS investigation is led by Dr. Philip Christensen at Arizona State University. Lockheed Martin Astronautics, Denver, is the prime contractor for the Odyssey project, and developed and built the orbiter. Mission operations are conducted jointly from Lockheed Martin and from JPL, a division of the California Institute of Technology in Pasadena.VIS Instrument. Latitude 3.2, Longitude 333.2 East. 19 meter/pixel resolution.

  20. Embrace the Chaos

    Science.gov (United States)

    Huwe, Terence K.

    2009-01-01

    "Embracing the chaos" is an ongoing challenge for librarians. Embracing the chaos means librarians must have a plan for responding to the flood of new products, widgets, web tools, and gizmos that students use daily. In this article, the author argues that library instruction and access services have been grappling with that chaos with…

  1. 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 ...

  2. 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.

  3. On Symmetric Polynomials

    OpenAIRE

    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...

  4. Synchronization of generalized Henon map using polynomial controller

    International Nuclear Information System (INIS)

    Lam, H.K.

    2010-01-01

    This Letter presents the chaos synchronization of two discrete-time generalized Henon map, namely the drive and response systems. A polynomial controller is proposed to drive the system states of the response system to follow those of the drive system. The system stability of the error system formed by the drive and response systems and the synthesis of the polynomial controller are investigated using the sum-of-squares (SOS) technique. Based on the Lyapunov stability theory, stability conditions in terms of SOS are derived to guarantee the system stability and facilitate the controller synthesis. By satisfying the SOS-based stability conditions, chaotic synchronization is achieved. The solution of the SOS-based stability conditions can be found numerically using the third-party Matlab toolbox SOSTOOLS. A simulation example is given to illustrate the merits of the proposed polynomial control approach.

  5. 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...

  6. Colored Chaos

    Science.gov (United States)

    2004-01-01

    [figure removed for brevity, see original site] Released 7 May 2004 This daytime visible color image was collected on May 30, 2002 during the Southern Fall season in Atlantis Chaos. The THEMIS VIS camera is capable of capturing color images of the martian surface using its five different color filters. In this mode of operation, the spatial resolution and coverage of the image must be reduced to accommodate the additional data volume produced from the use of multiple filters. To make a color image, three of the five filter images (each in grayscale) are selected. Each is contrast enhanced and then converted to a red, green, or blue intensity image. These three images are then combined to produce a full color, single image. Because the THEMIS color filters don't span the full range of colors seen by the human eye, a color THEMIS image does not represent true color. Also, because each single-filter image is contrast enhanced before inclusion in the three-color image, the apparent color variation of the scene is exaggerated. Nevertheless, the color variation that does appear is representative of some change in color, however subtle, in the actual scene. Note that the long edges of THEMIS color images typically contain color artifacts that do not represent surface variation. Image information: VIS instrument. Latitude -34.5, Longitude 183.6 East (176.4 West). 38 meter/pixel resolution. Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time. NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D

  7. Auream Chaos

    Science.gov (United States)

    2005-01-01

    [figure removed for brevity, see original site] The THEMIS VIS camera is capable of capturing color images of the Martian surface using five different color filters. In this mode of operation, the spatial resolution and coverage of the image must be reduced to accommodate the additional data volume produced from using multiple filters. To make a color image, three of the five filter images (each in grayscale) are selected. Each is contrast enhanced and then converted to a red, green, or blue intensity image. These three images are then combined to produce a full color, single image. Because the THEMIS color filters don't span the full range of colors seen by the human eye, a color THEMIS image does not represent true color. Also, because each single-filter image is contrast enhanced before inclusion in the three-color image, the apparent color variation of the scene is exaggerated. Nevertheless, the color variation that does appear is representative of some change in color, however subtle, in the actual scene. Note that the long edges of THEMIS color images typically contain color artifacts that do not represent surface variation. This false color image was collected during Southern Fall and shows part of the Aureum Chaos. Image information: VIS instrument. Latitude -3.6, Longitude 332.9 East (27.1 West). 35 meter/pixel resolution. Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time. NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS

  8. 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

  9. 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

  10. Additive and polynomial representations

    CERN Document Server

    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

  11. Chaos theory in politics

    CERN Document Server

    Erçetin, Şefika; Tekin, Ali

    2014-01-01

    The present work investigates global politics and political implications of social science and management with the aid of the latest complexity and chaos theories. Until now, deterministic chaos and nonlinear analysis have not been a focal point in this area of research. This book remedies this deficiency by utilizing these methods in the analysis of the subject matter. The authors provide the reader a detailed analysis on politics and its associated applications with the help of chaos theory, in a single edited volume.

  12. The Chaos of Katrina

    National Research Council Canada - National Science Library

    Morris, Jr, Gerald W

    2007-01-01

    .... The study investigates whether chaos theory, part of complexity science, can extract information from Katrina contracting data to help managers make better logistics decisions during disaster relief operations...

  13. Multivariate Local Polynomial Regression with Application to Shenzhen Component Index

    Directory of Open Access Journals (Sweden)

    Liyun Su

    2011-01-01

    Full Text Available This study attempts to characterize and predict stock index series in Shenzhen stock market using the concepts of multivariate local polynomial regression. Based on nonlinearity and chaos of the stock index time series, multivariate local polynomial prediction methods and univariate local polynomial prediction method, all of which use the concept of phase space reconstruction according to Takens' Theorem, are considered. To fit the stock index series, the single series changes into bivariate series. To evaluate the results, the multivariate predictor for bivariate time series based on multivariate local polynomial model is compared with univariate predictor with the same Shenzhen stock index data. The numerical results obtained by Shenzhen component index show that the prediction mean squared error of the multivariate predictor is much smaller than the univariate one and is much better than the existed three methods. Even if the last half of the training data are used in the multivariate predictor, the prediction mean squared error is smaller than the univariate predictor. Multivariate local polynomial prediction model for nonsingle time series is a useful tool for stock market price prediction.

  14. 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)

  15. 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....

  16. Stochastic chaos in a Duffing oscillator and its control

    International Nuclear Information System (INIS)

    Wu Cunli; Lei Youming; Fang Tong

    2006-01-01

    Stochastic chaos discussed here means a kind of chaotic responses in a Duffing oscillator with bounded random parameters under harmonic excitations. A system with random parameters is usually called a stochastic system. The modifier 'stochastic' here implies dependent on some random parameter. As the system itself is stochastic, so is the response, even under harmonic excitations alone. In this paper stochastic chaos and its control are verified by the top Lyapunov exponent of the system. A non-feedback control strategy is adopted here by adding an adjustable noisy phase to the harmonic excitation, so that the control can be realized by adjusting the noise level. It is found that by this control strategy stochastic chaos can be tamed down to the small neighborhood of a periodic trajectory or an equilibrium state. In the analysis the stochastic Duffing oscillator is first transformed into an equivalent deterministic nonlinear system by the Gegenbauer polynomial approximation, so that the problem of controlling stochastic chaos can be reduced into the problem of controlling deterministic chaos in the equivalent system. Then the top Lyapunov exponent of the equivalent system is obtained by Wolf's method to examine the chaotic behavior of the response. Numerical simulations show that the random phase control strategy is an effective way to control stochastic chaos

  17. Polynomial optimization : Error analysis and applications

    NARCIS (Netherlands)

    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

  18. "Chaos Rules" Revisited

    Science.gov (United States)

    Murphy, David

    2011-01-01

    About 20 years ago, while lost in the midst of his PhD research, the author mused over proposed titles for his thesis. He was pretty pleased with himself when he came up with "Chaos Rules" (the implied double meaning was deliberate), or more completely, "Chaos Rules: An Exploration of the Work of Instructional Designers in Distance Education." He…

  19. Chaos Modelling with Computers

    Indian Academy of Sciences (India)

    Chaos is one of the major scientific discoveries of our times. In fact many scientists ... But there are other natural phenomena that are not predictable though ... characteristics of chaos. ... The position and velocity are all that are needed to determine the motion of a .... a system of equations that modelled the earth's weather ...

  20. 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...

  1. 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...

  2. Polynomials in algebraic analysis

    OpenAIRE

    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 ...

  3. Quantum Hurwitz numbers and Macdonald polynomials

    Science.gov (United States)

    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.

  4. CHAOS-BASED ADVANCED ENCRYPTION STANDARD

    KAUST Repository

    Abdulwahed, Naif B.

    2013-05-01

    This thesis introduces a new chaos-based Advanced Encryption Standard (AES). The AES is a well-known encryption algorithm that was standardized by U.S National Institute of Standard and Technology (NIST) in 2001. The thesis investigates and explores the behavior of the AES algorithm by replacing two of its original modules, namely the S-Box and the Key Schedule, with two other chaos- based modules. Three chaos systems are considered in designing the new modules which are Lorenz system with multiplication nonlinearity, Chen system with sign modules nonlinearity, and 1D multiscroll system with stair case nonlinearity. The three systems are evaluated on their sensitivity to initial conditions and as Pseudo Random Number Generators (PRNG) after applying a post-processing technique to their output then performing NIST SP. 800-22 statistical tests. The thesis presents a hardware implementation of dynamic S-Boxes for AES that are populated using the three chaos systems. Moreover, a full MATLAB package to analyze the chaos generated S-Boxes based on graphical analysis, Walsh-Hadamard spectrum analysis, and image encryption analysis is developed. Although these S-Boxes are dynamic, meaning they are regenerated whenever the encryption key is changed, the analysis results show that such S-Boxes exhibit good properties like the Strict Avalanche Criterion (SAC) and the nonlinearity and in the application of image encryption. Furthermore, the thesis presents a new Lorenz-chaos-based key expansion for the AES. Many researchers have pointed out that there are some defects in the original key expansion of AES and thus have motivated such chaos-based key expansion proposal. The new proposed key schedule is analyzed and assessed in terms of confusion and diffusion by performing the frequency and SAC test respectively. The obtained results show that the new proposed design is more secure than the original AES key schedule and other proposed designs in the literature. The proposed

  5. 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 ...

  6. Multivariable Christoffel-Darboux Kernels and Characteristic Polynomials of Random Hermitian Matrices

    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.

  7. Improved Polynomial Fuzzy Modeling and Controller with Stability Analysis for Nonlinear Dynamical Systems

    OpenAIRE

    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...

  8. Paths to chaos

    International Nuclear Information System (INIS)

    Friedrich, H.

    1992-01-01

    Rapid growth in the study of nonlinear dynamics and chaos in classical mechanics, has led physicists to reappraise their abandonment of this definition of atomic theory in favour of quantum mechanics adopted earlier this century. The concept of chaos in classical mechanics is examined in this paper and manifestations of chaos in quantum mechanics are explored. While quantum mechanics teaches that atomic particles must not be pictured as moving sharply in defined orbits, these precise orbits can be used to describe essential features of the measurable quantum mechanical spectra. (UK)

  9. Chaos applications in telecommunications

    CERN Document Server

    Stavroulakis, Peter

    2005-01-01

    IntroductionPeter StavroulakisChaotic Signal Generation and Transmission Antonio Cândido Faleiros,Waldecir João Perrella,TâniaNunes Rabello,Adalberto Sampaio Santos, andNeiYoshihiro SomaChaotic Transceiver Design Arthur Fleming-DahlChaos-Based Modulation and DemodulationTechniques Francis C.M. Lau and Chi K. TseA Chaos Approach to Asynchronous DS-CDMASystems S. Callegari, G. Mazzini, R. Rovatti, and G. SettiChannel Equalization in Chaotic CommunicationSystems Mahmut CiftciOptical Communications using ChaoticTechniques Gregory D. VanWiggerenAPPENDIX AFundamental Concepts of the Theory ofChaos a

  10. A bound on chaos

    Energy Technology Data Exchange (ETDEWEB)

    Maldacena, Juan [School of Natural Sciences, Institute for Advanced Study,1 Einstein Drive, Princeton, NJ (United States); Shenker, Stephen H. [Stanford Institute for Theoretical Physics and Department of Physics, Stanford University,382 Via Pueblo Mall, Stanford, CA (United States); Stanford, Douglas [School of Natural Sciences, Institute for Advanced Study,1 Einstein Drive, Princeton, NJ (United States)

    2016-08-17

    We conjecture a sharp bound on the rate of growth of chaos in thermal quantum systems with a large number of degrees of freedom. Chaos can be diagnosed using an out-of-time-order correlation function closely related to the commutator of operators separated in time. We conjecture that the influence of chaos on this correlator can develop no faster than exponentially, with Lyapunov exponent λ{sub L}≤2πk{sub B}T/ℏ. We give a precise mathematical argument, based on plausible physical assumptions, establishing this conjecture.

  11. Colpitts and Chaos

    DEFF Research Database (Denmark)

    Lindberg, Erik

    1996-01-01

    The chaotic behaviour of the Colpitts oscillator reported by M.P. Kennedy is further investigated by means of PSpice simulations. Chaos is also observed with the default Ebers-Moll BJT transistor model with no memory. When the model is extended with memory and losses chaos do not occur and a 3'rd...... order limit cycle is found. If the the forward Early voltage parameter is added chaos is observed again. An examination of the eigenvalues of the oscillator with the simple memoryless Ebers-Moll BJT injection model is presented. By adding bulk resistors to the model stable limit cycles of orders 1, 2, 3...

  12. Polynomial approximation on polytopes

    CERN Document Server

    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.

  13. Polynomial intelligent states

    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

  14. 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.)

  15. Chaos: Choto delat?

    Science.gov (United States)

    Campbell, David

    1987-11-01

    I provide a brief overview of the current status of the field of deterministic "chaos" stressing its interrelations and applications to other fields and suggesting a number of important open problems for future study.

  16. Quantum manifestations of chaos

    International Nuclear Information System (INIS)

    Borondo, F.; Benito, R.M.

    1998-01-01

    The correspondence between classical and quantum mechanics is considered both in the regular and chaotic regimes, and the main results regarding the quantum manifestations of chaos are reviewed. (Author) 16 refs

  17. 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.)

  18. Channeling and dynamic chaos

    Energy Technology Data Exchange (ETDEWEB)

    Bolotin, IU L; Gonchar, V IU; Truten, V I; Shulga, N F

    1986-01-01

    It is shown that axial channeling of relativistic electrons can give rise to the effect of dynamic chaos which involves essentially chaotic motion of a particle in the channel. The conditions leading to the effect of dynamic chaos and the manifestations of this effect in physical processes associated with the passage of particles through a crystal are examined using a silicon crystal as an example. 7 references.

  19. Exploiting chaos for applications

    Energy Technology Data Exchange (ETDEWEB)

    Ditto, William L., E-mail: wditto@hawaii.edu [Department of Physics and Astronomy, University of Hawaii at Mānoa, Honolulu, Hawaii 96822 (United States); Sinha, Sudeshna, E-mail: sudeshna@iisermohali.ac.in [Indian Institute of Science Education and Research (IISER), Mohali, Knowledge City, Sector 81, SAS Nagar, PO Manauli 140306, Punjab (India)

    2015-09-15

    We discuss how understanding the nature of chaotic dynamics allows us to control these systems. A controlled chaotic system can then serve as a versatile pattern generator that can be used for a range of application. Specifically, we will discuss the application of controlled chaos to the design of novel computational paradigms. Thus, we present an illustrative research arc, starting with ideas of control, based on the general understanding of chaos, moving over to applications that influence the course of building better devices.

  20. Exploiting chaos for applications.

    Science.gov (United States)

    Ditto, William L; Sinha, Sudeshna

    2015-09-01

    We discuss how understanding the nature of chaotic dynamics allows us to control these systems. A controlled chaotic system can then serve as a versatile pattern generator that can be used for a range of application. Specifically, we will discuss the application of controlled chaos to the design of novel computational paradigms. Thus, we present an illustrative research arc, starting with ideas of control, based on the general understanding of chaos, moving over to applications that influence the course of building better devices.

  1. 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...

  2. Polynomial methods in combinatorics

    CERN Document Server

    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...

  3. Polynomial representations of GLn

    CERN Document Server

    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.

  4. Polynomial representations of GLN

    CERN Document Server

    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.

  5. Optimization over polynomials : Selected topics

    NARCIS (Netherlands)

    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

  6. Nonlinear chaos control and synchronization

    NARCIS (Netherlands)

    Huijberts, H.J.C.; Nijmeijer, H.; Schöll, E.; Schuster, H.G.

    2007-01-01

    This chapter contains sections titled: Introduction Nonlinear Geometric Control Some Differential Geometric Concepts Nonlinear Controllability Chaos Control Through Feedback Linearization Chaos Control Through Input-Output Linearization Lyapunov Design Lyapunov Stability and Lyapunov's First Method

  7. Enlightenment philosophers’ ideas about chaos

    Directory of Open Access Journals (Sweden)

    A. V. Kulik

    2014-07-01

     It is grounded that the philosopher and enlightener Johann Gottfried von Herder advanced an idea of objectivity of process of transformation chaos into order. It is shown that idea of «The law of nature» existing as for ordering chaos opened far­reaching prospects for researches of interaction with chaos.

  8. Model for Shock Wave Chaos

    KAUST Repository

    Kasimov, Aslan R.; Faria, Luiz; Rosales, Rodolfo R.

    2013-01-01

    : steady traveling wave solutions, instability of such solutions, and the onset of chaos. Our model is the first (to our knowledge) to describe chaos in shock waves by a scalar first-order partial differential equation. The chaos arises in the equation

  9. 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.

  10. Chaos in collective nuclei

    International Nuclear Information System (INIS)

    Whelan, N.D.

    1993-01-01

    Random Matrix Theory successfully describes the statistics of the low-lying spectra of some nuclei but not of others. It is currently believed that this theory applies to systems in which the corresponding classical motion is chaotic. This conjecture is tested for collective nuclei by studying the Interacting Boson Model. Quantum and classical measures of chaos are proposed and found to be in agreement throughout the parameter space of the model. For some parameter values the measures indicate the presence of a previously unknown approximate symmetry. A phenomenon called partial dynamical symmetry is explored and shown to lead to a suppression of chaos. A time dependent function calculated from the quantum spectrum is discussed. This function is sensitive to the extent of chaos and provides a robust method of analyzing experimental spectra

  11. Chaos and noise.

    Science.gov (United States)

    He, Temple; Habib, Salman

    2013-09-01

    Simple dynamical systems--with a small number of degrees of freedom--can behave in a complex manner due to the presence of chaos. Such systems are most often (idealized) limiting cases of more realistic situations. Isolating a small number of dynamical degrees of freedom in a realistically coupled system generically yields reduced equations with terms that can have a stochastic interpretation. In situations where both noise and chaos can potentially exist, it is not immediately obvious how Lyapunov exponents, key to characterizing chaos, should be properly defined. In this paper, we show how to do this in a class of well-defined noise-driven dynamical systems, derived from an underlying Hamiltonian model.

  12. 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....

  13. 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....

  14. An introduction to orthogonal polynomials

    CERN Document Server

    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

  15. 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

  16. Chaos Modelling with Computers

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 5. Chaos Modelling with Computers Unpredicatable Behaviour of Deterministic Systems. Balakrishnan Ramasamy T S K V Iyer. General Article Volume 1 Issue 5 May 1996 pp 29-39 ...

  17. Neural chaos and schizophrenia

    Czech Academy of Sciences Publication Activity Database

    Bob, P.; Chládek, Jan; Šusta, M.; Glaslová, K.; Jagla, F.; Kukleta, M.

    2007-01-01

    Roč. 26, č. 4 (2007), s. 298-305 ISSN 0231-5882 Institutional research plan: CEZ:AV0Z20650511 Keywords : EDA * Lyapunov exponent * schizophrenia * chaos Subject RIV: FL - Psychiatry, Sexuology Impact factor: 1.286, year: 2007

  18. Patterns in chaos

    International Nuclear Information System (INIS)

    Chirikov, B.V.

    1990-01-01

    Classification of chaotic patterns in classical Hamiltonian systems is given as a series of levels with increasing disorder. Hamiltonian dynamics is presented, including the renormalization chaos, based upon the fairly simple resonant theory. First estimates for the critical structure and related statistical anomalies in arbitrary dimensions are discussed. 49 refs

  19. Chaos at High School

    Directory of Open Access Journals (Sweden)

    Tamás Meszéna

    2017-04-01

    Full Text Available We are faced with chaotic processes in many segments of our life: meteorology, environmental pollution, financial and economic processes, sociology, mechanics, electronics, biology, chemistry. The spreading of high-performance computers and the development of simulation methods made the examination of these processes easily available. Regular, periodic motions (pendulum, harmonic oscillatory motion, bouncing ball, as taught at secondary level, become chaotic even due minor changes. If it is true that the most considerable achievements of twentieth century physics were the theory of relativity, quantum mechanics and chaos theory, then it is presumably time to think about, examine and test how and to what extent chaos can be presented to the students. Here I would like to introduce a 12 lesson long facultative curriculum framework on chaos designed for students aged seventeen. The investigation of chaos phenomenon in this work is based on a freeware, “Dynamics Solver”. This software, with some assistance from the teacher, is suitable for classroom use at secondary level.

  20. Survival and weak chaos.

    Science.gov (United States)

    Nee, Sean

    2018-05-01

    Survival analysis in biology and reliability theory in engineering concern the dynamical functioning of bio/electro/mechanical units. Here we incorporate effects of chaotic dynamics into the classical theory. Dynamical systems theory now distinguishes strong and weak chaos. Strong chaos generates Type II survivorship curves entirely as a result of the internal operation of the system, without any age-independent, external, random forces of mortality. Weak chaos exhibits (a) intermittency and (b) Type III survivorship, defined as a decreasing per capita mortality rate: engineering explicitly defines this pattern of decreasing hazard as 'infant mortality'. Weak chaos generates two phenomena from the normal functioning of the same system. First, infant mortality- sensu engineering-without any external explanatory factors, such as manufacturing defects, which is followed by increased average longevity of survivors. Second, sudden failure of units during their normal period of operation, before the onset of age-dependent mortality arising from senescence. The relevance of these phenomena encompasses, for example: no-fault-found failure of electronic devices; high rates of human early spontaneous miscarriage/abortion; runaway pacemakers; sudden cardiac death in young adults; bipolar disorder; and epilepsy.

  1. Chaos in drive systems

    Directory of Open Access Journals (Sweden)

    Kratochvíl C.

    2007-10-01

    Full Text Available The purpose of this article is to provide an elementary introduction to the subject of chaos in the electromechanical drive systems. In this article, we explore chaotic solutions of maps and continuous time systems. These solutions are also bounded like equilibrium, periodic and quasiperiodic solutions.

  2. User-Driven Chaos

    DEFF Research Database (Denmark)

    Lykke, Marianne; Lund, Haakon; Skov, Mette

    2016-01-01

    CHAOS (Cultural Heritage Archive Open System) provides streaming access to more than 500,000 broadcasts by the Danish Broadcast Corporation from 1931 and onwards. The archive is part of the LARM project with the purpose of enabling researchers to search, annotate, and interact with recordings...

  3. Metadata in CHAOS

    DEFF Research Database (Denmark)

    Lykke, Marianne; Skov, Mette; Lund, Haakon

    CHAOS (Cultural Heritage Archive Open System) provides streaming access to more than 500.000 broad-casts by the Danish Broadcast Corporation from 1931 and onwards. The archive is part of the LARM project with the purpose of enabling researchers to search, annotate, and interact with recordings...

  4. Chaos and insect ecology

    Science.gov (United States)

    Jesse A. Logan; Fred P. Hain

    1990-01-01

    Recent advances in applied mathematical analysis have uncovered a fascinating and unexpected dynamical richness that underlies behavior of even the simplest non-linear mathematical models. Due to the complexity of solutions to these non-linear equations, a new mathematical term, chaos, has been coined to describe the resulting dynamics. This term captures the notion...

  5. Adventures in order and chaos a scientific autobiography

    CERN Document Server

    Contopoulos, George

    2004-01-01

    The field of Order and Chaos had a remarkable expansion in the last 50 years. The main reason was the use of computers, and the development of new theoretical methods that we call now 'the theory of chaos'. The author describes this fascinating period in a relaxed and sometimes humorous autobiographical way. He relates his interactions with many people in dynamical astronomy and he quotes several anecdotes from these interactions. He refers also to his experiences when he served in various international positions, such as general secretary of the IAU and chairman of the journal Astronomy and A

  6. Bannai-Ito polynomials and dressing chains

    OpenAIRE

    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.

  7. Birth-death processes and associated polynomials

    NARCIS (Netherlands)

    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

  8. 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.

  9. Uniform approximations of Bernoulli and Euler polynomials in terms of hyperbolic functions

    NARCIS (Netherlands)

    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

  10. Chaos in neurons and its application: perspective of chaos engineering.

    Science.gov (United States)

    Hirata, Yoshito; Oku, Makito; Aihara, Kazuyuki

    2012-12-01

    We review our recent work on chaos in neurons and its application to neural networks from perspective of chaos engineering. Especially, we analyze a dataset of a squid giant axon by newly combining our previous work of identifying Devaney's chaos with surrogate data analysis, and show that an axon can behave chaotically. Based on this knowledge, we use a chaotic neuron model to investigate possible information processing in the brain.

  11. 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.

  12. Cosmographic analysis with Chebyshev polynomials

    Science.gov (United States)

    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.

  13. The joy of transient chaos

    Energy Technology Data Exchange (ETDEWEB)

    Tél, Tamás [Institute for Theoretical Physics, Eötvös University, and MTA-ELTE Theoretical Physics Research Group, Pázmány P. s. 1/A, Budapest H-1117 (Hungary)

    2015-09-15

    We intend to show that transient chaos is a very appealing, but still not widely appreciated, subfield of nonlinear dynamics. Besides flashing its basic properties and giving a brief overview of the many applications, a few recent transient-chaos-related subjects are introduced in some detail. These include the dynamics of decision making, dispersion, and sedimentation of volcanic ash, doubly transient chaos of undriven autonomous mechanical systems, and a dynamical systems approach to energy absorption or explosion.

  14. The joy of transient chaos.

    Science.gov (United States)

    Tél, Tamás

    2015-09-01

    We intend to show that transient chaos is a very appealing, but still not widely appreciated, subfield of nonlinear dynamics. Besides flashing its basic properties and giving a brief overview of the many applications, a few recent transient-chaos-related subjects are introduced in some detail. These include the dynamics of decision making, dispersion, and sedimentation of volcanic ash, doubly transient chaos of undriven autonomous mechanical systems, and a dynamical systems approach to energy absorption or explosion.

  15. Gullies of Gorgonus Chaos

    Science.gov (United States)

    2002-01-01

    (Released 11 June 2002) The Science This fractured surface belongs to a portion of a region called Gorgonum Chaos located in the southern hemisphere of Mars. Gorgonum Chaos is named after the Gorgons in ancient Greek mythology. The Gorgons were monstrous sisters with snakes for hair, tusks like boars and lolling tongues who lived in caves. As it turns out this is indeed a fitting name for this region of Mars because it contains a high density of gullies that 'snake' their way down the walls of the troughs located in this region of chaos. Upon closer examination one finds that these gullies and alluvial deposits, initially discovered by Mars Global Surveyor, are visible on the trough walls (best seen near the bottom of the image). These gullies appear to emanate from a specific layer in the walls. The gullies have been proposed to have formed by the subsurface release of water. The Story This fractured, almost spooky-looking surface belongs to a region called Gorgonum Chaos in the southern hemisphere of Mars. Chaos is a term used for regions of Mars with distinctive areas of broken terrain like the one seen above. This area of Martian chaos is named after the Gorgons in ancient Greek mythology. The Gorgons were monstrous sisters with snakes for hair, tusks like boars, and lolling tongues, who lived in caves. The Gorgons, including famous sister Medusa, could turn a person to stone, and their writhing, snakelike locks cause revulsion to this day. Given the afflicted nature of this contorted terrain, with all of its twisted, branching channels and hard, stony-looking hills in the top half of the image, this is indeed a fitting name for this region of Mars. The name also has great appeal, because the area contains a high density of gullies that 'snake' their way down the walls of the troughs located in this region of Martian chaos. Gullies are trenches cut into the land as accelerated streams of water (or another liquid) erode the surface. To see these, click on the

  16. Controlling chaos faster

    International Nuclear Information System (INIS)

    Bick, Christian; Kolodziejski, Christoph; Timme, Marc

    2014-01-01

    Predictive feedback control is an easy-to-implement method to stabilize unknown unstable periodic orbits in chaotic dynamical systems. Predictive feedback control is severely limited because asymptotic convergence speed decreases with stronger instabilities which in turn are typical for larger target periods, rendering it harder to effectively stabilize periodic orbits of large period. Here, we study stalled chaos control, where the application of control is stalled to make use of the chaotic, uncontrolled dynamics, and introduce an adaptation paradigm to overcome this limitation and speed up convergence. This modified control scheme is not only capable of stabilizing more periodic orbits than the original predictive feedback control but also speeds up convergence for typical chaotic maps, as illustrated in both theory and application. The proposed adaptation scheme provides a way to tune parameters online, yielding a broadly applicable, fast chaos control that converges reliably, even for periodic orbits of large period

  17. Handbook of Chaos Control

    CERN Document Server

    Schuster, H G

    2008-01-01

    This long-awaited revised second edition of the standard reference on the subject has been considerably expanded to include such recent developments as novel control schemes, control of chaotic space-time patterns, control of noisy nonlinear systems, and communication with chaos, as well as promising new directions in research. The contributions from leading international scientists active in the field provide a comprehensive overview of our current level of knowledge on chaos control and its applications in physics, chemistry, biology, medicine, and engineering. In addition, they show the overlap with the traditional field of control theory in the engineering community.An interdisciplinary approach of interest to scientists and engineers working in a number of areas

  18. Chaos in quantum channels

    Energy Technology Data Exchange (ETDEWEB)

    Hosur, Pavan; Qi, Xiao-Liang [Department of Physics, Stanford University,476 Lomita Mall, Stanford, California 94305 (United States); Roberts, Daniel A. [Center for Theoretical Physics and Department of Physics, Massachusetts Institute of Technology,77 Massachusetts Ave, Cambridge, Massachusetts 02139 (United States); Yoshida, Beni [Perimeter Institute for Theoretical Physics,31 Caroline Street North, Waterloo, Ontario N2L 2Y5 (Canada); Walter Burke Institute for Theoretical Physics, California Institute of Technology,1200 E California Blvd, Pasadena CA 91125 (United States)

    2016-02-01

    We study chaos and scrambling in unitary channels by considering their entanglement properties as states. Using out-of-time-order correlation functions to diagnose chaos, we characterize the ability of a channel to process quantum information. We show that the generic decay of such correlators implies that any input subsystem must have near vanishing mutual information with almost all partitions of the output. Additionally, we propose the negativity of the tripartite information of the channel as a general diagnostic of scrambling. This measures the delocalization of information and is closely related to the decay of out-of-time-order correlators. We back up our results with numerics in two non-integrable models and analytic results in a perfect tensor network model of chaotic time evolution. These results show that the butterfly effect in quantum systems implies the information-theoretic definition of scrambling.

  19. Fascination of chaos

    International Nuclear Information System (INIS)

    Loskutov, Alexander

    2010-01-01

    This review introduces most of the concepts used in the study of chaotic phenomena in nonlinear systems and has as its objective to summarize the current understanding of results from the theory of chaotic dynamical systems and to describe the original ideas underlying the study of deterministic chaos. The presentation relies on informal analysis, with abstract mathematical ideas visualized geometrically or by examples from physics. Hyperbolic dynamics, homoclinic trajectories and tangencies, wild hyperbolic sets, and different types of attractors which appear in dynamical systems are considered. The key aspects of ergodic theory are discussed, and the basic statistical properties of chaotic dynamical systems are described. The fundamental difference between stochastic dynamics and deterministic chaos is explained. The review concludes with an investigation of the possibility of studying complex systems on the basis of the analysis of registered signals, i.e. the generated time series. (reviews of topical problems)

  20. Controlling chaos faster.

    Science.gov (United States)

    Bick, Christian; Kolodziejski, Christoph; Timme, Marc

    2014-09-01

    Predictive feedback control is an easy-to-implement method to stabilize unknown unstable periodic orbits in chaotic dynamical systems. Predictive feedback control is severely limited because asymptotic convergence speed decreases with stronger instabilities which in turn are typical for larger target periods, rendering it harder to effectively stabilize periodic orbits of large period. Here, we study stalled chaos control, where the application of control is stalled to make use of the chaotic, uncontrolled dynamics, and introduce an adaptation paradigm to overcome this limitation and speed up convergence. This modified control scheme is not only capable of stabilizing more periodic orbits than the original predictive feedback control but also speeds up convergence for typical chaotic maps, as illustrated in both theory and application. The proposed adaptation scheme provides a way to tune parameters online, yielding a broadly applicable, fast chaos control that converges reliably, even for periodic orbits of large period.

  1. Chaos detection and predictability

    CERN Document Server

    Gottwald, Georg; Laskar, Jacques

    2016-01-01

    Distinguishing chaoticity from regularity in deterministic dynamical systems and specifying the subspace of the phase space in which instabilities are expected to occur is of utmost importance in as disparate areas as astronomy, particle physics and climate dynamics.   To address these issues there exists a plethora of methods for chaos detection and predictability. The most commonly employed technique for investigating chaotic dynamics, i.e. the computation of Lyapunov exponents, however, may suffer a number of problems and drawbacks, for example when applied to noisy experimental data.   In the last two decades, several novel methods have been developed for the fast and reliable determination of the regular or chaotic nature of orbits, aimed at overcoming the shortcomings of more traditional techniques. This set of lecture notes and tutorial reviews serves as an introduction to and overview of modern chaos detection and predictability techniques for graduate students and non-specialists.   The book cover...

  2. Controlling chaos faster

    Energy Technology Data Exchange (ETDEWEB)

    Bick, Christian [Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany); Bernstein Center for Computational Neuroscience (BCCN), 37077 Göttingen (Germany); Institute for Mathematics, Georg–August–Universität Göttingen, 37073 Göttingen (Germany); Kolodziejski, Christoph [Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany); III. Physical Institute—Biophysics, Georg–August–Universität Göttingen, 37077 Göttingen (Germany); Timme, Marc [Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany); Institute for Nonlinear Dynamics, Georg–August–Universität Göttingen, 37077 Göttingen (Germany)

    2014-09-01

    Predictive feedback control is an easy-to-implement method to stabilize unknown unstable periodic orbits in chaotic dynamical systems. Predictive feedback control is severely limited because asymptotic convergence speed decreases with stronger instabilities which in turn are typical for larger target periods, rendering it harder to effectively stabilize periodic orbits of large period. Here, we study stalled chaos control, where the application of control is stalled to make use of the chaotic, uncontrolled dynamics, and introduce an adaptation paradigm to overcome this limitation and speed up convergence. This modified control scheme is not only capable of stabilizing more periodic orbits than the original predictive feedback control but also speeds up convergence for typical chaotic maps, as illustrated in both theory and application. The proposed adaptation scheme provides a way to tune parameters online, yielding a broadly applicable, fast chaos control that converges reliably, even for periodic orbits of large period.

  3. Noise tolerant spatiotemporal chaos computing.

    Science.gov (United States)

    Kia, Behnam; Kia, Sarvenaz; Lindner, John F; Sinha, Sudeshna; Ditto, William L

    2014-12-01

    We introduce and design a noise tolerant chaos computing system based on a coupled map lattice (CML) and the noise reduction capabilities inherent in coupled dynamical systems. The resulting spatiotemporal chaos computing system is more robust to noise than a single map chaos computing system. In this CML based approach to computing, under the coupled dynamics, the local noise from different nodes of the lattice diffuses across the lattice, and it attenuates each other's effects, resulting in a system with less noise content and a more robust chaos computing architecture.

  4. Improved Polynomial Fuzzy Modeling and Controller with Stability Analysis for Nonlinear Dynamical Systems

    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.

  5. 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...

  6. Orthogonal Polynomials and Special Functions

    CERN Document Server

    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.

  7. Chaos on hyperspace

    Czech Academy of Sciences Publication Activity Database

    Beran, Zdeněk; Čelikovský, Sergej

    2013-01-01

    Roč. 23, č. 5 (2013), 1350084-1-1350084-9 ISSN 0218-1274 R&D Projects: GA ČR GA13-20433S Institutional support: RVO:67985556 Keywords : Hyperspace * chaos * shadowing * Bernoulli shift Subject RIV: BC - Control Systems Theory Impact factor: 1.017, year: 2013 http://library.utia.cas.cz/separaty/2013/TR/beran-0392926.pdf

  8. Aram Chaos Rocks

    Science.gov (United States)

    2005-01-01

    8 September 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows outcrops of light-toned, sedimentary rock among darker-toned mesas in Aram Chaos. Dark, windblown megaripples -- large ripples -- are also present at this location. Location near: 3.0oN, 21.6oW Image width: width: 3 km (1.9 mi) Illumination from: lower left Season: Northern Autumn

  9. Fractals and chaos

    CERN Document Server

    Earnshow, R; Jones, H

    1991-01-01

    This volume is based upon the presentations made at an international conference in London on the subject of 'Fractals and Chaos'. The objective of the conference was to bring together some of the leading practitioners and exponents in the overlapping fields of fractal geometry and chaos theory, with a view to exploring some of the relationships between the two domains. Based on this initial conference and subsequent exchanges between the editors and the authors, revised and updated papers were produced. These papers are contained in the present volume. We thank all those who contributed to this effort by way of planning and organisation, and also all those who helped in the production of this volume. In particular, we wish to express our appreciation to Gerhard Rossbach, Computer Science Editor, Craig Van Dyck, Production Director, and Nancy A. Rogers, who did the typesetting. A. J. Crilly R. A. Earnshaw H. Jones 1 March 1990 Introduction Fractals and Chaos The word 'fractal' was coined by Benoit Mandelbrot i...

  10. Chaos on the interval

    CERN Document Server

    Ruette, Sylvie

    2017-01-01

    The aim of this book is to survey the relations between the various kinds of chaos and related notions for continuous interval maps from a topological point of view. The papers on this topic are numerous and widely scattered in the literature; some of them are little known, difficult to find, or originally published in Russian, Ukrainian, or Chinese. Dynamical systems given by the iteration of a continuous map on an interval have been broadly studied because they are simple but nevertheless exhibit complex behaviors. They also allow numerical simulations, which enabled the discovery of some chaotic phenomena. Moreover, the "most interesting" part of some higher-dimensional systems can be of lower dimension, which allows, in some cases, boiling it down to systems in dimension one. Some of the more recent developments such as distributional chaos, the relation between entropy and Li-Yorke chaos, sequence entropy, and maps with infinitely many branches are presented in book form for the first time. The author gi...

  11. Chaos in hadrons

    International Nuclear Information System (INIS)

    Muñoz, L; Fernández-Ramírez, C; Relaño, A; Retamosa, J

    2012-01-01

    In the last decade quantum chaos has become a well established discipline with outreach to different fields, from condensed-matter to nuclear physics. The most important signature of quantum chaos is the statistical analysis of the energy spectrum, which distinguishes between systems with integrable and chaotic classical analogues. In recent years, spectral statistical techniques inherited from quantum chaos have been applied successfully to the baryon spectrum revealing its likely chaotic behaviour even at the lowest energies. However, the theoretical spectra present a behaviour closer to the statistics of integrable systems which makes theory and experiment statistically incompatible. The usual statement of missing resonances in the experimental spectrum when compared to the theoretical ones cannot account for the discrepancies. In this communication we report an improved analysis of the baryon spectrum, taking into account the low statistics and the error bars associated with each resonance. Our findings give a major support to the previous conclusions. Besides, analogue analyses are performed in the experimental meson spectrum, with comparison to theoretical models.

  12. Symmetric functions and orthogonal polynomials

    CERN Document Server

    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.

  13. 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

  14. Thermal expansion data

    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)

  15. 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.

  16. 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.

  17. 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...

  18. 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...

  19. Congruences concerning Legendre polynomials III

    OpenAIRE

    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\

  20. 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.

  1. 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)

  2. Universal signatures of quantum chaos

    International Nuclear Information System (INIS)

    Aurich, R.; Bolte, J.; Steiner, F.

    1994-02-01

    We discuss fingerprints of classical chaos in spectra of the corresponding bound quantum systems. A novel quantity to measure quantum chaos in spectra is proposed and a conjecture about its universal statistical behaviour is put forward. Numerical as well as theoretical evidence is provided in favour of the conjecture. (orig.)

  3. Chaos Theory and Post Modernism

    Science.gov (United States)

    Snell, Joel

    2009-01-01

    Chaos theory is often associated with post modernism. However, one may make the point that both terms are misunderstood. The point of this article is to define both terms and indicate their relationship. Description: Chaos theory is associated with a definition of a theory dealing with variables (butterflies) that are not directly related to a…

  4. Death and revival of chaos.

    Science.gov (United States)

    Kaszás, Bálint; Feudel, Ulrike; Tél, Tamás

    2016-12-01

    We investigate the death and revival of chaos under the impact of a monotonous time-dependent forcing that changes its strength with a non-negligible rate. Starting on a chaotic attractor it is found that the complexity of the dynamics remains very pronounced even when the driving amplitude has decayed to rather small values. When after the death of chaos the strength of the forcing is increased again with the same rate of change, chaos is found to revive but with a different history. This leads to the appearance of a hysteresis in the complexity of the dynamics. To characterize these dynamics, the concept of snapshot attractors is used, and the corresponding ensemble approach proves to be superior to a single trajectory description, that turns out to be nonrepresentative. The death (revival) of chaos is manifested in a drop (jump) of the standard deviation of one of the phase-space coordinates of the ensemble; the details of this chaos-nonchaos transition depend on the ratio of the characteristic times of the amplitude change and of the internal dynamics. It is demonstrated that chaos cannot die out as long as underlying transient chaos is present in the parameter space. As a condition for a "quasistatically slow" switch-off, we derive an inequality which cannot be fulfilled in practice over extended parameter ranges where transient chaos is present. These observations need to be taken into account when discussing the implications of "climate change scenarios" in any nonlinear dynamical system.

  5. Chaos Criminology: A critical analysis

    Science.gov (United States)

    McCarthy, Adrienne L.

    There has been a push since the early 1980's for a paradigm shift in criminology from a Newtonian-based ontology to one of quantum physics. Primarily this effort has taken the form of integrating Chaos Theory into Criminology into what this thesis calls 'Chaos Criminology'. However, with the melding of any two fields, terms and concepts need to be translated properly, which has yet to be done. In addition to proving a translation between fields, this thesis also uses a set of criteria to evaluate the effectiveness of the current use of Chaos Theory in Criminology. While the results of the theory evaluation reveal that the current Chaos Criminology work is severely lacking and in need of development, there is some promise in the development of Marx's dialectical materialism with Chaos Theory.

  6. [Shedding light on chaos theory].

    Science.gov (United States)

    Chou, Shieu-Ming

    2004-06-01

    Gleick (1987) said that only three twentieth century scientific theories would be important enough to continue be of use in the twenty-first century: The Theory of Relativity, Quantum Theory, and Chaos Theory. Chaos Theory has become a craze which is being used to forge a new scientific system. It has also been extensively applied in a variety of professions. The purpose of this article is to introduce chaos theory and its nursing applications. Chaos is a sign of regular order. This is to say that chaos theory emphasizes the intrinsic potential for regular order within disordered phenomena. It is to be hoped that this article will inspire more nursing scientists to apply this concept to clinical, research, or administrative fields in our profession.

  7. 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)

  8. 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.

  9. The finite Fourier transform of classical polynomials

    OpenAIRE

    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.

  10. 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

  11. Chromatic Derivatives, Chromatic Expansions and Associated Spaces

    OpenAIRE

    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 ...

  12. A Summation Formula for Macdonald Polynomials

    Science.gov (United States)

    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.

  13. A New Generalisation of Macdonald Polynomials

    Science.gov (United States)

    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.

  14. 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.

  15. Shear-induced chaos

    International Nuclear Information System (INIS)

    Lin, Kevin K; Young, Lai-Sang

    2008-01-01

    Guided by a geometric understanding developed in earlier works of Wang and Young, we carry out numerical studies of shear-induced chaos in several parallel but different situations. The settings considered include periodic kicking of limit cycles, random kicks at Poisson times and continuous-time driving by white noise. The forcing of a quasi-periodic model describing two coupled oscillators is also investigated. In all cases, positive Lyapunov exponents are found in suitable parameter ranges when the forcing is suitably directed

  16. Shear-induced chaos

    Science.gov (United States)

    Lin, Kevin K.; Young, Lai-Sang

    2008-05-01

    Guided by a geometric understanding developed in earlier works of Wang and Young, we carry out numerical studies of shear-induced chaos in several parallel but different situations. The settings considered include periodic kicking of limit cycles, random kicks at Poisson times and continuous-time driving by white noise. The forcing of a quasi-periodic model describing two coupled oscillators is also investigated. In all cases, positive Lyapunov exponents are found in suitable parameter ranges when the forcing is suitably directed.

  17. Eos Chaos Rocks

    Science.gov (United States)

    2006-01-01

    11 January 2006 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows light-toned, layered rock outcrops in Eos Chaos, located near the east end of the Valles Marineris trough system. The outcrops occur in the form of a distinct, circular butte (upper half of image) and a high slope (lower half of image). The rocks might be sedimentary rocks, similar to those found elsewhere exposed in the Valles Marineris system and the chaotic terrain to the east of the region. Location near: 12.9oS, 49.5oW Image width: 3 km (1.9 mi) Illumination from: lower left Season: Southern Summer

  18. Associated polynomials and birth-death processes

    NARCIS (Netherlands)

    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

  19. From Jack to Double Jack Polynomials via the Supersymmetric Bridge

    Science.gov (United States)

    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.

  20. Application of Chaos Theory to Engine Systems

    OpenAIRE

    Matsumoto, Kazuhiro; Diebner, Hans H.; Tsuda, Ichiro; Hosoi, Yukiharu

    2008-01-01

    We focus on the control issue for engine systems from the perspective of chaos theory, which is based on the fact that engine systems have a low-dimensional chaotic dynamics. Two approaches are discussed: controlling chaos and harnessing chaos, respectively. We apply Pyragas' chaos control method to an actual engine system. The experimental results show that the chaotic motion of an engine system may be stabilized to a periodic motion. Alternatively, harnessing chaos for engine systems is add...

  1. Quantum chaos: entropy signatures

    International Nuclear Information System (INIS)

    Miller, P.A.; Sarkar, S.; Zarum, R.

    1998-01-01

    A definition of quantum chaos is given in terms of entropy production rates for a quantum system coupled weakly to a reservoir. This allows the treatment of classical and quantum chaos on the same footing. In the quantum theory the entropy considered is the von Neumann entropy and in classical systems it is the Gibbs entropy. The rate of change of the coarse-grained Gibbs entropy of the classical system with time is given by the Kolmogorov-Sinai (KS) entropy. The relation between KS entropy and the rate of change of von Neumann entropy is investigated for the kicked rotator. For a system which is classically chaotic there is a linear relationship between these two entropies. Moreover it is possible to construct contour plots for the local KS entropy and compare it with the corresponding plots for the rate of change of von Neumann entropy. The quantitative and qualitative similarities of these plots are discussed for the standard map (kicked rotor) and the generalised cat maps. (author)

  2. 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.

  3. 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

  4. 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

  5. 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

  6. 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.

  7. 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.

  8. 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

  9. Quantum mechanical suppression of chaos

    International Nuclear Information System (INIS)

    Bluemel, R.; Smilansky, U.

    1990-01-01

    The relation between determinism and predictability is the central issue in the study of 'deterministic chaos'. Much knowledge has been accumulated in the past 10 years about the chaotic dynamics of macroscopic (classical) systems. The implications of chaos in the microscopic quantum world is examined, in other words, how to reconcile the correspondence principle with the inherent uncertainties which reflect the wave nature of quantum dynamics. Recent atomic physics experiments demonstrate clearly that chaos is relevant to the microscopic world. In particular, such experiments emphasise the urgent need to clarify the genuine quantum mechanism which imposes severe limitations on quantum dynamics, and renders it so very different from its classical counterpart. (author)

  10. Recent development of chaos theory in topological dynamics

    OpenAIRE

    Li, Jian; Ye, Xiangdong

    2015-01-01

    We give a summary on the recent development of chaos theory in topological dynamics, focusing on Li-Yorke chaos, Devaney chaos, distributional chaos, positive topological entropy, weakly mixing sets and so on, and their relationships.

  11. Ancient and Current Chaos Theories

    Directory of Open Access Journals (Sweden)

    Güngör Gündüz

    2006-07-01

    Full Text Available Chaos theories developed in the last three decades have made very important contributions to our understanding of dynamical systems and natural phenomena. The meaning of chaos in the current theories and in the past is somewhat different from each other. In this work, the properties of dynamical systems and the evolution of chaotic systems were discussed in terms of the views of ancient philosophers. The meaning of chaos in Anaximenes’ philosophy and its role in the Ancient natural philosophy has been discussed in relation to other natural philosophers such as of Anaximander, Parmenides, Heraclitus, Empedocles, Leucippus (i.e. atomists and Aristotle. In addition, the fundamental concepts of statistical mechanics and the current chaos theories were discussed in relation to the views in Ancient natural philosophy. The roots of the scientific concepts such as randomness, autocatalysis, nonlinear growth, information, pattern, etc. in the Ancient natural philosophy were investigated.

  12. Quantum Instantons and Quantum Chaos

    OpenAIRE

    Jirari, H.; Kröger, H.; Luo, X. Q.; Moriarty, K. J. M.; Rubin, S. G.

    1999-01-01

    Based on a closed form expression for the path integral of quantum transition amplitudes, we suggest rigorous definitions of both, quantum instantons and quantum chaos. As an example we compute the quantum instanton of the double well potential.

  13. Cryptography with chaos and shadowing

    International Nuclear Information System (INIS)

    Smaoui, Nejib; Kanso, Ali

    2009-01-01

    In this paper, we present a novel approach to encrypt a message (a text composed by some alphabets) using chaos and shadowing. First, we generate a numerical chaotic orbit based on the logistic map, and use the shadowing algorithm of Smaoui and Kostelich [Smaoui N, Kostelich E. Using chaos to shadow the quadratic map for all time. Int J Comput Math 1998;70:117-29] to show that there exists a finite number of true orbits that shadow the numerical orbit. Then, the finite number of maps generated is used in Baptista's algorithm [Baptista MS. Cryptography with chaos. Phys Lett A 1998;240:50-4] to encrypt each character of the message. It is shown that the use of chaos and shadowing in the encryption process enhances the security level.

  14. Chaos and complexity by design

    Energy Technology Data Exchange (ETDEWEB)

    Roberts, Daniel A. [Center for Theoretical Physics and Department of Physics,Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States); School of Natural Sciences, Institute for Advanced Study,Princeton, NJ 08540 (United States); Yoshida, Beni [Perimeter Institute for Theoretical Physics,Waterloo, Ontario N2L 2Y5 (Canada)

    2017-04-20

    We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the “frame potential,” which is minimized by unitary k-designs and measures the 2-norm distance between the Haar random unitary ensemble and another ensemble. A natural probe of quantum chaos is out-of-time-order (OTO) four-point correlation functions. We show that the norm squared of a generalization of out-of-time-order 2k-point correlators is proportional to the kth frame potential, providing a quantitative connection between chaos and pseudorandomness. Additionally, we prove that these 2k-point correlators for Pauli operators completely determine the k-fold channel of an ensemble of unitary operators. Finally, we use a counting argument to obtain a lower bound on the quantum circuit complexity in terms of the frame potential. This provides a direct link between chaos, complexity, and randomness.

  15. Chaos and complexity by design

    International Nuclear Information System (INIS)

    Roberts, Daniel A.; Yoshida, Beni

    2017-01-01

    We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the “frame potential,” which is minimized by unitary k-designs and measures the 2-norm distance between the Haar random unitary ensemble and another ensemble. A natural probe of quantum chaos is out-of-time-order (OTO) four-point correlation functions. We show that the norm squared of a generalization of out-of-time-order 2k-point correlators is proportional to the kth frame potential, providing a quantitative connection between chaos and pseudorandomness. Additionally, we prove that these 2k-point correlators for Pauli operators completely determine the k-fold channel of an ensemble of unitary operators. Finally, we use a counting argument to obtain a lower bound on the quantum circuit complexity in terms of the frame potential. This provides a direct link between chaos, complexity, and randomness.

  16. Experimental Induction of Genome Chaos.

    Science.gov (United States)

    Ye, Christine J; Liu, Guo; Heng, Henry H

    2018-01-01

    Genome chaos, or karyotype chaos, represents a powerful survival strategy for somatic cells under high levels of stress/selection. Since the genome context, not the gene content, encodes the genomic blueprint of the cell, stress-induced rapid and massive reorganization of genome topology functions as a very important mechanism for genome (karyotype) evolution. In recent years, the phenomenon of genome chaos has been confirmed by various sequencing efforts, and many different terms have been coined to describe different subtypes of the chaotic genome including "chromothripsis," "chromoplexy," and "structural mutations." To advance this exciting field, we need an effective experimental system to induce and characterize the karyotype reorganization process. In this chapter, an experimental protocol to induce chaotic genomes is described, following a brief discussion of the mechanism and implication of genome chaos in cancer evolution.

  17. Encounters with chaos and fractals

    CERN Document Server

    Gulick, Denny

    2012-01-01

    Periodic Points Iterates of Functions Fixed Points Periodic Points Families of Functions The Quadratic Family Bifurcations Period-3 Points The Schwarzian Derivative One-Dimensional Chaos Chaos Transitivity and Strong Chaos Conjugacy Cantor Sets Two-Dimensional Chaos Review of Matrices Dynamics of Linear FunctionsNonlinear Maps The Hénon Map The Horseshoe Map Systems of Differential Equations Review of Systems of Differential Equations Almost Linearity The Pendulum The Lorenz System Introduction to Fractals Self-Similarity The Sierpiński Gasket and Other "Monsters"Space-Filling Curves Similarity and Capacity DimensionsLyapunov Dimension Calculating Fractal Dimensions of Objects Creating Fractals Sets Metric Spaces The Hausdorff Metric Contractions and Affine Functions Iterated Function SystemsAlgorithms for Drawing Fractals Complex Fractals: Julia Sets and the Mandelbrot Set Complex Numbers and Functions Julia Sets The Mandelbrot Set Computer Programs Answers to Selected Exercises References Index.

  18. Cryptography with chaos and shadowing

    Energy Technology Data Exchange (ETDEWEB)

    Smaoui, Nejib [Department of Mathematics and Computer Science, Kuwait University, P.O. Box 5969, Safat 13060 (Kuwait)], E-mail: nsmaoui64@yahoo.com; Kanso, Ali [Department of Mathematics and Computer Science, Kuwait University, P.O. Box 5969, Safat 13060 (Kuwait)], E-mail: akanso@hotmail.com

    2009-11-30

    In this paper, we present a novel approach to encrypt a message (a text composed by some alphabets) using chaos and shadowing. First, we generate a numerical chaotic orbit based on the logistic map, and use the shadowing algorithm of Smaoui and Kostelich [Smaoui N, Kostelich E. Using chaos to shadow the quadratic map for all time. Int J Comput Math 1998;70:117-29] to show that there exists a finite number of true orbits that shadow the numerical orbit. Then, the finite number of maps generated is used in Baptista's algorithm [Baptista MS. Cryptography with chaos. Phys Lett A 1998;240:50-4] to encrypt each character of the message. It is shown that the use of chaos and shadowing in the encryption process enhances the security level.

  19. Optical digital chaos cryptography

    Science.gov (United States)

    Arenas-Pingarrón, Álvaro; González-Marcos, Ana P.; Rivas-Moscoso, José M.; Martín-Pereda, José A.

    2007-10-01

    In this work we present a new way to mask the data in a one-user communication system when direct sequence - code division multiple access (DS-CDMA) techniques are used. The code is generated by a digital chaotic generator, originally proposed by us and previously reported for a chaos cryptographic system. It is demonstrated that if the user's data signal is encoded with a bipolar phase-shift keying (BPSK) technique, usual in DS-CDMA, it can be easily recovered from a time-frequency domain representation. To avoid this situation, a new system is presented in which a previous dispersive stage is applied to the data signal. A time-frequency domain analysis is performed, and the devices required at the transmitter and receiver end, both user-independent, are presented for the optical domain.

  20. SPICE and Chaos

    DEFF Research Database (Denmark)

    Lindberg, Erik

    1996-01-01

    Can we believe in the results of our circuit simulators ? Is it possible to distinguish between results due to numerical chaos and resultsdue to the eventual chaotic nature of our modelsof physical systems ?. Three experiments with SPICE are presented: (1) A "stable" active RCcircuit with poles...... in the right half plane. (2) "Chaotic" steady state behaviour of a non-chaotic dc power supply. (3) Analysis of a Colpitts oscillator with chaotic behaviour. In order to obtain reliable results from the SPICE simulators the users of these programs need insight not only in the use of the programs but also...... in the models of the circuits to be analyzed. If trimmed properly SPICE normally gives the correct result....

  1. Hasard et chaos

    CERN Document Server

    Ruelle, David

    1991-01-01

    Comment expliquer le hasard ? Peut-on rendre raison de l'irraisonnable ? Ce livre, où il est question des jeux de dés, des loteries, des billards, des attracteurs étranges, de l'astrologie et des oracles, du temps qu'il fera, du libre arbitre, de la mécanique quantique, de l'écoulement des fluides, du théorème de Gödel et des limites de l'entendement humain, expose les fondements et les conséquences de la théorie du chaos. David Ruelle est membre de l'Académie des sciences et professeur de physique théorique à l'Institut des hautes études scientifiques de Bures-sur-Yvette.

  2. 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.

  3. 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

  4. Fourier series and orthogonal polynomials

    CERN Document Server

    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

  5. Killings, duality and characteristic polynomials

    Science.gov (United States)

    Á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

  6. Orthogonal polynomials and random matrices

    CERN Document Server

    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.

  7. Introduction to Real Orthogonal Polynomials

    Science.gov (United States)

    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

  8. 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

  9. 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)

  10. 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.

  11. Bayer Demosaicking with Polynomial Interpolation.

    Science.gov (United States)

    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.

  12. Fermionic formula for double Kostka polynomials

    OpenAIRE

    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...

  13. 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.

  14. An adaptive multi-element probabilistic collocation method for statistical EMC/EMI characterization

    KAUST Repository

    Yü cel, Abdulkadir C.; Bagci, Hakan; Michielssen, Eric

    2013-01-01

    polynomial chaos expansion of the observables. While constructing local polynomial expansions on each subdomain, a fast integral-equation-based deterministic field-cable-circuit simulator is used to compute the observable values at the collocation

  15. 2012 Symposium on Chaos, Complexity and Leadership

    CERN Document Server

    Erçetin, Şefika

    2014-01-01

    These proceedings from the 2012 symposium on "Chaos, complexity and leadership"  reflect current research results from all branches of Chaos, Complex Systems and their applications in Management. Included are the diverse results in the fields of applied nonlinear methods, modeling of data and simulations, as well as theoretical achievements of Chaos and Complex Systems. Also highlighted are  Leadership and Management applications of Chaos and Complexity Theory.

  16. Quantum chaos: Statistical relaxation in discrete spectrum

    International Nuclear Information System (INIS)

    Chirikov, B.V.

    1991-01-01

    The controversial phenomenon of quantum chaos is discussed using the quantized standard map, or the kicked rotator, as a simple model. The relation to the classical dynamical chaos is tracked down on the basis of the correspondence principle. Various mechanisms of the quantum suppression of classical chaos are considered with an application to the excitation and ionization of Rydberg atoms in a microwave field. Several definitions of the quantum chaos are discussed. (author). 27 refs

  17. Decoherence, determinism and chaos

    International Nuclear Information System (INIS)

    Noyes, H.P.

    1994-01-01

    The author claims by now to have made his case that modern work on fractals and chaos theory has already removed the presumption that classical physics is 'deterministic'. Further, he claims that in so far as classical relativistic field theory (i.e. electromagnetism and gravitation) are scale invariant, they are self-consistent only if the idea of 'test-particle' is introduced from outside the theory. Einstein spent the last years of his life trying to use singularities in the metric as 'particles' or to get them out of the non-linearities in a grand unified theory -- in vain. So classical physics in this sense cannot be the fundamental theory. However, the author claims to have shown that if he introduces a 'scale invariance bounded from below' by measurement accuracy, then Tanimura's generalization of the Feynman proof as reconstructed by Dyson allows him to make a consistent classical theory for decoherent sources sinks. Restoring coherence to classical physics via relativistic action-at-a distance is left as a task for the future. Relativistic quantum mechanics, properly reconstructed from a finite and discrete basis, emerges in much better shape. The concept of 'particles has to be replaced by NO-YES particulate events, and particle-antiparticle pair creation and annihilation properly formulated

  18. Quasiperiodic transition to chaos in a plasma

    International Nuclear Information System (INIS)

    Weixing, D.; Huang Wei; Wang Xiaodong; Yu, C.X.

    1993-01-01

    The quasiperiodic transition to chaos in an undriven discharge plasma has been investigated. Results from the power spectrum and Lyapunov exponents quantitatively confirm the transition to chaos through quasiperiodicity. A low-dimension strange attractor has been found for this kind of plasma chaos

  19. Further discussion on chaos in duopoly games

    International Nuclear Information System (INIS)

    Lu, Tianxiu; Zhu, Peiyong

    2013-01-01

    In this paper, we study Li–Yorke chaos, distributional chaos in a sequence, Li–Yorke sensitivity, sensitivity and distributional chaos of two-dimensional dynamical system of the form Φ(x, y) = (f(y), g(x))

  20. Puzzles in studies of quantum chaos

    International Nuclear Information System (INIS)

    Xu Gongou

    1994-01-01

    Puzzles in studies of quantum chaos are discussed. From the view of global properties of quantum states, it is clarified that quantum chaos originates from the break-down of invariant properties of quantum canonical transformations. There exist precise correspondences between quantum and classical chaos

  1. Towards chaos criterion in quantum field theory

    OpenAIRE

    Kuvshinov, V. I.; Kuzmin, A. V.

    2002-01-01

    Chaos criterion for quantum field theory is proposed. Its correspondence with classical chaos criterion in semi-classical regime is shown. It is demonstrated for real scalar field that proposed chaos criterion can be used to investigate stability of classical solutions of field equations.

  2. Quantum chaos: statistical relaxation in discrete spectrum

    International Nuclear Information System (INIS)

    Chirikov, B.V.

    1990-01-01

    The controversial phenomenon of quantum chaos is discussed using the quantized standard map, or the kicked rotator, as a simple model. The relation to the classical dynamical chaos is tracked down on the basis of the correspondence principle. Several definitions of the quantum chaos are discussed. 27 refs

  3. Hastily Formed Networks-Chaos to Recovery

    Science.gov (United States)

    2015-09-01

    NETWORKS— CHAOS TO RECOVERY by Mark Arezzi September 2015 Thesis Co-Advisors: Douglas J. MacKinnon Brian Steckler THIS PAGE......systems to self-organize, adapt, and exert control over the chaos . Defining the role of communications requires an understanding of complexity, chaos

  4. Chaos in the atomic and subatomic world

    International Nuclear Information System (INIS)

    Nussenzveig, H.M.

    1992-01-01

    This work discusses the possibility of the existence of chaos in the quantum level. In the macroscopic scale, chaos can be explained by the use of classical mechanics. The problem is to know whether there is any manifestation of chaos in the evolution of a system following the quantum mechanical laws. (A.C.A.S.)

  5. 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

  6. Determination of the exact range of the value of the parameter corresponding to chaos based on the Silnikov criterion

    International Nuclear Information System (INIS)

    Wei-Yi, Li; Qi-Chang, Zhang; Wei, Wang

    2010-01-01

    Based on the Silnikov criterion, this paper studies a chaotic system of cubic polynomial ordinary differential equations in three dimensions. Using the Cardano formula, it obtains the exact range of the value of the parameter corresponding to chaos by means of the centre manifold theory and the method of multiple scales combined with Floque theory. By calculating the manifold near the equilibrium point, the series expression of the homoclinic orbit is also obtained. The space trajectory and Lyapunov exponent are investigated via numerical simulation, which shows that there is a route to chaos through period-doubling bifurcation and that chaotic attractors exist in the system. The results obtained here mean that chaos occurred in the exact range given in this paper. Numerical simulations also verify the analytical results. (general)

  7. 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

  8. 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 ...

  9. 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)

  10. 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.

  11. 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.

  12. 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

  13. 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 ...

  14. 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.

  15. Laguerre polynomials by a harmonic oscillator

    Science.gov (United States)

    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.

  16. 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)

  17. 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.

  18. Dual exponential polynomials and linear differential equations

    Science.gov (United States)

    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.

  19. Technique for image interpolation using polynomial transforms

    NARCIS (Netherlands)

    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

  20. Factoring polynomials over arbitrary finite fields

    NARCIS (Netherlands)

    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

  1. Application of polynomial preconditioners to conservation laws

    NARCIS (Netherlands)

    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

  2. !CHAOS: A cloud of controls

    International Nuclear Information System (INIS)

    Angius, S.; Bisegni, C.; Ciuffetti, P.

    2016-01-01

    The paper is aimed to present the !CHAOS open source project aimed to develop a prototype of a national private Cloud Computing infrastructure, devoted to accelerator control systems and large experiments of High Energy Physics (HEP). The !CHAOS project has been financed by MIUR (Italian Ministry of Research and Education) and aims to develop a new concept of control system and data acquisition framework by providing, with a high level of abstraction, all the services needed for controlling and managing a large scientific, or non-scientific, infrastructure. A beta version of the !CHAOS infrastructure will be released at the end of December 2015 and will run on private Cloud infrastructures based on OpenStack.

  3. !CHAOS: A cloud of controls

    Science.gov (United States)

    Angius, S.; Bisegni, C.; Ciuffetti, P.; Di Pirro, G.; Foggetta, L. G.; Galletti, F.; Gargana, R.; Gioscio, E.; Maselli, D.; Mazzitelli, G.; Michelotti, A.; Orrù, R.; Pistoni, M.; Spagnoli, F.; Spigone, D.; Stecchi, A.; Tonto, T.; Tota, M. A.; Catani, L.; Di Giulio, C.; Salina, G.; Buzzi, P.; Checcucci, B.; Lubrano, P.; Piccini, M.; Fattibene, E.; Michelotto, M.; Cavallaro, S. R.; Diana, B. F.; Enrico, F.; Pulvirenti, S.

    2016-01-01

    The paper is aimed to present the !CHAOS open source project aimed to develop a prototype of a national private Cloud Computing infrastructure, devoted to accelerator control systems and large experiments of High Energy Physics (HEP). The !CHAOS project has been financed by MIUR (Italian Ministry of Research and Education) and aims to develop a new concept of control system and data acquisition framework by providing, with a high level of aaabstraction, all the services needed for controlling and managing a large scientific, or non-scientific, infrastructure. A beta version of the !CHAOS infrastructure will be released at the end of December 2015 and will run on private Cloud infrastructures based on OpenStack.

  4. Order against chaos in nuclei

    International Nuclear Information System (INIS)

    Soloviev, V.G.

    1995-01-01

    Order and chaos and order-to-chaos transition are treated in terms of nuclear wave functions. A quasiparticle-phonon interaction is responsible for the fragmentation of one- and many-quasiparticle and phonon states and for the mixing of closely spaced states. Complete damping of one-quasiparticle states cannot be considered as a transition to chaos due to large many-quasiparticle or quasiparticle-phonon terms in their wave functions. An experimental investigation of the strength distribution of many-quasiparticle and quasiparticle-phonon states should uncover a new region of a regularity in nuclei at intermediate excitation energy. A chaotic behaviour of nuclear states can be shifted to higher excitation energies. ((orig.))

  5. On CFT and quantum chaos

    Energy Technology Data Exchange (ETDEWEB)

    Turiaci, Gustavo J. [Physics Department, Princeton University,Princeton NJ 08544 (United States); Verlinde, Herman [Physics Department, Princeton University,Princeton NJ 08544 (United States); Princeton Center for Theoretical Science, Princeton University,Princeton NJ 08544 (United States)

    2016-12-21

    We make three observations that help clarify the relation between CFT and quantum chaos. We show that any 1+1-D system in which conformal symmetry is non-linearly realized exhibits two main characteristics of chaos: maximal Lyapunov behavior and a spectrum of Ruelle resonances. We use this insight to identify a lattice model for quantum chaos, built from parafermionic spin variables with an equation of motion given by a Y-system. Finally we point to a relation between the spectrum of Ruelle resonances of a CFT and the analytic properties of OPE coefficients between light and heavy operators. In our model, this spectrum agrees with the quasi-normal modes of the BTZ black hole.

  6. Chaos, decoherence and quantum cosmology

    International Nuclear Information System (INIS)

    Calzetta, Esteban

    2012-01-01

    In this topical review we discuss the connections between chaos, decoherence and quantum cosmology. We understand chaos as classical chaos in systems with a finite number of degrees of freedom, decoherence as environment induced decoherence and quantum cosmology as the theory of the Wheeler-DeWitt equation or else the consistent history formulation thereof, first in mini super spaces and later through its extension to midi super spaces. The overall conclusion is that consideration of decoherence is necessary (and probably sufficient) to sustain an interpretation of quantum cosmology based on the wavefunction of the Universe adopting a Wentzel-Kramers-Brillouin form for large Universes, but a definitive account of the semiclassical transition in classically chaotic cosmological models is not available in the literature yet. (topical review)

  7. On CFT and quantum chaos

    International Nuclear Information System (INIS)

    Turiaci, Gustavo J.; Verlinde, Herman

    2016-01-01

    We make three observations that help clarify the relation between CFT and quantum chaos. We show that any 1+1-D system in which conformal symmetry is non-linearly realized exhibits two main characteristics of chaos: maximal Lyapunov behavior and a spectrum of Ruelle resonances. We use this insight to identify a lattice model for quantum chaos, built from parafermionic spin variables with an equation of motion given by a Y-system. Finally we point to a relation between the spectrum of Ruelle resonances of a CFT and the analytic properties of OPE coefficients between light and heavy operators. In our model, this spectrum agrees with the quasi-normal modes of the BTZ black hole.

  8. Nuclear spectroscopy and quantum chaos

    International Nuclear Information System (INIS)

    Sakata, Fumihiko; Marumori, Toshio; Hashimoto, Yukio; Yamamoto, Yoshifumi; Tsukuma, Hidehiko; Iwasawa, Kazuo.

    1990-05-01

    In this paper, a recent development of INS-TSUKUBA joint research project on large-amplitude collective motion is summerized. The classical theory of nuclear collective dynamics formulated within the time-dependent Hartree-Fock theory is recapitulated and decisive role of the level crossing in the single-particle dynamics on the order-to-chaos transition of collective motion is discussed in detail. Extending the basic idea of the classical theory, we discuss a quantum theory of nuclear collective dynamics which allows us to properly define a concept of quantum chaos for each eigenfunction. By using numerical calculation, we illustrate what the quantum chaos for each eigenfunction means and its relation to usual definition based on the random matrix theory. (author)

  9. On the number of polynomial solutions of Bernoulli and Abel polynomial differential equations

    Science.gov (United States)

    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.

  10. Matrix product formula for Macdonald polynomials

    Science.gov (United States)

    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.

  11. 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)

  12. 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.

  13. L'ordre du chaos

    CERN Document Server

    1989-01-01

    Le mouvement brownien ; la mémoire des atomes ; le chaos ; déterminisme et prédictabilité ; déterminisme et chaos ; les phénomènes de physique et les échelles de longueur ; un ordre caché dans la matière désordonnée ; les verres de spin et l'étude des milieux désordonnés ; la convection ; la croissance fractale ; la physique de la matière hétérogène ; la matière ultradivisée.

  14. Some new surprises in chaos.

    Science.gov (United States)

    Bunimovich, Leonid A; Vela-Arevalo, Luz V

    2015-09-01

    "Chaos is found in greatest abundance wherever order is being sought.It always defeats order, because it is better organized"Terry PratchettA brief review is presented of some recent findings in the theory of chaotic dynamics. We also prove a statement that could be naturally considered as a dual one to the Poincaré theorem on recurrences. Numerical results demonstrate that some parts of the phase space of chaotic systems are more likely to be visited earlier than other parts. A new class of chaotic focusing billiards is discussed that clearly violates the main condition considered to be necessary for chaos in focusing billiards.

  15. SOLUTION OF SINGULAR INTEGRAL EQUATION FOR ELASTICITY THEORY WITH THE HELP OF ASYMPTOTIC POLYNOMIAL FUNCTION

    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.

  16. 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.

  17. Quantification of margins and mixed uncertainties using evidence theory and stochastic expansions

    International Nuclear Information System (INIS)

    Shah, Harsheel; Hosder, Serhat; Winter, Tyler

    2015-01-01

    The objective of this paper is to implement Dempster–Shafer Theory of Evidence (DSTE) in the presence of mixed (aleatory and multiple sources of epistemic) uncertainty to the reliability and performance assessment of complex engineering systems through the use of quantification of margins and uncertainties (QMU) methodology. This study focuses on quantifying the simulation uncertainties, both in the design condition and the performance boundaries along with the determination of margins. To address the possibility of multiple sources and intervals for epistemic uncertainty characterization, DSTE is used for uncertainty quantification. An approach to incorporate aleatory uncertainty in Dempster–Shafer structures is presented by discretizing the aleatory variable distributions into sets of intervals. In view of excessive computational costs for large scale applications and repetitive simulations needed for DSTE analysis, a stochastic response surface based on point-collocation non-intrusive polynomial chaos (NIPC) has been implemented as the surrogate for the model response. The technique is demonstrated on a model problem with non-linear analytical functions representing the outputs and performance boundaries of two coupled systems. Finally, the QMU approach is demonstrated on a multi-disciplinary analysis of a high speed civil transport (HSCT). - Highlights: • Quantification of margins and uncertainties (QMU) methodology with evidence theory. • Treatment of both inherent and epistemic uncertainties within evidence theory. • Stochastic expansions for representation of performance metrics and boundaries. • Demonstration of QMU on an analytical problem. • QMU analysis applied to an aerospace system (high speed civil transport)

  18. 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.

  19. Distributional chaos for linear operators

    Czech Academy of Sciences Publication Activity Database

    Bernardes Jr., N.C.; Bonilla, A.; Müller, Vladimír; Peris, A.

    2013-01-01

    Roč. 265, č. 9 (2013), s. 2143-2163 ISSN 0022-1236 R&D Projects: GA ČR GA201/09/0473 Institutional support: RVO:67985840 Keywords : distributional chaos * hypercyclic operators * irregular vectors Subject RIV: BA - General Mathematics Impact factor: 1.152, year: 2013 http://www.sciencedirect.com/science/article/pii/S0022123613002450

  20. Solitons and chaos in plasma

    International Nuclear Information System (INIS)

    Ichikawa, Y.H.

    1990-09-01

    Plasma exhibits a full of variety of nonlinear phenomena. Active research in nonlinear plasma physics contributed to explore the concepts of soliton and chaos. Structure of soliton equations and dynamics of low dimensional Hamiltonian systems are discussed to emphasize the universality of these novel concepts in the wide branch of science and engineering. (author) 52 refs

  1. Chaos Theory and International Relations

    Science.gov (United States)

    2016-12-01

    King Oscar II 12 James E. Glenn, Chaos Theory: The Essentials for Military Applications (Newport, RI...Adolf Hitler in Germany, Alexander’s conquest of the Persian Empire, the arrival of Attila to Europe, the onset of the two Gulf Wars, the Arab Spring

  2. The Chaos Theory of Careers

    Science.gov (United States)

    Bright, Jim E. H.; Pryor, Robert G. L.

    2011-01-01

    The Chaos Theory of Careers (CTC; Pryor & Bright, 2011) construes both individuals and the contexts in which they develop their careers in terms of complex dynamical systems. Such systems perpetually operate under influences of stability and change both internally and in relation to each other. The CTC introduces new concepts to account for…

  3. On the Mechanisms Behind Chaos

    DEFF Research Database (Denmark)

    Lindberg, Erik

    2006-01-01

    behind the chaotic behavior, e.g. one group is based on the sudden interrupt of inductive currents, another group is based on the sudden parallel coupling of capacitors with different voltages, and a third group may be based on multiplication of signals. An example of chaos based on disturbance...

  4. Chaos in the Solar System

    Science.gov (United States)

    Lecar, Myron; Franklin, Fred A.; Holman, Matthew J.; Murray, Norman J.

    2001-01-01

    The physical basis of chaos in the solar system is now better understood: In all cases investigated so far, chaotic orbits result from overlapping resonances. Perhaps the clearest examples are found in the asteroid belt. Overlapping resonances account for its kirkwood gaps and were used to predict and find evidence for very narrow gaps in the outer belt. Further afield, about one new "short-peroid" comet is discovered each year. They are believed to come from the "Kuiper Belt" (at 40 AU or more) via chaotic orbits produced by mean-motion and secular resonances with Neptune. Finally, the planetary system itself is not immune from chaos. In the inner solar system, overlapping secular resonances have been identified as the possible source of chaos. For example, Mercury in 1012 years, may suffer a close encounter with Venus or plunge into the Sun. In the outer solar system, three-body resonances have been identified as a source of chaos, but on an even longer time scale of 109 times the age of the solar system. On the human time scale, the planets do follow their orbits in a stately procession, and we can predict their trajectories for hundreds of thousands of years. That is because the mavericks, with shorter instability times, have long since been ejected. The solar system is not stable; it is just old!

  5. Chaos and remedial investigations

    International Nuclear Information System (INIS)

    Galbraith, R.M.

    1991-01-01

    Current research into the nature of chaos indicates that even for systems that are well known and easily modeled, slight changes in the scale used to measure the input have unpredictable results in the model output. The conduct of a remedial investigation (RI) is dictated by well-established rules of investigation and management, yet small changes in project orientation, regulatory environment, or site conditions have unpredictable consequences to the project. The consequences can lead to either brilliant success or utter failure. The chaotic effect of a change in scale is most often illustrated by an exercise in measuring the length of the coast of Great Britain. If a straight ruler 10-kilometers long is used, the sum of the 10-kilometer increments gives the length of the coast. If the ruler is changed to five kilometers long and the exercise is repeated, the sum of the five-kilometer increments will not be the same as the sum of the 10-kilometer increments. Nor is there a way to predict what the length of the coast will be using any other scale. Several examples from the Fernald Project RI are used to illustrate open-quotes changes in scaleclose quotes in both technical and management situations. Given that there is no way to predict the outcome of scale changes in a RI, technical and project management must be alert to the fact that a scale has changed and the investigation is no longer on the path it was thought to be on. The key to success, therefore, is to develop specific units of measure for a number of activities, in addition to cost and schedule, and track them regularly. An example for tracking a portion of the field investigation is presented. The determination of effective units of measure is perhaps the most difficult aspect of any project. Changes in scale sometimes go unnoticed until suddenly the budget is expended and only a portion of the work is completed. Remedial investigations on large facilities provide new and complex challenges

  6. 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.

  7. Hamiltonian Chaos and Fractional Dynamics

    International Nuclear Information System (INIS)

    Combescure, M

    2005-01-01

    This book provides an introduction and discussion of the main issues in the current understanding of classical Hamiltonian chaos, and of its fractional space-time structure. It also develops the most complex and open problems in this context, and provides a set of possible applications of these notions to some fundamental questions of dynamics: complexity and entropy of systems, foundation of classical statistical physics on the basis of chaos theory, and so on. Starting with an introduction of the basic principles of the Hamiltonian theory of chaos, the book covers many topics that can be found elsewhere in the literature, but which are collected here for the readers' convenience. In the last three parts, the author develops topics which are not typically included in the standard textbooks; among them are: - the failure of the traditional description of chaotic dynamics in terms of diffusion equations; - he fractional kinematics, its foundation and renormalization group analysis; - 'pseudo-chaos', i.e. kinetics of systems with weak mixing and zero Lyapunov exponents; - directional complexity and entropy. The purpose of this book is to provide researchers and students in physics, mathematics and engineering with an overview of many aspects of chaos and fractality in Hamiltonian dynamical systems. In my opinion it achieves this aim, at least provided researchers and students (mainly those involved in mathematical physics) can complement this reading with comprehensive material from more specialized sources which are provided as references and 'further reading'. Each section contains introductory pedagogical material, often illustrated by figures coming from several numerical simulations which give the feeling of what's going on, and thus is very useful to the reader who is not very familiar with the topics presented. Some problems are included at the end of most sections to help the reader to go deeper into the subject. My one regret is that the book does not

  8. 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.)

  9. Multilevel weighted least squares polynomial approximation

    KAUST Repository

    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

  10. Polynomials in finite geometries and combinatorics

    NARCIS (Netherlands)

    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.

  11. Polynomial analysis of ambulatory blood pressure measurements

    NARCIS (Netherlands)

    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

  12. Handbook on semidefinite, conic and polynomial optimization

    CERN Document Server

    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.

  13. 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...

  14. Generalized catalan numbers, sequences and polynomials

    OpenAIRE

    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.

  15. Schur Stability Regions for Complex Quadratic Polynomials

    Science.gov (United States)

    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.)

  16. About the solvability of matrix polynomial equations

    OpenAIRE

    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.

  17. Two polynomial representations of experimental design

    OpenAIRE

    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.

  18. 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

  19. Modeling Uncertainty in Steady State Diffusion Problems via Generalized Polynomial Chaos

    National Research Council Canada - National Science Library

    Xiu, Dongbin; Karniadakis, George E

    2002-01-01

    ...). A Galerkin projection in random space is applied to derive the equations in the weak form. The resulting set of deterministic equations for each random mode is solved iteratively by a block Gauss-Seidel iteration technique...

  20. Stochastic Uncertainty Quantification of Eddy Currents in the Human Body by Polynomial Chaos Decomposition

    OpenAIRE

    Gaignaire , Roman; Scorretti , Riccardo; Sabariego , Ruth ,; Geuzaine , Christophe

    2011-01-01

    The finite element method can be used to compute the electromagnetic fields induced in the human body by environmental extremely low frequency (ELF) fields. However, the electric properties of tissues are not precisely known and may vary depending on the individual, his/her age and other physiological parameters. In this paper, we account for the uncertainties on the conductivities of the brain tissues and spread them out to the induced fields by means of a nonintrusive approach based on Herm...

  1. Meaning Finds a Way: Chaos (Theory) and Composition

    Science.gov (United States)

    Kyburz, Bonnie Lenore

    2004-01-01

    The explanatory power provided by the chaos theory is explored. A dynamic and reciprocal relationship between culture and chaos theory indicates that the progressive cultural work may be formed by the cross-disciplinary resonance of chaos theory.

  2. Chaos, Chaos Control and Synchronization of a Gyrostat System

    Science.gov (United States)

    GE, Z.-M.; LIN, T.-N.

    2002-03-01

    The dynamic behavior of a gyrostat system subjected to external disturbance is studied in this paper. By applying numerical results, phase diagrams, power spectrum, period-T maps, and Lyapunov exponents are presented to observe periodic and choatic motions. The effect of the parameters changed in the system can be found in the bifurcation and parametric diagrams. For global analysis, the basins of attraction of each attractor of the system are located by employing the modified interpolated cell mapping (MICM) method. Several methods, the delayed feedback control, the addition of constant torque, the addition of periodic force, the addition of periodic impulse torque, injection of dither signal control, adaptive control algorithm (ACA) control and bang-bang control are used to control chaos effectively. Finally, synchronization of chaos in the gyrostat system is studied.

  3. Stability analysis of polynomial fuzzy models via polynomial fuzzy Lyapunov functions

    OpenAIRE

    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...

  4. 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)

  5. Does chaos assist localization or delocalization?

    Science.gov (United States)

    Tan, Jintao; Lu, Gengbiao; Luo, Yunrong; Hai, Wenhua

    2014-12-01

    We aim at a long-standing contradiction between chaos-assisted tunneling and chaos-related localization study quantum transport of a single particle held in an amplitude-modulated and tilted optical lattice. We find some near-resonant regions crossing chaotic and regular regions in the parameter space, and demonstrate that chaos can heighten velocity of delocalization in the chaos-resonance overlapping regions, while chaos may aid localization in the other chaotic regions. The degree of localization enhances with increasing the distance between parameter points and near-resonant regions. The results could be useful for experimentally manipulating chaos-assisted transport of single particles in optical or solid-state lattices.

  6. Advances in chaos theory and intelligent control

    CERN Document Server

    Vaidyanathan, Sundarapandian

    2016-01-01

    The book reports on the latest advances in and applications of chaos theory and intelligent control. Written by eminent scientists and active researchers and using a clear, matter-of-fact style, it covers advanced theories, methods, and applications in a variety of research areas, and explains key concepts in modeling, analysis, and control of chaotic and hyperchaotic systems. Topics include fractional chaotic systems, chaos control, chaos synchronization, memristors, jerk circuits, chaotic systems with hidden attractors, mechanical and biological chaos, and circuit realization of chaotic systems. The book further covers fuzzy logic controllers, evolutionary algorithms, swarm intelligence, and petri nets among other topics. Not only does it provide the readers with chaos fundamentals and intelligent control-based algorithms; it also discusses key applications of chaos as well as multidisciplinary solutions developed via intelligent control. The book is a timely and comprehensive reference guide for graduate s...

  7. Relations between Möbius and coboundary polynomials

    NARCIS (Netherlands)

    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

  8. Quantum chaos: diffusion photoeffect in hydrogen

    Energy Technology Data Exchange (ETDEWEB)

    Shepelyanskij, D L

    1987-05-01

    Ionization process in highly excited hydrogen atom in electromagnetic field is presented in the form of an extraordinary photoeffect, in which ionization at the frequency, being much lower than ionization energy, occurs much quicker than single-photon one. Such a quick ionization is explained by dynamic chaos occurence. Question, related to quantum effect influence on chaotic movement of the electron (quantum chaos) is considered. Electron excitation in the chaos area is described by a diffusional equation.

  9. Discursive Maps at the Edge of Chaos

    Science.gov (United States)

    2017-05-25

    Discursive Maps at the Edge of Chaos A Monograph by Major Mathieu Primeau Canadian Army, Royal Canadian Engineer School of Advanced Military...Master’s Thesis 3. DATES COVERED (From - To) JUN 2016 – MAY 2017 4. TITLE AND SUBTITLE Discursive Maps at the Edge of Chaos 5a. CONTRACT NUMBER 5b...meaning of boundaries and polarize conflict towards violence. The edge of chaos is the fine line between disorder and coherence. Discursive maps

  10. On rational classical orthogonal polynomials and their application for explicit computation of inverse Laplace transforms

    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.

  11. Thermal expansion

    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)

  12. Controlling Mackey-Glass chaos

    Science.gov (United States)

    Kiss, Gábor; Röst, Gergely

    2017-11-01

    The Mackey-Glass equation is the representative example of delay induced chaotic behavior. Here, we propose various control mechanisms so that otherwise erratic solutions are forced to converge to the positive equilibrium or to a periodic orbit oscillating around that equilibrium. We take advantage of some recent results of the delay differential literature, when a sufficiently large domain of the phase space has been shown to be attractive and invariant, where the system is governed by monotone delayed feedback and chaos is not possible due to some Poincaré-Bendixson type results. We systematically investigate what control mechanisms are suitable to drive the system into such a situation and prove that constant perturbation, proportional feedback control, Pyragas control, and state dependent delay control can all be efficient to control Mackey-Glass chaos with properly chosen control parameters.

  13. A quantum correction to chaos

    Energy Technology Data Exchange (ETDEWEB)

    Fitzpatrick, A. Liam [Department of Physics, Boston University,590 Commonwealth Avenue, Boston, MA 02215 (United States); Kaplan, Jared [Department of Physics and Astronomy, Johns Hopkins University,3400 N. Charles St, Baltimore, MD 21218 (United States)

    2016-05-12

    We use results on Virasoro conformal blocks to study chaotic dynamics in CFT{sub 2} at large central charge c. The Lyapunov exponent λ{sub L}, which is a diagnostic for the early onset of chaos, receives 1/c corrections that may be interpreted as λ{sub L}=((2π)/β)(1+(12/c)). However, out of time order correlators receive other equally important 1/c suppressed contributions that do not have such a simple interpretation. We revisit the proof of a bound on λ{sub L} that emerges at large c, focusing on CFT{sub 2} and explaining why our results do not conflict with the analysis leading to the bound. We also comment on relationships between chaos, scattering, causality, and bulk locality.

  14. Spatiotemporal chaos from bursting dynamics

    International Nuclear Information System (INIS)

    Berenstein, Igal; De Decker, Yannick

    2015-01-01

    In this paper, we study the emergence of spatiotemporal chaos from mixed-mode oscillations, by using an extended Oregonator model. We show that bursting dynamics consisting of fast/slow mixed mode oscillations along a single attractor can lead to spatiotemporal chaotic dynamics, although the spatially homogeneous solution is itself non-chaotic. This behavior is observed far from the Hopf bifurcation and takes the form of a spatiotemporal intermittency where the system locally alternates between the fast and the slow phases of the mixed mode oscillations. We expect this form of spatiotemporal chaos to be generic for models in which one or several slow variables are coupled to activator-inhibitor type of oscillators

  15. A quantum correction to chaos

    International Nuclear Information System (INIS)

    Fitzpatrick, A. Liam; Kaplan, Jared

    2016-01-01

    We use results on Virasoro conformal blocks to study chaotic dynamics in CFT_2 at large central charge c. The Lyapunov exponent λ_L, which is a diagnostic for the early onset of chaos, receives 1/c corrections that may be interpreted as λ_L=((2π)/β)(1+(12/c)). However, out of time order correlators receive other equally important 1/c suppressed contributions that do not have such a simple interpretation. We revisit the proof of a bound on λ_L that emerges at large c, focusing on CFT_2 and explaining why our results do not conflict with the analysis leading to the bound. We also comment on relationships between chaos, scattering, causality, and bulk locality.

  16. A history of chaos theory.

    Science.gov (United States)

    Oestreicher, Christian

    2007-01-01

    Whether every effect can be precisely linked to a given cause or to a list of causes has been a matter of debate for centuries, particularly during the 17th century, when astronomers became capable of predicting the trajectories of planets. Recent mathematical models applied to physics have included the idea that given phenomena cannot be predicted precisely, although they can be predicted to some extent, in line with the chaos theory. Concepts such as deterministic models, sensitivity to initial conditions, strange attractors, and fractal dimensions are inherent to the development of this theory A few situations involving normal or abnormal endogenous rhythms in biology have been analyzed following the principles of chaos theory. This is particularly the case with cardiac arrhythmias, but less so with biological clocks and circadian rhythms.

  17. Magnetic field induced dynamical chaos.

    Science.gov (United States)

    Ray, Somrita; Baura, Alendu; Bag, Bidhan Chandra

    2013-12-01

    In this article, we have studied the dynamics of a particle having charge in the presence of a magnetic field. The motion of the particle is confined in the x-y plane under a two dimensional nonlinear potential. We have shown that constant magnetic field induced dynamical chaos is possible even for a force which is derived from a simple potential. For a given strength of the magnetic field, initial position, and velocity of the particle, the dynamics may be regular, but it may become chaotic when the field is time dependent. Chaotic dynamics is very often if the field is time dependent. Origin of chaos has been explored using the Hamiltonian function of the dynamics in terms of action and angle variables. Applicability of the present study has been discussed with a few examples.

  18. Controlling Mackey-Glass chaos.

    Science.gov (United States)

    Kiss, Gábor; Röst, Gergely

    2017-11-01

    The Mackey-Glass equation is the representative example of delay induced chaotic behavior. Here, we propose various control mechanisms so that otherwise erratic solutions are forced to converge to the positive equilibrium or to a periodic orbit oscillating around that equilibrium. We take advantage of some recent results of the delay differential literature, when a sufficiently large domain of the phase space has been shown to be attractive and invariant, where the system is governed by monotone delayed feedback and chaos is not possible due to some Poincaré-Bendixson type results. We systematically investigate what control mechanisms are suitable to drive the system into such a situation and prove that constant perturbation, proportional feedback control, Pyragas control, and state dependent delay control can all be efficient to control Mackey-Glass chaos with properly chosen control parameters.

  19. A history of chaos theory

    Science.gov (United States)

    Oestreicher, Christian

    2007-01-01

    Whether every effect can be precisely linked to a given cause or to a list of causes has been a matter of debate for centuries, particularly during the 17th century when astronomers became capable of predicting the trajectories of planets. Recent mathematical models applied to physics have included the idea that given phenomena cannot be predicted precisely although they can be predicted to some extent in line with the chaos theory Concepts such as deterministic models, sensitivity to initial conditions, strange attractors, and fractal dimensions are inherent to the development of this theory, A few situations involving normal or abnormal endogenous rhythms in biology have been analyzed following the principles of chaos theory This is particularly the case with cardiac arrhythmias, but less so with biological clocks and circadian rhythms. PMID:17969865

  20. On the definition of 'chaos'

    International Nuclear Information System (INIS)

    Kolesov, Andrei Yu; Rozov, Nikolai Kh

    2009-01-01

    A new definition of a chaotic invariant set is given for a continuous semiflow in a metric space. It generalizes the well-known definition due to Devaney and allows one to take into account a special feature occurring in the non-compact infinite-dimensional case: so-called turbulent chaos. The paper consists of two sections. The first contains several well-known facts from chaotic dynamics, together with new definitions and results. The second presents a concrete example demonstrating that our definition of chaos is meaningful. Namely, an infinite-dimensional system of ordinary differential equations is investigated having an attractor that is chaotic in the sense of the new definition but not in the sense of Devaney or Knudsen. Bibliography: 65 titles.

  1. PHASE CHAOS IN THE DISCRETE KURAMOTO MODEL

    DEFF Research Database (Denmark)

    Maistrenko, V.; Vasylenko, A.; Maistrenko, Y.

    2010-01-01

    The paper describes the appearance of a novel, high-dimensional chaotic regime, called phase chaos, in a time-discrete Kuramoto model of globally coupled phase oscillators. This type of chaos is observed at small and intermediate values of the coupling strength. It arises from the nonlinear...... interaction among the oscillators, while the individual oscillators behave periodically when left uncoupled. For the four-dimensional time-discrete Kuramoto model, we outline the region of phase chaos in the parameter plane and determine the regions where phase chaos coexists with different periodic...

  2. The CHAOS-4 geomagnetic field model

    DEFF Research Database (Denmark)

    Olsen, Nils; Lühr, H.; Finlay, Chris

    2014-01-01

    We present CHAOS-4, a new version in the CHAOS model series, which aims to describe the Earth's magnetic field with high spatial and temporal resolution. Terms up to spherical degree of at least n = 85 for the lithospheric field, and up to n = 16 for the time-varying core field are robustly...... to the core field, but the high-degree lithospheric field is regularized for n > 85. CHAOS-4 model is derived by merging two submodels: its low-degree part has been derived using similar model parametrization and data sets as used for previous CHAOS models (but of course including more recent data), while its...

  3. The CHAOS-4 Geomagnetic Field Model

    DEFF Research Database (Denmark)

    Olsen, Nils; Finlay, Chris; Lühr, H.

    We present CHAOS-4, a new version in the CHAOS model series, which aims at describing the Earth's magnetic field with high spatial resolution (terms up to spherical degree n=90 for the crustal field, and up to n=16 for the time-varying core field are robustly determined) and high temporal...... between the coordinate systems of the vector magnetometer and of the star sensor providing attitude information). The final CHAOS-4 model is derived by merging two sub-models: its low-degree part has been obtained using similar model parameterization and data sets as used for previous CHAOS models (but...

  4. A quantum harmonic oscillator and strong chaos

    International Nuclear Information System (INIS)

    Oprocha, Piotr

    2006-01-01

    It is known that many physical systems which do not exhibit deterministic chaos when treated classically may exhibit such behaviour if treated from the quantum mechanics point of view. In this paper, we will show that an annihilation operator of the unforced quantum harmonic oscillator exhibits distributional chaos as introduced in B Schweizer and J SmItal (1994 Trans. Am. Math. Soc. 344 737-54). Our approach strengthens previous results on chaos in this model and provides a very powerful tool to measure chaos in other (quantum or classical) models

  5. The chaos cookbook a practical programming guide

    CERN Document Server

    Pritchard, Joe

    2014-01-01

    The Chaos Cookbook: A Practical Programming Guide discusses the use of chaos in computer programming. The book is comprised of 11 chapters that tackle various topics relevant to chaos and programming. Chapter 1 reviews the concept of chaos, and Chapter 2 discusses the iterative functions. Chapters 3 and 4 cover differential and Lorenz equations. Chapter 5 talks about strange attractors, while Chapter 6 deals with the fractal link. The book also discusses the Mandelbrot set, and then covers the Julia sets. The other fractal systems and the cellular automata are also explained. The last chapter

  6. Chaos in a complex plasma

    International Nuclear Information System (INIS)

    Sheridan, T.E.

    2005-01-01

    Chaotic dynamics is observed experimentally in a complex (dusty) plasma of three particles. A low-frequency sinusoidal modulation of the plasma density excites both the center-of-mass and breathing modes. Low-dimensional chaos is seen for a 1:2 resonance between these modes. A strange attractor with a dimension of 2.48±0.05 is observed. The largest Lyapunov exponent is positive

  7. Chaos, complexity, and random matrices

    Science.gov (United States)

    Cotler, Jordan; Hunter-Jones, Nicholas; Liu, Junyu; Yoshida, Beni

    2017-11-01

    Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically compute out-of-time-ordered correlation functions (OTOCs) and frame potentials to quantify scrambling, Haar-randomness, and circuit complexity. While our random matrix analysis gives a qualitatively correct prediction of the late-time behavior of chaotic systems, we find unphysical behavior at early times including an O(1) scrambling time and the apparent breakdown of spatial and temporal locality. The salient feature of GUE Hamiltonians which gives us computational traction is the Haar-invariance of the ensemble, meaning that the ensemble-averaged dynamics look the same in any basis. Motivated by this property of the GUE, we introduce k-invariance as a precise definition of what it means for the dynamics of a quantum system to be described by random matrix theory. We envision that the dynamical onset of approximate k-invariance will be a useful tool for capturing the transition from early-time chaos, as seen by OTOCs, to late-time chaos, as seen by random matrix theory.

  8. Model for Shock Wave Chaos

    KAUST Repository

    Kasimov, Aslan R.

    2013-03-08

    We propose the following model equation, ut+1/2(u2−uus)x=f(x,us) that predicts chaotic shock waves, similar to those in detonations in chemically reacting mixtures. The equation is given on the half line, x<0, and the shock is located at x=0 for any t≥0. Here, us(t) is the shock state and the source term f is taken to mimic the chemical energy release in detonations. This equation retains the essential physics needed to reproduce many properties of detonations in gaseous reactive mixtures: steady traveling wave solutions, instability of such solutions, and the onset of chaos. Our model is the first (to our knowledge) to describe chaos in shock waves by a scalar first-order partial differential equation. The chaos arises in the equation thanks to an interplay between the nonlinearity of the inviscid Burgers equation and a novel forcing term that is nonlocal in nature and has deep physical roots in reactive Euler equations.

  9. 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.

  10. 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.

  11. 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.

  12. Wilson polynomials/functions and intertwining operators for the generic quantum superintegrable system on the 2-sphere

    Science.gov (United States)

    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.

  13. Wilson polynomials/functions and intertwining operators for the generic quantum superintegrable system on the 2-sphere

    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)

  14. Uncertainty Analysis via Failure Domain Characterization: Polynomial Requirement Functions

    Science.gov (United States)

    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.

  15. 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

  16. Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials

    KAUST Repository

    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.

  17. 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.].

  18. Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials

    KAUST Repository

    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.

  19. Discrete-time state estimation for stochastic polynomial systems over polynomial observations

    Science.gov (United States)

    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.

  20. Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach

    Science.gov (United States)

    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.

  1. 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)

  2. 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

  3. Multilevel weighted least squares polynomial approximation

    KAUST Repository

    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.

  4. 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...

  5. A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption

    Energy Technology Data Exchange (ETDEWEB)

    Yang, Xiuping, E-mail: yangxiuping-1990@163.com; Min, Lequan, E-mail: minlequan@sina.com; Wang, Xue, E-mail: wangxue-20130818@163.com [Schools of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083 (China)

    2015-05-15

    This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.

  6. A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption.

    Science.gov (United States)

    Yang, Xiuping; Min, Lequan; Wang, Xue

    2015-05-01

    This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2(1345). As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.

  7. Hermite Polynomials and the Inverse Problem for Collisionless Equilibria

    Science.gov (United States)

    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

  8. 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.

  9. Fast beampattern evaluation by polynomial rooting

    Science.gov (United States)

    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.

  10. Chaos desynchronization in strongly coupled systems

    International Nuclear Information System (INIS)

    Wu Ye; Liu Weiqing; Xiao, Jinghua; Zhan Meng

    2007-01-01

    The dynamics of chaos desynchronization in strongly coupled oscillator systems is studied. We find a new bifurcation from synchronous chaotic state, chaotic short wave bifurcation, i.e. a chaotic desynchronization attractor is new born in the systems due to chaos desynchronization. In comparison with the usual periodic short wave bifurcation, very rich but distinct phenomena are observed

  11. Galloping instability to chaos of cables

    CERN Document Server

    Luo, Albert C J

    2017-01-01

    This book provides students and researchers with a systematic solution for fluid-induced structural vibrations, galloping instability and the chaos of cables. They will also gain a better understanding of stable and unstable periodic motions and chaos in fluid-induced structural vibrations. Further, the results presented here will help engineers effectively design and analyze fluid-induced vibrations.

  12. Chaos and fractals. Applications to nuclear engineering

    International Nuclear Information System (INIS)

    Clausse, A.; Delmastro, D.F.

    1990-01-01

    This work presents a description of the research lines carried out by the authors on chaos and fractal theories, oriented to the nuclear field. The possibilities that appear in the nuclear security branch where the information deriving from chaos and fractal techniques may help to the development of better criteria and more reliable designs, are of special importance. (Author) [es

  13. 4th international interdisciplinary chaos symposium

    CERN Document Server

    Banerjee, Santo; Caglar, Suleyman; Ozer, Mehmet; Chaos and complex systems

    2013-01-01

    Complexity Science and Chaos Theory are fascinating areas of scientific research with wide-ranging applications.  The interdisciplinary nature and ubiquity of complexity and chaos are features that provides scientists with a motivation to pursue general theoretical tools and frameworks. Complex systems give rise to emergent behaviors, which in turn produce novel and interesting phenomena in science, engineering, as well as in the socio-economic sciences. The aim of all Symposia on Chaos and Complex Systems (CCS) is to bring together scientists, engineers, economists and social scientists, and to discuss the latest insights and results obtained in the area of corresponding nonlinear-system complex (chaotic) behavior. Especially for the “4th International Interdisciplinary Chaos Symposium on Chaos and Complex Systems,” which took place April 29th to May 2nd, 2012 in Antalya, Turkey, the scope of the symposium had been further enlarged so as to encompass the presentation of work from circuits to econophysic...

  14. Chaos the science of predictable random motion

    CERN Document Server

    Kautz, Richard

    2011-01-01

    Based on only elementary mathematics, this engaging account of chaos theory bridges the gap between introductions for the layman and college-level texts. It develops the science of dynamics in terms of small time steps, describes the phenomenon of chaos through simple examples, and concludes with a close look at a homoclinic tangle, the mathematical monster at the heart of chaos. The presentation is enhanced by many figures, animations of chaotic motion (available on a companion CD), and biographical sketches of the pioneers of dynamics and chaos theory. To ensure accessibility to motivated high school students, care has been taken to explain advanced mathematical concepts simply, including exponentials and logarithms, probability, correlation, frequency analysis, fractals, and transfinite numbers. These tools help to resolve the intriguing paradox of motion that is predictable and yet random, while the final chapter explores the various ways chaos theory has been put to practical use.

  15. Semiconductor Lasers Stability, Instability and Chaos

    CERN Document Server

    Ohtsubo, Junji

    2013-01-01

    This third edition of “Semiconductor Lasers, Stability, Instability and Chaos” was significantly extended.  In the previous edition, the dynamics and characteristics of chaos in semiconductor lasers after the introduction of the fundamental theory of laser chaos and chaotic dynamics induced by self-optical feedback and optical injection was discussed. Semiconductor lasers with new device structures, such as vertical-cavity surface-emitting lasers and broad-area semiconductor lasers, are interesting devices from the viewpoint of chaotic dynamics since they essentially involve chaotic dynamics even in their free-running oscillations. These topics are also treated with respect to the new developments in the current edition. Also the control of such instabilities and chaos control are critical issues for applications. Another interesting and important issue of semiconductor laser chaos in this third edition is chaos synchronization between two lasers and the application to optical secure communication. One o...

  16. Scaling of chaos in strongly nonlinear lattices.

    Science.gov (United States)

    Mulansky, Mario

    2014-06-01

    Although it is now understood that chaos in complex classical systems is the foundation of thermodynamic behavior, the detailed relations between the microscopic properties of the chaotic dynamics and the macroscopic thermodynamic observations still remain mostly in the dark. In this work, we numerically analyze the probability of chaos in strongly nonlinear Hamiltonian systems and find different scaling properties depending on the nonlinear structure of the model. We argue that these different scaling laws of chaos have definite consequences for the macroscopic diffusive behavior, as chaos is the microscopic mechanism of diffusion. This is compared with previous results on chaotic diffusion [M. Mulansky and A. Pikovsky, New J. Phys. 15, 053015 (2013)], and a relation between microscopic chaos and macroscopic diffusion is established.

  17. 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...

  18. 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....

  19. 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....

  20. 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.

  1. 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.

  2. Chaos and bifurcations in periodic windows observed in plasmas

    International Nuclear Information System (INIS)

    Qin, J.; Wang, L.; Yuan, D.P.; Gao, P.; Zhang, B.Z.

    1989-01-01

    We report the experimental observations of deterministic chaos in a steady-state plasma which is not driven by any extra periodic forces. Two routes to chaos have been found, period-doubling and intermittent chaos. The fine structures in chaos such as periodic windows and bifurcations in windows have also been observed

  3. Prediction based chaos control via a new neural network

    International Nuclear Information System (INIS)

    Shen Liqun; Wang Mao; Liu Wanyu; Sun Guanghui

    2008-01-01

    In this Letter, a new chaos control scheme based on chaos prediction is proposed. To perform chaos prediction, a new neural network architecture for complex nonlinear approximation is proposed. And the difficulty in building and training the neural network is also reduced. Simulation results of Logistic map and Lorenz system show the effectiveness of the proposed chaos control scheme and the proposed neural network

  4. Homoclinic tubes and chaos in perturbed sine-Gordon equation

    International Nuclear Information System (INIS)

    Li, Y. Charles

    2004-01-01

    Sine-Gordon equation under a quasi-periodic perturbation or a chaotic perturbation is studied. Existence of a homoclinic tube is proved. Established are chaos associated with the homoclinic tube, and 'chaos cascade' referring to the embeddings of smaller scale chaos in larger scale chaos

  5. Moments expansion densities for quantifying financial risk

    OpenAIRE

    Ñí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...

  6. 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)

  7. Model for shock wave chaos.

    Science.gov (United States)

    Kasimov, Aslan R; Faria, Luiz M; Rosales, Rodolfo R

    2013-03-08

    We propose the following model equation, u(t) + 1/2(u(2)-uu(s))x = f(x,u(s)) that predicts chaotic shock waves, similar to those in detonations in chemically reacting mixtures. The equation is given on the half line, xorder partial differential equation. The chaos arises in the equation thanks to an interplay between the nonlinearity of the inviscid Burgers equation and a novel forcing term that is nonlocal in nature and has deep physical roots in reactive Euler equations.

  8. Chaos control in duffing system

    International Nuclear Information System (INIS)

    Wang Ruiqi; Deng Jin; Jing Zhujun

    2006-01-01

    Analytical and numerical results concerning the inhibition of chaos in Duffing's equation with two weak forcing excitations are presented. We theoretically give parameter-space regions by using Melnikov's function, where chaotic states can be suppressed. The intervals of initial phase difference between the two excitations for which chaotic dynamics can be eliminated are given. Meanwhile, the influence of the phase difference on Lyapunov exponents for different frequencies is investigated. Numerical simulation results show the consistence with the theoretical analysis and the chaotic motions can be controlled to period-motions by adjusting parameter of suppressing excitation

  9. Deterministic chaos in entangled eigenstates

    Science.gov (United States)

    Schlegel, K. G.; Förster, S.

    2008-05-01

    We investigate the problem of deterministic chaos in connection with entangled states using the Bohmian formulation of quantum mechanics. We show for a two particle system in a harmonic oscillator potential, that in a case of entanglement and three energy eigen-values the maximum Lyapunov-parameters of a representative ensemble of trajectories for large times develops to a narrow positive distribution, which indicates nearly complete chaotic dynamics. We also present in short results from two time-dependent systems, the anisotropic and the Rabi oscillator.

  10. Deterministic chaos in entangled eigenstates

    Energy Technology Data Exchange (ETDEWEB)

    Schlegel, K.G. [Fakultaet fuer Physik, Universitaet Bielefeld, Postfach 100131, D-33501 Bielefeld (Germany)], E-mail: guenter.schlegel@arcor.de; Foerster, S. [Fakultaet fuer Physik, Universitaet Bielefeld, Postfach 100131, D-33501 Bielefeld (Germany)

    2008-05-12

    We investigate the problem of deterministic chaos in connection with entangled states using the Bohmian formulation of quantum mechanics. We show for a two particle system in a harmonic oscillator potential, that in a case of entanglement and three energy eigen-values the maximum Lyapunov-parameters of a representative ensemble of trajectories for large times develops to a narrow positive distribution, which indicates nearly complete chaotic dynamics. We also present in short results from two time-dependent systems, the anisotropic and the Rabi oscillator.

  11. Deterministic chaos in entangled eigenstates

    International Nuclear Information System (INIS)

    Schlegel, K.G.; Foerster, S.

    2008-01-01

    We investigate the problem of deterministic chaos in connection with entangled states using the Bohmian formulation of quantum mechanics. We show for a two particle system in a harmonic oscillator potential, that in a case of entanglement and three energy eigen-values the maximum Lyapunov-parameters of a representative ensemble of trajectories for large times develops to a narrow positive distribution, which indicates nearly complete chaotic dynamics. We also present in short results from two time-dependent systems, the anisotropic and the Rabi oscillator

  12. Decoherence, determinism and chaos revisited

    Energy Technology Data Exchange (ETDEWEB)

    Noyes, H.P.

    1994-11-15

    We suggest that the derivation of the free space Maxwell Equations for classical electromagnetism, using a discrete ordered calculus developed by L.H. Kauffman and T. Etter, necessarily pushes the discussion of determinism in natural science down to the level of relativistic quantum mechanics and hence renders the mathematical phenomena studied in deterministic chaos research irrelevant to the question of whether the world investigated by physics is deterministic. We believe that this argument reinforces Suppes` contention that the issue of determinism versus indeterminism should be viewed as a Kantian antinomy incapable of investigation using currently available scientific tools.

  13. Decoherence, determinism and chaos revisited

    International Nuclear Information System (INIS)

    Noyes, H.P.

    1994-01-01

    We suggest that the derivation of the free space Maxwell Equations for classical electromagnetism, using a discrete ordered calculus developed by L.H. Kauffman and T. Etter, necessarily pushes the discussion of determinism in natural science down to the level of relativistic quantum mechanics and hence renders the mathematical phenomena studied in deterministic chaos research irrelevant to the question of whether the world investigated by physics is deterministic. We believe that this argument reinforces Suppes' contention that the issue of determinism versus indeterminism should be viewed as a Kantian antinomy incapable of investigation using currently available scientific tools

  14. The organization of the chaos

    OpenAIRE

    Merxhani, Branko

    2012-01-01

    Title: Organizimi i Kaosit (The organization of the chaos) Originally Published: In the monthly review Neo-shqiptarisma, Nr. 1, Tirana, 1930 Language: Albanian The excerpts used are from A. Plasari ed., Formula të Neoshqiptarismës. Përmbledhje shkrimesh (Tirana: Apollonia, 1996), pp. 99–102. About the author Branko Merxhani [1894 Istanbul – 1981, Istanbul]: scholar and writer. He was born in Istanbul and educated in Germany. In all likelihood, only his father was Albanian. By the end of the 1...

  15. Polynomial Similarity Transformation Theory: A smooth interpolation between coupled cluster doubles and projected BCS applied to the reduced BCS Hamiltonian

    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.

  16. Nonclassical Orthogonal Polynomials and Corresponding Quadratures

    CERN Document Server

    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.

  17. 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...

  18. 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...

  19. Algebraic polynomial system solving and applications

    NARCIS (Netherlands)

    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

  20. 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.

  1. 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)

  2. 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...

  3. 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,.

  4. 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)

  5. 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

  6. Polynomial Asymptotes of the Second Kind

    Science.gov (United States)

    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…

  7. 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 ...

  8. 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

  9. 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...

  10. 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....

  11. 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.

  12. Spectral properties of birth-death polynomials

    NARCIS (Netherlands)

    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

  13. Spectral properties of birth-death polynomials

    NARCIS (Netherlands)

    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

  14. Optimization of Cubic Polynomial Functions without Calculus

    Science.gov (United States)

    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…

  15. 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 ...

  16. 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- ...

  17. 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 ...

  18. Quantifying chaos for ecological stoichiometry.

    Science.gov (United States)

    Duarte, Jorge; Januário, Cristina; Martins, Nuno; Sardanyés, Josep

    2010-09-01

    The theory of ecological stoichiometry considers ecological interactions among species with different chemical compositions. Both experimental and theoretical investigations have shown the importance of species composition in the outcome of the population dynamics. A recent study of a theoretical three-species food chain model considering stoichiometry [B. Deng and I. Loladze, Chaos 17, 033108 (2007)] shows that coexistence between two consumers predating on the same prey is possible via chaos. In this work we study the topological and dynamical measures of the chaotic attractors found in such a model under ecological relevant parameters. By using the theory of symbolic dynamics, we first compute the topological entropy associated with unimodal Poincaré return maps obtained by Deng and Loladze from a dimension reduction. With this measure we numerically prove chaotic competitive coexistence, which is characterized by positive topological entropy and positive Lyapunov exponents, achieved when the first predator reduces its maximum growth rate, as happens at increasing δ1. However, for higher values of δ1 the dynamics become again stable due to an asymmetric bubble-like bifurcation scenario. We also show that a decrease in the efficiency of the predator sensitive to prey's quality (increasing parameter ζ) stabilizes the dynamics. Finally, we estimate the fractal dimension of the chaotic attractors for the stoichiometric ecological model.

  19. Invoking the muse: Dada's chaos.

    Science.gov (United States)

    Rosen, Diane

    2014-07-01

    Dada, a self-proclaimed (anti)art (non)movement, took shape in 1916 among a group of writers and artists who rejected the traditions of a stagnating bourgeoisie. Instead, they adopted means of creative expression that embraced chaos, stoked instability and undermined logic, an outburst that overturned centuries of classical and Romantic aesthetics. Paradoxically, this insistence on disorder foreshadowed a new order in understanding creativity. Nearly one hundred years later, Nonlinear Dynamical Systems theory (NDS) gives renewed currency to Dada's visionary perspective on chance, chaos and creative cognition. This paper explores commonalities between NDS-theory and this early precursor of the nonlinear paradigm, suggesting that their conceptual synergy illuminates what it means to 'be creative' beyond the disciplinary boundaries of either. Key features are discussed within a 5P model of creativity based on Rhodes' 4P framework (Person, Process, Press, Product), to which I add Participant-Viewer for the interactivity of observer-observed. Grounded in my own art practice, several techniques are then put forward as non-methodical methods that invoke creative border zones, those regions where Dada's chance and design are wedded in a dialectical tension of opposites.

  20. Markov transitions and the propagation of chaos

    International Nuclear Information System (INIS)

    Gottlieb, A.

    1998-01-01

    The propagation of chaos is a central concept of kinetic theory that serves to relate the equations of Boltzmann and Vlasov to the dynamics of many-particle systems. Propagation of chaos means that molecular chaos, i.e., the stochastic independence of two random particles in a many-particle system, persists in time, as the number of particles tends to infinity. We establish a necessary and sufficient condition for a family of general n-particle Markov processes to propagate chaos. This condition is expressed in terms of the Markov transition functions associated to the n-particle processes, and it amounts to saying that chaos of random initial states propagates if it propagates for pure initial states. Our proof of this result relies on the weak convergence approach to the study of chaos due to Sztitman and Tanaka. We assume that the space in which the particles live is homomorphic to a complete and separable metric space so that we may invoke Prohorov's theorem in our proof. We also show that, if the particles can be in only finitely many states, then molecular chaos implies that the specific entropies in the n-particle distributions converge to the entropy of the limiting single-particle distribution

  1. Using chaos theory: the implications for nursing.

    Science.gov (United States)

    Haigh, Carol

    2002-03-01

    The purpose of this paper is to review chaos theory and to examine the role that it may have in the discipline of nursing. In this paper, the fundamental ingredients of chaotic thinking are outlined. The earlier days of chaos thinking were characterized by an almost exclusively physiological focus. By the 21st century, nurse theorists were applying its principles to the organization and evaluation of care delivery with varying levels of success. Whilst the biological use of chaos has focused on pragmatic approaches to knowledge enhancement, nursing has often focused on the mystical aspects of chaos as a concept. The contention that chaos theory has yet to find a niche within nursing theory and practice is examined. The application of chaotic thinking across nursing practice, nursing research and statistical modelling is reviewed. The use of chaos theory as a way of identifying the attractor state of specific systems is considered and the suggestion is made that it is within statistical modelling of services that chaos theory is most effective.

  2. 3D pulsed chaos lidar system.

    Science.gov (United States)

    Cheng, Chih-Hao; Chen, Chih-Ying; Chen, Jun-Da; Pan, Da-Kung; Ting, Kai-Ting; Lin, Fan-Yi

    2018-04-30

    We develop an unprecedented 3D pulsed chaos lidar system for potential intelligent machinery applications. Benefited from the random nature of the chaos, conventional CW chaos lidars already possess excellent anti-jamming and anti-interference capabilities and have no range ambiguity. In our system, we further employ self-homodyning and time gating to generate a pulsed homodyned chaos to boost the energy-utilization efficiency. Compared to the original chaos, we show that the pulsed homodyned chaos improves the detection SNR by more than 20 dB. With a sampling rate of just 1.25 GS/s that has a native sampling spacing of 12 cm, we successfully achieve millimeter-level accuracy and precision in ranging. Compared with two commercial lidars tested side-by-side, namely the pulsed Spectroscan and the random-modulation continuous-wave Lidar-lite, the pulsed chaos lidar that is in compliance with the class-1 eye-safe regulation shows significantly better precision and a much longer detection range up to 100 m. Moreover, by employing a 2-axis MEMS mirror for active laser scanning, we also demonstrate real-time 3D imaging with errors of less than 4 mm in depth.

  3. How to test for partially predictable chaos.

    Science.gov (United States)

    Wernecke, Hendrik; Sándor, Bulcsú; Gros, Claudius

    2017-04-24

    For a chaotic system pairs of initially close-by trajectories become eventually fully uncorrelated on the attracting set. This process of decorrelation can split into an initial exponential decrease and a subsequent diffusive process on the chaotic attractor causing the final loss of predictability. Both processes can be either of the same or of very different time scales. In the latter case the two trajectories linger within a finite but small distance (with respect to the overall extent of the attractor) for exceedingly long times and remain partially predictable. Standard tests for chaos widely use inter-orbital correlations as an indicator. However, testing partially predictable chaos yields mostly ambiguous results, as this type of chaos is characterized by attractors of fractally broadened braids. For a resolution we introduce a novel 0-1 indicator for chaos based on the cross-distance scaling of pairs of initially close trajectories. This test robustly discriminates chaos, including partially predictable chaos, from laminar flow. Additionally using the finite time cross-correlation of pairs of initially close trajectories, we are able to identify laminar flow as well as strong and partially predictable chaos in a 0-1 manner solely from the properties of pairs of trajectories.

  4. 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...

  5. 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...

  6. 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.

  7. 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.

  8. Expansion dynamics

    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.)

  9. expansion method

    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.

  10. On the optimal polynomial approximation of stochastic PDEs by galerkin and collocation methods

    KAUST Repository

    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.

  11. Accurate polynomial expressions for the density and specific volume of seawater using the TEOS-10 standard

    Science.gov (United States)

    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.

  12. Generalized neurofuzzy network modeling algorithms using Bézier-Bernstein polynomial functions and additive decomposition.

    Science.gov (United States)

    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.

  13. On the optimal polynomial approximation of stochastic PDEs by galerkin and collocation methods

    KAUST Repository

    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.

  14. 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.

  15. 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

  16. 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

  17. 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.

  18. Contributions to fuzzy polynomial techniques for stability analysis and control

    OpenAIRE

    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...

  19. A Novel Operational Matrix of Caputo Fractional Derivatives of Fibonacci Polynomials: Spectral Solutions of Fractional Differential Equations

    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.

  20. Some remarks on chaos in topological dynamics

    Directory of Open Access Journals (Sweden)

    Huoyung Wang

    2011-10-01

    Full Text Available Bau-Sen Du introduced a notion of chaos which is stronger than Li-Yorke sensitivity. A TDS (X, f is called chaotic if there is a positive e such that for any x and any nonempty open set V of X there is a point y in V such that the pair (x, y is proximal but not e-asymptotic. In this article, we show that a TDS (T, f is transitive but not mixing if and only if (T, f is Li-Yorke sensitive but not chaotic, where T is a tree. Moreover, we compare such chaos with other notions of chaos.