Project 2: The Birkhoff interpolation problem (Q4238969)
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 1276824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Project 2: The Birkhoff interpolation problem |
scientific article; zbMATH DE number 1276824 |
Statements
20 April 1999
0 references
Birkhoff interpolation
0 references
algorithms
0 references
incidence matrices
0 references
0.8836086392402649
0 references
0.8051055669784546
0 references
0.7897664904594421
0 references
0.7876688241958618
0 references
Project 2: The Birkhoff interpolation problem (English)
0 references
Given a set of real numbers \(x_1<x_2<\cdots <x_n\) and a non-negative integer \(r\). It is well known that there is an incidence matrix with \(n\) rows and \(r+1\) columns, which is associated with the Birkhoff interpoation at the given points, of derivatives not exceeding \(r\)th order. The authors present a mixture of some basic algorithms used to deal with quantifier elimination problems to all the normal incidence matrices which are poised for some special choices of \(n\leq 4\) and \(r=3,4\) or 5 [cf. \textit{L. Gonzalez Vega}, J. Symb, Comput. 22, No. 1, 83-103 (1996; Zbl 0870.65007)]. For the entire collection see [Zbl 0924.13021].
0 references