A general condition number for polynomials (Q2840398)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6189190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general condition number for polynomials |
scientific article; zbMATH DE number 6189190 |
Statements
18 July 2013
0 references
polynomial condition number
0 references
polynomial basis
0 references
orthogonal polynomial
0 references
Clenshaw algorithm
0 references
floating-point arithmetic
0 references
running-error bound
0 references
Bernstein polynomials
0 references
A general condition number for polynomials (English)
0 references
The condition number of a polynomial with respect to a certain basis is an important quantity when it comes to the actual evaluation of this polynomial in finite precision arithmetic. The paper is devoted to the development of a general concept for such condition numbers that includes the well-known special cases where the basis consists of monomials or Bernstein polynomials and, in particular, allows to treat bases consisting of orthogonal polynomials. The properties of this condition number are studied in detail, and applications to some important special cases are discussed.
0 references
0.8079422116279602
0 references
0.7892829775810242
0 references
0.7785854935646057
0 references
0.7785854935646057
0 references
