A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems (Q875013): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
Revision as of 16:26, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
