Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Calculations of the roots of classical orthogonal polynomials: an application to gaussian quadrature
Download
index.pdf
Date
2019
Author
Shaidolda, Gulnaz
Metadata
Show full item record
Item Usage Stats
291
views
69
downloads
Cite This
This thesis focuses on classical orthogonal polynomials namely Jacobi, Laguerre and Hermite polynomials and a method to calculate the roots of these polynomials is constructed. The roots are expressed as the eigenvalues of a tridiagonal matrix whose coefficients depend on the recurrence formula for the classical orthogonal polynomials. These approximations of roots are used as method of computation of Gaussian quadratures. Then the discussion of the numerical results are then introduced to deduce the efficiency of the method.
Subject Keywords
Gaussian quadrature formulas.
,
Functions, Orthogonal.
,
Legendre's polynomials.
,
Laguerre polynomials.
URI
http://etd.lib.metu.edu.tr/upload/12622945/index.pdf
https://hdl.handle.net/11511/27991
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Randomness properties of some vector sequences generated by multivariate polynomial iterations
Gürkan Balıkçıoğlu, Pınar; Diker Yücel, Melek; Department of Cryptography (2016)
We examine the randomness properties of the sequences generated by the multivariate polynomial iterations method proposed by Ostafe and Shparlinski, by using the six different choices of polynomials given by the same authors. Our analysis is based on two approaches: distributions of the periods and linear complexities of the produced vector sequences. We deﬁne the efﬁciency parameters, PE for “period efﬁciency” and LCE for “linear complexity efﬁciency”, so that the actual values of the period and linear com...
A New Combinatorial Identity for Catalan Numbers
Aker, Kursat; Gursoy, Aysin Erkan (2017-10-01)
In this article, we prove a conjecture about the equality of two generating functions described in "From Parking Functions to Gelfand Pairs (Aker, Can 2012)" attached to two sets whose cardinalities are given by Catalan numbers: We establish a combinatorial bijection between the two sets on which the two generating functions were based on.
Classification of skew-symmetric forms corresponding to cluster algebras with principal coefficients
Mazı, Sedanur; Seven, Ahmet İrfan; Department of Mathematics (2016)
In this thesis, we study algebraic and combinatorial properties of the skew-symmetric forms that correspond to cluster algebras with principal coefficients. We obtain a classification of these forms under congruence and compute the Arf invariants for finite types.
HFE based multi-variate quadratic cryptosystems and Dembowski Ostrom polynomials
Alam, Bilal; Akyıldız, Ersan; Kırlar, Barış Bülent; Department of Cryptography (2013)
Harayama and Friesen proposed linearised binomial attack for multivariate quadratic cryptosystems and introduced weak Dembowski Ostrom(DO) polynomials in this framework over the finite fi eld F2. They conjecture about the existence of infi nite class of weak DO polynomials and presented the open problem of enumerating their classes. We extend linearised binomial attack to multivariate quadratic cryptosystems over Fp for any prime p and redefi ne the weak DO polynomials for general case. We identify an in fi...
Characterisation and enumeration of a class of semi bent quadratic Boolean functions
KOÇAK, Neşe; Koçak, Onur Ozan; Özbudak, Ferruh; SAYGI, ZÜLFÜKAR (2015-01-01)
In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. Shaidolda, “Calculations of the roots of classical orthogonal polynomials: an application to gaussian quadrature,” M.S. - Master of Science, Middle East Technical University, 2019.