Sciweavers

23 search results - page 2 / 5
» Multicomplexes and polynomials with real zeros
Sort
View
JAT
2010
82views more  JAT 2010»
13 years 3 months ago
The Laguerre-Sobolev-type orthogonal polynomials
In this paper we find the second order linear differential equation satisfied by orthogonal polynomials with respect to the inner product p, q = ∞ 0 p(x)q(x)xα e−x dx + Mp...
Herbert Dueñas, Francisco Marcellán
MICS
2007
57views more  MICS 2007»
13 years 4 months ago
Pseudozero Set of Real Multivariate Polynomials
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...
Stef Graillat
CPC
2004
66views more  CPC 2004»
13 years 5 months ago
Two Results on Real Zeros of Chromatic Polynomials
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
Feng Ming Dong, Khee Meng Koh
JCAM
2010
82views more  JCAM 2010»
13 years 2 days ago
Menke points on the real line and their connection to classical orthogonal polynomials
Abstract. We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show th...
P. Mathur, J. S. Brauchart, Edward B. Saff
JC
2008
77views more  JC 2008»
13 years 5 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...