Sciweavers

124 search results - page 8 / 25
» Calculating cyclotomic polynomials
Sort
View
JAT
2010
70views more  JAT 2010»
13 years 6 months ago
Density of eigenvalues and its perturbation invariance in unitary ensembles of random matrices
We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomi...
Dang-Zheng Liu, Zheng-Dong Wang, Kui-Hua Yan
CSC
2006
13 years 9 months ago
Computational Algorithm for Higher Order Legendre Polynomial and Gaussian Quadrature Method
: - There are many numerical methods adopted to solve mathematical problems. Early researchers focused on the methods to reduce computational costs. In recent years, reduction in c...
Asif Mughal, Xiu Ye, Kamran Iqbal
ADCM
2008
187views more  ADCM 2008»
13 years 7 months ago
Approximation on the sphere using radial basis functions plus polynomials
In this paper we analyse a hybrid approximation of functions on the sphere S2 R3 by radial basis functions combined with polynomials, with the radial basis functions assumed to be...
Ian H. Sloan, Alvise Sommariva
MICS
2007
88views more  MICS 2007»
13 years 7 months ago
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...
Philip Feinsilver, René Schott
CASES
2004
ACM
14 years 1 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...