Fibonacci-like Differential Equations with a Polynomial Non-Homogeneous Part

NARCIS (Netherlands)

Asveld, P.R.J.

1989-01-01

We investigate non-homogeneous linear differential equations of the form $x''(t) + x'(t) - x(t) = p(t)$ where $p(t)$ is either a polynomial or a factorial polynomial in $t$. We express the solution of these differential equations in terms of the coefficients of $p(t)$, in the initial conditions, and

Non-Abelian integrable hierarchies: matrix biorthogonal polynomials and perturbations

Science.gov (United States)

Ariznabarreta, Gerardo; García-Ardila, Juan C.; Mañas, Manuel; Marcellán, Francisco

2018-05-01

In this paper, Geronimus–Uvarov perturbations for matrix orthogonal polynomials on the real line are studied and then applied to the analysis of non-Abelian integrable hierarchies. The orthogonality is understood in full generality, i.e. in terms of a nondegenerate continuous sesquilinear form, determined by a quasidefinite matrix of bivariate generalized functions with a well-defined support. We derive Christoffel-type formulas that give the perturbed matrix biorthogonal polynomials and their norms in terms of the original ones. The keystone for this finding is the Gauss–Borel factorization of the Gram matrix. Geronimus–Uvarov transformations are considered in the context of the 2D non-Abelian Toda lattice and noncommutative KP hierarchies. The interplay between transformations and integrable flows is discussed. Miwa shifts, τ-ratio matrix functions and Sato formulas are given. Bilinear identities, involving Geronimus–Uvarov transformations, first for the Baker functions, then secondly for the biorthogonal polynomials and its second kind functions, and finally for the τ-ratio matrix functions, are found.

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

Collective motions and non-polynomial lagrangians in Fokker-Planck dynamics

International Nuclear Information System (INIS)

Spina, A.; Vucetich, H.

1986-04-01

A method based on the ideas of collective motion is applied to Fokker-Planck dynamics. The usual diagramatic techniques used in stochastic dynamics are enlarged in order to deal with the non-polynomial Lagrangians that appear in the theory. The technique is tested and applied to the case of a self-sustained sinusoidal oscillator whose statistical behaviour is well understood: the Poincare oscillator. (author)

Infinite families of (non)-Hermitian Hamiltonians associated with exceptional Xm Jacobi polynomials

International Nuclear Information System (INIS)

Midya, Bikashkali; Roy, Barnana

2013-01-01

Using an appropriate change of variable, the Schrödinger equation is transformed into a second-order differential equation satisfied by recently discovered Jacobi-type X m exceptional orthogonal polynomials. This facilitates the derivation of infinite families of exactly solvable Hermitian as well as non-Hermitian trigonometric Scarf potentials and a finite number of Hermitian and an infinite number of non-Hermitian PT-symmetric hyperbolic Scarf potentials. The bound state solutions of all these potentials are associated with the aforesaid exceptional orthogonal polynomials. These infinite families of potentials are shown to be extensions of the conventional trigonometric and hyperbolic Scarf potentials by the addition of some rational terms characterized by the presence of classical Jacobi polynomials. All the members of a particular family of these ‘rationally extended polynomial-dependent’ potentials have the same energy spectrum and possess translational shape-invariant symmetry. The obtained non-Hermitian trigonometric Scarf potentials are shown to be quasi-Hermitian in nature ensuring the reality of the associated energy spectra. (paper)

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.

Local polynomial Whittle estimation covering non-stationary fractional processes

DEFF Research Database (Denmark)

Nielsen, Frank

to the non-stationary region. By approximating the short-run component of the spectrum by a polynomial, instead of a constant, in a shrinking neighborhood of zero we alleviate some of the bias that the classical local Whittle estimators is prone to. This bias reduction comes at a cost as the variance is in...... study illustrates the performance of the proposed estimator compared to the classical local Whittle estimator and the local polynomial Whittle estimator. The empirical justi.cation of the proposed estimator is shown through an analysis of credit spreads....

Promising molecular targets and biomarkers for male BPH and LUTS.

Science.gov (United States)

Gharaee-Kermani, Mehrnaz; Macoska, Jill A

2013-12-01

Benign prostatic hyperplasia (BPH) is a major health concern for aging men. BPH is associated with urinary voiding dysfunction and lower urinary tract symptoms (LUTS), which negatively affects quality of life. Surgical resection and medical approaches have proven effective for improving urinary flow and relieving LUTS but are not effective for all men and can produce adverse effects that require termination of the therapeutic regimen. Thus, there is a need to explore other therapeutic targets to treat BPH/LUTS. Complicating the treatment of BPH/LUTS is the lack of biomarkers to effectively identify pathobiologies contributing to BPH/LUTS or to gauge successful response to therapy. This review will briefly discuss current knowledge and will highlight new studies that illuminate the pathobiologies contributing to BPH/LUTS, potential new therapeutic strategies for successfully treating BPH/LUTS, and new approaches for better defining these pathobiologies and response to therapeutics through the development of biomarkers and phenotyping strategies.

An algebraic approach to the non-symmetric Macdonald polynomial

International Nuclear Information System (INIS)

Nishino, Akinori; Ujino, Hideaki; Wadati, Miki

1999-01-01

In terms of the raising and lowering operators, we algebraically construct the non-symmetric Macdonald polynomials which are simultaneous eigenfunctions of the commuting Cherednik operators. We also calculate Cherednik's scalar product of them

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

On the non-hyperbolicity of a class of exponential polynomials

Directory of Open Access Journals (Sweden)

Gaspar Mora

2017-10-01

Full Text Available In this paper we have constructed a class of non-hyperbolic exponential polynomials that contains all the partial sums of the Riemann zeta function. An exponential polynomial been also defined to illustrate the complexity of the structure of the set defined by the closure of the real projections of its zeros. The sensitivity of this set, when the vector of delays is perturbed, has been analysed. These results have immediate implications in the theory of the neutral differential equations.

Relationship among diet habit and lower urinary tract symptoms and sexual function in outpatient-based males with LUTS/BPH: a multiregional and cross-sectional study in China.

Science.gov (United States)

Chen, Yuke; Yu, Wei; Zhou, Liqun; Wu, Shiliang; Yang, Yang; Wang, Jianye; Tian, Ye; He, Dalin; Xu, Yong; Huang, Jian; Wang, Xiaofeng; Gao, Xin; Li, Hanzhong; Ma, Lulin; Zhang, Ning; Zhao, Shengtian; Jin, Xunbo

2016-08-31

This study assessed the effect of diet habits on lower urinary tract symptoms (LUTS) and sexual function in Chinese men with LUTS/benign prostatic hypertrophy (LUTS/BPH). Multicentre study conducted between July 2013 and December 2013 in 11 hospitals in 3 geographic regions in China. Overall, participants with LUTS/BPH accounted for 61.4% (2584/4208) of the respondents, whose data were processed in the following statistical analysis. LUTS and sexual function were assessed based on the International Prostate Symptom Score (IPSS) and the International Index of Erectile Function 5 (IIEF-5) score. Prostate volume (PV) was determined by ultrasound. A total of 4208 participants met the inclusion criteria. The average age of the whole participants was 65.8±7.7 years. Overall, participants with LUTS/BPH accounted for 61.4% (2584/4208) of the respondents, whose data were processed in the following statistical analysis. Generally, prostate enlargement was greatest in south China. LUTS and male sexual dysfunction (MSD) were most severe in northwest China. Based on multivariable analysis, PV enlarged as the age (pBPH. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

Urologists' attitudes to sexual complications of LUTS/BPH treatments.

Science.gov (United States)

Giona, Simone; Ganguly, Indranil; Muir, Gordon

2018-04-21

Many LUTS/BPH treatments currently available may affect sexual function (SD). We wished to assess urologists' attitude and practice in this area. Attendees of an international meeting were randomly selected, interviewed and stratified by professional status and LUTS/BPH cases seen per month. There were four questions: treatment options offered, frequency of discussing erectile dysfunction (ED) with each treatment, frequency of discussing ejaculatory dysfunction (EjD) with each treatment, and offering alternative treatment based on the risks of sexual dysfunction. 199 of the 245 interviewed (81%) were urologists. The most common treatments offered were α-blockers (99.5%), 5-ARI (95.0%) and TURP (92.5%). About 70% of the specialists discuss ED before α-blockers (not known to cause ED). Regarding EjD, 70% discuss this prior to prescribing α-blockers, 60% before 5-ARI therapy, while 80% before TURP. A significant minority fails to discuss this complication in all areas. Many respondents do not routinely discuss alternative therapies on the risk of SD. The higher the caseload, the less likely was a urologist to offer alternative therapies, with 37% of urologists seeing over 30 LUTS/BPH patients per month stating they would "Not at all often" offer alternative therapies for this reason. There is a significant discrepancy in attitudes to counselling patients on SD related to LUTS/BPH treatments. This may, in some cases, affect the validity of consent to the treatment. Most urologists do not discuss alternative treatments with patients based on the risks of different outcomes and complications, and this seems more marked in those with the busier practices. This may sit ill with the concept of personalised healthcare.

Exploring Shared SRAM Tables in FPGAs for Larger LUTs and Higher Degree of Sharing

Directory of Open Access Journals (Sweden)

Ali Asghar

2017-01-01

Full Text Available In modern SRAM based Field Programmable Gate Arrays, a Look-Up Table (LUT is the principal constituent logic element which can realize every possible Boolean function. However, this flexibility of LUTs comes with a heavy area penalty. A part of this area overhead comes from the increased amount of configuration memory which rises exponentially as the LUT size increases. In this paper, we first present a detailed analysis of a previously proposed FPGA architecture which allows sharing of LUTs memory (SRAM tables among NPN-equivalent functions, to reduce the area as well as the number of configuration bits. We then propose several methods to improve the existing architecture. A new clustering technique has been proposed which packs NPN-equivalent functions together inside a Configurable Logic Block (CLB. We also make use of a recently proposed high performance Boolean matching algorithm to perform NPN classification. To enhance area savings further, we evaluate the feasibility of more than two LUTs sharing the same SRAM table. Consequently, this work explores the SRAM table sharing approach for a range of LUT sizes (4–7, while varying the cluster sizes (4–16. Experimental results on MCNC benchmark circuits set show an overall area reduction of ~7% while maintaining the same critical path delay.

The impact of metabolic syndrome on the responsiveness to α1-blocker in men with BPH/LUTS.

Science.gov (United States)

Lee, Y-C; Liu, C-C; Juan, Y-S; Wu, W-J; Li, W-M; Yeh, H-C; Wang, C-J; Huang, C-N; Huang, C-H; Huang, S-P

2013-04-01

Increasing evidence has proposed the components of metabolic syndrome (MtS) as risk factors for the development of benign prostate hyperplasia (BPH); therefore, it is thought that MtS may play a role in lower urinary tract symptoms related to BPH (BPH/LUTS) aetiology. Considering the closed relationships between MtS and BPH/LUTS, it is possible that patients with MtS might have different drug responsiveness in men with BPH/LUTS. We prospectively investigated the impact of MtS on responsiveness to α1-blocker in men with BPH/LUTS. We enrolled a total of 109 patients with a mean (SD) age of 59.8 (9.0) years, having a prostate volume of 20 cm(3) or greater with moderate to severe LUTS. All patients received doxazosin GITS (gastrointestinal therapeutic system) 4 mg once daily for a 12-week period of treatment. The efficacy measurement was assessed by the changes from baseline in the total IPSS, maximum urinary flow rate and postvoid residual urine volume. The drug responders were defined as those who had a total IPSS decrease of more than 4 points from baseline after 12 weeks of treatment. Using multiple logistic regression analysis, our results showed that MtS was an independent factor for drug non-responder (OR = 4.26, p = 0.002). The rate of drug responder and total IPSS improvements in patients with MtS significantly decreased as the number of MtS components increased (p = 0.012 and p = 0.026). Among the MtS components, abnormal fasting blood glucose (FBG) was the most significantly independent factor for drug non-responder (OR = 3.17, p = 0.020). This study suggested that the presence of MtS had a significantly negative impact on the responsiveness to α1-blocker in men with BPH/LUTS. Our results are important for BPH/LUTS patients who did not initially respond to α1-blocker or who strive to reduce these metabolic risk factors. © 2013 Blackwell Publishing Ltd.

Rodrigues formulas for the non-symmetric multivariable polynomials associated with the BCN-type root system

International Nuclear Information System (INIS)

Nishino, Akinori; Ujino, Hideaki; Komori, Yasushi; Wadati, Miki

2000-01-01

The non-symmetric Macdonald-Koornwinder polynomials are joint eigenfunctions of the commuting Cherednik operators which are constructed from the representation theory for the affine Hecke algebra corresponding to the BC N -type root system. We present the Rodrigues formula for the non-symmetric Macdonald-Koornwinder polynomials. The raising operators are derived from the realizations of the corresponding double affine Hecke algebra. In the quasi-classical limit, the above theory reduces to that of the BC N -type Sutherland model which describes many particles with inverse-square long-range interactions on a circle with one impurity. We also present the Rodrigues formula for the non-symmetric Jacobi polynomials of type BC N which are eigenstates of the BC N -type Sutherland model

Estimation of winter wheat canopy nitrogen density at different growth stages based on Multi-LUT approach

Science.gov (United States)

Li, Zhenhai; Li, Na; Li, Zhenhong; Wang, Jianwen; Liu, Chang

2017-10-01

Rapid real-time monitoring of wheat nitrogen (N) status is crucial for precision N management during wheat growth. In this study, Multi Lookup Table (Multi-LUT) approach based on the N-PROSAIL model parameters setting at different growth stages was constructed to estimating canopy N density (CND) in winter wheat. The results showed that the estimated CND was in line with with measured CND, with the determination coefficient (R2) and the corresponding root mean square error (RMSE) values of 0.80 and 1.16 g m-2, respectively. Time-consuming of one sample estimation was only 6 ms under the test machine with CPU configuration of Intel(R) Core(TM) i5-2430 @2.40GHz quad-core. These results confirmed the potential of using Multi-LUT approach for CND retrieval in winter wheat at different growth stages and under variables climatic conditions.

Surgical Procedures for BPH/LUTS: Impact on Male Sexual Health.

Science.gov (United States)

Becher, Edgardo F; McVary, Kevin T

2014-01-01

Lower urinary tract symptoms (LUTS) because of benign prostatic hyperplasia (BPH) are a highly prevalent condition in men over 50 years old, and their incidence increases with age. The relationship between LUTS and erectile dysfunction (ED) has received increased attention recently because both diseases are highly prevalent, frequently co-associated in the same aging male group, and contribute significantly to the overall quality of life. In this review, we will examine the literature to assess the impact of surgical and minimally invasive treatments for LUTS/BPH on the male's sexual health. The impact of the various surgical and minimally invasive treatments for LUTS/BPH was reviewed to ascertain the impact on erectile and ejaculatory function. Sexual side effects of treatment for LUTS/BPH are underappreciated by urologists but likely play a prominent role in patient decision making, creating a disparity between provider and patient. Almost all accepted therapies for LUTS (surgical or medical) can affect some aspect of sexual health, making it imperative that health-care professionals understand their patients' concerns and motivations in these two linked diseases. The incidence of newly diagnosed postoperative ED in patients treated with monopolar transurethral resection (TURP) is around 14%, with reported values in various studies ranging from 0-32.5%, 7.7%, 6.5%, 17%, to 14%. Importantly, there is no significant difference reported between bipolar and monopolar TURP on sexual function. The risk of sexual side effects is an important one to consider in discussing the implications for any LUTS intervention as they play a prominent role in patient motivation, acceptance of bother and decision making concerning surgical intervention, thus creating a potential disparity between provider and patient. Becher EF and McVary KT. Surgical procedures for BPH/LUTS: Impact on male sexual health. Sex Med Rev 2014;2:47-55. Copyright © 2014 International Society for Sexual

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

Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians

OpenAIRE

Ndayiragije, François; Van Assche, Walter

2013-01-01

Multiple Meixner polynomials are polynomials in one variable which satisfy orthogonality relations with respect to $r>1$ different negative binomial distributions (Pascal distributions). There are two kinds of multiple Meixner polynomials, depending on the selection of the parameters in the negative binomial distribution. We recall their definition and some formulas and give generating functions and explicit expressions for the coefficients in the nearest neighbor recurrence relation. Followi...

The correlation between lower urinary tract symptoms (LUTS) and erectile dysfunction (ED): results from a survey in males from Mexico City (MexiLUTS).

Science.gov (United States)

Gonzalez-Sanchez, Benjamin; Cendejas-Gomez, Jesus; Alejandro Rivera-Ramirez, J; Herrera-Caceres, Jaime O; Olvera-Posada, Daniel; Villeda-Sandoval, Christian I; Castillejos-Molina, Ricardo A; Feria-Bernal, Guillermo; Garcia-Mora, Arturo; Rodriguez-Covarrubias, Francisco

2016-07-01

ED and LUTS affect a high proportion of male population. Although Hispanics are suspected to have a higher risk of experiencing LUTS, detailed information on its frequency and association with ED in this population is scarce. To determine the frequency of LUTS and ED, and its correlation in Mexican males. A cross-sectional analytical survey was answered by 1041 men. It included the International Prostate Symptom Score and the quality of life question (IPSS/QoL); International Index of Erectile Function (IIEF-5); the short form of the International Consultation of Incontinence Questionnaire (ICIQ-SF); and demographic data. For the analysis, we divided our population into 2 groups (18-39 and 40 and older), and then an exploratory correlation analysis was performed to search for significant differences among IPSS severity groups, and finally a multivariate regression model was applied. Mean age was 48.6 ± 14.5 years. One hundred twenty-three individuals (11.8 %) were asymptomatic, and 611 (58.7 %) had mild, 226 (21.7 %) had moderate, and 81 (7.8 %) had severe IPSS score. The most common symptoms were nocturia (72.4 %), increased urinary frequency (58.3 %), and slow urinary stream (42.6 %). Two hundred fifty-eight (24.7 %) complained of incontinence. Of 765 individuals, 484(63.2 %) reported some degree of ED. Severe LUTS, DM, and age were independent risk factors for ED severity. LUTS and ED may represent one of the largest sources of morbidity in our population, and their association was demonstrated. Awareness on these entities should be raised, and further research is required to determine the higher frequency of LUTS and ED in Hispanics.

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.

Supersymmetric quantum mechanics and higher excited states of a non-polynomial potential

International Nuclear Information System (INIS)

Drigo Filho, E.; Ricotta, R.M.

1989-03-01

Supersymmetric quantum mechanics is used to evaluate new excited states of a non-polynomial potential. This illustrates a method of evaluating higher excited states of quantum mechanical potentials. (A.C.A.S.) [pt

Tadalafil - a therapeutic option in the management of BPH-LUTS.

Science.gov (United States)

Carson, C C; Rosenberg, M; Kissel, J; Wong, D G

2014-01-01

Men with signs of benign prostatic hyperplasia (BPH) may experience lower urinary tract symptoms (LUTS) such as urinary frequency, urgency, intermittence, nocturia, straining, incomplete emptying or a weak urinary stream. The effective management of LUTS suggestive of BPH (BPH-LUTS) requires careful consideration of several factors, including the severity of a patient's symptoms, concurrent or other coexisting medical conditions, the ability to improve symptoms and impact quality of life (QOL), as well as the potential side effects of available treatment options. Several clinical studies have assessed phosphodiesterase type 5 (PDE5) inhibitors in reducing LUTS; however, tadalafil is the only PDE5 inhibitor approved for the treatment of signs and symptoms of BPH, as well as in men with both erectile dysfunction (ED) and the signs and symptoms of BPH. This review examined articles that assessed tadalafil in patients with signs and symptoms of BPH, with or without erectile dysfunction (ED), which led to regulatory approval in the United States and Europe. In dose-ranging and confirmatory studies, results demonstrate that tadalafil significantly improved total International Prostate Symptom Score (IPSS) following 12 weeks of treatment with once daily tadalafil 5 mg. Statistically significant improvements in Benign Prostatic Hyperplasia Impact Index (BII), IPSS subscores, IPSS QOL and International Index of Erectile Function (IIEF) were also observed. Improvement in urinary symptoms occurred regardless of age, previous treatment with an α1 -adrenergic blocker, BPH-LUTS severity at baseline or ED status. While tadalafil is most frequently recognised as a standard treatment option for men with ED, it also represents a well-tolerated and effective treatment option in men with moderate to severe BPH-LUTS. © 2013 John Wiley & Sons Ltd.

A Tuned Value Chain Model for University Based Public Research Organisation. Case Lut Cst.

Directory of Open Access Journals (Sweden)

Vesa Karvonen

2012-12-01

Full Text Available The Porter´s value chain model was introduced for strategic business purposes. During the last decades also Universities and University based institutes have started to use actions similar to private business concepts. A University based institute is not independent actor like company but there are interest groups who are expecting them to act like they would be. This article discusses about the possibility of utilize tuned value chain to public research organizations (PRO. Also the interactions of tuned value chain model to existing industrial network are discussed. The case study object is the Centre for Separation Technology (CST at Lappeenranta University of Technology (LUT in Finland.

Model-based multi-fringe interferometry using Zernike polynomials

Science.gov (United States)

Gu, Wei; Song, Weihong; Wu, Gaofeng; Quan, Haiyang; Wu, Yongqian; Zhao, Wenchuan

2018-06-01

In this paper, a general phase retrieval method is proposed, which is based on one single interferogram with a small amount of fringes (either tilt or power). Zernike polynomials are used to characterize the phase to be measured; the phase distribution is reconstructed by a non-linear least squares method. Experiments show that the proposed method can obtain satisfactory results compared to the standard phase-shifting interferometry technique. Additionally, the retrace errors of proposed method can be neglected because of the few fringes; it does not need any auxiliary phase shifting facilities (low cost) and it is easy to implement without the process of phase unwrapping.

A polynomial based model for cell fate prediction in human diseases.

Science.gov (United States)

Ma, Lichun; Zheng, Jie

2017-12-21

Cell fate regulation directly affects tissue homeostasis and human health. Research on cell fate decision sheds light on key regulators, facilitates understanding the mechanisms, and suggests novel strategies to treat human diseases that are related to abnormal cell development. In this study, we proposed a polynomial based model to predict cell fate. This model was derived from Taylor series. As a case study, gene expression data of pancreatic cells were adopted to test and verify the model. As numerous features (genes) are available, we employed two kinds of feature selection methods, i.e. correlation based and apoptosis pathway based. Then polynomials of different degrees were used to refine the cell fate prediction function. 10-fold cross-validation was carried out to evaluate the performance of our model. In addition, we analyzed the stability of the resultant cell fate prediction model by evaluating the ranges of the parameters, as well as assessing the variances of the predicted values at randomly selected points. Results show that, within both the two considered gene selection methods, the prediction accuracies of polynomials of different degrees show little differences. Interestingly, the linear polynomial (degree 1 polynomial) is more stable than others. When comparing the linear polynomials based on the two gene selection methods, it shows that although the accuracy of the linear polynomial that uses correlation analysis outcomes is a little higher (achieves 86.62%), the one within genes of the apoptosis pathway is much more stable. Considering both the prediction accuracy and the stability of polynomial models of different degrees, the linear model is a preferred choice for cell fate prediction with gene expression data of pancreatic cells. The presented cell fate prediction model can be extended to other cells, which may be important for basic research as well as clinical study of cell development related diseases.

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.

Urine chemokines indicate pathogenic association of obesity with BPH/LUTS.

Science.gov (United States)

Tyagi, Pradeep; Motley, Saundra S; Kashyap, Mahendra; Pore, Subrata; Gingrich, Jeffrey; Wang, Zhou; Yoshimura, Naoki; Fowke, Jay H

2015-07-01

High prevalence of lower urinary tract symptoms (LUTS) consistent with benign prostate hyperplasia (BPH) is associated with obesity and prostatic inflammation. Here, we investigated whether chemokines associated with obesity and prostatic inflammation can be measured in normally voided urine of BPH/LUTS patients to demonstrate the mechanistic association between obesity and BPH/LUTS. Frozen urine specimens of BPH/LUTS patients enrolled in the Nashville Men's Health Study were sent for blinded analysis to University of Pittsburgh. Thirty patients were blocked by their AUA-SI (>7 or ≤7) and prostatic enlargement (60 cc). Clinical parameters including age, prostate size, and medications were derived from chart review. CXC chemokines (CXCL-1, CXCL-8, and CXCL-10), CC chemokines (CCL2 and CCL3), and sIL-1ra were measured in thawed urine using Luminex™ xMAP(®) technology and ELISA for NGF. Urinary CCL2 levels were several fold higher compared with the other six proteins, of which CCL3 was detectable in less than one-fourth of patients. Urine levels of sIL-1ra and CXCL-8 were significantly associated with increasing BMI and waist circumference in BPH patients. CXCL-8 showed a marginal association with overall AUA-SI scores, as well as obstructive (p = 0.08) symptom subscores. Prostate volume was inversely and marginally associated with urinary CXCL-10 (p = 0.09). Urine levels of CXCL-8, CXCL-10, and sIL-1ra were associated with varying degrees with LUTS severity, prostate size, and obesity, respectively. These findings in urine are consistent with past studies of chemokine levels from expressed prostatic secretions and demonstrate the potential of noninvasively measured chemokine in urine to objectively classify BPH/LUTS patients.

Effects of prostatic inflammation on LUTS and alpha blocker treatment outcomes

Directory of Open Access Journals (Sweden)

Ha Na Lee

2014-06-01

Full Text Available Purpose To evaluate the association between prostatic inflammation and lower urinary tract symptoms (LUTS, and to identify the effects of prostatic inflammation on the treatment with an alpha blocker. Materials and Methods 111 Participants who were aged ≥ 50 years, the presence of LUTS (maximal flow rate < 20 m/s, IPSS ≥ 11, and an elevated PSA level (3-20ng/mL were treated with tamsulosin 0.2mg once daily for 3 months after prostate biopsies. Prostatic inflammation was scored as none (0, mild (I, moderate (II, or marked (III. LUTS parameters including urine flow rates, IPSS, PSA, and prostate volume were evaluated. Results Inflammation grading resulted in 25, 60, and 26 patients that were grade 0, I, and II, respectively. Lower grade inflammation was related to higher urine flow rate at baseline. Patients with higher inflammation grades had larger prostate volumes, larger total and transitional zone volumes, and higher PSA levels. Overall, urine flow rates and residual urine volume were improved after 3 months of alpha blocker therapy. Eighty percent of patients with grade 0 inflammation, 73% of patients with grade I inflammation, and 92.3% of patients with grade II inflammation showed improvement of LUTS after treatment. Longer duration of treatment was related to a decreased chance of improvement of LUTS. Patients with increased IPSS voiding subscales could be predictive of improvement of LUTS. Conclusions Patients with high grade inflammation had lower flow rates and higher prostatic volumes than patients with low grade inflammation. Inflammation grade did not affect the outcomes of alpha blocker treatment.

[LUTS in BPH patients with histological prostatitis before and after transurethral resection of the prostate].

Science.gov (United States)

Huang, Xiang-Hua; Qin, Bin; Liang, Yi-Wen; Wu, Qing-Guo; Li, Chang-Zan; Wei, Gang-Shan; Ji, Han-Chu; Liang, Yang-Bing; Chen, Hong-Qiu; Guan, Ting

2013-01-01

To investigate the effects of transurethral resection of the prostate (TURP) on lower urinary tract symptoms (LUTS) in patients with benign prostatic hyperplasia (BPH) complicated by histological prostatitis. This study included 432 cases of BPH pathologically confirmed after TURP. Excluding those with LUTS-related factors before and after surgery and based on the international prostatitis histological classification of diagnostic criteria, the remaining 144 cases were divided into groups A (pure BPH, n = 30), B (mild inflammation, n = 55), C (moderate inflammation, n = 31), and D (severe inflammation, n = 28). Each group was evaluated for LUTS by IPSS before and a month after surgery. A total of 399 cases (92.4%) were diagnosed as BPH with histological prostatitis, 269 (67.4%) mild, 86 (21.6%) moderate and 44 (11.0%) severe. The preoperative IPSS was 21.43 +/- 6.09 in group A, 21.75 +/- 5.97 in B, 27.84 +/- 4.18 in C and 31.00 +/- 2.92 in D, with statistically significant differences among different groups (P BPH with histological prostatitis were lymphocytes. BPH is mostly complicated with histological chronic prostatitis. The severity of LUTS is higher in BPH patients with histological prostatitis than in those without before and after TURP, and positively correlated with the grade of inflammation. Those complicated with moderate or severe histological prostatitis should take medication for the management of LUTS.

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.

Bound state solution of Dirac equation for Hulthen plus trigonometric Rosen Morse non-central potential using Romanovski polynomial

Energy Technology Data Exchange (ETDEWEB)

Suparmi, A., E-mail: suparmiuns@gmail.com; Cari, C., E-mail: suparmiuns@gmail.com [Physics Department, Post Graduate Study, Sebelas Maret University (Indonesia); Angraini, L. M. [Physics Department, Mataram University (Indonesia)

2014-09-30

The bound state solutions of Dirac equation for Hulthen and trigonometric Rosen Morse non-central potential are obtained using finite Romanovski polynomials. The approximate relativistic energy spectrum and the radial wave functions which are given in terms of Romanovski polynomials are obtained from solution of radial Dirac equation. The angular wave functions and the orbital quantum number are found from angular Dirac equation solution. In non-relativistic limit, the relativistic energy spectrum reduces into non-relativistic energy.

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

A quadruple mutant of Arabidopsis reveals a β-carotene hydroxylation activity for LUT1/CYP97C1 and a regulatory role of xanthophylls on determination of the PSI/PSII ratio.

Science.gov (United States)

Fiore, Alessia; Dall'Osto, Luca; Cazzaniga, Stefano; Diretto, Gianfranco; Giuliano, Giovanni; Bassi, Roberto

2012-04-18

Xanthophylls are oxygenated carotenoids playing an essential role as structural components of the photosynthetic apparatus. Xanthophylls contribute to the assembly and stability of light-harvesting complex, to light absorbance and to photoprotection. The first step in xanthophyll biosynthesis from α- and β-carotene is the hydroxylation of ε- and β-rings, performed by both non-heme iron oxygenases (CHY1, CHY2) and P450 cytochromes (LUT1/CYP97C1, LUT5/CYP97A3). The Arabidopsis triple chy1chy2lut5 mutant is almost completely depleted in β-xanthophylls. Here we report on the quadruple chy1chy2lut2lut5 mutant, additionally carrying the lut2 mutation (affecting lycopene ε-cyclase). This genotype lacks lutein and yet it shows a compensatory increase in β-xanthophylls with respect to chy1chy2lut5 mutant. Mutant plants show an even stronger photosensitivity than chy1chy2lut5, a complete lack of qE, the rapidly reversible component of non-photochemical quenching, and a peculiar organization of the pigment binding complexes into thylakoids. Biochemical analysis reveals that the chy1chy2lut2lut5 mutant is depleted in Lhcb subunits and is specifically affected in Photosystem I function, showing a deficiency in PSI-LHCI supercomplexes. Moreover, by analyzing a series of single, double, triple and quadruple Arabidopsis mutants in xanthophyll biosynthesis, we show a hitherto undescribed correlation between xanthophyll levels and the PSI-PSII ratio. The decrease in the xanthophyll/carotenoid ratio causes a proportional decrease in the LHCII and PSI core levels with respect to PSII. The physiological and biochemical phenotype of the chy1chy2lut2lut5 mutant shows that (i) LUT1/CYP97C1 protein reveals a major β-carotene hydroxylase activity in vivo when depleted in its preferred substrate α-carotene; (ii) xanthophylls are needed for normal level of Photosystem I and LHCII accumulation.

A quadruple mutant of Arabidopsis reveals a β-carotene hydroxylation activity for LUT1/CYP97C1 and a regulatory role of xanthophylls on determination of the PSI/PSII ratio

Directory of Open Access Journals (Sweden)

Fiore Alessia

2012-04-01

Full Text Available Abstract Background Xanthophylls are oxygenated carotenoids playing an essential role as structural components of the photosynthetic apparatus. Xanthophylls contribute to the assembly and stability of light-harvesting complex, to light absorbance and to photoprotection. The first step in xanthophyll biosynthesis from α- and β-carotene is the hydroxylation of ε- and β-rings, performed by both non-heme iron oxygenases (CHY1, CHY2 and P450 cytochromes (LUT1/CYP97C1, LUT5/CYP97A3. The Arabidopsis triple chy1chy2lut5 mutant is almost completely depleted in β-xanthophylls. Results Here we report on the quadruple chy1chy2lut2lut5 mutant, additionally carrying the lut2 mutation (affecting lycopene ε-cyclase. This genotype lacks lutein and yet it shows a compensatory increase in β-xanthophylls with respect to chy1chy2lut5 mutant. Mutant plants show an even stronger photosensitivity than chy1chy2lut5, a complete lack of qE, the rapidly reversible component of non-photochemical quenching, and a peculiar organization of the pigment binding complexes into thylakoids. Biochemical analysis reveals that the chy1chy2lut2lut5 mutant is depleted in Lhcb subunits and is specifically affected in Photosystem I function, showing a deficiency in PSI-LHCI supercomplexes. Moreover, by analyzing a series of single, double, triple and quadruple Arabidopsis mutants in xanthophyll biosynthesis, we show a hitherto undescribed correlation between xanthophyll levels and the PSI-PSII ratio. The decrease in the xanthophyll/carotenoid ratio causes a proportional decrease in the LHCII and PSI core levels with respect to PSII. Conclusions The physiological and biochemical phenotype of the chy1chy2lut2lut5 mutant shows that (i LUT1/CYP97C1 protein reveals a major β-carotene hydroxylase activity in vivo when depleted in its preferred substrate α-carotene; (ii xanthophylls are needed for normal level of Photosystem I and LHCII accumulation.

Non-invasive diagnosis of bladder outlet obstruction (BOO) in male patients with lower urinary tract symptoms (LUTS)

NARCIS (Netherlands)

Oelke, M.

2016-01-01

The thesis summarizes nine published articles and deals with the diagnostic value of morphological changes in the lower urinary tract in adult men with LUTS associated with BOO. Until recently, no morphological change of the lower urinary tract could safely diagnose BOO. Therefore, the value of

Fitting the Fractional Polynomial Model to Non-Gaussian Longitudinal Data

Directory of Open Access Journals (Sweden)

Ji Hoon Ryoo

2017-08-01

Full Text Available As in cross sectional studies, longitudinal studies involve non-Gaussian data such as binomial, Poisson, gamma, and inverse-Gaussian distributions, and multivariate exponential families. A number of statistical tools have thus been developed to deal with non-Gaussian longitudinal data, including analytic techniques to estimate parameters in both fixed and random effects models. However, as yet growth modeling with non-Gaussian data is somewhat limited when considering the transformed expectation of the response via a linear predictor as a functional form of explanatory variables. In this study, we introduce a fractional polynomial model (FPM that can be applied to model non-linear growth with non-Gaussian longitudinal data and demonstrate its use by fitting two empirical binary and count data models. The results clearly show the efficiency and flexibility of the FPM for such applications.

Solution of Schrodinger equation for Three Dimensional Harmonics Oscillator plus Rosen-Morse Non-central potential using NU Method and Romanovski Polynomials

International Nuclear Information System (INIS)

Cari, C; Suparmi, A

2013-01-01

The energy eigenvalues and eigenfunctions of Schrodinger equation for three dimensional harmonic oscillator potential plus Rosen-Morse non-central potential are investigated using NU method and Romanovski polynomial. The bound state energy eigenvalues are given in a closed form and corresponding radial wave functions are expressed in associated Laguerre polynomials while angular eigen functions are given in terms of Romanovski polynomials. The Rosen-Morse potential is considered to be a perturbation factor to the three dimensional harmonic oscillator potential that causes the increase of radial wave function amplitude and decrease of angular momentum length. Keywords: Schrodinger Equation, Three dimensional Harmonic Oscillator potential, Rosen-morse non-central potential, NU method, Romanovski Polynomials

Viin, Hitler ja Oskar Luts / Vaapo Vaher

Index Scriptorium Estoniae

Vaher, Vaapo, 1945-

2007-01-01

Tutvustus: Saarikoski, Pentti. On või ei ole ; Euroopa serval ; Bretagne'i päevik / soome keelest tõlkinud Piret Saluri. Tallinn : Varrak, 2007 ; Kull, Aivar. Oskar Luts : pildikesi kirjanikupõlvest. Tartu : Ilmamaa, 2007

Prevalence of Lower Urinary Tract Symptoms (LUTS) in Stroke Patients. A cross-sectional, clinical survey

DEFF Research Database (Denmark)

Tibæk, Sigrid; Gard, Gunvor; Klarskov, Peter

2008-01-01

AIMS: The aims of this study were primarily to investigate the prevalence, severity and impact on daily life of Lower Urinary Tract Symptoms (LUTS) in a clinical sample of stroke patients and secondly to identify factors associated with LUTS. MATERIALS AND METHODS: This was a cross......, symptoms of urinary incontinence on admission, and use of analgesics were significantly associated with severity, whereas the prevalence and bother of LUTS could not be associated with other patient characteristics. CONCLUSION: LUTS are highly prevalent in stroke patients and have a major impact on daily...

Impact of overactive bladder on work productivity in the United States: results from EpiLUTS.

Science.gov (United States)

Sexton, Chris C; Coyne, Karin S; Vats, Vasudha; Kopp, Zoe S; Irwin, Debra E; Wagner, Todd H

2009-03-01

Little research has focused on the impact of overactive bladder (OAB) on work productivity. Consequently, the impact of OAB and other lower urinary tract symptoms (LUTS) on work productivity was evaluated in employed men and women aged 40 to 65 in the United States. Data from a population-based, cross-sectional Internet survey were used to examine the impact of OAB symptoms on work productivity. US participants aged 40 to 65 working full- or part-time were included in the analysis. Participants were asked about the incidence of OAB and other LUTS and a series of questions about work productivity. Descriptive statistics and linear and logistic regressions were used to evaluate outcome differences for men and women by the OAB groups of no/minimal symptoms, continent OAB, and incontinent OAB. The response rate was 60%, and a total of 2876 men and 2820 women were analyzed. Men and women with incontinent OAB reported the lowest levels of work productivity and highest rates of daily work interference. Storage symptoms associated with OAB were most consistently associated with work productivity outcomes; however, significant associations were also found for other storage, voiding, and postmicturition LUTS. In this large US population-based study, OAB was highly prevalent and was associated with lower levels of work productivity. These findings add to the literature documenting the burden of OAB and other LUTS, underscoring the need for increased screening and treatment.

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

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.

Current drug therapy of patients with BPH-LUTS with the special emphasis on PDE5 inhibitors.

Science.gov (United States)

Kolontarev, Konstantin; Govorov, Alexander; Kasyan, George; Priymak, Diana; Pushkar, Dmitry

2016-01-01

Benign prostatic hyperplasia (BPH) is the most common cause of lower urinary tract symptom (LUTS) development in men [1]. The intensity of the symptoms may vary from mild to severe, significantly affecting the quality of life. Erectile dysfunction (ED) is one of the most challenging issues in modern urology that significantly influences the quality of life in men worldwide. The objective of this literature review was to analyze the current drug therapies of patients with BPH-LUTS, with the special emphasis on PDE5 inhibitors. The authors searched the literature for the period from 2000 until 2015 in MEDLINE and PubMed. Twenty-three articles were selected based on their reliability. A detailed analysis of the selected papers was performed. Primary attention was given to articles describing the use of PDE5. Works describing the use of different groups of drugs in patients with BPH-LUTS were also selected. The current literature analysis suggests that the introduction of PDE5 inhibitors in clinical practice for the treatment of patients with BPH-LUTS will allow for significant expansion of the therapeutic options for the treatment of this disease.

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

Energy Technology Data Exchange (ETDEWEB)

Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; Belkouchi, B.; Montomoli, F.

2016-09-01

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

International Nuclear Information System (INIS)

Ahlfeld, R.; Belkouchi, B.; Montomoli, F.

2016-01-01

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10

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)

Erectile dysfunction and lower urinary tract symptoms associated with benign prostatic hyperplasia (LUTS/BPH) combined responders to tadalafil after 12 weeks of treatment.

Science.gov (United States)

Roehrborn, Claus G; Egan, Kathryn B; Miner, Martin M; Ni, Xiao; Wong, David G; Rosen, Raymond C

2016-07-01

To analyse the proportion of men taking tadalafil 5 mg once daily who experience a combined improvement in symptoms of both erectile dysfunction (ED) and lower urinary tract symptoms associated with benign prostatic hyperplasia (LUTS/BPH). The data from men aged ≥45 years randomized to tadalafil 5 mg once daily or placebo enrolled in one of four randomized, placebo-controlled LUTS/BPH clinical trials were analysed (N = 927). A novel classification of 'combined responders' to ED and LUTS/BPH treatment was defined, based on published criteria for men who showed improvement in both International Index of Erectile Function - Erectile Function domain (IIEF-EF) score and total International Prostate Symptom Score (IPSS). Descriptive analyses assessed the covariate distribution by responder status. Unadjusted and adjusted logistic regressions provided odds ratios with 95% confidence intervals comparing combined responders with all others (partial and non-responders). Among men randomized to tadalafil 5 mg, 40.5% were combined responders (n = 189). Among placebo randomized men, 18.3% were combined responders (n = 84). Combined responders, in the total population, had the highest baseline IPSS and lowest baseline IIEF-EF scores, corresponding to the highest level of dysfunction. The majority of men were aged ≤65 years, white, non-obese, non-smokers, and regular alcohol consumers. Only treatment, baseline IPSS, baseline IIEF-EF, obesity and psychoactive medication use were significantly associated with responder status (P ≤ 0.05). Tadalafil-treated men had 2.8 times significantly increased adjusted odds of being combined responders vs non-responders (P BPH after treatment with tadalafil 5 mg once daily vs placebo. This combined responder measure may be useful in future assessment of treatment benefits across patient groups after various types of treatment intervention (e.g. surgical vs pharmacotherapy vs non-pharmacological intervention). © 2016 The Authors BJU

Characteristic Polynomials of Sample Covariance Matrices: The Non-Square Case

OpenAIRE

Kösters, Holger

2009-01-01

We consider the sample covariance matrices of large data matrices which have i.i.d. complex matrix entries and which are non-square in the sense that the difference between the number of rows and the number of columns tends to infinity. We show that the second-order correlation function of the characteristic polynomial of the sample covariance matrix is asymptotically given by the sine kernel in the bulk of the spectrum and by the Airy kernel at the edge of the spectrum. Similar results are g...

Estimation of Length and Order of Polynomial-based Filter Implemented in the Form of Farrow Structure

Directory of Open Access Journals (Sweden)

S. Vukotic

2016-08-01

Full Text Available Digital polynomial-based interpolation filters implemented using the Farrow structure are used in Digital Signal Processing (DSP to calculate the signal between its discrete samples. The two basic design parameters for these filters are number of polynomial-segments defining the finite length of impulse response, and order of polynomials in each polynomial segment. The complexity of the implementation structure and the frequency domain performance depend on these two parameters. This contribution presents estimation formulae for length and polynomial order of polynomial-based filters for various types of requirements including attenuation in stopband, width of transitions band, deviation in passband, weighting in passband/stopband.

Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

Energy Technology Data Exchange (ETDEWEB)

Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)

1996-12-31

The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.

Maximum Power Point Tracking Control of Photovoltaic Systems: A Polynomial Fuzzy Model-Based Approach

DEFF Research Database (Denmark)

Rakhshan, Mohsen; Vafamand, Navid; Khooban, Mohammad Hassan

2018-01-01

This paper introduces a polynomial fuzzy model (PFM)-based maximum power point tracking (MPPT) control approach to increase the performance and efficiency of the solar photovoltaic (PV) electricity generation. The proposed method relies on a polynomial fuzzy modeling, a polynomial parallel......, a direct maximum power (DMP)-based control structure is considered for MPPT. Using the PFM representation, the DMP-based control structure is formulated in terms of SOS conditions. Unlike the conventional approaches, the proposed approach does not require exploring the maximum power operational point...

A general U-block model-based design procedure for nonlinear polynomial control systems

Science.gov (United States)

Zhu, Q. M.; Zhao, D. Y.; Zhang, Jianhua

2016-10-01

The proposition of U-model concept (in terms of 'providing concise and applicable solutions for complex problems') and a corresponding basic U-control design algorithm was originated in the first author's PhD thesis. The term of U-model appeared (not rigorously defined) for the first time in the first author's other journal paper, which established a framework for using linear polynomial control system design approaches to design nonlinear polynomial control systems (in brief, linear polynomial approaches → nonlinear polynomial plants). This paper represents the next milestone work - using linear state-space approaches to design nonlinear polynomial control systems (in brief, linear state-space approaches → nonlinear polynomial plants). The overall aim of the study is to establish a framework, defined as the U-block model, which provides a generic prototype for using linear state-space-based approaches to design the control systems with smooth nonlinear plants/processes described by polynomial models. For analysing the feasibility and effectiveness, sliding mode control design approach is selected as an exemplary case study. Numerical simulation studies provide a user-friendly step-by-step procedure for the readers/users with interest in their ad hoc applications. In formality, this is the first paper to present the U-model-oriented control system design in a formal way and to study the associated properties and theorems. The previous publications, in the main, have been algorithm-based studies and simulation demonstrations. In some sense, this paper can be treated as a landmark for the U-model-based research from intuitive/heuristic stage to rigour/formal/comprehensive studies.

Stability Analysis of Positive Polynomial Fuzzy-Model-Based Control Systems with Time Delay under Imperfect Premise Matching

OpenAIRE

Li, Xiaomiao; Lam, Hak Keung; Song, Ge; Liu, Fucai

2017-01-01

This paper deals with the stability and positivity analysis of polynomial-fuzzy-model-based ({PFMB}) control systems with time delay, which is formed by a polynomial fuzzy model and a polynomial fuzzy controller connected in a closed loop, under imperfect premise matching. To improve the design and realization flexibility, the polynomial fuzzy model and the polynomial fuzzy controller are allowed to have their own set of premise membership functions. A sum-of-squares (SOS)-based stability ana...

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.

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)

Conference on Commutative rings, integer-valued polynomials and polynomial functions

CERN Document Server

Frisch, Sophie; Glaz, Sarah; Commutative Algebra : Recent Advances in Commutative Rings, Integer-Valued Polynomials, and Polynomial Functions

2014-01-01

This volume presents a multi-dimensional collection of articles highlighting recent developments in commutative algebra. It also includes an extensive bibliography and lists a substantial number of open problems that point to future directions of research in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics and research methods include Noetherian and non- Noetherian ring theory as well as integer-valued polynomials and functions. Specific topics include: ·    Homological dimensions of Prüfer-like rings ·    Quasi complete rings ·    Total graphs of rings ·    Properties of prime ideals over various rings ·    Bases for integer-valued polynomials ·    Boolean subrings ·    The portable property of domains ·    Probabilistic topics in Intn(D) ·    Closure operations in Zariski-Riemann spaces of valuation domains ·    Stability of do...

Coexistence of algebraic and non-algebraic limit cycles for quintic polynomial differential systems

Directory of Open Access Journals (Sweden)

Ahmed Bendjeddou

2017-03-01

Full Text Available In the work by Gine and Grau [11], a planar differential system of degree nine admitting a nested configuration formed by an algebraic and a non-algebraic limit cycles explicitly given was presented. As an improvement, we obtain by a new method a similar result for a family of quintic polynomial differential systems.

Image Compression Based On Wavelet, Polynomial and Quadtree

Directory of Open Access Journals (Sweden)

Bushra A. SULTAN

2011-01-01

Full Text Available In this paper a simple and fast image compression scheme is proposed, it is based on using wavelet transform to decompose the image signal and then using polynomial approximation to prune the smoothing component of the image band. The architect of proposed coding scheme is high synthetic where the error produced due to polynomial approximation in addition to the detail sub-band data are coded using both quantization and Quadtree spatial coding. As a last stage of the encoding process shift encoding is used as a simple and efficient entropy encoder to compress the outcomes of the previous stage.The test results indicate that the proposed system can produce a promising compression performance while preserving the image quality level.

Polynomial approximation of non-Gaussian unitaries by counting one photon at a time

Science.gov (United States)

Arzani, Francesco; Treps, Nicolas; Ferrini, Giulia

2017-05-01

In quantum computation with continuous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to realize in the laboratory. We propose and analyze two methods to apply a polynomial approximation of any unitary operator diagonal in the amplitude quadrature representation, including non-Gaussian operators, to an unknown input state. Our protocols use as a primary non-Gaussian resource a single-photon counter. We use the fidelity of the transformation with the target one on Fock and coherent states to assess the quality of the approximate gate.

In a free healthcare system, why do men not consult for lower urinary tract symptoms (LUTS?

Directory of Open Access Journals (Sweden)

lai U Chong

2011-06-01

Full Text Available Abstract Background The prevalence of lower urinary tract symptoms (LUTS varies among different populations but the rate of seeking medical advice is consistently low. Little is known about the reasons for this low rate. In the city of Macau, China, primary healthcare is free and easily accessible to all citizens. We aim to study the patients' rate of consulting for LUTS and their reasons for not consulting under a free healthcare system. Method A convenience sample of 549 male patients aged 40-85 years in a government health centre filled in the International Prostate Symptoms Scale (IPSS questionnaire. They were also asked if they had consulted doctors for LUTS, and if not, why not. Result Of the whole sample, 64 men (11.7% had ever consulted doctors for LUTS. Of 145 with moderate to severe LUTS, 35 (24.1% consulted. Of 73 who were dissatisfied with their quality of life, 22 (30.1% consulted. Regarding the symptoms as normal or not problematic was the main reason for not consulting. Advancing age and duration of symptoms were the significant factors for consulting. Conclusion Primary care doctors could help many of LUTS patients by sensitively initiating the discussion when these patients consult for other problems.

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

Burden of male lower urinary tract symptoms (LUTS) suggestive of benign prostatic hyperplasia (BPH) - focus on the UK.

Science.gov (United States)

Speakman, Mark; Kirby, Roger; Doyle, Scott; Ioannou, Chris

2015-04-01

Lower urinary tract symptoms (LUTS) associated with benign prostatic hyperplasia (BPH) can be bothersome and negatively impact on a patient's quality of life (QoL). As the prevalence of LUTS/BPH increases with age, the burden on the healthcare system and society may increase due to the ageing population. This review unifies literature on the burden of LUTS/BPH on patients and society, particularly in the UK. LUTS/BPH is associated with high personal and societal costs, both in direct medical costs and indirect losses in daily functioning, and through its negative impact on QoL for patients and partners. LUTS/BPH is often underdiagnosed and undertreated. Men should be encouraged to seek medical advice for this condition and should not accept it as part of ageing, while clinicians should be more active in the identification and treatment of LUTS/BPH. To assess the burden of illness and unmet need arising from lower urinary tract symptoms (LUTS) presumed secondary to benign prostatic hyperplasia (BPH) from an individual patient and societal perspective with a focus on the UK. Embase, PubMed, the World Health Organization, the Cochrane Database of Systematic Reviews and the York Centre for Reviews and Dissemination were searched to identify studies on the epidemiological, humanistic or economic burden of LUTS/BPH published in English between October 2001 and January 2013. Data were extracted and the quality of the studies was assessed for inclusion. UK data were reported; in the absence of UK data, European and USA data were provided. In all, 374 abstracts were identified, 104 full papers were assessed and 33 papers met the inclusion criteria and were included in the review. An additional paper was included in the review upon a revision in 2014. The papers show that LUTS are common in the UK, affecting ≈3% of men aged 45-49 years, rising to >30% in men aged ≥85 years. European and USA studies have reported the major impact of LUTS on quality of life of the patient

LMI-based stability analysis of fuzzy-model-based control systems using approximated polynomial membership functions.

Science.gov (United States)

Narimani, Mohammand; Lam, H K; Dilmaghani, R; Wolfe, Charles

2011-06-01

Relaxed linear-matrix-inequality-based stability conditions for fuzzy-model-based control systems with imperfect premise matching are proposed. First, the derivative of the Lyapunov function, containing the product terms of the fuzzy model and fuzzy controller membership functions, is derived. Then, in the partitioned operating domain of the membership functions, the relations between the state variables and the mentioned product terms are represented by approximated polynomials in each subregion. Next, the stability conditions containing the information of all subsystems and the approximated polynomials are derived. In addition, the concept of the S-procedure is utilized to release the conservativeness caused by considering the whole operating region for approximated polynomials. It is shown that the well-known stability conditions can be special cases of the proposed stability conditions. Simulation examples are given to illustrate the validity of the proposed approach.

M-Polynomial and Degree-Based Topological Indices of Polyhex Nanotubes

Directory of Open Access Journals (Sweden)

Mobeen Munir

2016-12-01

Full Text Available The discovery of new nanomaterials adds new dimensions to industry, electronics, and pharmaceutical and biological therapeutics. In this article, we first find closed forms of M-polynomials of polyhex nanotubes. We also compute closed forms of various degree-based topological indices of these tubes. These indices are numerical tendencies that often depict quantitative structural activity/property/toxicity relationships and correlate certain physico-chemical properties, such as boiling point, stability, and strain energy, of respective nanomaterial. To conclude, we plot surfaces associated to M-polynomials and characterize some facts about these tubes.

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

Non-hermitian symmetric N = 2 coset models, Poincare polynomials, and string compactification

International Nuclear Information System (INIS)

Fuchs, J.; Schweigert, C.

1994-01-01

The field identification problem, including fixed point resolution, is solved for the non-hermitian symmetric N = 2 superconformal coset theories. Thereby these models are finally identified as well-defined modular invariant conformal field theories. As an application, the theories are used as subtheories in N = 2 tensor products with c = 9, which in turn are taken as the inner sector of heterotic superstring compactifications. All string theories of this type are classified, and the chiral ring as well as the number of massless generations and anti-generations are computed with the help of the extended Poincare polynomial. Several equivalences between a priori different non-hermitian coset theories show up; in particular there is a level-rank duality for an infinite series of coset theories based on C-type Lie algebras. Further, some general results for generic N = 2 coset theories are proven: a simple formula for the number of identification currents is found, and it is shown that the set of Ramond ground states of any N = 2 coset model is invariant under charge conjugation. (orig.)

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.

Design of a polynomial ring based symmetric homomorphic encryption scheme

Directory of Open Access Journals (Sweden)

Smaranika Dasgupta

2016-09-01

Full Text Available Security of data, especially in clouds, has become immensely essential for present-day applications. Fully homomorphic encryption (FHE is a great way to secure data which is used and manipulated by untrusted applications or systems. In this paper, we propose a symmetric FHE scheme based on polynomial over ring of integers. This scheme is somewhat homomorphic due to accumulation of noise after few operations, which is made fully homomorphic using a refresh procedure. After certain amount of homomorphic computations, large ciphertexts are refreshed for proper decryption. The hardness of the scheme is based on the difficulty of factorizing large integers. Also, it requires polynomial addition which is computationally cost effective. Experimental results are shown to support our claim.

A comparison of high-order polynomial and wave-based methods for Helmholtz problems

Science.gov (United States)

Lieu, Alice; Gabard, Gwénaël; Bériot, Hadrien

2016-09-01

The application of computational modelling to wave propagation problems is hindered by the dispersion error introduced by the discretisation. Two common strategies to address this issue are to use high-order polynomial shape functions (e.g. hp-FEM), or to use physics-based, or Trefftz, methods where the shape functions are local solutions of the problem (typically plane waves). Both strategies have been actively developed over the past decades and both have demonstrated their benefits compared to conventional finite-element methods, but they have yet to be compared. In this paper a high-order polynomial method (p-FEM with Lobatto polynomials) and the wave-based discontinuous Galerkin method are compared for two-dimensional Helmholtz problems. A number of different benchmark problems are used to perform a detailed and systematic assessment of the relative merits of these two methods in terms of interpolation properties, performance and conditioning. It is generally assumed that a wave-based method naturally provides better accuracy compared to polynomial methods since the plane waves or Bessel functions used in these methods are exact solutions of the Helmholtz equation. Results indicate that this expectation does not necessarily translate into a clear benefit, and that the differences in performance, accuracy and conditioning are more nuanced than generally assumed. The high-order polynomial method can in fact deliver comparable, and in some cases superior, performance compared to the wave-based DGM. In addition to benchmarking the intrinsic computational performance of these methods, a number of practical issues associated with realistic applications are also discussed.

Constructing general partial differential equations using polynomial and neural networks.

Science.gov (United States)

Zjavka, Ladislav; Pedrycz, Witold

2016-01-01

Sum fraction terms can approximate multi-variable functions on the basis of discrete observations, replacing a partial differential equation definition with polynomial elementary data relation descriptions. Artificial neural networks commonly transform the weighted sum of inputs to describe overall similarity relationships of trained and new testing input patterns. Differential polynomial neural networks form a new class of neural networks, which construct and solve an unknown general partial differential equation of a function of interest with selected substitution relative terms using non-linear multi-variable composite polynomials. The layers of the network generate simple and composite relative substitution terms whose convergent series combinations can describe partial dependent derivative changes of the input variables. This regression is based on trained generalized partial derivative data relations, decomposed into a multi-layer polynomial network structure. The sigmoidal function, commonly used as a nonlinear activation of artificial neurons, may transform some polynomial items together with the parameters with the aim to improve the polynomial derivative term series ability to approximate complicated periodic functions, as simple low order polynomials are not able to fully make up for the complete cycles. The similarity analysis facilitates substitutions for differential equations or can form dimensional units from data samples to describe real-world problems. Copyright © 2015 Elsevier Ltd. All rights reserved.

A Polynomial Subset-Based Efficient Multi-Party Key Management System for Lightweight Device Networks.

Science.gov (United States)

Mahmood, Zahid; Ning, Huansheng; Ghafoor, AtaUllah

2017-03-24

Wireless Sensor Networks (WSNs) consist of lightweight devices to measure sensitive data that are highly vulnerable to security attacks due to their constrained resources. In a similar manner, the internet-based lightweight devices used in the Internet of Things (IoT) are facing severe security and privacy issues because of the direct accessibility of devices due to their connection to the internet. Complex and resource-intensive security schemes are infeasible and reduce the network lifetime. In this regard, we have explored the polynomial distribution-based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied. It becomes more costly when these polynomials are regenerated dynamically after each node join or leave operation and whenever key is refreshed. To reduce the computation, we have proposed an Efficient Key Management (EKM) scheme for multiparty communication-based scenarios. The proposed session key management protocol is established by applying a symmetric polynomial for group members, and the group head acts as a responsible node. The polynomial generation method uses security credentials and secure hash function. Symmetric cryptographic parameters are efficient in computation, communication, and the storage required. The security justification of the proposed scheme has been completed by using Rubin logic, which guarantees that the protocol attains mutual validation and session key agreement property strongly among the participating entities. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs during authentication, session key generation, node migration, secure joining, and leaving phases. EKM is efficient regarding storage, computation, and communication overhead and can protect WSN-based IoT infrastructure.

Perceptually informed synthesis of bandlimited classical waveforms using integrated polynomial interpolation.

Science.gov (United States)

Välimäki, Vesa; Pekonen, Jussi; Nam, Juhan

2012-01-01

Digital subtractive synthesis is a popular music synthesis method, which requires oscillators that are aliasing-free in a perceptual sense. It is a research challenge to find computationally efficient waveform generation algorithms that produce similar-sounding signals to analog music synthesizers but which are free from audible aliasing. A technique for approximately bandlimited waveform generation is considered that is based on a polynomial correction function, which is defined as the difference of a non-bandlimited step function and a polynomial approximation of the ideal bandlimited step function. It is shown that the ideal bandlimited step function is equivalent to the sine integral, and that integrated polynomial interpolation methods can successfully approximate it. Integrated Lagrange interpolation and B-spline basis functions are considered for polynomial approximation. The polynomial correction function can be added onto samples around each discontinuity in a non-bandlimited waveform to suppress aliasing. Comparison against previously known methods shows that the proposed technique yields the best tradeoff between computational cost and sound quality. The superior method amongst those considered in this study is the integrated third-order B-spline correction function, which offers perceptually aliasing-free sawtooth emulation up to the fundamental frequency of 7.8 kHz at the sample rate of 44.1 kHz. © 2012 Acoustical Society of America.

Patient's adherence on pharmacological therapy for benign prostatic hyperplasia (BPH)-associated lower urinary tract symptoms (LUTS) is different: is combination therapy better than monotherapy?

Science.gov (United States)

Cindolo, Luca; Pirozzi, Luisella; Sountoulides, Petros; Fanizza, Caterina; Romero, Marilena; Castellan, Pietro; Antonelli, Alessandro; Simeone, Claudio; Tubaro, Andrea; de Nunzio, Cosimo; Schips, Luigi

2015-09-21

Recent studies showed that the non-adherence to the pharmacological therapy of patients affected by BPH-associated LUTS increased the risk of clinical progression of BPH. We examined the patients adherence to pharmacological therapy and its clinical consequences in men with BPH-associated LUTS looking at the differences between drug classes comparing mono vs combination therapy. A retrospective, population-based cohort study, using prescription administrative database and hospital discharge codes from a total of 1.5 million Italian men. Patients ≥ 40 years, administered alpha-blockers (AB) and 5alpha-reductase inhibitors (5ARIs), alone or in combination (CT), for BPH-associated LUTS were analyzed. The 1-year and long term adherence together with the analyses of hospitalization rates for BPH and BPH-related surgery were examined using multivariable Cox proportional hazards regression model and Pearson chi square test. Patients exposed to at least 6 months of therapy had a 1-year overall adherence of 29 % (monotherapy AB 35 %, monotherapy 5ARI 18 %, CT 9 %). Patient adherence progressively declined to 15 %, 8 % and 3 % for AB, 5ARI, and CT, respectively at the fifth year of follow up. Patients on CT had a higher discontinuation rate along all the follow-up compared to those under monotherapy with ABs or 5ARIs (all p BPH-related surgery (HR 0.94; p BPH-associated LUTS is low and varies depending on drugs class. Patients under CT have a higher likelihood of discontinuing treatment for a number of reasons that should be better investigated. Our study suggests that new strategies aiming to increase patient's adherence to the prescribed treatment are necessary in order to prevent BPH progression.

LUTS and sexual dysfunction : Implications for management of BPH

NARCIS (Netherlands)

van Moorselaar, J

2003-01-01

Objectives: To summarise currently available data describing the impact of surgical and pharmacological treatments for lower urinary tract symptoms (LUTS) on male sexual function. To compare treatment options and outline implications for the management of this patient group. Methods: Key published

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

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

Strong result for real zeros of random algebraic polynomials

Directory of Open Access Journals (Sweden)

T. Uno

2001-01-01

Full Text Available An estimate is given for the lower bound of real zeros of random algebraic polynomials whose coefficients are non-identically distributed dependent Gaussian random variables. Moreover, our estimated measure of the exceptional set, which is independent of the degree of the polynomials, tends to zero as the degree of the polynomial tends to infinity.

Learning Mixtures of Polynomials of Conditional Densities from Data

DEFF Research Database (Denmark)

L. López-Cruz, Pedro; Nielsen, Thomas Dyhre; Bielza, Concha

2013-01-01

Mixtures of polynomials (MoPs) are a non-parametric density estimation technique for hybrid Bayesian networks with continuous and discrete variables. We propose two methods for learning MoP ap- proximations of conditional densities from data. Both approaches are based on learning MoP approximatio...

Superiority of Bessel function over Zernicke polynomial as base ...

Indian Academy of Sciences (India)

Abstract. Here we describe the superiority of Bessel function as base function for radial expan- sion over Zernicke polynomial in the tomographic reconstruction technique. The causes for the superiority have been described in detail. The superiority has been shown both with simulated data for Kadomtsev's model for ...

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.

A Fast lattice-based polynomial digital signature system for m-commerce

Science.gov (United States)

Wei, Xinzhou; Leung, Lin; Anshel, Michael

2003-01-01

The privacy and data integrity are not guaranteed in current wireless communications due to the security hole inside the Wireless Application Protocol (WAP) version 1.2 gateway. One of the remedies is to provide an end-to-end security in m-commerce by applying application level security on top of current WAP1.2. The traditional security technologies like RSA and ECC applied on enterprise's server are not practical for wireless devices because wireless devices have relatively weak computation power and limited memory compared with server. In this paper, we developed a lattice based polynomial digital signature system based on NTRU's Polynomial Authentication and Signature Scheme (PASS), which enabled the feasibility of applying high-level security on both server and wireless device sides.

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

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.

Non-stationary component extraction in noisy multicomponent signal using polynomial chirping Fourier transform.

Science.gov (United States)

Lu, Wenlong; Xie, Junwei; Wang, Heming; Sheng, Chuan

2016-01-01

Inspired by track-before-detection technology in radar, a novel time-frequency transform, namely polynomial chirping Fourier transform (PCFT), is exploited to extract components from noisy multicomponent signal. The PCFT combines advantages of Fourier transform and polynomial chirplet transform to accumulate component energy along a polynomial chirping curve in the time-frequency plane. The particle swarm optimization algorithm is employed to search optimal polynomial parameters with which the PCFT will achieve a most concentrated energy ridge in the time-frequency plane for the target component. The component can be well separated in the polynomial chirping Fourier domain with a narrow-band filter and then reconstructed by inverse PCFT. Furthermore, an iterative procedure, involving parameter estimation, PCFT, filtering and recovery, is introduced to extract components from a noisy multicomponent signal successively. The Simulations and experiments show that the proposed method has better performance in component extraction from noisy multicomponent signal as well as provides more time-frequency details about the analyzed signal than conventional methods.

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.

Algorithms for computing solvents of unilateral second-order matrix polynomials over prime finite fields using lambda-matrices

Science.gov (United States)

Burtyka, Filipp

2018-01-01

The paper considers algorithms for finding diagonalizable and non-diagonalizable roots (so called solvents) of monic arbitrary unilateral second-order matrix polynomial over prime finite field. These algorithms are based on polynomial matrices (lambda-matrices). This is an extension of existing general methods for computing solvents of matrix polynomials over field of complex numbers. We analyze how techniques for complex numbers can be adapted for finite field and estimate asymptotic complexity of the obtained algorithms.

Hydrodynamics-based functional forms of activity metabolism: a case for the power-law polynomial function in animal swimming energetics.

Science.gov (United States)

Papadopoulos, Anthony

2009-01-01

The first-degree power-law polynomial function is frequently used to describe activity metabolism for steady swimming animals. This function has been used in hydrodynamics-based metabolic studies to evaluate important parameters of energetic costs, such as the standard metabolic rate and the drag power indices. In theory, however, the power-law polynomial function of any degree greater than one can be used to describe activity metabolism for steady swimming animals. In fact, activity metabolism has been described by the conventional exponential function and the cubic polynomial function, although only the power-law polynomial function models drag power since it conforms to hydrodynamic laws. Consequently, the first-degree power-law polynomial function yields incorrect parameter values of energetic costs if activity metabolism is governed by the power-law polynomial function of any degree greater than one. This issue is important in bioenergetics because correct comparisons of energetic costs among different steady swimming animals cannot be made unless the degree of the power-law polynomial function derives from activity metabolism. In other words, a hydrodynamics-based functional form of activity metabolism is a power-law polynomial function of any degree greater than or equal to one. Therefore, the degree of the power-law polynomial function should be treated as a parameter, not as a constant. This new treatment not only conforms to hydrodynamic laws, but also ensures correct comparisons of energetic costs among different steady swimming animals. Furthermore, the exponential power-law function, which is a new hydrodynamics-based functional form of activity metabolism, is a special case of the power-law polynomial function. Hence, the link between the hydrodynamics of steady swimming and the exponential-based metabolic model is defined.

Hydrodynamics-based functional forms of activity metabolism: a case for the power-law polynomial function in animal swimming energetics.

Directory of Open Access Journals (Sweden)

Anthony Papadopoulos

Full Text Available The first-degree power-law polynomial function is frequently used to describe activity metabolism for steady swimming animals. This function has been used in hydrodynamics-based metabolic studies to evaluate important parameters of energetic costs, such as the standard metabolic rate and the drag power indices. In theory, however, the power-law polynomial function of any degree greater than one can be used to describe activity metabolism for steady swimming animals. In fact, activity metabolism has been described by the conventional exponential function and the cubic polynomial function, although only the power-law polynomial function models drag power since it conforms to hydrodynamic laws. Consequently, the first-degree power-law polynomial function yields incorrect parameter values of energetic costs if activity metabolism is governed by the power-law polynomial function of any degree greater than one. This issue is important in bioenergetics because correct comparisons of energetic costs among different steady swimming animals cannot be made unless the degree of the power-law polynomial function derives from activity metabolism. In other words, a hydrodynamics-based functional form of activity metabolism is a power-law polynomial function of any degree greater than or equal to one. Therefore, the degree of the power-law polynomial function should be treated as a parameter, not as a constant. This new treatment not only conforms to hydrodynamic laws, but also ensures correct comparisons of energetic costs among different steady swimming animals. Furthermore, the exponential power-law function, which is a new hydrodynamics-based functional form of activity metabolism, is a special case of the power-law polynomial function. Hence, the link between the hydrodynamics of steady swimming and the exponential-based metabolic model is defined.

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.

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.

Describing Quadratic Cremer Point Polynomials by Parabolic Perturbations

DEFF Research Database (Denmark)

Sørensen, Dan Erik Krarup

1996-01-01

We describe two infinite order parabolic perturbation proceduresyielding quadratic polynomials having a Cremer fixed point. The main ideais to obtain the polynomial as the limit of repeated parabolic perturbations.The basic tool at each step is to control the behaviour of certain externalrays.......Polynomials of the Cremer type correspond to parameters at the boundary of ahyperbolic component of the Mandelbrot set. In this paper we concentrate onthe main cardioid component. We investigate the differences between two-sided(i.e. alternating) and one-sided parabolic perturbations.In the two-sided case, we prove...... the existence of polynomials having an explicitlygiven external ray accumulating both at the Cremer point and at its non-periodicpreimage. We think of the Julia set as containing a "topologists double comb".In the one-sided case we prove a weaker result: the existence of polynomials havingan explicitly given...

A new Identity Based Encryption (IBE) scheme using extended Chebyshev polynomial over finite fields Zp

International Nuclear Information System (INIS)

Benasser Algehawi, Mohammed; Samsudin, Azman

2010-01-01

We present a method to extract key pairs needed for the Identity Based Encryption (IBE) scheme from extended Chebyshev polynomial over finite fields Z p . Our proposed scheme relies on the hard problem and the bilinear property of the extended Chebyshev polynomial over Z p . The proposed system is applicable, secure, and reliable.

Influence of surface error on electromagnetic performance of reflectors based on Zernike polynomials

Science.gov (United States)

Li, Tuanjie; Shi, Jiachen; Tang, Yaqiong

2018-04-01

This paper investigates the influence of surface error distribution on the electromagnetic performance of antennas. The normalized Zernike polynomials are used to describe a smooth and continuous deformation surface. Based on the geometrical optics and piecewise linear fitting method, the electrical performance of reflector described by the Zernike polynomials is derived to reveal the relationship between surface error distribution and electromagnetic performance. Then the relation database between surface figure and electric performance is built for ideal and deformed surfaces to realize rapidly calculation of far-field electric performances. The simulation analysis of the influence of Zernike polynomials on the electrical properties for the axis-symmetrical reflector with the axial mode helical antenna as feed is further conducted to verify the correctness of the proposed method. Finally, the influence rules of surface error distribution on electromagnetic performance are summarized. The simulation results show that some terms of Zernike polynomials may decrease the amplitude of main lobe of antenna pattern, and some may reduce the pointing accuracy. This work extracts a new concept for reflector's shape adjustment in manufacturing process.

Adaptive Digital Predistortion Schemes to Linearize RF Power Amplifiers with Memory Effects

Institute of Scientific and Technical Information of China (English)

ZHANG Peng; WU Si-liang; ZHANG Qin

2008-01-01

To compensate for nonlinear distortion introduced by RF power amplifiers (PAs) with memory effects, two correlated models, namely an extended memory polynomial (EMP) model and a memory lookup table (LUT) model, are proposed for predistorter design. Two adaptive digital predistortion (ADPD) schemes with indirect learning architecture are presented. One adopts the EMP model and the recursive least square (RLS) algorithm, and the other utilizes the memory LUT model and the least mean square (LMS) algorithm. Simulation results demonstrate that the EMP-based ADPD yields the best linearization performance in terms of suppressing spectral regrowth. It is also shown that the ADPD based on memory LUT makes optimum tradeoff between performance and computational complexity.

Some Results on the Independence Polynomial of Unicyclic Graphs

Directory of Open Access Journals (Sweden)

Oboudi Mohammad Reza

2018-05-01

Full Text Available Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x=∑k=0ns(G,kxk$I(G,x = \\sum\

A genetic variant near GATA3 implicated in inherited susceptibility and etiology of benign prostatic hyperplasia (BPH) and lower urinary tract symptoms (LUTS).

Science.gov (United States)

Na, Rong; Helfand, Brian T; Chen, Haitao; Conran, Carly A; Crawford, Susan E; Hayward, Simon W; Tammela, Teuvo L J; Hoffman-Bolton, Judy; Zheng, Siqun L; Walsh, Patrick C; Schleutker, Johanna; Platz, Elizabeth A; Isaacs, William B; Xu, Jianfeng

2017-08-01

Benign prostatic hyperplasia (BPH) and associated lower urinary tract symptoms (LUTS) are common conditions. Little is known about their etiologies except that studies have suggested a substantial heritable component. Our objective is to provide a comprehensive, genome-wide evaluation of inherited risks and possible mechanisms of etiology in BPH. We performed a three-stage, genome-wide association study (GWAS) of men from three independent populations, the REduction by DUtasteride of prostate Cancer Events (REDUCE) trial, the CLUE II cohort, and a Finnish hospital-based population. DNA samples were genotyped using the Illumina HumanOmniExpress BeadChip in REDUCE and CLUE II, and using the Sequenom iPLEX system for the confirmation stage in the Finnish population. A logistic regression model was used to evaluate the association between each SNP and BPH/LUTS. Fourteen SNPs reached P BPH pathogenesis and progression. Rs17144046 located near GATA3 was significantly associated with BPH/LUTS in three independent populations, but did not reach a stringent GWAS significance level. Genetic variants of GATA3 may play a role in the inherited susceptibility and etiology of BPH/LUTS. Further research in this area is needed. © 2017 Wiley Periodicals, Inc.

Skew-orthogonal polynomials and random matrix theory

CERN Document Server

Ghosh, Saugata

2009-01-01

Orthogonal polynomials satisfy a three-term recursion relation irrespective of the weight function with respect to which they are defined. This gives a simple formula for the kernel function, known in the literature as the Christoffel-Darboux sum. The availability of asymptotic results of orthogonal polynomials and the simple structure of the Christoffel-Darboux sum make the study of unitary ensembles of random matrices relatively straightforward. In this book, the author develops the theory of skew-orthogonal polynomials and obtains recursion relations which, unlike orthogonal polynomials, depend on weight functions. After deriving reduced expressions, called the generalized Christoffel-Darboux formulas (GCD), he obtains universal correlation functions and non-universal level densities for a wide class of random matrix ensembles using the GCD. The author also shows that once questions about higher order effects are considered (questions that are relevant in different branches of physics and mathematics) the ...

Mirror symmetry, toric branes and topological string amplitudes as polynomials

Energy Technology Data Exchange (ETDEWEB)

Alim, Murad

2009-07-13

The central theme of this thesis is the extension and application of mirror symmetry of topological string theory. The contribution of this work on the mathematical side is given by interpreting the calculated partition functions as generating functions for mathematical invariants which are extracted in various examples. Furthermore the extension of the variation of the vacuum bundle to include D-branes on compact geometries is studied. Based on previous work for non-compact geometries a system of differential equations is derived which allows to extend the mirror map to the deformation spaces of the D-Branes. Furthermore, these equations allow the computation of the full quantum corrected superpotentials which are induced by the D-branes. Based on the holomorphic anomaly equation, which describes the background dependence of topological string theory relating recursively loop amplitudes, this work generalizes a polynomial construction of the loop amplitudes, which was found for manifolds with a one dimensional space of deformations, to arbitrary target manifolds with arbitrary dimension of the deformation space. The polynomial generators are determined and it is proven that the higher loop amplitudes are polynomials of a certain degree in the generators. Furthermore, the polynomial construction is generalized to solve the extension of the holomorphic anomaly equation to D-branes without deformation space. This method is applied to calculate higher loop amplitudes in numerous examples and the mathematical invariants are extracted. (orig.)

Mirror symmetry, toric branes and topological string amplitudes as polynomials

International Nuclear Information System (INIS)

Alim, Murad

2009-01-01

The central theme of this thesis is the extension and application of mirror symmetry of topological string theory. The contribution of this work on the mathematical side is given by interpreting the calculated partition functions as generating functions for mathematical invariants which are extracted in various examples. Furthermore the extension of the variation of the vacuum bundle to include D-branes on compact geometries is studied. Based on previous work for non-compact geometries a system of differential equations is derived which allows to extend the mirror map to the deformation spaces of the D-Branes. Furthermore, these equations allow the computation of the full quantum corrected superpotentials which are induced by the D-branes. Based on the holomorphic anomaly equation, which describes the background dependence of topological string theory relating recursively loop amplitudes, this work generalizes a polynomial construction of the loop amplitudes, which was found for manifolds with a one dimensional space of deformations, to arbitrary target manifolds with arbitrary dimension of the deformation space. The polynomial generators are determined and it is proven that the higher loop amplitudes are polynomials of a certain degree in the generators. Furthermore, the polynomial construction is generalized to solve the extension of the holomorphic anomaly equation to D-branes without deformation space. This method is applied to calculate higher loop amplitudes in numerous examples and the mathematical invariants are extracted. (orig.)

Linear operator pencils on Lie algebras and Laurent biorthogonal polynomials

International Nuclear Information System (INIS)

Gruenbaum, F A; Vinet, Luc; Zhedanov, Alexei

2004-01-01

We study operator pencils on generators of the Lie algebras sl 2 and the oscillator algebra. These pencils are linear in a spectral parameter λ. The corresponding generalized eigenvalue problem gives rise to some sets of orthogonal polynomials and Laurent biorthogonal polynomials (LBP) expressed in terms of the Gauss 2 F 1 and degenerate 1 F 1 hypergeometric functions. For special choices of the parameters of the pencils, we identify the resulting polynomials with the Hendriksen-van Rossum LBP which are widely believed to be the biorthogonal analogues of the classical orthogonal polynomials. This places these examples under the umbrella of the generalized bispectral problem which is considered here. Other (non-bispectral) cases give rise to some 'nonclassical' orthogonal polynomials including Tricomi-Carlitz and random-walk polynomials. An application to solutions of relativistic Toda chain is considered

Polynomial fuzzy model-based control systems stability analysis and control synthesis using membership function dependent techniques

CERN Document Server

Lam, Hak-Keung

2016-01-01

This book presents recent research on the stability analysis of polynomial-fuzzy-model-based control systems where the concept of partially/imperfectly matched premises and membership-function dependent analysis are considered. The membership-function-dependent analysis offers a new research direction for fuzzy-model-based control systems by taking into account the characteristic and information of the membership functions in the stability analysis. The book presents on a research level the most recent and advanced research results, promotes the research of polynomial-fuzzy-model-based control systems, and provides theoretical support and point a research direction to postgraduate students and fellow researchers. Each chapter provides numerical examples to verify the analysis results, demonstrate the effectiveness of the proposed polynomial fuzzy control schemes, and explain the design procedure. The book is comprehensively written enclosing detailed derivation steps and mathematical derivations also for read...

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.

Applications of Kalman filters based on non-linear functions to numerical weather predictions

Directory of Open Access Journals (Sweden)

G. Galanis

2006-10-01

Full Text Available This paper investigates the use of non-linear functions in classical Kalman filter algorithms on the improvement of regional weather forecasts. The main aim is the implementation of non linear polynomial mappings in a usual linear Kalman filter in order to simulate better non linear problems in numerical weather prediction. In addition, the optimal order of the polynomials applied for such a filter is identified. This work is based on observations and corresponding numerical weather predictions of two meteorological parameters characterized by essential differences in their evolution in time, namely, air temperature and wind speed. It is shown that in both cases, a polynomial of low order is adequate for eliminating any systematic error, while higher order functions lead to instabilities in the filtered results having, at the same time, trivial contribution to the sensitivity of the filter. It is further demonstrated that the filter is independent of the time period and the geographic location of application.

Applications of Kalman filters based on non-linear functions to numerical weather predictions

Directory of Open Access Journals (Sweden)

G. Galanis

2006-10-01

Full Text Available This paper investigates the use of non-linear functions in classical Kalman filter algorithms on the improvement of regional weather forecasts. The main aim is the implementation of non linear polynomial mappings in a usual linear Kalman filter in order to simulate better non linear problems in numerical weather prediction. In addition, the optimal order of the polynomials applied for such a filter is identified. This work is based on observations and corresponding numerical weather predictions of two meteorological parameters characterized by essential differences in their evolution in time, namely, air temperature and wind speed. It is shown that in both cases, a polynomial of low order is adequate for eliminating any systematic error, while higher order functions lead to instabilities in the filtered results having, at the same time, trivial contribution to the sensitivity of the filter. It is further demonstrated that the filter is independent of the time period and the geographic location of application.

Evaluation and management of children with lower urinary tract symptoms (LUTS

Directory of Open Access Journals (Sweden)

Guerrero Tinoco, Gustavo Adolfo

2018-01-01

Full Text Available Voiding dysfunction is a disorder of the bladder filling or emptying in children without neurological or anatomical disorders. Lower urinary tract symptoms (LUTS are a frequent reason for consulting the pediatrician, nephrologist or pediatric urologist, and even the neurologist and child psychologist. It is considered a relatively benign disease that sometimes generates disinterest among doctors and families, leading to late consultation and inadequate interpretation of symptoms. Urgency, incontinence, enuresis, post-void dribbling, urinary tract infections, recurrent vulvovaginitis and constipation in children without neurological disease should lead to consider the possibility of voiding dysfunction, in order to recognize it timely, restore the quality of life, prevent urinary tract infection and the irreversible kidney damage secondary to delayed diagnosis. Current recommendations emphasize on a less invasive approach, conservative treatment, management of constipation and bladder retraining. This article discusses the correct assessment, diagnosis and management of children with LUTS.

A new high accuracy non-polynomial tension spline method for the solution of one dimensional wave equation in polar co-ordinates

Directory of Open Access Journals (Sweden)

Venu Gopal

2014-07-01

Full Text Available In this paper, we propose a new three-level implicit nine point compact finite difference formulation of O(k2 + h4 based on non-polynomial tension spline approximation in r-direction and finite difference approximation in t-direction for the numerical solution of one dimensional wave equation in polar co-ordinates. We describe the mathematical formulation procedure in details and also discuss the stability of the method. Numerical results are provided to justify the usefulness of the proposed method.

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

New operator-ordering identities and associative integration formulas of two-variable Hermite polynomials for constructing non-Gaussian states

International Nuclear Information System (INIS)

Fan Hong-Yi; Wang Zhen

2014-01-01

For directly normalizing the photon non-Gaussian states (e.g., photon added and subtracted squeezed states), we use the method of integration within an ordered product (IWOP) of operators to derive some new bosonic operator-ordering identities. We also derive some new integration transformation formulas about one- and two-variable Hermite polynomials in complex function space. These operator identities and associative integration formulas provide much convenience for constructing non-Gaussian states in quantum engineering. (general)

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.

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

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

Novel stability criteria for fuzzy Hopfield neural networks based on an improved homogeneous matrix polynomials technique

International Nuclear Information System (INIS)

Feng Yi-Fu; Zhang Qing-Ling; Feng De-Zhi

2012-01-01

The global stability problem of Takagi—Sugeno (T—S) fuzzy Hopfield neural networks (FHNNs) with time delays is investigated. Novel LMI-based stability criteria are obtained by using Lyapunov functional theory to guarantee the asymptotic stability of the FHNNs with less conservatism. Firstly, using both Finsler's lemma and an improved homogeneous matrix polynomial technique, and applying an affine parameter-dependent Lyapunov—Krasovskii functional, we obtain the convergent LMI-based stability criteria. Algebraic properties of the fuzzy membership functions in the unit simplex are considered in the process of stability analysis via the homogeneous matrix polynomials technique. Secondly, to further reduce the conservatism, a new right-hand-side slack variables introducing technique is also proposed in terms of LMIs, which is suitable to the homogeneous matrix polynomials setting. Finally, two illustrative examples are given to show the efficiency of the proposed approaches

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

Collagen content in the bladder of men with LUTS undergoing open prostatectomy: A pilot study.

Science.gov (United States)

Averbeck, Marcio A; De Lima, Nelson G; Motta, Gabriela A; Beltrao, Lauro F; Abboud Filho, Nury J; Rigotti, Clarice P; Dos Santos, William N; Dos Santos, Steven K J; Da Silva, Luis F B; Rhoden, Ernani L

2018-03-01

To evaluate the collagen content in the bladder wall of men undergoing open prostate surgery. From July 2014 to August 2016, men aged ≥ 50 years, presenting LUTS and undergoing open prostate surgery due to benign prostatic enlargement (BPE) or prostate cancer were prospectively enrolled. Preoperative assessment included validated questionnaires (IPSS and OAB-V8), lower urinary tract ultrasound, and urodynamics. Bladder biopsies were obtained during open prostatectomy for determination of collagen content (sirius red-picric acid stain; polarized light analysis). Collagen to smooth muscle ratio (C/M) in the detrusor was measured and its relationship with preoperative parameters was investigated. The level of significance was P non-diabetic patients (17.71 ± 6.82% vs 12.46 ± 5.2%, respectively; P = 0.024). Reduced bladder compliance was also marker for higher collagen content (P = 0.042). Bladder outlet obstruction (BOO) was not a predictor of increased collagen deposition in the bladder wall (P = 0.75). Patients with PVR ≥ 200 mL showed a higher collagen to smooth muscle ratio in the bladder wall (P = 0.036). DM2 and urodynamic parameters, such as increased PVR and reduced bladder compliance, were associated with higher collagen content in the bladder wall of men with LUTS. © 2017 Wiley Periodicals, Inc.

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

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

A quasi-static polynomial nodal method for nuclear reactor analysis

International Nuclear Information System (INIS)

Gehin, J.C.

1992-09-01

Modern nodal methods are currently available which can accurately and efficiently solve the static and transient neutron diffusion equations. Most of the methods, however, are limited to two energy groups for practical application. The objective of this research is the development of a static and transient, multidimensional nodal method which allows more than two energy groups and uses a non-linear iterative method for efficient solution of the nodal equations. For both the static and transient methods, finite-difference equations which are corrected by the use of discontinuity factors are derived. The discontinuity factors are computed from a polynomial nodal method using a non-linear iteration technique. The polynomial nodal method is based upon a quartic approximation and utilizes a quadratic transverse-leakage approximation. The solution of the time-dependent equations is performed by the use of a quasi-static method in which the node-averaged fluxes are factored into shape and amplitude functions. The application of the quasi-static polynomial method to several benchmark problems demonstrates that the accuracy is consistent with that of other nodal methods. The use of the quasi-static method is shown to substantially reduce the computation time over the traditional fully-implicit time-integration method. Problems involving thermal-hydraulic feedback are accurately, and efficiently, solved by performing several reactivity/thermal-hydraulic updates per shape calculation

A quasi-static polynomial nodal method for nuclear reactor analysis

Energy Technology Data Exchange (ETDEWEB)

Gehin, Jess C. [Massachusetts Inst. of Tech., Cambridge, MA (United States)

1992-09-01

Modern nodal methods are currently available which can accurately and efficiently solve the static and transient neutron diffusion equations. Most of the methods, however, are limited to two energy groups for practical application. The objective of this research is the development of a static and transient, multidimensional nodal method which allows more than two energy groups and uses a non-linear iterative method for efficient solution of the nodal equations. For both the static and transient methods, finite-difference equations which are corrected by the use of discontinuity factors are derived. The discontinuity factors are computed from a polynomial nodal method using a non-linear iteration technique. The polynomial nodal method is based upon a quartic approximation and utilizes a quadratic transverse-leakage approximation. The solution of the time-dependent equations is performed by the use of a quasi-static method in which the node-averaged fluxes are factored into shape and amplitude functions. The application of the quasi-static polynomial method to several benchmark problems demonstrates that the accuracy is consistent with that of other nodal methods. The use of the quasi-static method is shown to substantially reduce the computation time over the traditional fully-implicit time-integration method. Problems involving thermal-hydraulic feedback are accurately, and efficiently, solved by performing several reactivity/thermal-hydraulic updates per shape calculation.

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

Conditional Density Approximations with Mixtures of Polynomials

DEFF Research Database (Denmark)

Varando, Gherardo; López-Cruz, Pedro L.; Nielsen, Thomas Dyhre

2015-01-01

Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one- and multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce...... two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities...

Numerical Simulation of Polynomial-Speed Convergence Phenomenon

Science.gov (United States)

Li, Yao; Xu, Hui

2017-11-01

We provide a hybrid method that captures the polynomial speed of convergence and polynomial speed of mixing for Markov processes. The hybrid method that we introduce is based on the coupling technique and renewal theory. We propose to replace some estimates in classical results about the ergodicity of Markov processes by numerical simulations when the corresponding analytical proof is difficult. After that, all remaining conclusions can be derived from rigorous analysis. Then we apply our results to seek numerical justification for the ergodicity of two 1D microscopic heat conduction models. The mixing rate of these two models are expected to be polynomial but very difficult to prove. In both examples, our numerical results match the expected polynomial mixing rate well.

The role of inflammation in lower urinary tract symptoms (LUTS) due to benign prostatic hyperplasia (BPH) and its potential impact on medical therapy.

Science.gov (United States)

Ficarra, Vincenzo; Rossanese, Marta; Zazzara, Michele; Giannarini, Gianluca; Abbinante, Maria; Bartoletti, Riccardo; Mirone, Vincenzo; Scaglione, Francesco

2014-12-01

A chronic prostatic inflammation seems to play a crucial role in benign prostatic hyperplasia (BPH) pathogenesis and progression. Therefore, inflammation could represent a new potential target for medical therapy of lower urinary tract symptoms (LUTS) due to BPH (LUTS/BPH). This review article analyzes the evidence supporting the role of inflammation in the onset and progression of BPH, and it assesses the potential impact of previous mechanisms on medical therapy of LUTS/BPH. Literature data support the role of inflammation as a relevant factor in the pathogenesis of BPH. Indeed, several data favour the role of infiltrating lymphocytes in the development and progression of prostate adenoma as an effect of a self-maintaining remodeling process. Although available drugs commonly used in the treatment of LUTS/BPH do not exhibit an anti-inflammatory activity, it seems to be obvious considering the inflammation as a new target in the treatment of LUTS/BPH. Drugs currently investigated for the treatment of prostatic inflammation include the hexanic lipidosterolic extract of Serenoa repens, nonsteroidal anti-inflammatory drugs, and vitamin D receptor agonists.

Generalized Pseudospectral Method and Zeros of Orthogonal Polynomials

Directory of Open Access Journals (Sweden)

Oksana Bihun

2018-01-01

Full Text Available Via a generalization of the pseudospectral method for numerical solution of differential equations, a family of nonlinear algebraic identities satisfied by the zeros of a wide class of orthogonal polynomials is derived. The generalization is based on a modification of pseudospectral matrix representations of linear differential operators proposed in the paper, which allows these representations to depend on two, rather than one, sets of interpolation nodes. The identities hold for every polynomial family pνxν=0∞ orthogonal with respect to a measure supported on the real line that satisfies some standard assumptions, as long as the polynomials in the family satisfy differential equations Apν(x=qν(xpν(x, where A is a linear differential operator and each qν(x is a polynomial of degree at most n0∈N; n0 does not depend on ν. The proposed identities generalize known identities for classical and Krall orthogonal polynomials, to the case of the nonclassical orthogonal polynomials that belong to the class described above. The generalized pseudospectral representations of the differential operator A for the case of the Sonin-Markov orthogonal polynomials, also known as generalized Hermite polynomials, are presented. The general result is illustrated by new algebraic relations satisfied by the zeros of the Sonin-Markov polynomials.

Nested polynomial trends for the improvement of Gaussian process-based predictors

Science.gov (United States)

Perrin, G.; Soize, C.; Marque-Pucheu, S.; Garnier, J.

2017-10-01

The role of simulation keeps increasing for the sensitivity analysis and the uncertainty quantification of complex systems. Such numerical procedures are generally based on the processing of a huge amount of code evaluations. When the computational cost associated with one particular evaluation of the code is high, such direct approaches based on the computer code only, are not affordable. Surrogate models have therefore to be introduced to interpolate the information given by a fixed set of code evaluations to the whole input space. When confronted to deterministic mappings, the Gaussian process regression (GPR), or kriging, presents a good compromise between complexity, efficiency and error control. Such a method considers the quantity of interest of the system as a particular realization of a Gaussian stochastic process, whose mean and covariance functions have to be identified from the available code evaluations. In this context, this work proposes an innovative parametrization of this mean function, which is based on the composition of two polynomials. This approach is particularly relevant for the approximation of strongly non linear quantities of interest from very little information. After presenting the theoretical basis of this method, this work compares its efficiency to alternative approaches on a series of examples.

Differential Galois theory and non-integrability of planar polynomial vector fields

Science.gov (United States)

Acosta-Humánez, Primitivo B.; Lázaro, J. Tomás; Morales-Ruiz, Juan J.; Pantazi, Chara

2018-06-01

We study a necessary condition for the integrability of the polynomials vector fields in the plane by means of the differential Galois Theory. More concretely, by means of the variational equations around a particular solution it is obtained a necessary condition for the existence of a rational first integral. The method is systematic starting with the first order variational equation. We illustrate this result with several families of examples. A key point is to check whether a suitable primitive is elementary or not. Using a theorem by Liouville, the problem is equivalent to the existence of a rational solution of a certain first order linear equation, the Risch equation. This is a classical problem studied by Risch in 1969, and the solution is given by the "Risch algorithm". In this way we point out the connection of the non integrability with some higher transcendent functions, like the error function.

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

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

Existence of positive solutions for multi-term non-autonomous fractional differential equations with polynomial coefficients

Directory of Open Access Journals (Sweden)

Azizollah Babakhani

2006-10-01

Full Text Available In the present paper we discuss the existence of positive solutions in the case of multi-term non-autonomous fractional differential equations with polynomial coefficients; the constant coefficient case has been studied in [2]. We consider the equation $$ Big(D^{alpha_n} -sum_{j = 1}^{n - 1} p_j(xD^{alpha_{n - j}}Bigy = f(x, y. $$ We state various conditions on $f$ and $p_j$'s under which this equation has: positive solutions, a unique solution which is positive, and a unique solution which may not be positive.

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.

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.

On the estimation of the degree of regression polynomial

International Nuclear Information System (INIS)

Toeroek, Cs.

1997-01-01

The mathematical functions most commonly used to model curvature in plots are polynomials. Generally, the higher the degree of the polynomial, the more complex is the trend that its graph can represent. We propose a new statistical-graphical approach based on the discrete projective transformation (DPT) to estimating the degree of polynomial that adequately describes the trend in the plot

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.

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

Primitive polynomials selection method for pseudo-random number generator

Science.gov (United States)

Anikin, I. V.; Alnajjar, Kh

2018-01-01

In this paper we suggested the method for primitive polynomials selection of special type. This kind of polynomials can be efficiently used as a characteristic polynomials for linear feedback shift registers in pseudo-random number generators. The proposed method consists of two basic steps: finding minimum-cost irreducible polynomials of the desired degree and applying primitivity tests to get the primitive ones. Finally two primitive polynomials, which was found by the proposed method, used in pseudorandom number generator based on fuzzy logic (FRNG) which had been suggested before by the authors. The sequences generated by new version of FRNG have low correlation magnitude, high linear complexity, less power consumption, is more balanced and have better statistical properties.

The computation of bond percolation critical polynomials by the deletion–contraction algorithm

International Nuclear Information System (INIS)

Scullard, Christian R

2012-01-01

Although every exactly known bond percolation critical threshold is the root in [0,1] of a lattice-dependent polynomial, it has recently been shown that the notion of a critical polynomial can be extended to any periodic lattice. The polynomial is computed on a finite subgraph, called the base, of an infinite lattice. For any problem with exactly known solution, the prediction of the bond threshold is always correct for any base containing an arbitrary number of unit cells. For unsolved problems, the polynomial is referred to as the generalized critical polynomial and provides an approximation that becomes more accurate with increasing number of bonds in the base, appearing to approach the exact answer. The polynomials are computed using the deletion–contraction algorithm, which quickly becomes intractable by hand for more than about 18 bonds. Here, I present generalized critical polynomials calculated with a computer program for bases of up to 36 bonds for all the unsolved Archimedean lattices, except the kagome lattice, which was considered in an earlier work. The polynomial estimates are generally within 10 −5 –10 −7 of the numerical values, but the prediction for the (4,8 2 ) lattice, though not exact, is not ruled out by simulations. (paper)

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.

Zernike polynomial based Rayleigh-Ritz model of a piezoelectric unimorph deformable mirror

CSIR Research Space (South Africa)

Long, CS

2012-04-01

Full Text Available , are routinely and conveniently described using Zernike polynomials. A Rayleigh-Ritz structural model, which uses Zernike polynomials directly to describe the displacements, is proposed in this paper. The proposed formulation produces a numerically inexpensive...

Polynomial fuzzy observer designs: a sum-of-squares approach.

Science.gov (United States)

Tanaka, Kazuo; Ohtake, Hiroshi; Seo, Toshiaki; Tanaka, Motoyasu; Wang, Hua O

2012-10-01

This paper presents a sum-of-squares (SOS) approach to polynomial fuzzy observer designs for three classes of polynomial fuzzy systems. The proposed SOS-based framework provides a number of innovations and improvements over the existing linear matrix inequality (LMI)-based approaches to Takagi-Sugeno (T-S) fuzzy controller and observer designs. First, we briefly summarize previous results with respect to a polynomial fuzzy system that is a more general representation of the well-known T-S fuzzy system. Next, we propose polynomial fuzzy observers to estimate states in three classes of polynomial fuzzy systems and derive SOS conditions to design polynomial fuzzy controllers and observers. A remarkable feature of the SOS design conditions for the first two classes (Classes I and II) is that they realize the so-called separation principle, i.e., the polynomial fuzzy controller and observer for each class can be separately designed without lack of guaranteeing the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. Although, for the last class (Class III), the separation principle does not hold, we propose an algorithm to design polynomial fuzzy controller and observer satisfying the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. All the design conditions in the proposed approach can be represented in terms of SOS and are symbolically and numerically solved via the recently developed SOSTOOLS and a semidefinite-program solver, respectively. To illustrate the validity and applicability of the proposed approach, three design examples are provided. The examples demonstrate the advantages of the SOS-based approaches for the existing LMI approaches to T-S fuzzy observer designs.

Solutions of interval type-2 fuzzy polynomials using a new ranking method

Science.gov (United States)

Rahman, Nurhakimah Ab.; Abdullah, Lazim; Ghani, Ahmad Termimi Ab.; Ahmad, Noor'Ani

2015-10-01

A few years ago, a ranking method have been introduced in the fuzzy polynomial equations. Concept of the ranking method is proposed to find actual roots of fuzzy polynomials (if exists). Fuzzy polynomials are transformed to system of crisp polynomials, performed by using ranking method based on three parameters namely, Value, Ambiguity and Fuzziness. However, it was found that solutions based on these three parameters are quite inefficient to produce answers. Therefore in this study a new ranking method have been developed with the aim to overcome the inherent weakness. The new ranking method which have four parameters are then applied in the interval type-2 fuzzy polynomials, covering the interval type-2 of fuzzy polynomial equation, dual fuzzy polynomial equations and system of fuzzy polynomials. The efficiency of the new ranking method then numerically considered in the triangular fuzzy numbers and the trapezoidal fuzzy numbers. Finally, the approximate solutions produced from the numerical examples indicate that the new ranking method successfully produced actual roots for the interval type-2 fuzzy polynomials.

Symmetric integrable-polynomial factorization for symplectic one-turn-map tracking

International Nuclear Information System (INIS)

Shi, Jicong

1993-01-01

It was found that any homogeneous polynomial can be written as a sum of integrable polynomials of the same degree which Lie transformations can be evaluated exactly. By utilizing symplectic integrators, an integrable-polynomial factorization is developed to convert a symplectic map in the form of Dragt-Finn factorization into a product of Lie transformations associated with integrable polynomials. A small number of factorization bases of integrable polynomials enable one to use high order symplectic integrators so that the high-order spurious terms can be greatly suppressed. A symplectic map can thus be evaluated with desired accuracy

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.

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.

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

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

Exponential time paradigms through the polynomial time lens

NARCIS (Netherlands)

Drucker, A.; Nederlof, J.; Santhanam, R.; Sankowski, P.; Zaroliagis, C.

2016-01-01

We propose a general approach to modelling algorithmic paradigms for the exact solution of NP-hard problems. Our approach is based on polynomial time reductions to succinct versions of problems solvable in polynomial time. We use this viewpoint to explore and compare the power of paradigms such as

O(N) symmetries, sum rules for generalized Hermite polynomials and squeezed states

International Nuclear Information System (INIS)

Daboul, Jamil; Mizrahi, Salomon S

2005-01-01

Quantum optics has been dealing with coherent states, squeezed states and many other non-classical states. The associated mathematical framework makes use of special functions as Hermite polynomials, Laguerre polynomials and others. In this connection we here present some formal results that follow directly from the group O(N) of complex transformations. Motivated by the squeezed states structure, we introduce the generalized Hermite polynomials (GHP), which include as particular cases, the Hermite polynomials as well as the heat polynomials. Using generalized raising operators, we derive new sum rules for the GHP, which are covariant under O(N) transformations. The GHP and the associated sum rules become useful for evaluating Wigner functions in a straightforward manner. As a byproduct, we use one of these sum rules, on the operator level, to obtain raising and lowering operators for the Laguerre polynomials and show that they generate an sl(2, R) ≅ su(1, 1) algebra

Astroidal geometry of hypocycloids and the Hessian topology of hyperbolic polynomials

International Nuclear Information System (INIS)

Arnol'd, Vladimir I

2001-01-01

The Hessian topology has just begun to be developed (in connection with the study of parabolic curves on smooth surfaces in Euclidean or projective space), in contrast to the symplectic and contact topologies related to it. For instance, it is not known how many (compact) parabolic curves can belong to the graph of a polynomial of a given (even of the fourth) degree in two variables or to a smooth algebraic surface of a given degree. The astroid is a hypocycloid with four cusp points. A hyperbolic polynomial is a homogeneous polynomial whose second differential has the signature (+,-) at any non-zero point. Hyperbolic polynomials and functions are connected with Morse theory and Sturm theory and with hypocycloids via caustics (and wave fronts) of periodic functions. The astroid is the caustic of the cosine of a double angle. The caustic of any periodic function has at least four cusp points, and if there are four of them, as is the case for the astroid, then these points form a parallelogram. The theory developed in this paper, based on the study of envelopes and inequalities between derivatives of smooth functions, proves that hyperbolic polynomials of degree four form a connected set and those of degree six form a disconnected set. These topological generalizations of the Sturm and Hurwitz theorems about the zeros of Fourier series give algebraic-geometric results on caustics and wave fronts as well and also establish relationships between these results and the Morse theory of anti-Rolle functions (whose zeros alternate with those of their derivatives)

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

Exact polynomial solutions of second order differential equations and their applications

International Nuclear Information System (INIS)

Zhang Yaozhong

2012-01-01

We find all polynomials Z(z) such that the differential equation where X(z), Y(z), Z(z) are polynomials of degree at most 4, 3, 2, respectively, has polynomial solutions S(z) = ∏ n i=1 (z − z i ) of degree n with distinct roots z i . We derive a set of n algebraic equations which determine these roots. We also find all polynomials Z(z) which give polynomial solutions to the differential equation when the coefficients of X(z) and Y(z) are algebraically dependent. As applications to our general results, we obtain the exact (closed-form) solutions of the Schrödinger-type differential equations describing: (1) two Coulombically repelling electrons on a sphere; (2) Schrödinger equation from the kink stability analysis of φ 6 -type field theory; (3) static perturbations for the non-extremal Reissner–Nordström solution; (4) planar Dirac electron in Coulomb and magnetic fields; and (5) O(N) invariant decatic anharmonic oscillator. (paper)

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.

Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices.

Science.gov (United States)

Dehmer, Matthias; Emmert-Streib, Frank; Shi, Yongtang; Stefu, Monica; Tripathi, Shailesh

2015-01-01

In this paper, we study the discrimination power of graph measures that are based on graph-theoretical matrices. The paper generalizes the work of [M. Dehmer, M. Moosbrugger. Y. Shi, Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix, Applied Mathematics and Computation, 268(2015), 164-168]. We demonstrate that by using the new functional matrix approach, exhaustively generated graphs can be discriminated more uniquely than shown in the mentioned previous work.

Assessment of noninvasive predictors of bladder detrusor underactivity in BPH/LUTs patients.

Science.gov (United States)

Luo, Fei; Sun, Hong-Hong; Su, Yan-Hui; Zhang, Zhi-Hua; Wang, Ya-Shen; Zhao, Zhen; Li, Jian

2017-05-01

To retrospectively assess the diagnostic predictive value of clinical characteristics to improve the diagnostic accuracy of bladder detrusor underactivity (DU) among benign prostatic hyperplasia/lower urinary tract symptoms (BPH/LUTS) patients who cannot undergo urodynamic examinations. A total of 704 BPH/LUTS patients at Tianjin Medical Union Center from January 2013 through June 2016 were enrolled in the study. All cases were stratified by maximum detrusor pressure (Pdet.max) into two groups (DU and control). Patient and clinical variables were analyzed in both groups. One hundred twelve and 592 cases were classified into the DU and control group, respectively. PV (OR 0.976, 95% CI 0.961-0.991, P = 0.002) and PVR (OR 1.004, 95% CI 1.001-1.007, P = 0.004) were independent predictors of DU. In addition, Pdet.max was positively correlated with HTN (≥10 years) (r = 0.373, P = 0.001), smoking (r = 0.108, P = 0.039), IPSS (20-23) (r = 0.257, P = 0.013), PV (r = 0.305, P 76 years) (r = -0.265, P = 0.015), BMI (21-23) (r = -0.382, P = 0.001), DM (0-20 years) (r = 0.365, P = 0.009) and PVR (50-400 mL) (r = 0.423, P = 0.001). The AUCs for BMI, PV, tPSA, PSAD, Q max , and PVR were 0.762, 0.739, 0.727, 0.681, 0.749, and 0.716, respectively. Combined ROC analysis showed the AUC for PV + PVR was 0.774 with sensitivity of 77.78% and specificity of 73.68%. Clinical factors were effective for predicting DU and could help improve the diagnostic accuracy for BPH/LUTS patients who cannot undergo urodynamic examinations.

Scalar potential for the gauged Heisenberg algebra and a non-polynomial antisymmetric tensor theory

International Nuclear Information System (INIS)

D'Auria, R.; Ferrara, S.; Trigiante, M.; Vaula, S.

2005-01-01

We study some issues related to the effective theory of Calabi-Yau compactifications with fluxes in type II theories. At first the scalar potential for a generic electric Abelian gauging of the Heisenberg algebra, underlying all possible gaugings of R-R isometries, is presented and shown to exhibit, in some circumstances, a 'dual' no-scale structure under the interchange of hypermultiplets and vector multiplets. Subsequently a new setting of such theories, when all R-R scalars are dualized into antisymmetric tensors, is discussed. This formulation falls in the class of non-polynomial tensor theories considered long ago by Freedman and Townsend and it may be relevant for the introduction of both electric and magnetic charges

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

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.

ISAR Imaging of Maneuvering Targets Based on the Modified Discrete Polynomial-Phase Transform

Directory of Open Access Journals (Sweden)

Yong Wang

2015-09-01

Full Text Available Inverse synthetic aperture radar (ISAR imaging of a maneuvering target is a challenging task in the field of radar signal processing. The azimuth echo can be characterized as a multi-component polynomial phase signal (PPS after the translational compensation, and the high quality ISAR images can be obtained by the parameters estimation of it combined with the Range-Instantaneous-Doppler (RID technique. In this paper, a novel parameters estimation algorithm of the multi-component PPS with order three (cubic phase signal-CPS based on the modified discrete polynomial-phase transform (MDPT is proposed, and the corresponding new ISAR imaging algorithm is presented consequently. This algorithm is efficient and accurate to generate a focused ISAR image, and the results of real data demonstrate the effectiveness of it.

On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

Science.gov (United States)

Freund, Roland

1988-01-01

Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.

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

Matrix biorthogonal polynomials on the unit circle and non-Abelian Ablowitz-Ladik hierarchy

International Nuclear Information System (INIS)

Cafasso, Mattia

2009-01-01

Adler and van Moerbeke (2001 Commun. Pure Appl. Math. 54 153-205) described a reduction of the 2D-Toda hierarchy called the Toeplitz lattice. This hierarchy turns out to be equivalent to the one originally described by Ablowitz and Ladik (1975 J. Math. Phys. 16 598-603) using semidiscrete zero- curvature equations. In this paper, we obtain the original semidiscrete zero-curvature equations starting directly from the Toeplitz lattice and we generalize these computations to the matrix case. This generalization leads us to the semidiscrete zero-curvature equations for the non-Abelian (or multicomponent) version of the Ablowitz-Ladik equations (Gerdzhikov and Ivanov 1982 Theor. Math. Phys. 52 676-85). In this way, we extend the link between biorthogonal polynomials on the unit circle and the Ablowitz-Ladik hierarchy to the matrix case.

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

Higher order branching of periodic orbits from polynomial isochrones

Directory of Open Access Journals (Sweden)

B. Toni

1999-09-01

Full Text Available We discuss the higher order local bifurcations of limit cycles from polynomial isochrones (linearizable centers when the linearizing transformation is explicitly known and yields a polynomial perturbation one-form. Using a method based on the relative cohomology decomposition of polynomial one-forms complemented with a step reduction process, we give an explicit formula for the overall upper bound of branch points of limit cycles in an arbitrary $n$ degree polynomial perturbation of the linear isochrone, and provide an algorithmic procedure to compute the upper bound at successive orders. We derive a complete analysis of the nonlinear cubic Hamiltonian isochrone and show that at most nine branch points of limit cycles can bifurcate in a cubic polynomial perturbation. Moreover, perturbations with exactly two, three, four, six, and nine local families of limit cycles may be constructed.

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.

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.

Real zeros of classes of random algebraic polynomials

Directory of Open Access Journals (Sweden)

K. Farahmand

2003-01-01

Full Text Available There are many known asymptotic estimates for the expected number of real zeros of an algebraic polynomial a0+a1x+a2x2+⋯+an−1xn−1 with identically distributed random coefficients. Under different assumptions for the distribution of the coefficients {aj}j=0n−1 it is shown that the above expected number is asymptotic to O(logn. This order for the expected number of zeros remains valid for the case when the coefficients are grouped into two, each group with a different variance. However, it was recently shown that if the coefficients are non-identically distributed such that the variance of the jth term is (nj the expected number of zeros of the polynomial increases to O(n. The present paper provides the value for this asymptotic formula for the polynomials with the latter variances when they are grouped into three with different patterns for their variances.

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

Optimal non-coherent data detection for massive SIMO wireless systems: A polynomial complexity solution

KAUST Repository

Alshamary, Haider Ali Jasim

2016-01-04

© 2015 IEEE. This paper considers the joint maximum likelihood (ML) channel estimation and data detection problem for massive SIMO (single input multiple output) wireless systems. We propose efficient algorithms achieving the exact ML non-coherent data detection, for both constant-modulus constellations and nonconstant-modulus constellations. Despite a large number of unknown channel coefficients in massive SIMO systems, we show that the expected computational complexity is linear in the number of receive antennas and polynomial in channel coherence time. To the best of our knowledge, our algorithms are the first efficient algorithms to achieve the exact joint ML channel estimation and data detection performance for massive SIMO systems with general constellations. Simulation results show our algorithms achieve considerable performance gains at a low computational complexity.

Optimal non-coherent data detection for massive SIMO wireless systems: A polynomial complexity solution

KAUST Repository

Alshamary, Haider Ali Jasim; Al-Naffouri, Tareq Y.; Zaib, Alam; Xu, Weiyu

2016-01-01

© 2015 IEEE. This paper considers the joint maximum likelihood (ML) channel estimation and data detection problem for massive SIMO (single input multiple output) wireless systems. We propose efficient algorithms achieving the exact ML non-coherent data detection, for both constant-modulus constellations and nonconstant-modulus constellations. Despite a large number of unknown channel coefficients in massive SIMO systems, we show that the expected computational complexity is linear in the number of receive antennas and polynomial in channel coherence time. To the best of our knowledge, our algorithms are the first efficient algorithms to achieve the exact joint ML channel estimation and data detection performance for massive SIMO systems with general constellations. Simulation results show our algorithms achieve considerable performance gains at a low computational complexity.

Spline-based high-accuracy piecewise-polynomial phase-to-sinusoid amplitude converters.

Science.gov (United States)

Petrinović, Davor; Brezović, Marko

2011-04-01

We propose a method for direct digital frequency synthesis (DDS) using a cubic spline piecewise-polynomial model for a phase-to-sinusoid amplitude converter (PSAC). This method offers maximum smoothness of the output signal. Closed-form expressions for the cubic polynomial coefficients are derived in the spectral domain and the performance analysis of the model is given in the time and frequency domains. We derive the closed-form performance bounds of such DDS using conventional metrics: rms and maximum absolute errors (MAE) and maximum spurious free dynamic range (SFDR) measured in the discrete time domain. The main advantages of the proposed PSAC are its simplicity, analytical tractability, and inherent numerical stability for high table resolutions. Detailed guidelines for a fixed-point implementation are given, based on the algebraic analysis of all quantization effects. The results are verified on 81 PSAC configurations with the output resolutions from 5 to 41 bits by using a bit-exact simulation. The VHDL implementation of a high-accuracy DDS based on the proposed PSAC with 28-bit input phase word and 32-bit output value achieves SFDR of its digital output signal between 180 and 207 dB, with a signal-to-noise ratio of 192 dB. Its implementation requires only one 18 kB block RAM and three 18-bit embedded multipliers in a typical field-programmable gate array (FPGA) device. © 2011 IEEE

A new numerical treatment based on Lucas polynomials for 1D and 2D sinh-Gordon equation

Science.gov (United States)

Oruç, Ömer

2018-04-01

In this paper, a new mixed method based on Lucas and Fibonacci polynomials is developed for numerical solutions of 1D and 2D sinh-Gordon equations. Firstly time variable discretized by central finite difference and then unknown function and its derivatives are expanded to Lucas series. With the help of these series expansion and Fibonacci polynomials, matrices for differentiation are derived. With this approach, finding the solution of sinh-Gordon equation transformed to finding the solution of an algebraic system of equations. Lucas series coefficients are acquired by solving this system of algebraic equations. Then by plugginging these coefficients into Lucas series expansion numerical solutions can be obtained consecutively. The main objective of this paper is to demonstrate that Lucas polynomial based method is convenient for 1D and 2D nonlinear problems. By calculating L2 and L∞ error norms of some 1D and 2D test problems efficiency and performance of the proposed method is monitored. Acquired accurate results confirm the applicability of the method.

UPPER TRIASSIC (NORIAN-RHAETIAN HYPERCALCIFIED SPONGES FROM THE LUT BLOCK, EAST CENTRAL IRAN

Directory of Open Access Journals (Sweden)

FATEMEH AMIRHASSANKHANI

2014-11-01

Full Text Available In order to study the hypercalcified sponges in reefal deposits of the Nayband Formation in Lut Block, the Garm Ab section near the village of Mehran Kushk, located about 20 km northeast of Ferdows city, was sampled. Eight horizons of reefal limestone beds are exposed in this section. The most important reef builders are hypercalcified sponges with some representatives of hexactinellids, scleractinian corals and other reef organisms. The field and lab-observations on rock units, sedimentary facies and faunal assemblages indicate the middle Norian-Rhaetian as the age of the reef horizons. Twenty-three sponge taxa, including 15 of the chambered sphinctozoans, 2 of hexactinellids sponges and 8 non-chambered inozoan were identified. The majority of recognized sponges are reported from the Nayband Formation from the other localities in central Iran. One new species identified as Cryptocoelia maxima n. sp. was recovered and is described here.

Completeness of the ring of polynomials

DEFF Research Database (Denmark)

Thorup, Anders

2015-01-01

Consider the polynomial ring R:=k[X1,…,Xn]R:=k[X1,…,Xn] in n≥2n≥2 variables over an uncountable field k. We prove that R   is complete in its adic topology, that is, the translation invariant topology in which the non-zero ideals form a fundamental system of neighborhoods of 0. In addition we pro...

Gaussian polynomials and content ideal in trivial extensions

International Nuclear Information System (INIS)

Bakkari, C.; Mahdou, N.

2006-12-01

The goal of this paper is to exhibit a class of Gaussian non-coherent rings R (with zero-divisors) such that wdim(R) = ∞ and fPdim(R) is always at most one and also exhibits a new class of rings (with zerodivisors) which are neither locally Noetherian nor locally domain where Gaussian polynomials have a locally principal content. For this purpose, we study the possible transfer of the 'Gaussian' property and the property 'the content ideal of a Gaussian polynomial is locally principal' to various trivial extension contexts. This article includes a brief discussion of the scopes and limits of our result. (author)

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.

Tensor calculus in polar coordinates using Jacobi polynomials

Science.gov (United States)

Vasil, Geoffrey M.; Burns, Keaton J.; Lecoanet, Daniel; Olver, Sheehan; Brown, Benjamin P.; Oishi, Jeffrey S.

2016-11-01

Spectral methods are an efficient way to solve partial differential equations on domains possessing certain symmetries. The utility of a method depends strongly on the choice of spectral basis. In this paper we describe a set of bases built out of Jacobi polynomials, and associated operators for solving scalar, vector, and tensor partial differential equations in polar coordinates on a unit disk. By construction, the bases satisfy regularity conditions at r = 0 for any tensorial field. The coordinate singularity in a disk is a prototypical case for many coordinate singularities. The work presented here extends to other geometries. The operators represent covariant derivatives, multiplication by azimuthally symmetric functions, and the tensorial relationship between fields. These arise naturally from relations between classical orthogonal polynomials, and form a Heisenberg algebra. Other past work uses more specific polynomial bases for solving equations in polar coordinates. The main innovation in this paper is to use a larger set of possible bases to achieve maximum bandedness of linear operations. We provide a series of applications of the methods, illustrating their ease-of-use and accuracy.

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.

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

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.

Damage Identification of Bridge Based on Chebyshev Polynomial Fitting and Fuzzy Logic without Considering Baseline Model Parameters

Directory of Open Access Journals (Sweden)

Yu-Bo Jiao

2015-01-01

Full Text Available The paper presents an effective approach for damage identification of bridge based on Chebyshev polynomial fitting and fuzzy logic systems without considering baseline model data. The modal curvature of damaged bridge can be obtained through central difference approximation based on displacement modal shape. Depending on the modal curvature of damaged structure, Chebyshev polynomial fitting is applied to acquire the curvature of undamaged one without considering baseline parameters. Therefore, modal curvature difference can be derived and used for damage localizing. Subsequently, the normalized modal curvature difference is treated as input variable of fuzzy logic systems for damage condition assessment. Numerical simulation on a simply supported bridge was carried out to demonstrate the feasibility of the proposed method.

Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor

DEFF Research Database (Denmark)

Hansen, Thomas Dueholm; Miltersen, Peter Bro; Zwick, Uri

2013-01-01

Ye [2011] showed recently that the simplex method with Dantzig’s pivoting rule, as well as Howard’s policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that both algorithms terminate...... terminates after at most O(m1−γ log n1−γ) iterations. Second, and more importantly, we show that the same bound applies to the number of iterations performed by the strategy iteration (or strategy improvement) algorithm, a generalization of Howard’s policy iteration algorithm used for solving 2-player turn-based...... for 2-player turn-based stochastic games; it is strongly polynomial for a fixed discount factor, and exponential otherwise....

Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

OpenAIRE

N. Stojanovic; N. Stamenkovic; I. Krstic

2016-01-01

A new approximation to design continuoustime and discrete-time low-pass filters, presented in this paper, based on the product of Gegenbauer polynomials, provides the ability of more flexible adjustment of passband and stopband responses. The design is achieved taking into account a prescribed specification, leading to a better trade-off among the magnitude and group delay responses. Many well-known continuous-time and discrete-time transitional filter based on the classical polynomial approx...

An algorithmic approach to solving polynomial equations associated with quantum circuits

International Nuclear Information System (INIS)

Gerdt, V.P.; Zinin, M.V.

2009-01-01

In this paper we present two algorithms for reducing systems of multivariate polynomial equations over the finite field F 2 to the canonical triangular form called lexicographical Groebner basis. This triangular form is the most appropriate for finding solutions of the system. On the other hand, the system of polynomials over F 2 whose variables also take values in F 2 (Boolean polynomials) completely describes the unitary matrix generated by a quantum circuit. In particular, the matrix itself can be computed by counting the number of solutions (roots) of the associated polynomial system. Thereby, efficient construction of the lexicographical Groebner bases over F 2 associated with quantum circuits gives a method for computing their circuit matrices that is alternative to the direct numerical method based on linear algebra. We compare our implementation of both algorithms with some other software packages available for computing Groebner bases over F 2

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.

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

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.

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.

Stabilization of nonlinear systems using sampled-data output-feedback fuzzy controller based on polynomial-fuzzy-model-based control approach.

Science.gov (United States)

Lam, H K

2012-02-01

This paper investigates the stability of sampled-data output-feedback (SDOF) polynomial-fuzzy-model-based control systems. Representing the nonlinear plant using a polynomial fuzzy model, an SDOF fuzzy controller is proposed to perform the control process using the system output information. As only the system output is available for feedback compensation, it is more challenging for the controller design and system analysis compared to the full-state-feedback case. Furthermore, because of the sampling activity, the control signal is kept constant by the zero-order hold during the sampling period, which complicates the system dynamics and makes the stability analysis more difficult. In this paper, two cases of SDOF fuzzy controllers, which either share the same number of fuzzy rules or not, are considered. The system stability is investigated based on the Lyapunov stability theory using the sum-of-squares (SOS) approach. SOS-based stability conditions are obtained to guarantee the system stability and synthesize the SDOF fuzzy controller. Simulation examples are given to demonstrate the merits of the proposed SDOF fuzzy control approach.

Computing Galois Groups of Eisenstein Polynomials Over P-adic Fields

Science.gov (United States)

Milstead, Jonathan

The most efficient algorithms for computing Galois groups of polynomials over global fields are based on Stauduhar's relative resolvent method. These methods are not directly generalizable to the local field case, since they require a field that contains the global field in which all roots of the polynomial can be approximated. We present splitting field-independent methods for computing the Galois group of an Eisenstein polynomial over a p-adic field. Our approach is to combine information from different disciplines. We primarily, make use of the ramification polygon of the polynomial, which is the Newton polygon of a related polynomial. This allows us to quickly calculate several invariants that serve to reduce the number of possible Galois groups. Algorithms by Greve and Pauli very efficiently return the Galois group of polynomials where the ramification polygon consists of one segment as well as information about the subfields of the stem field. Second, we look at the factorization of linear absolute resolvents to further narrow the pool of possible groups.

H∞ Control of Polynomial Fuzzy Systems: A Sum of Squares Approach

Directory of Open Access Journals (Sweden)

Bomo W. Sanjaya

2014-07-01

Full Text Available This paper proposes the control design ofa nonlinear polynomial fuzzy system with H∞ performance objective using a sum of squares (SOS approach. Fuzzy model and controller are represented by a polynomial fuzzy model and controller. The design condition is obtained by using polynomial Lyapunov functions that not only guarantee stability but also satisfy the H∞ performance objective. The design condition is represented in terms of an SOS that can be numerically solved via the SOSTOOLS. A simulation study is presented to show the effectiveness of the SOS-based H∞ control designfor nonlinear polynomial fuzzy systems.

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

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

Tadalafil once daily in the treatment of lower urinary tract symptoms (LUTS) suggestive of benign prostatic hyperplasia (BPH) in men without erectile dysfunction.

Science.gov (United States)

Brock, Gerald; Broderick, Gregory; Roehrborn, Claus G; Xu, Lei; Wong, David; Viktrup, Lars

2013-11-01

To assess the safety and efficacy of tadalafil once daily on lower urinary tract symptoms suggestive of clinical benign prostatic hyperplasia (BPH-LUTS) in men without erectile dysfunction (ED). To compare these with effects in men with ED. After a 4-week washout period and 4-week placebo run-in period, 1089 men without ED (n = 338) and with ED (n = 751) were randomly assigned to placebo or tadalafil 5 mg once daily for 12 weeks in three global clinical studies with similar designs. In the pooled dataset, post hoc analyses of covariance assessed the impact and severity of BPH-LUTS using the International Prostate Symptom Score (IPSS) and the BPH Impact Index (BII) and IPSS quality-of-life (IPSS-QoL) subscores. Safety was assessed using treatment-emergent adverse events. The treatment-by-ED-status interaction was used to assess efficacy differences between the with/without ED subgroups. Men without ED were similar in BPH-LUTS severity/previous therapy to men with ED. Tadalafil significantly reduced BPH-LUTS from baseline when compared with placebo in men without ED (IPSS -5.4 vs -3.3, P  0.68). Tadalafil was safe and well tolerated. Tadalafil 5 mg once daily improved BPH-LUTS in men without ED by a magnitude similar to that observed in men with ED. The adverse event profile in men without ED was consistent with that observed in men with ED. © 2013 The Authors. BJU International © 2013 BJU International.

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.

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.

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.

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

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

International Nuclear Information System (INIS)

Hampton, Jerrad; Doostan, Alireza

2015-01-01

Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as coherence, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ℓ 1 -minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy

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

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.

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

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

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

Science.gov (United States)

Rahman, Nurhakimah Ab.; Abdullah, Lazim

2014-07-01

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

On factorization of generalized Macdonald polynomials

International Nuclear Information System (INIS)

Kononov, Ya.; Morozov, A.

2016-01-01

A remarkable feature of Schur functions - the common eigenfunctions of cut-and-join operators from W ∞ - is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U q (SL N ) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization - on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding. (orig.)

On factorization of generalized Macdonald polynomials

Science.gov (United States)

Kononov, Ya.; Morozov, A.

2016-08-01

A remarkable feature of Schur functions—the common eigenfunctions of cut-and-join operators from W_∞ —is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U_q(SL_N) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization—on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding.

On factorization of generalized Macdonald polynomials

Energy Technology Data Exchange (ETDEWEB)

Kononov, Ya. [Landau Institute for Theoretical Physics, Chernogolovka (Russian Federation); HSE, Math Department, Moscow (Russian Federation); Morozov, A. [ITEP, Moscow (Russian Federation); Institute for Information Transmission Problems, Moscow (Russian Federation); National Research Nuclear University MEPhI, Moscow (Russian Federation)

2016-08-15

A remarkable feature of Schur functions - the common eigenfunctions of cut-and-join operators from W{sub ∞} - is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U{sub q}(SL{sub N}) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization - on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding. (orig.)

M-Polynomial and Related Topological Indices of Nanostar Dendrimers

Directory of Open Access Journals (Sweden)

Mobeen Munir

2016-09-01

Full Text Available Dendrimers are highly branched organic macromolecules with successive layers of branch units surrounding a central core. The M-polynomial of nanotubes has been vastly investigated as it produces many degree-based topological indices. These indices are invariants of the topology of graphs associated with molecular structure of nanomaterials to correlate certain physicochemical properties like boiling point, stability, strain energy, etc. of chemical compounds. In this paper, we first determine M-polynomials of some nanostar dendrimers and then recover many degree-based topological indices.

Return polynomials for non-intersecting paths above a surface on the directed square lattice

Energy Technology Data Exchange (ETDEWEB)

Brak, R. [Deartment of Mathematics, University of Melbourne, Parkville, VIC (Australia)]. E-mail: r.brak@ms.unimelb.edu.au; Essam, J.W. [Department of Mathematics, Royal Holloway College, University of London, Egham, Surrey (United Kingdom)]. E-mail: j.essam@alpha1.rhul.ac.uk

2001-12-14

We enumerate sets of n non-intersecting, t-step paths on the directed square lattice which are excluded from the region below the surface y=0 to which they are initially attached. In particular we obtain a product formula for the number of star configurations in which the paths have arbitrary fixed endpoints. We also consider the 'return' polynomial, R-'{sup W}{sub t}(y;k)={sigma}{sub m{>=}}{sub 0}r-'{sup W}{sub t}(y;m)k{sup m} where r-'{sup W}{sub t}(y;m) is the number of n-path configurations of watermelon type having deviation {gamma} for which the path closest to the surface returns to the surface m times. The 'marked return' polynomial is defined by u-'{sup W}{sub t}(y;k{sub 1}){identical_to}R-'{sup W}{sub 1}(y;k{sub 1}+l)={sigma}{sub m{>=}}{sub 0}u-'{sup W}{sub t}(y;m)k{sub 1}{sup m} where u-'{sup W}{sub t}(y;m) is the number of marked configurations having at least m returns, just m of which are marked. Both r-'{sup W}{sub t}(y;m) and u-'{sup W}(y;m) are expressed in terms of the numbers of paths ignoring returns but introducing a suitably modified endpoint condition. This enables u-'{sup W}{sub t}(y;m) to be written in product form for arbitrary y, but for r-'{sup W}{sub t}(y;m) this can only be done in the case y=0. (author)

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)

Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

Directory of Open Access Journals (Sweden)

N. Stojanovic

2016-09-01

Full Text Available A new approximation to design continuoustime and discrete-time low-pass filters, presented in this paper, based on the product of Gegenbauer polynomials, provides the ability of more flexible adjustment of passband and stopband responses. The design is achieved taking into account a prescribed specification, leading to a better trade-off among the magnitude and group delay responses. Many well-known continuous-time and discrete-time transitional filter based on the classical polynomial approximations(Chebyshev, Legendre, Butterworth are shown to be a special cases of proposed approximation method.

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)

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

An Operational Matrix Technique for Solving Variable Order Fractional Differential-Integral Equation Based on the Second Kind of Chebyshev Polynomials

Directory of Open Access Journals (Sweden)

Jianping Liu

2016-01-01

Full Text Available An operational matrix technique is proposed to solve variable order fractional differential-integral equation based on the second kind of Chebyshev polynomials in this paper. The differential operational matrix and integral operational matrix are derived based on the second kind of Chebyshev polynomials. Using two types of operational matrixes, the original equation is transformed into the arithmetic product of several dependent matrixes, which can be viewed as an algebraic system after adopting the collocation points. Further, numerical solution of original equation is obtained by solving the algebraic system. Finally, several examples show that the numerical algorithm is computationally efficient.

An Assessment of Polynomial Regression Techniques for the Relative Radiometric Normalization (RRN of High-Resolution Multi-Temporal Airborne Thermal Infrared (TIR Imagery

Directory of Open Access Journals (Sweden)

Mir Mustafizur Rahman

2014-11-01

Full Text Available Thermal Infrared (TIR remote sensing images of urban environments are increasingly available from airborne and satellite platforms. However, limited access to high-spatial resolution (H-res: ~1 m TIR satellite images requires the use of TIR airborne sensors for mapping large complex urban surfaces, especially at micro-scales. A critical limitation of such H-res mapping is the need to acquire a large scene composed of multiple flight lines and mosaic them together. This results in the same scene components (e.g., roads, buildings, green space and water exhibiting different temperatures in different flight lines. To mitigate these effects, linear relative radiometric normalization (RRN techniques are often applied. However, the Earth’s surface is composed of features whose thermal behaviour is characterized by complexity and non-linearity. Therefore, we hypothesize that non-linear RRN techniques should demonstrate increased radiometric agreement over similar linear techniques. To test this hypothesis, this paper evaluates four (linear and non-linear RRN techniques, including: (i histogram matching (HM; (ii pseudo-invariant feature-based polynomial regression (PIF_Poly; (iii no-change stratified random sample-based linear regression (NCSRS_Lin; and (iv no-change stratified random sample-based polynomial regression (NCSRS_Poly; two of which (ii and iv are newly proposed non-linear techniques. When applied over two adjacent flight lines (~70 km2 of TABI-1800 airborne data, visual and statistical results show that both new non-linear techniques improved radiometric agreement over the previously evaluated linear techniques, with the new fully-automated method, NCSRS-based polynomial regression, providing the highest improvement in radiometric agreement between the master and the slave images, at ~56%. This is ~5% higher than the best previously evaluated linear technique (NCSRS-based linear regression.

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.

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.

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.

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

Two-Stage Method Based on Local Polynomial Fitting for a Linear Heteroscedastic Regression Model and Its Application in Economics

Directory of Open Access Journals (Sweden)

Liyun Su

2012-01-01

Full Text Available We introduce the extension of local polynomial fitting to the linear heteroscedastic regression model. Firstly, the local polynomial fitting is applied to estimate heteroscedastic function, then the coefficients of regression model are obtained by using generalized least squares method. One noteworthy feature of our approach is that we avoid the testing for heteroscedasticity by improving the traditional two-stage method. Due to nonparametric technique of local polynomial estimation, we do not need to know the heteroscedastic function. Therefore, we can improve the estimation precision, when the heteroscedastic function is unknown. Furthermore, we focus on comparison of parameters and reach an optimal fitting. Besides, we verify the asymptotic normality of parameters based on numerical simulations. Finally, this approach is applied to a case of economics, and it indicates that our method is surely effective in finite-sample situations.

Density of Real Zeros of the Tutte Polynomial

DEFF Research Database (Denmark)

Ok, Seongmin; Perrett, Thomas

2018-01-01

The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...

Density of Real Zeros of the Tutte Polynomial

DEFF Research Database (Denmark)

Ok, Seongmin; Perrett, Thomas

2017-01-01

The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane. This ....... This is the first density result for the real zeros of the Tutte polynomial in a region of positive volume. Our result almost confirms a conjecture of Jackson and Sokal except for one region which is related to an open problem on flow polynomials.......The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the real zeros of the Tutte polynomials of graphs, and show that they form a dense subset of certain regions of the plane...

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

Complex and real Hermite polynomials and related quantizations

International Nuclear Information System (INIS)

Cotfas, Nicolae; Gazeau, Jean Pierre; Gorska, Katarzyna

2010-01-01

It is known that the anti-Wick (or standard coherent state) quantization of the complex plane produces both canonical commutation rule and quantum spectrum of the harmonic oscillator (up to the addition of a constant). In this work, we show that these two issues are not necessarily coupled: there exists a family of separable Hilbert spaces, including the usual Fock-Bargmann space, and in each element in this family there exists an overcomplete set of unit-norm states resolving the unity. With the exception of the Fock-Bargmann case, they all produce non-canonical commutation relation whereas the quantum spectrum of the harmonic oscillator remains the same up to the addition of a constant. The statistical aspects of these non-equivalent coherent state quantizations are investigated. We also explore the localization aspects in the real line yielded by similar quantizations based on real Hermite polynomials.

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

Numerical solutions of multi-order fractional differential equations by Boubaker polynomials

Directory of Open Access Journals (Sweden)

Bolandtalat A.

2016-01-01

Full Text Available In this paper, we have applied a numerical method based on Boubaker polynomials to obtain approximate numerical solutions of multi-order fractional differential equations. We obtain an operational matrix of fractional integration based on Boubaker polynomials. Using this operational matrix, the given problem is converted into a set of algebraic equations. Illustrative examples are are given to demonstrate the efficiency and simplicity of this technique.

Chebyshev polynomial functions based locally recurrent neuro-fuzzy information system for prediction of financial and energy market data

Directory of Open Access Journals (Sweden)

A.K. Parida

2016-09-01

Full Text Available In this paper Chebyshev polynomial functions based locally recurrent neuro-fuzzy information system is presented for the prediction and analysis of financial and electrical energy market data. The normally used TSK-type feedforward fuzzy neural network is unable to take the full advantage of the use of the linear fuzzy rule base in accurate input–output mapping and hence the consequent part of the rule base is made nonlinear using polynomial or arithmetic basis functions. Further the Chebyshev polynomial functions provide an expanded nonlinear transformation to the input space thereby increasing its dimension for capturing the nonlinearities and chaotic variations in financial or energy market data streams. Also the locally recurrent neuro-fuzzy information system (LRNFIS includes feedback loops both at the firing strength layer and the output layer to allow signal flow both in forward and backward directions, thereby making the LRNFIS mimic a dynamic system that provides fast convergence and accuracy in predicting time series fluctuations. Instead of using forward and backward least mean square (FBLMS learning algorithm, an improved Firefly-Harmony search (IFFHS learning algorithm is used to estimate the parameters of the consequent part and feedback loop parameters for better stability and convergence. Several real world financial and energy market time series databases are used for performance validation of the proposed LRNFIS model.

Fitting method of pseudo-polynomial for solving nonlinear parametric adjustment

Institute of Scientific and Technical Information of China (English)

陶华学; 宫秀军; 郭金运

2001-01-01

The optimal condition and its geometrical characters of the least-square adjustment were proposed. Then the relation between the transformed surface and least-squares was discussed. Based on the above, a non-iterative method, called the fitting method of pseudo-polynomial, was derived in detail. The final least-squares solution can be determined with sufficient accuracy in a single step and is not attained by moving the initial point in the view of iteration. The accuracy of the solution relys wholly on the frequency of Taylor's series. The example verifies the correctness and validness of the method.

Szász-Durrmeyer operators involving Boas-Buck polynomials of blending type.

Science.gov (United States)

Sidharth, Manjari; Agrawal, P N; Araci, Serkan

2017-01-01

The present paper introduces the Szász-Durrmeyer type operators based on Boas-Buck type polynomials which include Brenke type polynomials, Sheffer polynomials and Appell polynomials considered by Sucu et al. (Abstr. Appl. Anal. 2012:680340, 2012). We establish the moments of the operator and a Voronvskaja type asymptotic theorem and then proceed to studying the convergence of the operators with the help of Lipschitz type space and weighted modulus of continuity. Next, we obtain a direct approximation theorem with the aid of unified Ditzian-Totik modulus of smoothness. Furthermore, we study the approximation of functions whose derivatives are locally of bounded variation.

Szász-Durrmeyer operators involving Boas-Buck polynomials of blending type

Directory of Open Access Journals (Sweden)

Manjari Sidharth

2017-05-01

Full Text Available Abstract The present paper introduces the Szász-Durrmeyer type operators based on Boas-Buck type polynomials which include Brenke type polynomials, Sheffer polynomials and Appell polynomials considered by Sucu et al. (Abstr. Appl. Anal. 2012:680340, 2012. We establish the moments of the operator and a Voronvskaja type asymptotic theorem and then proceed to studying the convergence of the operators with the help of Lipschitz type space and weighted modulus of continuity. Next, we obtain a direct approximation theorem with the aid of unified Ditzian-Totik modulus of smoothness. Furthermore, we study the approximation of functions whose derivatives are locally of bounded variation.

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

The Jones polynomial as a new invariant of topological fluid dynamics

International Nuclear Information System (INIS)

Ricca, Renzo L; Liu, Xin

2014-01-01

A new method based on the use of the Jones polynomial, a well-known topological invariant of knot theory, is introduced to tackle and quantify topological aspects of structural complexity of vortex tangles in ideal fluids. By re-writing the Jones polynomial in terms of helicity, the resulting polynomial becomes then function of knot topology and vortex circulation, providing thus a new invariant of topological fluid dynamics. Explicit computations of the Jones polynomial for some standard configurations, including the Whitehead link and the Borromean rings (whose linking numbers are zero), are presented for illustration. In the case of a homogeneous, isotropic tangle of vortex filaments with same circulation, the new Jones polynomial reduces to some simple algebraic expression, that can be easily computed by numerical methods. This shows that this technique may offer a new setting and a powerful tool to detect and compute topological complexity and to investigate relations with energy, by tackling fundamental aspects of turbulence research. (paper)

Parallel multigrid smoothing: polynomial versus Gauss-Seidel

International Nuclear Information System (INIS)

Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray

2003-01-01

Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines

Parallel multigrid smoothing: polynomial versus Gauss-Seidel

Science.gov (United States)

Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray

2003-07-01

Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines.

Prediction of thermophysical and transport properties of ternary organic non-electrolyte systems including water by polynomials

Directory of Open Access Journals (Sweden)

Đorđević Bojan D.

2013-01-01

Full Text Available The description and prediction of the thermophysical and transport properties of ternary organic non-electrolyte systems including water by the polynomial equations are reviewed. Empirical equations of Radojković et al. (also known as Redlich-Kister, Kohler, Jacob-Fitzner, Colinet, Tsao-Smith, Toop, Scatchard et al. and Rastogi et al. are compared with experimental data of available papers appeared in well know international journals (Fluid Phase Equilibria, Journal of Chemical and Engineering Data, Journal of Chemical Thermodynamics, Journal of Solution Chemistry, Journal of the Serbian Chemical Society, The Canadian Journal of Chemical Engineering, Journal of Molecular Liquids, Thermochimica Acta, etc.. The applicability of empirical models to estimate excess molar volumes, VE, excess viscosities, ηE, excess free energies of activation of a viscous flow,

Weighted Polynomial Approximation for Automated Detection of Inspiratory Flow Limitation

Directory of Open Access Journals (Sweden)

Sheng-Cheng Huang

2017-01-01

Full Text Available Inspiratory flow limitation (IFL is a critical symptom of sleep breathing disorders. A characteristic flattened flow-time curve indicates the presence of highest resistance flow limitation. This study involved investigating a real-time algorithm for detecting IFL during sleep. Three categories of inspiratory flow shape were collected from previous studies for use as a development set. Of these, 16 cases were labeled as non-IFL and 78 as IFL which were further categorized into minor level (20 cases and severe level (58 cases of obstruction. In this study, algorithms using polynomial functions were proposed for extracting the features of IFL. Methods using first- to third-order polynomial approximations were applied to calculate the fitting curve to obtain the mean absolute error. The proposed algorithm is described by the weighted third-order (w.3rd-order polynomial function. For validation, a total of 1,093 inspiratory breaths were acquired as a test set. The accuracy levels of the classifications produced by the presented feature detection methods were analyzed, and the performance levels were compared using a misclassification cobweb. According to the results, the algorithm using the w.3rd-order polynomial approximation achieved an accuracy of 94.14% for IFL classification. We concluded that this algorithm achieved effective automatic IFL detection during sleep.

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

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

Bounds on the degree of APN polynomials: the case of x −1 + g(x)

DEFF Research Database (Denmark)

Leander, Gregor; Rodier, François

2011-01-01

In this paper we consider APN functions $${f:\\mathcal{F}_{2^m}\\to \\mathcal{F}_{2^m}}$$ of the form f(x) = x −1 + g(x) where g is any non $${\\mathcal{F}_{2}}$$-affine polynomial. We prove a lower bound on the degree of the polynomial g. This bound in particular implies that such a function f is AP...

Weierstrass method for quaternionic polynomial root-finding

Science.gov (United States)

Falcão, M. Irene; Miranda, Fernando; Severino, Ricardo; Soares, M. Joana

2018-01-01

Quaternions, introduced by Hamilton in 1843 as a generalization of complex numbers, have found, in more recent years, a wealth of applications in a number of different areas which motivated the design of efficient methods for numerically approximating the zeros of quaternionic polynomials. In fact, one can find in the literature recent contributions to this subject based on the use of complex techniques, but numerical methods relying on quaternion arithmetic remain scarce. In this paper we propose a Weierstrass-like method for finding simultaneously {\\sl all} the zeros of unilateral quaternionic polynomials. The convergence analysis and several numerical examples illustrating the performance of the method are also presented.

Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula

Directory of Open Access Journals (Sweden)

Marlowe Thomas J.

1998-01-01

Full Text Available Reliability is an important consideration in analyzing computer and other communication networks, but current techniques are extremely limited in the classes of graphs which can be analyzed efficiently. While Gilbert's formula establishes a theoretically elegant recursive relationship between the edge reliability of a graph and the reliability of its subgraphs, naive evaluation requires consideration of all sequences of deletions of individual vertices, and for many graphs has time complexity essentially Θ (N!. We discuss a general approach which significantly reduces complexity, encoding subgraph isomorphism in a finer partition by invariants, and recursing through the set of invariants. We illustrate this approach using threshhold graphs, and show that any computation of reliability using Gilbert's formula will be polynomial-time if and only if the number of invariants considered is polynomial; we then show families of graphs with polynomial-time, and non-polynomial reliability computation, and show that these encompass most previously known results. We then codify our approach to indicate how it can be used for other classes of graphs, and suggest several classes to which the technique can be applied.

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

An efficient coupled polynomial interpolation scheme for shear mode sandwich beam finite element

Directory of Open Access Journals (Sweden)

Litesh N. Sulbhewar

Full Text Available An efficient piezoelectric sandwich beam finite element is presented here. It employs the coupled polynomial field interpolation scheme for field variables which incorporates electromechanical coupling at interpolation level itself; unlike conventional sandwich beam theory (SBT based formulations available in the literature. A variational formulation is used to derive the governing equations, which are used to establish the relationships between field variables. These relations lead to the coupled polynomial field descriptions of variables, unlike conventional SBT formulations which use assumed independent polynomials. The relative axial displacement is expressed only by coupled terms containing contributions from other mechanical and electrical variables, thus eliminating use of the transverse displacement derivative as a degree of freedom. A set of coupled shape function based on these polynomials has shown the improvement in the convergence characteristics of the SBT based formulation. This improvement in the performance is achieved with one nodal degree of freedom lesser than the conventional SBT formulations.

Molecular correlates in urine for the obesity and prostatic inflammation of BPH/LUTS patients.

Science.gov (United States)

Tyagi, Pradeep; Motley, Saundra S; Koyama, Tatsuki; Kashyap, Mahendra; Gingrich, Jeffrey; Yoshimura, Naoki; Fowke, Jay H

2018-01-01

Benign prostatic hyperplasia (BPH) is strongly associated with obesity and prostatic tissue inflammation, but the molecular underpinning of this relationship is not known. Here, we examined the association between urine levels of chemokines/adipokines with histological markers of prostate inflammation, obesity, and lower urinary tract symptoms LUTS in BPH patients. Frozen urine specimens from 207 BPH/LUTS patients enrolled in Nashville Men's Health Study were sent for blinded analysis of 11 analytes, namely sIL-1RA, CXC chemokines (CXCL-1, CXCL-8, CXCL-10), CC chemokines (CCL2, CCL3, CCL5), PDGF-BB, interleukins IL-6, IL-17, and sCD40L using Luminex™ xMAP® technology. After adjusting for age and medication use, the urine levels of analytes were correlated with the scales of obesity, prostate inflammation grade, extent, and markers of lymphocytic infiltration (CD3 and CD20) using linear regression. sIL-1RA levels were significantly raised with higher BMI, waist circumference and waist-hip ratio in BPH patients after correction for multiple testing (P = 0.02). Men with greater overall extent of inflammatory infiltrates and maximal CD3 infiltration were marginally associated with CXCL-10 (P = 0.054) and CCL5 (P = 0.054), respectively. CCL3 in 15 patients with moderate to severe grade inflammation was marginally associated with maximal CD20 infiltration (P = 0.09), whereas CCL3 was undetectable in men with mild prostate tissue inflammation. There was marginal association of sCD40L with AUA-SI scores (P = 0.07). Strong association of sIL-1RA in urine with greater body size supports it as a major molecular correlate of obesity in the urine of BPH patients. Increased urine levels of CXCL-10, CCL5, and CCL3 were marginally associated with the scores for prostate tissue inflammation and lymphocytic infiltration. Overall, elevated urinary chemokines support that BPH is a metabolic disorder and suggest a molecular link between BPH/LUTS and prostatic

Ultrasound image features of intravesical prostatic protrusion indicated failure of medication therapy of finasteride and doxazosin in patients with benign prostatic hyperplasia (LUTS/BPH).

Science.gov (United States)

Liu, Qiang; Zhu, Yunkai; Liu, Jianping; Qi, Jun; Kang, Jian

2017-03-01

Intravesical prostatic protrusion (IPP) is a type of benign prostatic hyperplasia (BPH) adenoma, and it plays a critical role in the pathogenesis of bladder outlet obstruction in patients with lower urinary tract syndromes (LUTS/BPH). The goal of this study was to investigate the effect of a combination therapy with finasteride and doxazosin on IPP in BPU/LUTS patients. A total of 322 BPH patients with enlarged prostatic volume as well as moderate to severe symptom scores were enrolled and divided into four groups according to the degree of IPP (IPP > 10 mm, 5-10 mm,  0.05). Failure rates of the medication differed significantly among the four groups. The study indicated that the combination therapy using finasteride and doxazosin could not reduce the degree of IPP. LUTS/BPH patients with IPP which contributes to the failure of medication tend to have a higher risk of progression.

Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation.

Science.gov (United States)

Yuan, Lifeng; Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

2016-01-01

After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t', n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely.

Analysis of the Level-Release Polynomial from a Hydroelectric Plant

Directory of Open Access Journals (Sweden)

Ieda Hidalgo

2012-02-01

Full Text Available The mathematic representation of the tailrace elevation as function of the water release can be modified, for example, by the geomorphologic impact of large floods. The level-release polynomial from a hydroelectric plant is important information to computational models used for optimization and simulation of the power generation systems operation. They depend on data quality to provide reliable results. Therefore, this paper presents a method for adjusting of the tailrace polynomial based on operation data recorded by the plant’s owner or company. The proposed method uses a non-linear regression tool, such as Trendline in Excel. A case study has been applied to the data from a large Brazilian hydroelectric plant whose operation is under the coordination of the Electric System ational Operator. The benefits of the data correction are analyzed using a simulation model for the hydroelectric plants operation. This simulator is used to reproduce the past operation of the plant, first with official data and second with adjusted data. The results show significant improvements in terms of quality of the data, contributing to bring the real and simulated operation closer.

Real-root property of the spectral polynomial of the Treibich-Verdier potential and related problems

Science.gov (United States)

Chen, Zhijie; Kuo, Ting-Jung; Lin, Chang-Shou; Takemura, Kouichi

2018-04-01

We study the spectral polynomial of the Treibich-Verdier potential. Such spectral polynomial, which is a generalization of the classical Lamé polynomial, plays fundamental roles in both the finite-gap theory and the ODE theory of Heun's equation. In this paper, we prove that all the roots of such spectral polynomial are real and distinct under some assumptions. The proof uses the classical concept of Sturm sequence and isomonodromic theories. We also prove an analogous result for a polynomial associated with a generalized Lamé equation, where we apply a new approach based on the viewpoint of the monodromy data.

Invariance of the global monodromies in families of nondegenerate polynomials in two variables

International Nuclear Information System (INIS)

Son, Pham Tien

2009-07-01

We are interested in a global version of Le-Ramanujam μ-constant theorem for polynomials. We consider an analytic family {f s }, s element of [0, 1], of complex polynomials in two variables, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant, then we show that the global monodromy fibrations of f s are all isomorphic, and that the degree of f s is constant (up to an algebraic automorphism of C 2 ). (author)

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

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.

A novel stabilization condition for T-S polynomial fuzzy system with time-delay:A sum-of-squares approach

OpenAIRE

Tsai, Shun Hung; Chen, Yu-An; Chen, Yu-Wen; Lo, Ji-Chang; Lam, Hak-Keung

2017-01-01

A novel stabilization problem for T-S polynomial fuzzy system with time-delay is investigated in this paper. Firstly, a polynomial fuzzy controller for T-S polynomial fuzzy system with time-delay is proposed. In addition, based on polynomial Lyapunov-Krasovskii function and the developed polynomial slack variable matrices, a novel stabilization condition for T-S polynomial fuzzy system with time-delay is presented in terms of sum-of-square (SOS) form. Lastly, nonlinear system with time-delay ...

Quadratic Polynomial Regression using Serial Observation Processing:Implementation within DART

Science.gov (United States)

Hodyss, D.; Anderson, J. L.; Collins, N.; Campbell, W. F.; Reinecke, P. A.

2017-12-01

Many Ensemble-Based Kalman ltering (EBKF) algorithms process the observations serially. Serial observation processing views the data assimilation process as an iterative sequence of scalar update equations. What is useful about this data assimilation algorithm is that it has very low memory requirements and does not need complex methods to perform the typical high-dimensional inverse calculation of many other algorithms. Recently, the push has been towards the prediction, and therefore the assimilation of observations, for regions and phenomena for which high-resolution is required and/or highly nonlinear physical processes are operating. For these situations, a basic hypothesis is that the use of the EBKF is sub-optimal and performance gains could be achieved by accounting for aspects of the non-Gaussianty. To this end, we develop here a new component of the Data Assimilation Research Testbed [DART] to allow for a wide-variety of users to test this hypothesis. This new version of DART allows one to run several variants of the EBKF as well as several variants of the quadratic polynomial lter using the same forecast model and observations. Dierences between the results of the two systems will then highlight the degree of non-Gaussianity in the system being examined. We will illustrate in this work the differences between the performance of linear versus quadratic polynomial regression in a hierarchy of models from Lorenz-63 to a simple general circulation model.

Recognition of Arabic Sign Language Alphabet Using Polynomial Classifiers

Directory of Open Access Journals (Sweden)

M. Al-Rousan

2005-08-01

Full Text Available Building an accurate automatic sign language recognition system is of great importance in facilitating efficient communication with deaf people. In this paper, we propose the use of polynomial classifiers as a classification engine for the recognition of Arabic sign language (ArSL alphabet. Polynomial classifiers have several advantages over other classifiers in that they do not require iterative training, and that they are highly computationally scalable with the number of classes. Based on polynomial classifiers, we have built an ArSL system and measured its performance using real ArSL data collected from deaf people. We show that the proposed system provides superior recognition results when compared with previously published results using ANFIS-based classification on the same dataset and feature extraction methodology. The comparison is shown in terms of the number of misclassified test patterns. The reduction in the rate of misclassified patterns was very significant. In particular, we have achieved a 36% reduction of misclassifications on the training data and 57% on the test data.

Popov form computation for matrices of Ore polynomials

DEFF Research Database (Denmark)

Khochtali, Mohamed; Né Nielsen, Johan Rosenkilde; Storjohann, Arne

2017-01-01

Let F[∂; s, d] be a ring of Ore polynomials over a field. We give a new deterministic algorithm for computing the Popov form P of a non-singular matrix A ∈ F[∂; s, d]n×n. Our main focus is to ensure controlled growth in the size of coefficients from F in the case F = k(z), and even k = Q. Our...

Sum-of-squares based observer design for polynomial systems with a known fixed time delay

Czech Academy of Sciences Publication Activity Database

Rehák, Branislav

2015-01-01

Roč. 51, č. 5 (2015), s. 858-873 ISSN 0023-5954 R&D Projects: GA ČR GA13-02149S Institutional support: RVO:67985556 Keywords : sum-of-squares polynomial * observer * polynomial system Subject RIV: BC - Control Systems Theory Impact factor: 0.628, year: 2015 http://www.kybernetika.cz/content/2015/5/856

Canonical basis for type A4 (II) - Polynomial elements in one variable

International Nuclear Information System (INIS)

Hu Yuwang; Ye Jiachen

2003-12-01

All the 62 monomial elements in the canonical basis B of the quantized enveloping algebra for type A 4 have been determined. According to Lusztig's idea, the elements in the canonical basis B consist of monomials and linear combinations of monomials (for convenience, we call them polynomials). In this note, we compute all the 144 polynomial elements in one variable in the canonical basis B of the quantized enveloping algebra for type A 4 based on our joint note. We conjecture that there are other polynomial elements in two or three variables in the canonical basis B, which include independent variables and dependent variables. Moreover, it is conjectured that there are no polynomial elements in the canonical basis B with four or more variables. (author)

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.

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.

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.

Phase unwrapping algorithm using polynomial phase approximation and linear Kalman filter.

Science.gov (United States)

Kulkarni, Rishikesh; Rastogi, Pramod

2018-02-01

A noise-robust phase unwrapping algorithm is proposed based on state space analysis and polynomial phase approximation using wrapped phase measurement. The true phase is approximated as a two-dimensional first order polynomial function within a small sized window around each pixel. The estimates of polynomial coefficients provide the measurement of phase and local fringe frequencies. A state space representation of spatial phase evolution and the wrapped phase measurement is considered with the state vector consisting of polynomial coefficients as its elements. Instead of using the traditional nonlinear Kalman filter for the purpose of state estimation, we propose to use the linear Kalman filter operating directly with the wrapped phase measurement. The adaptive window width is selected at each pixel based on the local fringe density to strike a balance between the computation time and the noise robustness. In order to retrieve the unwrapped phase, either a line-scanning approach or a quality guided strategy of pixel selection is used depending on the underlying continuous or discontinuous phase distribution, respectively. Simulation and experimental results are provided to demonstrate the applicability of the proposed method.

Relations between zeros of special polynomials associated with the Painleve equations

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.; Demina, Maria V.

2007-01-01

A method for finding relations of roots of polynomials is presented. Our approach allows us to get a number of relations between the zeros of the classical polynomials as well as the roots of special polynomials associated with rational solutions of the Painleve equations. We apply the method to obtain the relations for the zeros of several polynomials. These are: the Hermite polynomials, the Laguerre polynomials, the Yablonskii-Vorob'ev polynomials, the generalized Okamoto polynomials, and the generalized Hermite polynomials. All the relations found can be considered as analogues of generalized Stieltjes relations

Recurrence approach and higher order polynomial algebras for superintegrable monopole systems

Science.gov (United States)

Hoque, Md Fazlul; Marquette, Ian; Zhang, Yao-Zhong

2018-05-01

We revisit the MIC-harmonic oscillator in flat space with monopole interaction and derive the polynomial algebra satisfied by the integrals of motion and its energy spectrum using the ad hoc recurrence approach. We introduce a superintegrable monopole system in a generalized Taub-Newman-Unti-Tamburino (NUT) space. The Schrödinger equation of this model is solved in spherical coordinates in the framework of Stäckel transformation. It is shown that wave functions of the quantum system can be expressed in terms of the product of Laguerre and Jacobi polynomials. We construct ladder and shift operators based on the corresponding wave functions and obtain the recurrence formulas. By applying these recurrence relations, we construct higher order algebraically independent integrals of motion. We show that the integrals form a polynomial algebra. We construct the structure functions of the polynomial algebra and obtain the degenerate energy spectra of the model.

M-Polynomials and Topological Indices of Titania Nanotubes

Directory of Open Access Journals (Sweden)

Mobeen Munir

2016-10-01

Full Text Available Titania is one of the most comprehensively studied nanostructures due to their widespread applications in the production of catalytic, gas sensing, and corrosion-resistant materials. M-polynomial of nanotubes has been vastly investigated, as it produces many degree-based topological indices, which are numerical parameters capturing structural and chemical properties. These indices are used in the development of quantitative structure-activity relationships (QSARs in which the biological activity and other properties of molecules, such as boiling point, stability, strain energy, etc., are correlated with their structure. In this report, we provide M-polynomials of single-walled titania (SW TiO2 nanotubes and recover important topological degree-based indices to theoretically judge these nanotubes. We also plot surfaces associated to single-walled titania (SW TiO2 nanotubes.

On polynomial solutions of the Heun equation

International Nuclear Information System (INIS)

Gurappa, N; Panigrahi, Prasanta K

2004-01-01

By making use of a recently developed method to solve linear differential equations of arbitrary order, we find a wide class of polynomial solutions to the Heun equation. We construct the series solution to the Heun equation before identifying the polynomial solutions. The Heun equation extended by the addition of a term, -σ/x, is also amenable for polynomial solutions. (letter to the editor)

A new Arnoldi approach for polynomial eigenproblems

Energy Technology Data Exchange (ETDEWEB)

Raeven, F.A.

1996-12-31

In this paper we introduce a new generalization of the method of Arnoldi for matrix polynomials. The new approach is compared with the approach of rewriting the polynomial problem into a linear eigenproblem and applying the standard method of Arnoldi to the linearised problem. The algorithm that can be applied directly to the polynomial eigenproblem turns out to be more efficient, both in storage and in computation.

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.

Petrogenesis of Neogene basaltic volcanism associated with the Lut block, eastern Iran: Implication for tectonic and metallogenic evolution

Science.gov (United States)

Saadat, Saeed

This dissertation presents petrochemical data concerning Neogene olivine basalts erupted both along the margins and within the micro-continental Lut block, eastern Iran, which is a part of the active Alpine-Himalayan orogenic belt. These data demonstrate the following: (1) Basalts that erupted from small monogenetic parasitic cones around the Bazman stratovolcano, Makran arc area, in the southern Lut block, are low-Ti sub-alkaline olivine basalts. Enrichments of LILE relative to LREE, and depletions in Nb and Ta relatively to LILE, are similar to those observed for other convergent plate boundary arc magmas around the world and suggest that these basalts formed by melting of subcontinental mantle modified by dehydration of the subducted Oman Sea oceanic lithosphere. (2) Northeast of Iran, an isolated outcrop of Neogene/Quaternary alkali olivine basalt, containing mantle and crustal xenoliths, formed by mixing of small melt fractions from both garnet and spinel-facies mantle. These melts rose to the surface along localized pathways associated with extension at the junction between the N-S right-lateral strike-slip faults and E-W left-lateral strike slip faults. The spinel-peridotite mantle xenoliths contained in the basalts, which equilibrated in the subcontinental lithosphere at depths of 30 to 60 km and temperatures of 965°C to 1065°C, do not preserve evidence of extensive metasomatic enrichment as has been inferred for the mantle below the Damavand volcano further to the west in north-central Iran. (3) Neogene mafic rocks within the central Lut block represent the last manifestation of a much more extensive mid-Tertiary magmatic event. These basalts formed from both OIB-like asthenosphere and subcontinental lithosphere which preserved chemical characteristics inherited from mid-Tertiary subduction associated with the collision of the Arabian with the Eurasian plate and closing of the Neotethys Ocean. Neogene/Quternary alkali olivine basalts erupted mainly along

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.

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

Design of a Polynomial Fuzzy Observer Controller With Sampled-Output Measurements for Nonlinear Systems Considering Unmeasurable Premise Variables

OpenAIRE

Liu, Chuang; Lam, H. K.

2015-01-01

In this paper, we propose a polynomial fuzzy observer controller for nonlinear systems, where the design is achieved through the stability analysis of polynomial-fuzzy-model-based (PFMB) observer-control system. The polynomial fuzzy observer estimates the system states using estimated premise variables. The estimated states are then employed by the polynomial fuzzy controller for the feedback control of nonlinear systems represented by the polynomial fuzzy model. The system stability of the P...

Uniqueness and zeros of q-shift difference polynomials

Indian Academy of Sciences (India)

In this paper, we consider the zero distributions of -shift difference polynomials of meromorphic functions with zero order, and obtain two theorems that extend the classical Hayman results on the zeros of differential polynomials to -shift difference polynomials. We also investigate the uniqueness problem of -shift ...

A novel efficient coupled polynomial field interpolation scheme for higher order piezoelectric extension mode beam finite elements

International Nuclear Information System (INIS)

Sulbhewar, Litesh N; Raveendranath, P

2014-01-01

An efficient piezoelectric smart beam finite element based on Reddy’s third-order displacement field and layerwise linear potential is presented here. The present formulation is based on the coupled polynomial field interpolation of variables, unlike conventional piezoelectric beam formulations that use independent polynomials. Governing equations derived using a variational formulation are used to establish the relationship between field variables. The resulting expressions are used to formulate coupled shape functions. Starting with an assumed cubic polynomial for transverse displacement (w) and a linear polynomial for electric potential (φ), coupled polynomials for axial displacement (u) and section rotation (θ) are found. This leads to a coupled quadratic polynomial representation for axial displacement (u) and section rotation (θ). The formulation allows accommodation of extension–bending, shear–bending and electromechanical couplings at the interpolation level itself, in a variationally consistent manner. The proposed interpolation scheme is shown to eliminate the locking effects exhibited by conventional independent polynomial field interpolations and improve the convergence characteristics of HSDT based piezoelectric beam elements. Also, the present coupled formulation uses only three mechanical degrees of freedom per node, one less than the conventional formulations. Results from numerical test problems prove the accuracy and efficiency of the present formulation. (paper)

A Formally Verified Conflict Detection Algorithm for Polynomial Trajectories

Science.gov (United States)

Narkawicz, Anthony; Munoz, Cesar

2015-01-01

In air traffic management, conflict detection algorithms are used to determine whether or not aircraft are predicted to lose horizontal and vertical separation minima within a time interval assuming a trajectory model. In the case of linear trajectories, conflict detection algorithms have been proposed that are both sound, i.e., they detect all conflicts, and complete, i.e., they do not present false alarms. In general, for arbitrary nonlinear trajectory models, it is possible to define detection algorithms that are either sound or complete, but not both. This paper considers the case of nonlinear aircraft trajectory models based on polynomial functions. In particular, it proposes a conflict detection algorithm that precisely determines whether, given a lookahead time, two aircraft flying polynomial trajectories are in conflict. That is, it has been formally verified that, assuming that the aircraft trajectories are modeled as polynomial functions, the proposed algorithm is both sound and complete.

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.

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

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.

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

Discrete least squares polynomial approximation with random evaluations - application to PDEs with Random parameters

KAUST Repository

Nobile, Fabio

2015-01-01

the parameter-to-solution map u(y) from random noise-free or noisy observations in random points by discrete least squares on polynomial spaces. The noise-free case is relevant whenever the technique is used to construct metamodels, based on polynomial

Modeling Source Water TOC Using Hydroclimate Variables and Local Polynomial Regression.

Science.gov (United States)

Samson, Carleigh C; Rajagopalan, Balaji; Summers, R Scott

2016-04-19

To control disinfection byproduct (DBP) formation in drinking water, an understanding of the source water total organic carbon (TOC) concentration variability can be critical. Previously, TOC concentrations in water treatment plant source waters have been modeled using streamflow data. However, the lack of streamflow data or unimpaired flow scenarios makes it difficult to model TOC. In addition, TOC variability under climate change further exacerbates the problem. Here we proposed a modeling approach based on local polynomial regression that uses climate, e.g. temperature, and land surface, e.g., soil moisture, variables as predictors of TOC concentration, obviating the need for streamflow. The local polynomial approach has the ability to capture non-Gaussian and nonlinear features that might be present in the relationships. The utility of the methodology is demonstrated using source water quality and climate data in three case study locations with surface source waters including river and reservoir sources. The models show good predictive skill in general at these locations, with lower skills at locations with the most anthropogenic influences in their streams. Source water TOC predictive models can provide water treatment utilities important information for making treatment decisions for DBP regulation compliance under future climate scenarios.

M-Polynomials and Topological Indices of Dominating David Derived Networks

Directory of Open Access Journals (Sweden)

Kang Shin Min

2018-03-01

Full Text Available There is a strong relationship between the chemical characteristics of chemical compounds and their molecular structures. Topological indices are numerical values associated with the chemical molecular graphs that help to understand the physical features, chemical reactivity, and biological activity of chemical compound. Thus, the study of the topological indices is important. M-polynomial helps to recover many degree-based topological indices for example Zagreb indices, Randic index, symmetric division idex, inverse sum index etc. In this article we compute M-polynomials of dominating David derived networks of the first type, second type and third type of dimension n and find some topological properties by using these M-polynomials. The results are plotted using Maple to see the dependence of topological indices on the involved parameters.

A Determinant Expression for the Generalized Bessel Polynomials

Directory of Open Access Journals (Sweden)

Sheng-liang Yang

2013-01-01

Full Text Available Using the exponential Riordan arrays, we show that a variation of the generalized Bessel polynomial sequence is of Sheffer type, and we obtain a determinant formula for the generalized Bessel polynomials. As a result, the Bessel polynomial is represented as determinant the entries of which involve Catalan numbers.

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.

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.

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

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.

On Multiple Interpolation Functions of the -Genocchi Polynomials

Directory of Open Access Journals (Sweden)

Jin Jeong-Hee

2010-01-01

Full Text Available Abstract Recently, many mathematicians have studied various kinds of the -analogue of Genocchi numbers and polynomials. In the work (New approach to q-Euler, Genocchi numbers and their interpolation functions, "Advanced Studies in Contemporary Mathematics, vol. 18, no. 2, pp. 105–112, 2009.", Kim defined new generating functions of -Genocchi, -Euler polynomials, and their interpolation functions. In this paper, we give another definition of the multiple Hurwitz type -zeta function. This function interpolates -Genocchi polynomials at negative integers. Finally, we also give some identities related to these polynomials.

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)

Global sensitivity analysis using polynomial chaos expansions

International Nuclear Information System (INIS)

Sudret, Bruno

2008-01-01

Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices

Global sensitivity analysis using polynomial chaos expansions

Energy Technology Data Exchange (ETDEWEB)

Sudret, Bruno [Electricite de France, R and D Division, Site des Renardieres, F 77818 Moret-sur-Loing Cedex (France)], E-mail: bruno.sudret@edf.fr

2008-07-15

Global sensitivity analysis (SA) aims at quantifying the respective effects of input random variables (or combinations thereof) onto the variance of the response of a physical or mathematical model. Among the abundant literature on sensitivity measures, the Sobol' indices have received much attention since they provide accurate information for most models. The paper introduces generalized polynomial chaos expansions (PCE) to build surrogate models that allow one to compute the Sobol' indices analytically as a post-processing of the PCE coefficients. Thus the computational cost of the sensitivity indices practically reduces to that of estimating the PCE coefficients. An original non intrusive regression-based approach is proposed, together with an experimental design of minimal size. Various application examples illustrate the approach, both from the field of global SA (i.e. well-known benchmark problems) and from the field of stochastic mechanics. The proposed method gives accurate results for various examples that involve up to eight input random variables, at a computational cost which is 2-3 orders of magnitude smaller than the traditional Monte Carlo-based evaluation of the Sobol' indices.

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)

Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

Science.gov (United States)

Gordon, Sheldon P.; Yang, Yajun

2017-01-01

This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…

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

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

Force prediction in cold rolling mills by polynomial methods

Directory of Open Access Journals (Sweden)

Nicu ROMAN

2007-12-01

Full Text Available A method for steel and aluminium strip thickness control is provided including a new technique for predictive rolling force estimation method by statistic model based on polynomial techniques.

Polynomial asymptotic stability of damped stochastic differential equations

Directory of Open Access Journals (Sweden)

John Appleby

2004-08-01

Full Text Available The paper studies the polynomial convergence of solutions of a scalar nonlinear It\\^{o} stochastic differential equation\\[dX(t = -f(X(t\\,dt + \\sigma(t\\,dB(t\\] where it is known, {\\it a priori}, that $\\lim_{t\\rightarrow\\infty} X(t=0$, a.s. The intensity of the stochastic perturbation $\\sigma$ is a deterministic, continuous and square integrable function, which tends to zero more quickly than a polynomially decaying function. The function $f$ obeys $\\lim_{x\\rightarrow 0}\\mbox{sgn}(xf(x/|x|^\\beta = a$, for some $\\beta>1$, and $a>0$.We study two asymptotic regimes: when $\\sigma$ tends to zero sufficiently quickly the polynomial decay rate of solutions is the same as for the deterministic equation (when $\\sigma\\equiv0$. When $\\sigma$ decays more slowly, a weaker almost sure polynomial upper bound on the decay rate of solutions is established. Results which establish the necessity for $\\sigma$ to decay polynomially in order to guarantee the almost sure polynomial decay of solutions are also proven.

One-dimensional, non-local, first-order, stationary mean-field games with congestion: a Fourier approach

KAUST Repository

Nurbekyan, Levon

2017-01-01

Here, we study a one-dimensional, non-local mean-field game model with congestion. When the kernel in the non-local coupling is a trigonometric polynomial we reduce the problem to a finite dimensional system. Furthermore, we treat the general case by approximating the kernel with trigonometric polynomials. Our technique is based on Fourier expansion methods.

One-dimensional, non-local, first-order, stationary mean-field games with congestion: a Fourier approach

KAUST Repository

Nurbekyan, Levon

2017-03-11

Here, we study a one-dimensional, non-local mean-field game model with congestion. When the kernel in the non-local coupling is a trigonometric polynomial we reduce the problem to a finite dimensional system. Furthermore, we treat the general case by approximating the kernel with trigonometric polynomials. Our technique is based on Fourier expansion methods.

Degenerate r-Stirling Numbers and r-Bell Polynomials

Science.gov (United States)

Kim, T.; Yao, Y.; Kim, D. S.; Jang, G.-W.

2018-01-01

The purpose of this paper is to exploit umbral calculus in order to derive some properties, recurrence relations, and identities related to the degenerate r-Stirling numbers of the second kind and the degenerate r-Bell polynomials. Especially, we will express the degenerate r-Bell polynomials as linear combinations of many well-known families of special polynomials.

Commutators with idempotent values on multilinear polynomials in ...

Indian Academy of Sciences (India)

Multilinear polynomial; derivations; generalized polynomial identity; prime ring; right ideal. Abstract. Let R be a prime ring of characteristic different from 2, C its extended centroid, d a nonzero derivation of R , f ( x 1 , … , x n ) a multilinear polynomial over C , ϱ a nonzero right ideal of R and m > 1 a fixed integer such that.

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

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

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.

Orthogonal polynomials derived from the tridiagonal representation approach

Science.gov (United States)

Alhaidari, A. D.

2018-01-01

The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials whose properties give the structure and dynamics of the corresponding physical system. For a certain range of parameters, one of these polynomials has a mix of continuous and discrete spectra making it suitable for describing physical systems with both scattering and bound states. In this work, we define these polynomials by their recursion relations and highlight some of their properties using numerical means. Due to the prime significance of these polynomials in physics, we hope that our short expose will encourage experts in the field of orthogonal polynomials to study them and derive their properties (weight functions, generating functions, asymptotics, orthogonality relations, zeros, etc.) analytically.

A note on some identities of derangement polynomials.

Science.gov (United States)

Kim, Taekyun; Kim, Dae San; Jang, Gwan-Woo; Kwon, Jongkyum

2018-01-01

The problem of counting derangements was initiated by Pierre Rémond de Montmort in 1708 (see Carlitz in Fibonacci Q. 16(3):255-258, 1978, Clarke and Sved in Math. Mag. 66(5):299-303, 1993, Kim, Kim and Kwon in Adv. Stud. Contemp. Math. (Kyungshang) 28(1):1-11 2018. A derangement is a permutation that has no fixed points, and the derangement number [Formula: see text] is the number of fixed-point-free permutations on an n element set. In this paper, we study the derangement polynomials and investigate some interesting properties which are related to derangement numbers. Also, we study two generalizations of derangement polynomials, namely higher-order and r -derangement polynomials, and show some relations between them. In addition, we express several special polynomials in terms of the higher-order derangement polynomials by using umbral calculus.

Topological quantum information, virtual Jones polynomials and Khovanov homology

International Nuclear Information System (INIS)

Kauffman, Louis H

2011-01-01

In this paper, we give a quantum statistical interpretation of the bracket polynomial state sum 〈K〉, the Jones polynomial V K (t) and virtual knot theory versions of the Jones polynomial, including the arrow polynomial. We use these quantum mechanical interpretations to give new quantum algorithms for these Jones polynomials. In those cases where the Khovanov homology is defined, the Hilbert space C(K) of our model is isomorphic with the chain complex for Khovanov homology with coefficients in the complex numbers. There is a natural unitary transformation U:C(K) → C(K) such that 〈K〉 = Trace(U), where 〈K〉 denotes the evaluation of the state sum model for the corresponding polynomial. We show that for the Khovanov boundary operator ∂:C(K) → C(K), we have the relationship ∂U + U∂ = 0. Consequently, the operator U acts on the Khovanov homology, and we obtain a direct relationship between the Khovanov homology and this quantum algorithm for the Jones polynomial. (paper)

Polynomial solutions of the Monge-Ampère equation

Energy Technology Data Exchange (ETDEWEB)

Aminov, Yu A [B.Verkin Institute for Low Temperature Physics and Engineering, National Academy of Sciences of Ukraine, Khar' kov (Ukraine)

2014-11-30

The question of the existence of polynomial solutions to the Monge-Ampère equation z{sub xx}z{sub yy}−z{sub xy}{sup 2}=f(x,y) is considered in the case when f(x,y) is a polynomial. It is proved that if f is a polynomial of the second degree, which is positive for all values of its arguments and has a positive squared part, then no polynomial solution exists. On the other hand, a solution which is not polynomial but is analytic in the whole of the x, y-plane is produced. Necessary and sufficient conditions for the existence of polynomial solutions of degree up to 4 are found and methods for the construction of such solutions are indicated. An approximation theorem is proved. Bibliography: 10 titles.

An inline surface measurement method for membrane mirror fabrication using two-stage trained Zernike polynomials and elitist teaching–learning-based optimization

International Nuclear Information System (INIS)

Liu, Yang; Chen, Zhenyu; Yang, Zhile; Li, Kang; Tan, Jiubin

2016-01-01

The accuracy of surface measurement determines the manufacturing quality of membrane mirrors. Thus, an efficient and accurate measuring method is critical in membrane mirror fabrication. This paper formulates this measurement issue as a surface reconstruction problem and employs two-stage trained Zernike polynomials as an inline measuring tool to solve the optical surface measurement problem in the membrane mirror manufacturing process. First, all terms of the Zernike polynomial are generated and projected to a non-circular region as the candidate model pool. The training data are calculated according to the measured values of distance sensors and the geometrical relationship between the ideal surface and the installed sensors. Then the terms are selected by minimizing the cost function each time successively. To avoid the problem of ill-conditioned matrix inversion by the least squares method, the coefficient of each model term is achieved by modified elitist teaching–learning-based optimization. Subsequently, the measurement precision is further improved by a second stage of model refinement. Finally, every point on the membrane surface can be measured according to this model, providing more the subtle feedback information needed for the precise control of membrane mirror fabrication. Experimental results confirm that the proposed method is effective in a membrane mirror manufacturing system driven by negative pressure, and the measurement accuracy can achieve 15 µ m. (paper)

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

Large N Penner matrix model and a novel asymptotic formula for the generalized Laguerre polynomials

International Nuclear Information System (INIS)

Deo, N

2003-01-01

The Gaussian Penner matrix model is re-examined in the light of the results which have been found in double-well matrix models. The orthogonal polynomials for the Gaussian Penner model are shown to be the generalized Laguerre polynomials L (α) n (x) with α and x depending on N, the size of the matrix. An asymptotic formula for the orthogonal polynomials is derived following closely the orthogonal polynomial method of Deo (1997 Nucl. Phys. B 504 609). The universality found in the double-well matrix model is extended to include non-polynomial potentials. An asymptotic formula is also found for the Laguerre polynomial using the saddle-point method by rescaling α and x with N. Combining these results a novel asymptotic formula is found for the generalized Laguerre polynomials (different from that given in Szego's book) in a different asymptotic regime. This may have applications in mathematical and physical problems in the future. The density-density correlators are derived and are the same as those found for the double-well matrix models. These correlators in the smoothed large N limit are sensitive to odd and even N where N is the size of the matrix. These results for the two-point density-density correlation function may be useful in finding eigenvalue effects in experiments in mesoscopic systems or small metallic grains. There may be applications to string theory as well as the tunnelling of an eigenvalue from one valley to the other being an important quantity there

Zeros and uniqueness of Q-difference polynomials of meromorphic ...

Indian Academy of Sciences (India)

Meromorphic functions; Nevanlinna theory; logarithmic order; uniqueness problem; difference-differential polynomial. Abstract. In this paper, we investigate the value distribution of -difference polynomials of meromorphic function of finite logarithmic order, and study the zero distribution of difference-differential polynomials ...

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.

Prostatic Inflammation is Determinant for Prostate Overgrowth and Luts Severity in Men with Metabolic Syndrome: Highlights from Two Recently Published Multicentre Studies

Directory of Open Access Journals (Sweden)

Mauro Gacci

2013-12-01

Full Text Available Introduction: Several evidences have pointed out the possible association between Metabolic Syndrome (MetS and low urinary tract symptoms (LUTS/benign prostate hyperplasia (BPH. Recent epidemiological and histopatological evidences suggested chronic inflammation is a crucial event in BPH pathogenesis. Aim of this study is to demonstrate the correlation among pre-operatory LUTS/BPH severity, MetS features and inflammatory infiltrates in prostatectomy specimens of patients with BPH, highlighting the results of two recently published multicentre studies analyzing all the data from a preclinical and clinical point of view. Materials and methods: We conducted two retrospective study in 271 and 244 consecutive men treated with simple prostatectomy for LUTS/BPH in two tertiary referral centres. Prostate diameters and volume were measured by transrectal ultrasound, LUTS were scored by IPSS, and obstruction diagnosed by uroflowmetry. MetS was defined according to DF & AHA/NHLBI criteria. The inflammatory infiltrate was investigated according to the scoring system of chronic prostatitis (CP-CPPS and scored as inflammation score (IS ranging 3 to 9 and glandular disruption (GD. In addition, we investigated the in vitro inflammatory effects of metabolic insults on human prostatic myofibroblast cells isolated from BPH patients (hBPH. Results: Of 271 men, 86 (31.7% were affected by MetS. Prostatic volume and the anterior-posterior (AP diameter were positively associated to the number of MetS components. Among MetS determinants, only dyslipidaemia (increased serum triglycerides and reduced serum HDL levels was significantly associated with an increased risk of having a prostatic volume >60cm3. IS in prostatectomy specimens showed a step- wise association with number of MetS factors (p=0.001. Dyslipidaemia was the only factor significantly associated with IS. Positive significant correlations among MetS, IS, GD and IPSS Scores were observed. In myofibroblastic h

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

Imaging characteristics of Zernike and annular polynomial aberrations.

Science.gov (United States)

Mahajan, Virendra N; Díaz, José Antonio

2013-04-01

The general equations for the point-spread function (PSF) and optical transfer function (OTF) are given for any pupil shape, and they are applied to optical imaging systems with circular and annular pupils. The symmetry properties of the PSF, the real and imaginary parts of the OTF, and the modulation transfer function (MTF) of a system with a circular pupil aberrated by a Zernike circle polynomial aberration are derived. The interferograms and PSFs are illustrated for some typical polynomial aberrations with a sigma value of one wave, and 3D PSFs and MTFs are shown for 0.1 wave. The Strehl ratio is also calculated for polynomial aberrations with a sigma value of 0.1 wave, and shown to be well estimated from the sigma value. The numerical results are compared with the corresponding results in the literature. Because of the same angular dependence of the corresponding annular and circle polynomial aberrations, the symmetry properties of systems with annular pupils aberrated by an annular polynomial aberration are the same as those for a circular pupil aberrated by a corresponding circle polynomial aberration. They are also illustrated with numerical examples.

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.

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

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.

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)

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

General quantum polynomials: irreducible modules and Morita equivalence

International Nuclear Information System (INIS)

Artamonov, V A

1999-01-01

In this paper we continue the investigation of the structure of finitely generated modules over rings of general quantum (Laurent) polynomials. We obtain a description of the lattice of submodules of periodic finitely generated modules and describe the irreducible modules. We investigate the problem of Morita equivalence of rings of general quantum polynomials, consider properties of division rings of fractions, and solve Zariski's problem for quantum polynomials

Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials

International Nuclear Information System (INIS)

Tratnik, M.V.

1990-01-01

Several families of multivariable, biorthogonal, partly continuous and partly discrete, Wilson polynomials are presented. These yield limit cases that are purely continuous in some of the variables and purely discrete in the others, or purely discrete in all the variables. The latter are referred to as the multivariable biorthogonal Racah polynomials. Interesting further limit cases include the multivariable biorthogonal Hahn and dual Hahn polynomials

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.

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.

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

From sequences to polynomials and back, via operator orderings

Energy Technology Data Exchange (ETDEWEB)

Amdeberhan, Tewodros, E-mail: tamdeber@tulane.edu; Dixit, Atul, E-mail: adixit@tulane.edu; Moll, Victor H., E-mail: vhm@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118 (United States); De Angelis, Valerio, E-mail: vdeangel@xula.edu [Department of Mathematics, Xavier University of Louisiana, New Orleans, Louisiana 70125 (United States); Vignat, Christophe, E-mail: vignat@tulane.edu [Department of Mathematics, Tulane University, New Orleans, Louisiana 70118, USA and L.S.S. Supelec, Universite d' Orsay (France)

2013-12-15

Bender and Dunne [“Polynomials and operator orderings,” J. Math. Phys. 29, 1727–1731 (1988)] showed that linear combinations of words q{sup k}p{sup n}q{sup n−k}, where p and q are subject to the relation qp − pq = ı, may be expressed as a polynomial in the symbol z=1/2 (qp+pq). Relations between such polynomials and linear combinations of the transformed coefficients are explored. In particular, examples yielding orthogonal polynomials are provided.

Connection coefficients between Boas-Buck polynomial sets

Science.gov (United States)

Cheikh, Y. Ben; Chaggara, H.

2006-07-01

In this paper, a general method to express explicitly connection coefficients between two Boas-Buck polynomial sets is presented. As application, we consider some generalized hypergeometric polynomials, from which we derive some well-known results including duplication and inversion formulas.

Least squares orthogonal polynomial approximation in several independent variables

International Nuclear Information System (INIS)

Caprari, R.S.

1992-06-01

This paper begins with an exposition of a systematic technique for generating orthonormal polynomials in two independent variables by application of the Gram-Schmidt orthogonalization procedure of linear algebra. It is then demonstrated how a linear least squares approximation for experimental data or an arbitrary function can be generated from these polynomials. The least squares coefficients are computed without recourse to matrix arithmetic, which ensures both numerical stability and simplicity of implementation as a self contained numerical algorithm. The Gram-Schmidt procedure is then utilised to generate a complete set of orthogonal polynomials of fourth degree. A theory for the transformation of the polynomial representation from an arbitrary basis into the familiar sum of products form is presented, together with a specific implementation for fourth degree polynomials. Finally, the computational integrity of this algorithm is verified by reconstructing arbitrary fourth degree polynomials from their values at randomly chosen points in their domain. 13 refs., 1 tab

simEye: computer-based simulation of visual perception under various eye defects using Zernike polynomials

OpenAIRE

Fink, Wolfgang; Micol, Daniel

2006-01-01

We describe a computer eye model that allows for aspheric surfaces and a three-dimensional computer-based ray-tracing technique to simulate optical properties of the human eye and visual perception under various eye defects. Eye surfaces, such as the cornea, eye lens, and retina, are modeled or approximated by a set of Zernike polynomials that are fitted to input data for the respective surfaces. A ray-tracing procedure propagates light rays using Snell’s law of refraction from an input objec...

Diffusion Coefficient Calculations With Low Order Legendre Polynomial and Chebyshev Polynomial Approximation for the Transport Equation in Spherical Geometry

International Nuclear Information System (INIS)

Yasa, F.; Anli, F.; Guengoer, S.

2007-01-01

We present analytical calculations of spherically symmetric radioactive transfer and neutron transport using a hypothesis of P1 and T1 low order polynomial approximation for diffusion coefficient D. Transport equation in spherical geometry is considered as the pseudo slab equation. The validity of polynomial expansionion in transport theory is investigated through a comparison with classic diffusion theory. It is found that for causes when the fluctuation of the scattering cross section dominates, the quantitative difference between the polynomial approximation and diffusion results was physically acceptable in general

On Roots of Polynomials and Algebraically Closed Fields

Directory of Open Access Journals (Sweden)

Schwarzweller Christoph

2017-10-01

Full Text Available In this article we further extend the algebraic theory of polynomial rings in Mizar [1, 2, 3]. We deal with roots and multiple roots of polynomials and show that both the real numbers and finite domains are not algebraically closed [5, 7]. We also prove the identity theorem for polynomials and that the number of multiple roots is bounded by the polynomial’s degree [4, 6].

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)

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

Charactering baseline shift with 4th polynomial function for portable biomedical near-infrared spectroscopy device

Science.gov (United States)

Zhao, Ke; Ji, Yaoyao; Pan, Boan; Li, Ting

2018-02-01

The continuous-wave Near-infrared spectroscopy (NIRS) devices have been highlighted for its clinical and health care applications in noninvasive hemodynamic measurements. The baseline shift of the deviation measurement attracts lots of attentions for its clinical importance. Nonetheless current published methods have low reliability or high variability. In this study, we found a perfect polynomial fitting function for baseline removal, using NIRS. Unlike previous studies on baseline correction for near-infrared spectroscopy evaluation of non-hemodynamic particles, we focused on baseline fitting and corresponding correction method for NIRS and found that the polynomial fitting function at 4th order is greater than the function at 2nd order reported in previous research. Through experimental tests of hemodynamic parameters of the solid phantom, we compared the fitting effect between the 4th order polynomial and the 2nd order polynomial, by recording and analyzing the R values and the SSE (the sum of squares due to error) values. The R values of the 4th order polynomial function fitting are all higher than 0.99, which are significantly higher than the corresponding ones of 2nd order, while the SSE values of the 4th order are significantly smaller than the corresponding ones of the 2nd order. By using the high-reliable and low-variable 4th order polynomial fitting function, we are able to remove the baseline online to obtain more accurate NIRS measurements.

q-analogue of the Krawtchouk and Meixner orthogonal polynomials

International Nuclear Information System (INIS)

Campigotto, C.; Smirnov, Yu.F.; Enikeev, S.G.

1993-06-01

The comparative analysis of Krawtchouk polynomials on a uniform grid with Wigner D-functions for the SU(2) group is presented. As a result the partnership between corresponding properties of the polynomials and D-functions is established giving the group-theoretical interpretation of the Krawtchouk polynomials properties. In order to extend such an analysis on the quantum groups SU q (2) and SU q (1,1), q-analogues of Krawtchouk and Meixner polynomials of a discrete variable are studied. The total set of characteristics of these polynomials is calculated, including the orthogonality condition, normalization factor, recurrent relation, the explicit analytic expression, the Rodrigues formula, the difference derivative formula and various particular cases and values. (R.P.) 22 refs.; 2 tabs

Time-division polynomial pre-distorter for linearisation of 1.5 T MRI power amplifier

Directory of Open Access Journals (Sweden)

Ming Hui

2017-06-01

Full Text Available A time-division polynomial (TDP model is proposed for modelling and linearising a 1.5 T magnetic resonance imaging (MRI power amplifier (PA with strong non-linearity in high input signal dynamic range. In order to demonstrate the merit of this non-linear model, a 64 dBm 1.5 T MRI PA (63.89 MHz and two different Sinc-pulse signals are used in modelling and linearisation measurements. The TDP is compared with the conventional non-memory polynomial (NMP and no digital pre-distortion for the 1.5 T MRI PA, which is driven by test signal with 2 ms time length and 2% duty cycle. The proposed TDP leads to up to 9 dB improvement in the normalised mean square error compared with the NMP in two different test signals. More importantly, TDP illustrates significantly better reduction in amplitude modulation/amplitude modulation (AM/AM and amplitude modulation/phase modulation (AM/PM conversion compared with the NMP.

Some properties of generalized self-reciprocal polynomials over finite fields

Directory of Open Access Journals (Sweden)

Ryul Kim

2014-07-01

Full Text Available Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal polynomials and characterize the parity of the number of irreducible factors for a-self reciprocal polynomials over finite fields of odd characteristic.

Computation of the Likelihood in Biallelic Diffusion Models Using Orthogonal Polynomials

Directory of Open Access Journals (Sweden)

Claus Vogl

2014-11-01

Full Text Available In population genetics, parameters describing forces such as mutation, migration and drift are generally inferred from molecular data. Lately, approximate methods based on simulations and summary statistics have been widely applied for such inference, even though these methods waste information. In contrast, probabilistic methods of inference can be shown to be optimal, if their assumptions are met. In genomic regions where recombination rates are high relative to mutation rates, polymorphic nucleotide sites can be assumed to evolve independently from each other. The distribution of allele frequencies at a large number of such sites has been called “allele-frequency spectrum” or “site-frequency spectrum” (SFS. Conditional on the allelic proportions, the likelihoods of such data can be modeled as binomial. A simple model representing the evolution of allelic proportions is the biallelic mutation-drift or mutation-directional selection-drift diffusion model. With series of orthogonal polynomials, specifically Jacobi and Gegenbauer polynomials, or the related spheroidal wave function, the diffusion equations can be solved efficiently. In the neutral case, the product of the binomial likelihoods with the sum of such polynomials leads to finite series of polynomials, i.e., relatively simple equations, from which the exact likelihoods can be calculated. In this article, the use of orthogonal polynomials for inferring population genetic parameters is investigated.

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.

Automatic bone outer contour extraction from B-modes ultrasound images based on local phase symmetry and quadratic polynomial fitting

Science.gov (United States)

Karlita, Tita; Yuniarno, Eko Mulyanto; Purnama, I. Ketut Eddy; Purnomo, Mauridhi Hery

2017-06-01

Analyzing ultrasound (US) images to get the shapes and structures of particular anatomical regions is an interesting field of study since US imaging is a non-invasive method to capture internal structures of a human body. However, bone segmentation of US images is still challenging because it is strongly influenced by speckle noises and it has poor image quality. This paper proposes a combination of local phase symmetry and quadratic polynomial fitting methods to extract bone outer contour (BOC) from two dimensional (2D) B-modes US image as initial steps of three-dimensional (3D) bone surface reconstruction. By using local phase symmetry, the bone is initially extracted from US images. BOC is then extracted by scanning one pixel on the bone boundary in each column of the US images using first phase features searching method. Quadratic polynomial fitting is utilized to refine and estimate the pixel location that fails to be detected during the extraction process. Hole filling method is then applied by utilize the polynomial coefficients to fill the gaps with new pixel. The proposed method is able to estimate the new pixel position and ensures smoothness and continuity of the contour path. Evaluations are done using cow and goat bones by comparing the resulted BOCs with the contours produced by manual segmentation and contours produced by canny edge detection. The evaluation shows that our proposed methods produces an excellent result with average MSE before and after hole filling at the value of 0.65.

Applications of polynomial optimization in financial risk investment

Science.gov (United States)

Zeng, Meilan; Fu, Hongwei

2017-09-01

Recently, polynomial optimization has many important applications in optimization, financial economics and eigenvalues of tensor, etc. This paper studies the applications of polynomial optimization in financial risk investment. We consider the standard mean-variance risk measurement model and the mean-variance risk measurement model with transaction costs. We use Lasserre's hierarchy of semidefinite programming (SDP) relaxations to solve the specific cases. The results show that polynomial optimization is effective for some financial optimization problems.

A New Navigation Satellite Clock Bias Prediction Method Based on Modified Clock-bias Quadratic Polynomial Model

Science.gov (United States)

Wang, Y. P.; Lu, Z. P.; Sun, D. S.; Wang, N.

2016-01-01

In order to better express the characteristics of satellite clock bias (SCB) and improve SCB prediction precision, this paper proposed a new SCB prediction model which can take physical characteristics of space-borne atomic clock, the cyclic variation, and random part of SCB into consideration. First, the new model employs a quadratic polynomial model with periodic items to fit and extract the trend term and cyclic term of SCB; then based on the characteristics of fitting residuals, a time series ARIMA ~(Auto-Regressive Integrated Moving Average) model is used to model the residuals; eventually, the results from the two models are combined to obtain final SCB prediction values. At last, this paper uses precise SCB data from IGS (International GNSS Service) to conduct prediction tests, and the results show that the proposed model is effective and has better prediction performance compared with the quadratic polynomial model, grey model, and ARIMA model. In addition, the new method can also overcome the insufficiency of the ARIMA model in model recognition and order determination.

On continuous lifetime distributions with polynomial failure rate with an application in reliability

International Nuclear Information System (INIS)

Csenki, Attila

2011-01-01

It is shown that the Laplace transform of a continuous lifetime random variable with a polynomial failure rate function satisfies a certain differential equation. This generates a set of differential equations which can be used to express the polynomial coefficients in terms of the derivatives of the Laplace transform at the origin. The technique described here establishes a procedure for estimating the polynomial coefficients from the sample moments of the distribution. Some special cases are worked through symbolically using computer algebra. Real data from the literature recording bus motor failures is used to compare the proposed approach with results based on the least squares procedure.

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.

Polynomially Riesz elements | Živković-Zlatanović | Quaestiones ...

African Journals Online (AJOL)

A Banach algebra element ɑ ∈ A is said to be "polynomially Riesz", relative to the homomorphism T : A → B, if there exists a nonzero complex polynomial p(z) such that the image Tp ∈ B is quasinilpotent. Keywords: Homomorphism of Banach algebras, polynomially Riesz element, Fredholm spectrum, Browder element, ...

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.

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.

Okounkov's BC-Type Interpolation Macdonald Polynomials and Their q=1 Limit

NARCIS (Netherlands)

Koornwinder, T.H.

2015-01-01

This paper surveys eight classes of polynomials associated with A-type and BC-type root systems: Jack, Jacobi, Macdonald and Koornwinder polynomials and interpolation (or shifted) Jack and Macdonald polynomials and their BC-type extensions. Among these the BC-type interpolation Jack polynomials were

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

Interlacing of zeros of quasi-orthogonal meixner polynomials | Driver ...

African Journals Online (AJOL)

... interlacing of zeros of quasi-orthogonal Meixner polynomials Mn(x;β; c) with the zeros of their nearest orthogonal counterparts Mt(x;β + k; c), l; n ∈ ℕ, k ∈ {1; 2}; is also discussed. Mathematics Subject Classication (2010): 33C45, 42C05. Key words: Discrete orthogonal polynomials, quasi-orthogonal polynomials, Meixner

Quantum models with energy-dependent potentials solvable in terms of exceptional orthogonal polynomials

International Nuclear Information System (INIS)

Schulze-Halberg, Axel; Roy, Pinaki

2017-01-01

We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.

Quantum models with energy-dependent potentials solvable in terms of exceptional orthogonal polynomials

Energy Technology Data Exchange (ETDEWEB)

Schulze-Halberg, Axel, E-mail: axgeschu@iun.edu [Department of Mathematics and Actuarial Science, Indiana University Northwest, 3400 Broadway, Gary IN 46408 (United States); Department of Physics, Indiana University Northwest, 3400 Broadway, Gary IN 46408 (United States); Roy, Pinaki, E-mail: pinaki@isical.ac.in [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India)

2017-03-15

We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.

Discriminants and functional equations for polynomials orthogonal on the unit circle

International Nuclear Information System (INIS)

Ismail, M.E.H.; Witte, N.S.

2000-01-01

We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and q-difference equations for these polynomials. A general functional equation is found which allows one to relate the zeros of the orthogonal polynomials to the stationary values of an explicit quasi-energy and implies recurrences on the orthogonal polynomial coefficients. We also evaluate the discriminants and quantized discriminants of polynomials orthogonal on the unit circle

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

A Synoptic of Software Implementation for Shift Registers Based on 16th Degree Primitive Polynomials

Directory of Open Access Journals (Sweden)

Mirella Amelia Mioc

2016-08-01

Full Text Available Almost all of the major applications in the specific Fields of Communication used a well-known device called Linear Feedback Shift Register. Usually LFSR functions in a Galois Field GF(2n, meaning that all the operations are done with arithmetic modulo n degree Irreducible  and especially  Primitive Polynomials. Storing data in Galois Fields allows effective and manageable manipulation, mainly in computer cryptographic applications. The analysis of functioning for Primitive Polynomials of 16th degree shows that almost all the obtained results are in the same time distribution.

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

On the Lorentz degree of a product of polynomials

KAUST Repository

Ait-Haddou, Rachid

2015-01-01

In this note, we negatively answer two questions of T. Erdélyi (1991, 2010) on possible lower bounds on the Lorentz degree of product of two polynomials. We show that the correctness of one question for degree two polynomials is a direct consequence of a result of Barnard et al. (1991) on polynomials with nonnegative coefficients.

All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials

OpenAIRE

N. Stojanovic; N. Stamenkovic; V. Stojanovic

2014-01-01

A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0), controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev f...

Appropriateness of oral drugs for long-term treatment of lower urinary tract symptoms in older persons: results of a systematic literature review and international consensus validation process (LUTS-FORTA 2014).

Science.gov (United States)

Oelke, Matthias; Becher, Klaus; Castro-Diaz, David; Chartier-Kastler, Emmanuel; Kirby, Mike; Wagg, Adrian; Wehling, Martin

2015-09-01

we aimed to systematically review drugs to treat lower urinary tract symptoms (LUTS) regularly used in older persons to classify appropriate and inappropriate drugs based on efficacy, safety and tolerability by using the Fit fOR The Aged (FORTA) classification. to evaluate the efficacy, safety and tolerability of drugs used for treatment of LUTS in older persons, a systematic review was performed. Papers on clinical trials and summaries of individual product characteristics were analysed regarding efficacy and safety in older persons (≥65 years). The most frequently used drugs were selected based on current prescription data. An interdisciplinary international expert panel assessed the drugs in a Delphi process. for the 16 drugs included here, a total of 896 citations were identified; of those, only 25 reported clinical trials with explicit data on, or solely performed in older people, underlining the lack of evidence in older people for drug treatment of LUTS. No drug was rated at the FORTA-A-level (indispensable). Only three were assigned to FORTA B (beneficial): dutasteride, fesoterodine and finasteride. The majority was rated FORTA C (questionable): darifenacin, mirabegron, extended release oxybutynin, silodosin, solifenacin, tadalafil, tamsulosin, tolterodine and trospium. FORTA D (avoid) was assigned to alfuzosin, doxazosin, immediate release oxybutynin, propiverine and terazosin. dutasteride, fesoterodine and finasteride were classified as beneficial in older persons or frail elderly people (FORTA B). For most drugs, in particular those from the group of α-blockers and antimuscarinics, use in this group seems questionable (FORTA C) or should be avoided (FORTA D). © The Author 2015. Published by Oxford University Press on behalf of the British Geriatrics Society. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Correcting bias in the rational polynomial coefficients of satellite imagery using thin-plate smoothing splines

Science.gov (United States)

Shen, Xiang; Liu, Bin; Li, Qing-Quan

2017-03-01

The Rational Function Model (RFM) has proven to be a viable alternative to the rigorous sensor models used for geo-processing of high-resolution satellite imagery. Because of various errors in the satellite ephemeris and instrument calibration, the Rational Polynomial Coefficients (RPCs) supplied by image vendors are often not sufficiently accurate, and there is therefore a clear need to correct the systematic biases in order to meet the requirements of high-precision topographic mapping. In this paper, we propose a new RPC bias-correction method using the thin-plate spline modeling technique. Benefiting from its excellent performance and high flexibility in data fitting, the thin-plate spline model has the potential to remove complex distortions in vendor-provided RPCs, such as the errors caused by short-period orbital perturbations. The performance of the new method was evaluated by using Ziyuan-3 satellite images and was compared against the recently developed least-squares collocation approach, as well as the classical affine-transformation and quadratic-polynomial based methods. The results show that the accuracies of the thin-plate spline and the least-squares collocation approaches were better than the other two methods, which indicates that strong non-rigid deformations exist in the test data because they cannot be adequately modeled by simple polynomial-based methods. The performance of the thin-plate spline method was close to that of the least-squares collocation approach when only a few Ground Control Points (GCPs) were used, and it improved more rapidly with an increase in the number of redundant observations. In the test scenario using 21 GCPs (some of them located at the four corners of the scene), the correction residuals of the thin-plate spline method were about 36%, 37%, and 19% smaller than those of the affine transformation method, the quadratic polynomial method, and the least-squares collocation algorithm, respectively, which demonstrates

Prediction of the temperature of the atmosphere of the primary containment: comparison between neural networks and polynomial regression

International Nuclear Information System (INIS)

Alvarez Huerta, A.; Gonzalez Miguelez, R.; Garcia Metola, D.; Noriega Gonzalez, A.

2011-01-01

The modelization is carried out through two different techniques, a conventional polynomial regression and other based on an approach by neural networks artificial. He is a comparison between the quality of the forecast would make different models based on the polynomial regression and neural network with generalization by Bayesian regulation, using the indicators of the root of the mean square error and the coefficient of determination, in view of the results, the neural network generates a prediction more accurate and reliable than the polynomial regression.

On Some Extensions of Szasz Operators Including Boas-Buck-Type Polynomials

Directory of Open Access Journals (Sweden)

Sezgin Sucu

2012-01-01

Full Text Available This paper is concerned with a new sequence of linear positive operators which generalize Szasz operators including Boas-Buck-type polynomials. We establish a convergence theorem for these operators and give the quantitative estimation of the approximation process by using a classical approach and the second modulus of continuity. Some explicit examples of our operators involving Laguerre polynomials, Charlier polynomials, and Gould-Hopper polynomials are given. Moreover, a Voronovskaya-type result is obtained for the operators containing Gould-Hopper polynomials.

Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing

OpenAIRE

Chitambar, Eric; Duan, Runyao; Shi, Yaoyun

2009-01-01

We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to the question of tripartite to bipartit...

On associated polynomials and decay rates for birth-death processes

NARCIS (Netherlands)

van Doorn, Erik A.

2001-01-01

We consider sequences of orthogonal polynomials 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. In particular, we relate the supports of the

On associated polynomials and decay rates for birth-death processes

NARCIS (Netherlands)

van Doorn, Erik A.

2003-01-01

We consider sequences of orthogonal polynomials and pursue the question of how (partial) knowledge of the orthogonalizing measure for the associated polynomials can lead to information about the orthogonalizing measure for the original polynomials. In particular, we relate the supports of the two

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.

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.

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.

Evaluation of quantum mechanics path integrals by the approximations exact on a class of polynomial functionals

International Nuclear Information System (INIS)

Lobanov, Yu.Yu.; Shidkov, E.P.

1987-01-01

The method for numerical evaluation of path integrals in Eucledean quantum mechanics without lattice discretization is elaborated. The method is based on the representation of these integrals in the form of functional integrals with respect to the conditional Wiener measure and on the use of the derived approximate exact on a class of polynomial functionals of a given degree. By the computations of non-perturbative characteristics, concerned the topological structure of vacuum, the advantages of this method versus lattice Monte-Carlo calculations are demonstrated

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

Positive trigonometric polynomials and signal processing applications

CERN Document Server

Dumitrescu, Bogdan

2017-01-01

This revised edition is made up of two parts: theory and applications. Though many of the fundamental results are still valid and used, new and revised material is woven throughout the text. As with the original book, the theory of sum-of-squares trigonometric polynomials is presented unitarily based on the concept of Gram matrix (extended to Gram pair or Gram set). The programming environment has also evolved, and the books examples are changed accordingly. The applications section is organized as a collection of related problems that use systematically the theoretical results. All the problems are brought to a semi-definite programming form, ready to be solved with algorithms freely available, like those from the libraries SeDuMi, CVX and Pos3Poly. A new chapter discusses applications in super-resolution theory, where Bounded Real Lemma for trigonometric polynomials is an important tool. This revision is written to be more appealing and easier to use for new readers. < Features updated information on LMI...

Quantitative Boltzmann-Gibbs Principles via Orthogonal Polynomial Duality

Science.gov (United States)

Ayala, Mario; Carinci, Gioia; Redig, Frank

2018-06-01

We study fluctuation fields of orthogonal polynomials in the context of particle systems with duality. We thereby obtain a systematic orthogonal decomposition of the fluctuation fields of local functions, where the order of every term can be quantified. This implies a quantitative generalization of the Boltzmann-Gibbs principle. In the context of independent random walkers, we complete this program, including also fluctuation fields in non-stationary context (local equilibrium). For other interacting particle systems with duality such as the symmetric exclusion process, similar results can be obtained, under precise conditions on the n particle dynamics.

Finite-Time Stability and Controller Design of Continuous-Time Polynomial Fuzzy Systems

Directory of Open Access Journals (Sweden)

Xiaoxing Chen

2017-01-01

Full Text Available Finite-time stability and stabilization problem is first investigated for continuous-time polynomial fuzzy systems. The concept of finite-time stability and stabilization is given for polynomial fuzzy systems based on the idea of classical references. A sum-of-squares- (SOS- based approach is used to obtain the finite-time stability and stabilization conditions, which include some classical results as special cases. The proposed conditions can be solved with the help of powerful Matlab toolbox SOSTOOLS and a semidefinite-program (SDP solver. Finally, two numerical examples and one practical example are employed to illustrate the validity and effectiveness of the provided conditions.

PDE5 inhibitors blunt inflammation in human BPH: a potential mechanism of action for PDE5 inhibitors in LUTS.

Science.gov (United States)

Vignozzi, Linda; Gacci, Mauro; Cellai, Ilaria; Morelli, Annamaria; Maneschi, Elena; Comeglio, Paolo; Santi, Raffaella; Filippi, Sandra; Sebastianelli, Arcangelo; Nesi, Gabriella; Serni, Sergio; Carini, Marco; Maggi, Mario

2013-09-01

Metabolic syndrome (MetS) and benign prostate hyperplasia (BPH)/low urinary tract symptoms (LUTS) are often comorbid. Chronic inflammation is one of the putative links between these diseases. Phosphodiesterase type 5 inhibitors (PDE5i) are recognized as an effective treatment of BPH-related LUTS. One proposed mechanism of action of PDE5 is the inhibition of intraprostatic inflammation. In this study we investigate whether PDE5i could blunt inflammation in the human prostate. Evaluation of the effect of tadalafil and vardenafil on secretion of interleukin 8 (IL-8, a surrogate marker of prostate inflammation) by human myofibroblast prostatic cells (hBPH) exposed to different inflammatory stimuli. We preliminary evaluate histological features of prostatic inflammatory infiltrates in BPH patients enrolled in a randomized, double bind, placebo controlled study aimed at investigating the efficacy of vardenafil (10 mg/day, for 12 weeks) on BPH/LUTS. In vitro treatment with tadalafil or vardenafil on hBPH reduced IL-8 secretion induced by either TNFα or metabolic factors, including oxidized low-density lipoprotein, oxLDL, to the same extent as a PDE5-insensitive PKG agonist Sp-8-Br-PET-cGMP. These effects were reverted by the PKG inhibitor KT5823, suggesting a cGMP/PKG-dependency. Treatment with tadalafil or vardenafil significantly suppressed oxLDL receptor (LOX-1) expression. Histological evaluation of anti-CD45 staining (CD45 score) in prostatectomy specimens of BPH patients showed a positive association with MetS severity. Reduced HDL-cholesterol and elevated triglycerides were the only MetS factors significantly associated with CD45 score. In the MetS cohort there was a significant lower CD45 score in the vardenafil-arm versus the placebo-one. © 2013 Wiley Periodicals, Inc.

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

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.

Generalized Freud's equation and level densities with polynomial

Indian Academy of Sciences (India)

Home; Journals; Pramana – Journal of Physics; Volume 81; Issue 2. Generalized Freud's equation and level densities with polynomial potential. Akshat Boobna Saugata Ghosh. Research Articles Volume 81 ... Keywords. Orthogonal polynomial; Freud's equation; Dyson–Mehta method; methods of resolvents; level density.

Safety and efficacy of tamsulosin, alfuzosin or silodosin as monotherapy for LUTS in BPH - a double-blind randomized trial.

Science.gov (United States)

Manohar, Chikka Moga Siddaiah; Nagabhushana, Mahadevappa; Karthikeyan, Vilvapathy Senguttuvan; Sanjay, Ramachandra Pudakalkatti; Kamath, Ananth Janardhan; Keshavamurthy, Ramaiah

2017-06-30

Currently alpha1-adrenoceptor blockers (AB) are widely used as first-line therapy to improve lower urinary tract symptoms (LUTS) associated with benign prostatic hyperplasia (BPH). We compared the efficacy and safety profile of tamsulosin, alfuzosin and silodosin in LUTS due to BPH. Consecutive consenting male patients (N = 269) undergoing medical management of BPH with AB from February 2012 to October 2015 were enrolled. Patients were randomized to a 0.4 mg tamsulosin (group T), 10 mg alfuzosin (group A) or a 8 mg silodosin (group S) by double-blind randomization. All patients were assessed for improvements and post-void residual urine (PVR) and for adverse drug events (ADE). IPSS showed significant improvement in Group S at the first week (11.7 ±4.18, p = 0.027) and at 3 months (7.97 ±3.84, p = 0.020). QOL showed significant improvement at 1 (2.2 ±0.76, p = 0.020), 4 (1.47 ±0.63, p BPH and objectively improves maximum flow rate. However, silodosin has more adverse events when compared to tamsulosin and alfuzosin.

A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection

NARCIS (Netherlands)

Takano, Y.; Sotirov, R.

2010-01-01

We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on

A polynomial optimization approach to constant rebalanced portfolio selection

NARCIS (Netherlands)

Takano, Y.; Sotirov, R.

2012-01-01

We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on

An overview on polynomial approximation of NP-hard problems

Directory of Open Access Journals (Sweden)

Paschos Vangelis Th.

2009-01-01

Full Text Available The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's quality. In other words, heuristic computation consists of trying to find not the best solution but one solution which is 'close to' the optimal one in reasonable time. Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions that are, under some predefined criterion, as near to the optimal ones as possible. The polynomial approximation theory deals with the study of such algorithms. This survey first presents and analyzes time approximation algorithms for some classical examples of NP-hard problems. Secondly, it shows how classical notions and tools of complexity theory, such as polynomial reductions, can be matched with polynomial approximation in order to devise structural results for NP-hard optimization problems. Finally, it presents a quick description of what is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.

Superintegrability in two-dimensional Euclidean space and associated polynomial solutions

International Nuclear Information System (INIS)

Kalnins, E.G.; Miller, W. Jr; Pogosyan, G.S.

1996-01-01

In this work we examine the basis functions for those classical and quantum mechanical systems in two dimensions which admit separation of variables in at least two coordinate systems. We do this for the corresponding systems defined in Euclidean space and on the two dimensional sphere. We present all of these cases from a unified point of view. In particular, all of the spectral functions that arise via variable separation have their essential features expressed in terms of their zeros. The principal new results are the details of the polynomial base for each of the nonsubgroup base, not just the subgroup cartesian and polar coordinate case, and the details of the structure of the quadratic algebras. We also study the polynomial eigenfunctions in elliptic coordinates of the N-dimensional isotropic quantum oscillator. 28 refs., 1 tab

Comparison Between Polynomial, Euler Beta-Function and Expo-Rational B-Spline Bases

Science.gov (United States)

Kristoffersen, Arnt R.; Dechevsky, Lubomir T.; Laksa˚, Arne; Bang, Børre

2011-12-01

Euler Beta-function B-splines (BFBS) are the practically most important instance of generalized expo-rational B-splines (GERBS) which are not true expo-rational B-splines (ERBS). BFBS do not enjoy the full range of the superproperties of ERBS but, while ERBS are special functions computable by a very rapidly converging yet approximate numerical quadrature algorithms, BFBS are explicitly computable piecewise polynomial (for integer multiplicities), similar to classical Schoenberg B-splines. In the present communication we define, compute and visualize for the first time all possible BFBS of degree up to 3 which provide Hermite interpolation in three consecutive knots of multiplicity up to 3, i.e., the function is being interpolated together with its derivatives of order up to 2. We compare the BFBS obtained for different degrees and multiplicities among themselves and versus the classical Schoenberg polynomial B-splines and the true ERBS for the considered knots. The results of the graphical comparison are discussed from analytical point of view. For the numerical computation and visualization of the new B-splines we have used Maple 12.

A note on the zeros of Freud-Sobolev orthogonal polynomials

Science.gov (United States)

Moreno-Balcazar, Juan J.

2007-10-01

We prove that the zeros of a certain family of Sobolev orthogonal polynomials involving the Freud weight function e-x4 on are real, simple, and interlace with the zeros of the Freud polynomials, i.e., those polynomials orthogonal with respect to the weight function e-x4. Some numerical examples are shown.

Polynomial estimation of the smoothing splines for the new Finnish reference values for spirometry.

Science.gov (United States)

Kainu, Annette; Timonen, Kirsi

2016-07-01

Background Discontinuity of spirometry reference values from childhood into adulthood has been a problem with traditional reference values, thus modern modelling approaches using smoothing spline functions to better depict the transition during growth and ageing have been recently introduced. Following the publication of the new international Global Lung Initiative (GLI2012) reference values also new national Finnish reference values have been calculated using similar GAMLSS-modelling, with spline estimates for mean (Mspline) and standard deviation (Sspline) provided in tables. The aim of this study was to produce polynomial estimates for these spline functions to use in lieu of lookup tables and to assess their validity in the reference population of healthy non-smokers. Methods Linear regression modelling was used to approximate the estimated values for Mspline and Sspline using similar polynomial functions as in the international GLI2012 reference values. Estimated values were compared to original calculations in absolute values, the derived predicted mean and individually calculated z-scores using both values. Results Polynomial functions were estimated for all 10 spirometry variables. The agreement between original lookup table-produced values and polynomial estimates was very good, with no significant differences found. The variation slightly increased in larger predicted volumes, but a range of -0.018 to +0.022 litres of FEV1 representing ± 0.4% of maximum difference in predicted mean. Conclusions Polynomial approximations were very close to the original lookup tables and are recommended for use in clinical practice to facilitate the use of new reference values.

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.

Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes

KAUST Repository

Lin, Sian-Jheng; Al-Naffouri, Tareq Y.; Han, Yunghsiang S.; Chung, Wei-Ho

2016-01-01

In this paper, we present a fast Fourier transform (FFT) algorithm over extension binary fields, where the polynomial is represented in a non-standard basis. The proposed Fourier-like transform requires O(h lg(h)) field operations, where h

q-Bernoulli numbers and q-Bernoulli polynomials revisited

Directory of Open Access Journals (Sweden)

Kim Taekyun

2011-01-01

Full Text Available Abstract This paper performs a further investigation on the q-Bernoulli numbers and q-Bernoulli polynomials given by Acikgöz et al. (Adv Differ Equ, Article ID 951764, 9, 2010, some incorrect properties are revised. It is point out that the generating function for the q-Bernoulli numbers and polynomials is unreasonable. By using the theorem of Kim (Kyushu J Math 48, 73-86, 1994 (see Equation 9, some new generating functions for the q-Bernoulli numbers and polynomials are shown. Mathematics Subject Classification (2000 11B68, 11S40, 11S80

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)

Low‐Power and Low‐Hardware Bit‐Parallel Polynomial Basis Systolic Multiplier over GF(2m for Irreducible Polynomials

Directory of Open Access Journals (Sweden)

Sudha Ellison Mathe

2017-08-01

Full Text Available Multiplication in finite fields is used in many applications, especially in cryptography. It is a basic and the most computationally intensive operation from among all such operations. Several systolic multipliers are proposed in the literature that offer low hardware complexity or high speed. In this paper, a bit‐parallel polynomial basis systolic multiplier for generic irreducible polynomials is proposed based on a modified interleaved multiplication method. The hardware complexity and delay of the proposed multiplier are estimated, and a comparison with the corresponding multipliers available in the literature is presented. Of the corresponding multipliers, the proposed multiplier achieves a reduction in the hardware complexity of up to 20% when compared to the best multiplier for m = 163. The synthesis results of application‐specific integrated circuit and field‐programmable gate array implementations of the proposed multiplier are also presented. From the synthesis results, it is inferred that the proposed multiplier achieves low power consumption and low area complexitywhen compared to the best of the corresponding multipliers.

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.

Comparative Performance of Complex-Valued B-Spline and Polynomial Models Applied to Iterative Frequency-Domain Decision Feedback Equalization of Hammerstein Channels.

Science.gov (United States)

Chen, Sheng; Hong, Xia; Khalaf, Emad F; Alsaadi, Fuad E; Harris, Chris J

2017-12-01

Complex-valued (CV) B-spline neural network approach offers a highly effective means for identifying and inverting practical Hammerstein systems. Compared with its conventional CV polynomial-based counterpart, a CV B-spline neural network has superior performance in identifying and inverting CV Hammerstein systems, while imposing a similar complexity. This paper reviews the optimality of the CV B-spline neural network approach. Advantages of B-spline neural network approach as compared with the polynomial based modeling approach are extensively discussed, and the effectiveness of the CV neural network-based approach is demonstrated in a real-world application. More specifically, we evaluate the comparative performance of the CV B-spline and polynomial-based approaches for the nonlinear iterative frequency-domain decision feedback equalization (NIFDDFE) of single-carrier Hammerstein channels. Our results confirm the superior performance of the CV B-spline-based NIFDDFE over its CV polynomial-based counterpart.

Homogenous polynomially parameter-dependent H∞ filter designs of discrete-time fuzzy systems.

Science.gov (United States)

Zhang, Huaguang; Xie, Xiangpeng; Tong, Shaocheng

2011-10-01

This paper proposes a novel H(∞) filtering technique for a class of discrete-time fuzzy systems. First, a novel kind of fuzzy H(∞) filter, which is homogenous polynomially parameter dependent on membership functions with an arbitrary degree, is developed to guarantee the asymptotic stability and a prescribed H(∞) performance of the filtering error system. Second, relaxed conditions for H(∞) performance analysis are proposed by using a new fuzzy Lyapunov function and the Finsler lemma with homogenous polynomial matrix Lagrange multipliers. Then, based on a new kind of slack variable technique, relaxed linear matrix inequality-based H(∞) filtering conditions are proposed. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed approach.

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.

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.

Guts of surfaces and the colored Jones polynomial

CERN Document Server

Futer, David; Purcell, Jessica

2013-01-01

This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses, we prove that the growth of the degree of the colored Jones polynomials is a boundary slope of an essential surface in the knot complement. We show that certain coefficients of the polynomial measure how far this surface is from being a fiber for the knot; in particular, the surface is a fiber if and only if a particular coefficient vanishes. We also relate hyperbolic volume to colored Jones polynomials. Our method is to generalize the checkerboard decompositions of alternating knots. Under mild diagrammatic hypotheses, we show that these surfaces are essential, and obtain an ideal polyhedral decomposition of their complement. We use normal surface theory to relate the pieces of the JSJ decomposition of the  complement to the combinatorics of certain surface spines (state graphs). Since state graphs have p...

Computing Tutte polynomials of contact networks in classrooms

Science.gov (United States)

Hincapié, Doracelly; Ospina, Juan

2013-05-01

Objective: The topological complexity of contact networks in classrooms and the potential transmission of an infectious disease were analyzed by sex and age. Methods: The Tutte polynomials, some topological properties and the number of spanning trees were used to algebraically compute the topological complexity. Computations were made with the Maple package GraphTheory. Published data of mutually reported social contacts within a classroom taken from primary school, consisting of children in the age ranges of 4-5, 7-8 and 10-11, were used. Results: The algebraic complexity of the Tutte polynomial and the probability of disease transmission increases with age. The contact networks are not bipartite graphs, gender segregation was observed especially in younger children. Conclusion: Tutte polynomials are tools to understand the topology of the contact networks and to derive numerical indexes of such topologies. It is possible to establish relationships between the Tutte polynomial of a given contact network and the potential transmission of an infectious disease within such network

Evaluating the Performance of Polynomial Regression Method with Different Parameters during Color Characterization

Directory of Open Access Journals (Sweden)

Bangyong Sun

2014-01-01

Full Text Available The polynomial regression method is employed to calculate the relationship of device color space and CIE color space for color characterization, and the performance of different expressions with specific parameters is evaluated. Firstly, the polynomial equation for color conversion is established and the computation of polynomial coefficients is analysed. And then different forms of polynomial equations are used to calculate the RGB and CMYK’s CIE color values, while the corresponding color errors are compared. At last, an optimal polynomial expression is obtained by analysing several related parameters during color conversion, including polynomial numbers, the degree of polynomial terms, the selection of CIE visual spaces, and the linearization.

A reachability test for systems over polynomial rings using Gröbner bases

NARCIS (Netherlands)

Habets, L.C.G.J.M.

1992-01-01

Conditions for the reachability of a system over a polynomial ring are well known in the literature. However, the verification of these conditions remained a difficult problem in general. Application of the Gröbner Basis method from constructive commutative algebra makes it possible to carry out

M-Polynomials and topological indices of V-Phenylenic Nanotubes and Nanotori.

Science.gov (United States)

Kwun, Young Chel; Munir, Mobeen; Nazeer, Waqas; Rafique, Shazia; Min Kang, Shin

2017-08-18

V-Phenylenic nanotubes and nanotori are most comprehensively studied nanostructures due to widespread applications in the production of catalytic, gas-sensing and corrosion-resistant materials. Representing chemical compounds with M-polynomial is a recent idea and it produces nice formulas of degree-based topological indices which correlate chemical properties of the material under investigation. These indices are used in the development of quantitative structure-activity relationships (QSARs) in which the biological activity and other properties of molecules like boiling point, stability, strain energy etc. are correlated with their structures. In this paper, we determine general closed formulae for M-polynomials of V-Phylenic nanotubes and nanotori. We recover important topological degree-based indices. We also give different graphs of topological indices and their relations with the parameters of structures.

Root and Critical Point Behaviors of Certain Sums of Polynomials

Indian Academy of Sciences (India)

13

There is an extensive literature concerning roots of sums of polynomials. Many papers and books([5], [6],. [7]) have written about these polynomials. Perhaps the most immediate question of sums of polynomials,. A + B = C, is “given bounds for the roots of A and B, what bounds can be given for the roots of C?” By. Fell [3], if ...

Global structure of a polynomial autonomous system on the plane

International Nuclear Information System (INIS)

Nguyen Van Chau.

1991-10-01

This note is to study the global behaviour of a polynomial autonomous system on the plane with divergence non-positive outside a bounded set. It is shown that in some certain conditions the global structure of such system can be simple. The main result here can be seen as an improvement of the result of Olech and Meister concerning with the global asymptotical stable conjecture of Markur and Yamable and the Jacobian Conjecture. (author). 13 refs

A polynomial approach for generating a monoparametric family of chaotic attractors via switched linear systems

International Nuclear Information System (INIS)

Aguirre-Hernández, B.; Campos-Cantón, E.; López-Renteria, J.A.; Díaz González, E.C.

2015-01-01

In this paper, we consider characteristic polynomials of n-dimensional systems that determine a segment of polynomials. One parameter is used to characterize this segment of polynomials in order to determine the maximal interval of dissipativity and unstability. Then we apply this result to the generation of a family of attractors based on a class of unstable dissipative systems (UDS) of type affine linear systems. This class of systems is comprised of switched linear systems yielding strange attractors. A family of these chaotic switched systems is determined by the maximal interval of perturbation of the matrix that governs the dynamics for still having scroll attractors

Modification of REE distribution of ordinary chondrites from Atacama (Chile) and Lut (Iran) hot deserts: Insights into the chemical weathering of meteorites

Science.gov (United States)

Pourkhorsandi, Hamed; D'Orazio, Massimo; Rochette, Pierre; Valenzuela, Millarca; Gattacceca, Jérôme; Mirnejad, Hassan; Sutter, Brad; Hutzler, Aurore; Aboulahris, Maria

2017-09-01

The behavior of rare earth elements (REEs) during hot desert weathering of meteorites is investigated. Ordinary chondrites (OCs) from Atacama (Chile) and Lut (Iran) deserts show different variations in REE composition during this process. Inductively coupled plasma-mass spectrometry (ICP-MS) data reveal that hot desert OCs tend to show elevated light REE concentrations, relative to OC falls. Chondrites from Atacama are by far the most enriched in REEs and this enrichment is not necessarily related to their degree of weathering. Positive Ce anomaly of fresh chondrites from Atacama and the successive formation of a negative Ce anomaly with the addition of trivalent REEs are similar to the process reported from Antarctic eucrites. In addition to REEs, Sr and Ba also show different concentrations when comparing OCs from different hot deserts. The stability of Atacama surfaces and the associated old terrestrial ages of meteorites from this region give the samples the necessary time to interact with the terrestrial environment and to be chemically modified. Higher REE contents and LREE-enriched composition are evidence of contamination by terrestrial soil. Despite their low degrees of weathering, special care must be taken into account while working on the REE composition of Atacama meteorites for cosmochemistry applications. In contrast, chondrites from the Lut desert show lower degrees of REE modification, despite significant weathering signed by Sr content. This is explained by the relatively rapid weathering rate of the meteorites occurring in the Lut desert, which hampers the penetration of terrestrial material by forming voluminous Fe oxide/oxyhydroxides shortly after the meteorite fall.

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

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.

The penile cuff test: A clinically useful non-invasive urodynamic investigation to diagnose men with lower urinary tract symptoms

Directory of Open Access Journals (Sweden)

Christopher Harding

2009-01-01

Full Text Available Objectives: To summarize the development of a novel non-invasive test to categorize voiding dysfunction in men complaining of lower urinary tract symptoms (LUTS - the penile cuff test. Methods: The test involves the controlled inflation of a penile cuff during micturition to interrupt voiding and hence estimate isovolumetric bladder pressure (p ves.isv . The validity, reliability, and clinical usefulness of the test were determined in a number of studies in men with LUTS. Results: The penile cuff test can be successfully performed in over 90% of men with LUTS. The reading of cuff pressure at flow interruption (p cuff.int gives a valid and reliable estimate of invasively-measured p ves.isv and when combined with the reading for maximum flow rate obtained during the test (Q max produces an accurate categorization of bladder outlet obstruction (BOO. Use of this categorization prior to treatment allows improved prediction of outcome from prostatectomy. Conclusion: The penile cuff test fulfils the criteria as a useful clinical measurement technique applicable to the diagnosis and treatment planning of men with LUTS.

Guaranteed cost control of polynomial fuzzy systems via a sum of squares approach.

Science.gov (United States)

Tanaka, Kazuo; Ohtake, Hiroshi; Wang, Hua O

2009-04-01

This paper presents the guaranteed cost control of polynomial fuzzy systems via a sum of squares (SOS) approach. First, we present a polynomial fuzzy model and controller that are more general representations of the well-known Takagi-Sugeno (T-S) fuzzy model and controller, respectively. Second, we derive a guaranteed cost control design condition based on polynomial Lyapunov functions. Hence, the design approach discussed in this paper is more general than the existing LMI approaches (to T-S fuzzy control system designs) based on quadratic Lyapunov functions. The design condition realizes a guaranteed cost control by minimizing the upper bound of a given performance function. In addition, the design condition in the proposed approach can be represented in terms of SOS and is numerically (partially symbolically) solved via the recent developed SOSTOOLS. To illustrate the validity of the design approach, two design examples are provided. The first example deals with a complicated nonlinear system. The second example presents micro helicopter control. Both the examples show that our approach provides more extensive design results for the existing LMI approach.

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

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.

Bernoulli numbers and polynomials from a more general point of view

International Nuclear Information System (INIS)

Dattoli, G.; Cesarano, C.; Lorenzutta, S.

2000-01-01

In this work it is applied the method of generating function, to introduce new forms of Bernoulli numbers and polynomials, which are exploited to derive further classes of partial sums involving generalized many index many variable polynomials. Analogous considerations are developed for the Euler numbers and polynomials [it

Generalizations of an integral for Legendre polynomials by Persson and Strang

NARCIS (Netherlands)

Diekema, E.; Koornwinder, T.H.

2012-01-01

Persson and Strang (2003) evaluated the integral over [−1,1] of a squared odd degree Legendre polynomial divided by x2 as being equal to 2. We consider a similar integral for orthogonal polynomials with respect to a general even orthogonality measure, with Gegenbauer and Hermite polynomials as

Eye aberration analysis with Zernike polynomials

Science.gov (United States)

Molebny, Vasyl V.; Chyzh, Igor H.; Sokurenko, Vyacheslav M.; Pallikaris, Ioannis G.; Naoumidis, Leonidas P.

1998-06-01

New horizons for accurate photorefractive sight correction, afforded by novel flying spot technologies, require adequate measurements of photorefractive properties of an eye. Proposed techniques of eye refraction mapping present results of measurements for finite number of points of eye aperture, requiring to approximate these data by 3D surface. A technique of wave front approximation with Zernike polynomials is described, using optimization of the number of polynomial coefficients. Criterion of optimization is the nearest proximity of the resulted continuous surface to the values calculated for given discrete points. Methodology includes statistical evaluation of minimal root mean square deviation (RMSD) of transverse aberrations, in particular, varying consecutively the values of maximal coefficient indices of Zernike polynomials, recalculating the coefficients, and computing the value of RMSD. Optimization is finished at minimal value of RMSD. Formulas are given for computing ametropia, size of the spot of light on retina, caused by spherical aberration, coma, and astigmatism. Results are illustrated by experimental data, that could be of interest for other applications, where detailed evaluation of eye parameters is needed.

Animating Nested Taylor Polynomials to Approximate a Function

Science.gov (United States)

Mazzone, Eric F.; Piper, Bruce R.

2010-01-01

The way that Taylor polynomials approximate functions can be demonstrated by moving the center point while keeping the degree fixed. These animations are particularly nice when the Taylor polynomials do not intersect and form a nested family. We prove a result that shows when this nesting occurs. The animations can be shown in class or…

Learning Read-constant Polynomials of Constant Degree modulo Composites

DEFF Research Database (Denmark)

Chattopadhyay, Arkadev; Gavaldá, Richard; Hansen, Kristoffer Arnsfelt

2011-01-01

Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class \\textACC0ACC0. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class...... is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning Boolean functions represented by polynomials of constant degree over arbitrary finite rings from membership queries, with the additional constraint that each variable...

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.

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

Polynomial constitutive model for shape memory and pseudo elasticity

International Nuclear Information System (INIS)

Savi, M.A.; Kouzak, Z.

1995-01-01

This paper reports an one-dimensional phenomenological constitutive model for shape memory and pseudo elasticity using a polynomial expression for the free energy which is based on the classical Devonshire theory. This study identifies the main characteristics of the classical theory and introduces a simple modification to obtain better results. (author). 9 refs., 6 figs

Tsallis p, q-deformed Touchard polynomials and Stirling numbers

Science.gov (United States)

Herscovici, O.; Mansour, T.

2017-01-01

In this paper, we develop and investigate a new two-parametrized deformation of the Touchard polynomials, based on the definition of the NEXT q-exponential function of Tsallis. We obtain new generalizations of the Stirling numbers of the second kind and of the binomial coefficients and represent two new statistics for the set partitions.

Mapping Landslides in Lunar Impact Craters Using Chebyshev Polynomials and Dem's

Science.gov (United States)

Yordanov, V.; Scaioni, M.; Brunetti, M. T.; Melis, M. T.; Zinzi, A.; Giommi, P.

2016-06-01

Geological slope failure processes have been observed on the Moon surface for decades, nevertheless a detailed and exhaustive lunar landslide inventory has not been produced yet. For a preliminary survey, WAC images and DEM maps from LROC at 100 m/pixels have been exploited in combination with the criteria applied by Brunetti et al. (2015) to detect the landslides. These criteria are based on the visual analysis of optical images to recognize mass wasting features. In the literature, Chebyshev polynomials have been applied to interpolate crater cross-sections in order to obtain a parametric characterization useful for classification into different morphological shapes. Here a new implementation of Chebyshev polynomial approximation is proposed, taking into account some statistical testing of the results obtained during Least-squares estimation. The presence of landslides in lunar craters is then investigated by analyzing the absolute values off odd coefficients of estimated Chebyshev polynomials. A case study on the Cassini A crater has demonstrated the key-points of the proposed methodology and outlined the required future development to carry out.

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

Design of polynomial fuzzy observer-controller for nonlinear systems with state delay: sum of squares approach

Science.gov (United States)

Gassara, H.; El Hajjaji, A.; Chaabane, M.

2017-07-01

This paper investigates the problem of observer-based control for two classes of polynomial fuzzy systems with time-varying delay. The first class concerns a special case where the polynomial matrices do not depend on the estimated state variables. The second one is the general case where the polynomial matrices could depend on unmeasurable system states that will be estimated. For the last case, two design procedures are proposed. The first one gives the polynomial fuzzy controller and observer gains in two steps. In the second procedure, the designed gains are obtained using a single-step approach to overcome the drawback of a two-step procedure. The obtained conditions are presented in terms of sum of squares (SOS) which can be solved via the SOSTOOLS and a semi-definite program solver. Illustrative examples show the validity and applicability of the proposed results.

Complex centers of polynomial differential equations

Directory of Open Access Journals (Sweden)

Mohamad Ali M. Alwash

2007-07-01

Full Text Available We present some results on the existence and nonexistence of centers for polynomial first order ordinary differential equations with complex coefficients. In particular, we show that binomial differential equations without linear terms do not have complex centers. Classes of polynomial differential equations, with more than two terms, are presented that do not have complex centers. We also study the relation between complex centers and the Pugh problem. An algorithm is described to solve the Pugh problem for equations without complex centers. The method of proof involves phase plane analysis of the polar equations and a local study of periodic solutions.

Differential recurrence formulae for orthogonal polynomials

Directory of Open Access Journals (Sweden)

Anton L. W. von Bachhaus

1995-11-01

Full Text Available Part I - By combining a general 2nd-order linear homogeneous ordinary differential equation with the three-term recurrence relation possessed by all orthogonal polynomials, it is shown that sequences of orthogonal polynomials which satisfy a differential equation of the above mentioned type necessarily have a differentiation formula of the type: gn(xY'n(x=fn(xYn(x+Yn-1(x. Part II - A recurrence formula of the form: rn(xY'n(x+sn(xY'n+1(x+tn(xY'n-1(x=0, is derived using the result of Part I.

Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

DEFF Research Database (Denmark)

Hansen, Thomas Dueholm; Miltersen, Peter Bro; Zwick, Uri

2011-01-01

Ye showed recently that the simplex method with Dantzig pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that both algorithms terminate after...... iterations. Second, and more importantly, we show that the same bound applies to the number of iterations performed by the strategy iteration (or strategy improvement) algorithm, a generalization of Howard's policy iteration algorithm used for solving 2-player turn-based stochastic games with discounted zero...

Open Problems Related to the Hurwitz Stability of Polynomials Segments

Directory of Open Access Journals (Sweden)

Baltazar Aguirre-Hernández

2018-01-01

Full Text Available In the framework of robust stability analysis of linear systems, the development of techniques and methods that help to obtain necessary and sufficient conditions to determine stability of convex combinations of polynomials is paramount. In this paper, knowing that Hurwitz polynomials set is not a convex set, a brief overview of some results and open problems concerning the stability of the convex combinations of Hurwitz polynomials is then provided.

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

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization

NARCIS (Netherlands)

de Klerk, Etienne; Laurent, Monique; Sun, Zhao

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre (SIAM J Optim 21(3):864–885, 2011), obtained by searching for an optimal probability density function h on K which is a sum of squares of polynomials, so

Novel quadrilateral elements based on explicit Hermite polynomials for bending of Kirchhoff-Love plates

Science.gov (United States)

Beheshti, Alireza

2018-03-01

The contribution addresses the finite element analysis of bending of plates given the Kirchhoff-Love model. To analyze the static deformation of plates with different loadings and geometries, the principle of virtual work is used to extract the weak form. Following deriving the strain field, stresses and resultants may be obtained. For constructing four-node quadrilateral plate elements, the Hermite polynomials defined with respect to the variables in the parent space are applied explicitly. Based on the approximated field of displacement, the stiffness matrix and the load vector in the finite element method are obtained. To demonstrate the performance of the subparametric 4-node plate elements, some known, classical examples in structural mechanics are solved and there are comparisons with the analytical solutions available in the literature.

A high-order q-difference equation for q-Hahn multiple orthogonal polynomials

DEFF Research Database (Denmark)

Arvesú, J.; Esposito, Chiara

2012-01-01

A high-order linear q-difference equation with polynomial coefficients having q-Hahn multiple orthogonal polynomials as eigenfunctions is given. The order of the equation coincides with the number of orthogonality conditions that these polynomials satisfy. Some limiting situations when are studie....... Indeed, the difference equation for Hahn multiple orthogonal polynomials given in Lee [J. Approx. Theory (2007), ), doi: 10.1016/j.jat.2007.06.002] is obtained as a limiting case....

On the Lorentz degree of a product of polynomials

KAUST Repository

Ait-Haddou, Rachid

2015-01-01

In this note, we negatively answer two questions of T. Erdélyi (1991, 2010) on possible lower bounds on the Lorentz degree of product of two polynomials. We show that the correctness of one question for degree two polynomials is a direct consequence

A Memory-Based Programmable Logic Device Using Look-Up Table Cascade with Synchronous Static Random Access Memories

Science.gov (United States)

Nakamura, Kazuyuki; Sasao, Tsutomu; Matsuura, Munehiro; Tanaka, Katsumasa; Yoshizumi, Kenichi; Nakahara, Hiroki; Iguchi, Yukihiro

2006-04-01

A large-scale memory-technology-based programmable logic device (PLD) using a look-up table (LUT) cascade is developed in the 0.35-μm standard complementary metal oxide semiconductor (CMOS) logic process. Eight 64 K-bit synchronous SRAMs are connected to form an LUT cascade with a few additional circuits. The features of the LUT cascade include: 1) a flexible cascade connection structure, 2) multi phase pseudo asynchronous operations with synchronous static random access memory (SRAM) cores, and 3) LUT-bypass redundancy. This chip operates at 33 MHz in 8-LUT cascades at 122 mW. Benchmark results show that it achieves a comparable performance to field programmable gate array (FPGAs).

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.

Generalized Freud's equation and level densities with polynomial potential

Science.gov (United States)

Boobna, Akshat; Ghosh, Saugata

2013-08-01

We study orthogonal polynomials with weight $\\exp[-NV(x)]$, where $V(x)=\\sum_{k=1}^{d}a_{2k}x^{2k}/2k$ is a polynomial of order 2d. We derive the generalised Freud's equations for $d=3$, 4 and 5 and using this obtain $R_{\\mu}=h_{\\mu}/h_{\\mu -1}$, where $h_{\\mu}$ is the normalization constant for the corresponding orthogonal polynomials. Moments of the density functions, expressed in terms of $R_{\\mu}$, are obtained using Freud's equation and using this, explicit results of level densities as $N\\rightarrow\\infty$ are derived.

Algebraic calculations for spectrum of superintegrable system from exceptional orthogonal polynomials

Science.gov (United States)

Hoque, Md. Fazlul; Marquette, Ian; Post, Sarah; Zhang, Yao-Zhong

2018-04-01

We introduce an extended Kepler-Coulomb quantum model in spherical coordinates. The Schrödinger equation of this Hamiltonian is solved in these coordinates and it is shown that the wave functions of the system can be expressed in terms of Laguerre, Legendre and exceptional Jacobi polynomials (of hypergeometric type). We construct ladder and shift operators based on the corresponding wave functions and obtain their recurrence formulas. These recurrence relations are used to construct higher-order, algebraically independent integrals of motion to prove superintegrability of the Hamiltonian. The integrals form a higher rank polynomial algebra. By constructing the structure functions of the associated deformed oscillator algebras we derive the degeneracy of energy spectrum of the superintegrable system.

Zeros and logarithmic asymptotics of Sobolev orthogonal polynomials for exponential weights

Science.gov (United States)

Díaz Mendoza, C.; Orive, R.; Pijeira Cabrera, H.

2009-12-01

We obtain the (contracted) weak zero asymptotics for orthogonal polynomials with respect to Sobolev inner products with exponential weights in the real semiaxis, of the form , with [gamma]>0, which include as particular cases the counterparts of the so-called Freud (i.e., when [phi] has a polynomial growth at infinity) and Erdös (when [phi] grows faster than any polynomial at infinity) weights. In addition, the boundness of the distance of the zeros of these Sobolev orthogonal polynomials to the convex hull of the support and, as a consequence, a result on logarithmic asymptotics are derived.

Localization of periodic orbits of polynomial vector fields of even degree by linear functions

Energy Technology Data Exchange (ETDEWEB)

Starkov, Konstantin E. [CITEDI-IPN, Av. del Parque 1310, Mesa de Otay, Tijuana, BC (Mexico)] e-mail: konst@citedi.mx

2005-08-01

This paper is concerned with the localization problem of periodic orbits of polynomial vector fields of even degree by using linear functions. Conditions of the localization of all periodic orbits in sets of a simple structure are obtained. Our results are based on the solution of the conditional extremum problem and the application of homogeneous polynomial forms of even degrees. As examples, the Lanford system, the jerky system with one quadratic monomial and a quartically perturbed harmonic oscillator are considered.

Localization of periodic orbits of polynomial vector fields of even degree by linear functions

International Nuclear Information System (INIS)

Starkov, Konstantin E.

2005-01-01

This paper is concerned with the localization problem of periodic orbits of polynomial vector fields of even degree by using linear functions. Conditions of the localization of all periodic orbits in sets of a simple structure are obtained. Our results are based on the solution of the conditional extremum problem and the application of homogeneous polynomial forms of even degrees. As examples, the Lanford system, the jerky system with one quadratic monomial and a quartically perturbed harmonic oscillator are considered

Limit cycles bifurcating from the periodic annulus of cubic homogeneous polynomial centers

Directory of Open Access Journals (Sweden)

Jaume Llibre

2015-10-01

Full Text Available We obtain an explicit polynomial whose simple positive real roots provide the limit cycles which bifurcate from the periodic orbits of any cubic homogeneous polynomial center when it is perturbed inside the class of all polynomial differential systems of degree n.

Polynomial Poisson algebras: Gel'fand-Kirillov problem and Poisson spectra

OpenAIRE

Lecoutre, César

2014-01-01

We study the fields of fractions and the Poisson spectra of polynomial Poisson algebras.\\ud \\ud First we investigate a Poisson birational equivalence problem for polynomial Poisson algebras over a field of arbitrary characteristic. Namely, the quadratic Poisson Gel'fand-Kirillov problem asks whether the field of fractions of a Poisson algebra is isomorphic to the field of fractions of a Poisson affine space, i.e. a polynomial algebra such that the Poisson bracket of two generators is equal to...

Polynomial Phase Estimation Based on Adaptive Short-Time Fourier Transform.

Science.gov (United States)

Jing, Fulong; Zhang, Chunjie; Si, Weijian; Wang, Yu; Jiao, Shuhong

2018-02-13

Polynomial phase signals (PPSs) have numerous applications in many fields including radar, sonar, geophysics, and radio communication systems. Therefore, estimation of PPS coefficients is very important. In this paper, a novel approach for PPS parameters estimation based on adaptive short-time Fourier transform (ASTFT), called the PPS-ASTFT estimator, is proposed. Using the PPS-ASTFT estimator, both one-dimensional and multi-dimensional searches and error propagation problems, which widely exist in PPSs field, are avoided. In the proposed algorithm, the instantaneous frequency (IF) is estimated by S-transform (ST), which can preserve information on signal phase and provide a variable resolution similar to the wavelet transform (WT). The width of the ASTFT analysis window is equal to the local stationary length, which is measured by the instantaneous frequency gradient (IFG). The IFG is calculated by the principal component analysis (PCA), which is robust to the noise. Moreover, to improve estimation accuracy, a refinement strategy is presented to estimate signal parameters. Since the PPS-ASTFT avoids parameter search, the proposed algorithm can be computed in a reasonable amount of time. The estimation performance, computational cost, and implementation of the PPS-ASTFT are also analyzed. The conducted numerical simulations support our theoretical results and demonstrate an excellent statistical performance of the proposed algorithm.

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.

Testing reachability and stabilizability of systems over polynomial rings using Gröbner bases

NARCIS (Netherlands)

Habets, L.C.G.J.M.

1993-01-01

Conditions for the reachability and stabilizability of systems over polynomial rings are well-known in the literature. For a system $ \\Sigma = (A,B)$ they can be expressed as right-invertibility cconditions on the matrix $(zI - A \\mid B)$. Therefore there is quite a strong algebraic relationship

Classification of complex polynomial vector fields in one complex variable

DEFF Research Database (Denmark)

Branner, Bodil; Dias, Kealey

2010-01-01

This paper classifies the global structure of monic and centred one-variable complex polynomial vector fields. The classification is achieved by means of combinatorial and analytic data. More specifically, given a polynomial vector field, we construct a combinatorial invariant, describing...... the topology, and a set of analytic invariants, describing the geometry. Conversely, given admissible combinatorial and analytic data sets, we show using surgery the existence of a unique monic and centred polynomial vector field realizing the given invariants. This is the content of the Structure Theorem......, the main result of the paper. This result is an extension and refinement of Douady et al. (Champs de vecteurs polynomiaux sur C. Unpublished manuscript) classification of the structurally stable polynomial vector fields. We further review some general concepts for completeness and show that vector fields...

Fundamental Frequency Estimation using Polynomial Rooting of a Subspace-Based Method

DEFF Research Database (Denmark)

Jensen, Jesper Rindom; Christensen, Mads Græsbøll; Jensen, Søren Holdt

2010-01-01

improvements compared to HMUSIC. First, by using the proposed method we can obtain an estimate of the fundamental frequency without doing a grid search like in HMUSIC. This is due to that the fundamental frequency is estimated as the argument of the root lying closest to the unit circle. Second, we obtain...... a higher spectral resolution compared to HMUSIC which is a property of polynomial rooting methods. Our simulation results show that the proposed method is applicable to real-life signals, and that we in most cases obtain a higher spectral resolution than HMUSIC....

Random polynomials and expected complexity of bisection methods for real solving

DEFF Research Database (Denmark)

Emiris, Ioannis Z.; Galligo, André; Tsigaridas, Elias

2010-01-01

, and by Edelman and Kostlan in order to estimate the real root separation of degree d polynomials with i.i.d. coefficients that follow two zero-mean normal distributions: for SO(2) polynomials, the i-th coefficient has variance (d/i), whereas for Weyl polynomials its variance is 1/i!. By applying results from....... The second part of the paper shows that the expected number of real roots of a degree d polynomial in the Bernstein basis is √2d ± O(1), when the coefficients are i.i.d. variables with moderate standard deviation. Our paper concludes with experimental results which corroborate our analysis....

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

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

On integral and finite Fourier transforms of continuous q-Hermite polynomials

International Nuclear Information System (INIS)

Atakishiyeva, M. K.; Atakishiyev, N. M.

2009-01-01

We give an overview of the remarkably simple transformation properties of the continuous q-Hermite polynomials H n (x vertical bar q) of Rogers with respect to the classical Fourier integral transform. The behavior of the q-Hermite polynomials under the finite Fourier transform and an explicit form of the q-extended eigenfunctions of the finite Fourier transform, defined in terms of these polynomials, are also discussed.

On polynomial selection for the general number field sieve

Science.gov (United States)

Kleinjung, Thorsten

2006-12-01

The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.

Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy

DEFF Research Database (Denmark)

Frederiksen, Søren Kristoffer Stiil; Miltersen, Peter Bro

2013-01-01

We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state red...... reduction algorithm for Markov chains using arbitrary precision floating point arithmetic and giving a rigorous error analysis of the algorithm.......We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state...

The LUT-Gauge for overcoring rock stress measurements - Technical description and laboratory evaluation

International Nuclear Information System (INIS)

Leijon, B.

1988-03-01

The development of the LUT-Gauge - a triaxial borehole instrument for overcoring rock stress measurements - is reported. The borehole gauge and the associated equipment is described in some detail. The experimental procedures applicable to field measurements with the device are presented. A series of laboratory tests, aimed at investigating the performance of the instrumentation, are reported, This included basic tests of mechanical and electrical reliability, as well as investigations of the thermal sensitivity of the measuring method. These factors are significant with respect to the applicability of the method under field conditions. The results from the laboratory tests showed that instrument performance was in all respects satisfactory. Furthermore, that the effects of temperature changes, expressed as the corresponding measuring error to be expected under typical field conditions, was less than ± 1 MPa. (author)

Automorphisms of Algebras and Bochner's Property for Vector Orthogonal Polynomials

Science.gov (United States)

Horozov, Emil

2016-05-01

We construct new families of vector orthogonal polynomials that have the property to be eigenfunctions of some differential operator. They are extensions of the Hermite and Laguerre polynomial systems. A third family, whose first member has been found by Y. Ben Cheikh and K. Douak is also constructed. The ideas behind our approach lie in the studies of bispectral operators. We exploit automorphisms of associative algebras which transform elementary vector orthogonal polynomial systems which are eigenfunctions of a differential operator into other systems of this type.

[Saw palmetto fruit extract improves LUTS in type ⅢA prostatitis patients].

Science.gov (United States)

Shao, Yun-Peng; Xue, Hao-Liang; Shen, Bai-Xin; Ding, Liu-Cheng; Chen, Zheng-Seng; Wei, Zhong-Qing

2017-05-01

To assess the clinical efficacy of the saw palmetto fruit extract (SPFE) in the treatment of lower urinary tract symptoms (LUTS) in patients with type ⅢA prostatitis. This retrospective study included 54 cases of type ⅢA prostatitis treated in the Outpatient Department of our hospital from January to December 2015. The patients were aged 35.06 ± 5.85 years, with a mean disease course of 3.8 ± 2.1 years, and all received oral medication of SPFE Capsules at the dose of 320 mg qd for 12 weeks. We assessed the therapeutic effects by comparing the NIH-chronic prostatitis symptom indexes (NIH-CPSI), voiding diary, International Prostate Symptom Scores (IPSS), and results of urodynamic examination before and after treatment. Compared with the baseline, both NIH-CPSI and IPSS were significantly decreased after medication (27.61 ± 3.76 vs 18.6 ± 5.34, P <0.01; 20.44 ± 4.51 vs 10.96±4.62, P <0.01), and urodynamic examination and voiding diary showed dramatic post-medication improvement in the average urinary flow rate (［8.05±1.42］ vs ［12.05±2.60］ ml/s, P <0.01 ), maximum urinary flow rate (［14.22±1.74］ vs ［21.32±4.51］ ml/s, P <0.01), residual urine volume (［46.15±16.57］ vs ［14.55±10.21］ ml, P <0.01), maximum urethral closure pressure (［76.52±3.53］ vs ［65.32±4.75］ cm H2O, P <0.01), mean urinary volume (［124.63±40.55］ vs ［285.93±58.68］ ml, P <0.01), urination frequency (16.96±4.17 vs 8.96±2.50, P <0.01), and nocturia frequency (8.94±3.23 vs 3.15±1.90, P <0.01). No apparent adverse reactions were observed in any of the patients. SPFE Capsules can safely and effectively improve LUTS and thus the quality of life of patients with type ⅢA prostatitis.

Families of superintegrable Hamiltonians constructed from exceptional polynomials

International Nuclear Information System (INIS)

Post, Sarah; Tsujimoto, Satoshi; Vinet, Luc

2012-01-01

We introduce a family of exactly-solvable two-dimensional Hamiltonians whose wave functions are given in terms of Laguerre and exceptional Jacobi polynomials. The Hamiltonians contain purely quantum terms which vanish in the classical limit leaving only a previously known family of superintegrable systems. Additional, higher-order integrals of motion are constructed from ladder operators for the considered orthogonal polynomials proving the quantum system to be superintegrable. (paper)

Raising and Lowering Operators for Askey-Wilson Polynomials

Directory of Open Access Journals (Sweden)

Siddhartha Sahi

2007-01-01

Full Text Available In this paper we describe two pairs of raising/lowering operators for Askey-Wilson polynomials, which result from constructions involving very different techniques. The first technique is quite elementary, and depends only on the ''classical'' properties of these polynomials, viz. the q-difference equation and the three term recurrence. The second technique is less elementary, and involves the one-variable version of the double affine Hecke algebra.

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.

Geometric-kinematic characteristics of the main faults in the W-SW of the Lut Block (SE Iran)

Science.gov (United States)

Rashidi Boshrabadi, Ahmad; Khatib, Mohamad Mahdi; Raeesi, Mohamad; Mousavi, Seyed Morteza; Djamour, Yahya

2018-03-01

The area to the W-SW of the Lut Block in Iran has experienced numerous historical and recent destructive earthquakes. We examined a number of faults in this area that have high potential for generating destructive earthquakes. In this study a number of faults are introduced and named for the first time. These new faults are Takdar, Dehno, Suru, Hojat Abad, North Faryab, North Kahnoj, Heydarabad, Khatun Abad and South Faryab. For a group of previously known faults, their mechanism and geological offsets are investigated for the first time. This group of faults include East Nayband, West Nayband, Sardueiyeh, Dalfard, Khordum, South Jabal-e-Barez, and North Jabal-e-Barez. The N-S fault systems of Sabzevaran, Gowk, and Nayband induce slip on the E-W, NE-SW and NW-SE fault systems. The faulting patterns appear to preserve different stages of fault development. We investigated the distribution of active faults and the role that they play in accommodating tectonic strain in the SW-Lut. In the study area, the fault systems with en-echelon arrangement create structures such as restraining and releasing stepover, fault bend and pullapart basin. The main mechanism for fault growth in the region seems to be 'segment linkage of preexisting weaknesses' and also for a limited area through 'process zone'. Estimations are made for the likely magnitudes of separate or combined failure of the fault segments. Such magnitudes are used in hazard analysis of the region.

Asymptotically extremal polynomials with respect to varying weights and application to Sobolev orthogonality

Science.gov (United States)

Díaz Mendoza, C.; Orive, R.; Pijeira Cabrera, H.

2008-10-01

We study the asymptotic behavior of the zeros of a sequence of polynomials whose weighted norms, with respect to a sequence of weight functions, have the same nth root asymptotic behavior as the weighted norms of certain extremal polynomials. This result is applied to obtain the (contracted) weak zero distribution for orthogonal polynomials with respect to a Sobolev inner product with exponential weights of the form e-[phi](x), giving a unified treatment for the so-called Freud (i.e., when [phi] has polynomial growth at infinity) and Erdös (when [phi] grows faster than any polynomial at infinity) cases. In addition, we provide a new proof for the bound of the distance of the zeros to the convex hull of the support for these Sobolev orthogonal polynomials.

Mathematical Use Of Polynomials Of Different End Periods Of ...

African Journals Online (AJOL)

This paper focused on how polynomials of different end period of random numbers can be used in the application of encryption and decryption of a message. Eight steps were used in generating information on how polynomials of different end periods of random numbers in the application of encryption and decryption of a ...

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead. PMID:26426701

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

Polynomial Chaos Expansion Approach to Interest Rate Models

Directory of Open Access Journals (Sweden)

Luca Di Persio