#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2011

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Matthias Humet, Marc Van Barel
- Numerical Algorithms
- 2011

Let $\cal{L}$ be a positive definite bilinear functional, then the Uvarov transformation of $\cal{L}$ is given by $\,\mathcal{U}(p,q) = \mathcal{L}(p,q) + m\,p(\alpha)\overline{q}(\alpha^{-1}) + \overline{m}\,p(\overline{\alpha}^{-1})$ $\overline{q}(\overline{\alpha})$ where $|\alpha| > 1, m \in \mathbb{C}$ . In this paper we analyze conditions on m for… (More)

- Matthias Humet, Marc Van Barel
- J. Computational Applied Mathematics
- 2014

LetˆL be a positive definite bilinear functional on the unit circle defined on P n , the space of polynomials of degree at most n. Then its Geronimus transformation L is defined byˆL(p, q) = L (z − α)p(z), (z − α)q(z) for all p, q ∈ P n , α ∈ C. GivenˆL, there are infinitely many such L which can be described by a complex free parameter. The Hessenberg… (More)

Efficient and effective algorithms are designed to compute the coordinates of nearly optimal points for multivariate polynomial interpolation on a general geometry. " Nearly optimal " refers to the property that the set of points has a Lebesgue constant near to the minimal Lebesgue constant with respect to multivariate polynomial interpolation on a finite… (More)

An algorithm is presented to compute good point sets and weights for discrete least squares polynomial approximation on a geometry Ω ⊂ R2. The criterion that is used is the minimisation of the Lebesgue constant of the corresponding least squares operator. In order to approximate the Lebesgue constant, we evaluate the Lebesgue function in a point set… (More)

- ‹
- 1
- ›