A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems (Q875013)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems |
scientific article |
Statements
A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems (English)
0 references
10 April 2007
0 references
The main scope of the paper is to develop a first and accurate algorithm for solving a linear system whose coefficient matrix is a generalized Vandermonde matrix for the Bernstein polynomials basis functions (B-V matrix). The algorithm is based on the bidiagonal factorization of the inverse of the B-V matrix.
0 references
Bernstein basis
0 references
Interpolation
0 references
Vandermonde matrix
0 references
Bidiagonal decomposition
0 references
Total positivity
0 references
High relative accuracy
0 references
algorithm
0 references
bidiagonal factorization
0 references
0 references
0.9271052
0 references
0.91716594
0 references
0.9023969
0 references
0.89729774
0 references
0.8960674
0 references
0.8947675
0 references
0.88742733
0 references
0 references
