A fast and accurate algorithm for solving Bernstein-Vandermonde linear sytem
A. Marco, J. J. Martinez
Abstract
A fast and accurate algorithm for solving a Bernstein-Vandermonde linear system is presented. The algorithm is derived by using results related to the bidiagonal decomposition of the inverse of a totally positive matrix by means of Neville elimination. The use of explicit expressions for the determinants involved in the process serves to make the algorithm both fast and accurate.
Create a lesson
Related papers
Fast and Stable Arbitrary Precision Approximate Matrix Multiplication
Ioana Dumitriu, Olga Holtz, Abraham Hsu et al.
Analysis of an inexact Schwarz domain decomposition method in 3D
Nibedita Ghosh
Energy conserving compatible space--time FEM for deterministic and stochastic rotating shallow water
Maneesh Kumar Singh, Colin J. Cotter
Preconditioning proximal Galerkin: mesh and degree robust solvers for variational inequalities
Ioannis P. A. Papadopoulos, Pablo D. Brubeck
On a maximum principle in discretization with spherical harmonics
Arnold Reusken
Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems
Christina Brandt, Patrick Horn