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
A Multilevel Interacting Particle System Method for the estimation of Failure Probabilities
Rubén Aylwin, José Pinto
Enforcing Dirichlet Boundary Conditions in Operator Learning
Andrew M. Stuart, Margaret Trautner
QH-GEM: Quantum-Hydrodynamic Generative Modeling
Harbir Antil, Alex Kaltenbach, Sarswati Shah
Bochner Stability for B-stable DIRK Schemes
Anthony E. Ramirez, Abner J. Salgado
A multi-class kinetic traffic flow model: discrete-velocity formulation and diffusively-corrected macroscopic limits
Carmen Mezquita-Nieto, Paola Goatin, Axel Klar
Primal-dual methods and acceleration for Morozov and equality constrained regularization
Diana-Elena Mirciu, Martin Benning, Elena Resmerita