𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast and accurate algorithm for solving Bernstein–Vandermonde linear systems

✍ Scribed by Ana Marco; José-Javier Martı´nez

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
166 KB
Volume
422
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithms of Björck-Pereyra type f
Fast algorithms of Björck-Pereyra type for solving Cauchy-Vandermonde linear systems
✍ J.J. Martínez; J.M. Peña 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 579 KB

Cauchy-Vandermonde matrices and their relationship with rational interpolation problems are studied. Fast algorithms for solving the corresponding linear systems are presented. They are explicit algorithms that generalize in a natural way BjOrck-Pereyra algorithms for solving Vandermonde linear syst

A systolic algorithm for solving dense l
A systolic algorithm for solving dense linear systems
✍ Chau-Jy Lin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 799 KB

For an arbitrary n x n matrix A and an n × 1 column vector b, we present a systolic algorithm to solve the dense linear equations Ax = b. An important consideration is that the pivot row can be changed during the execution of our systolic algorithm. The computational model consists of n linear systo

Fast Parallel Algorithms for Solving Tri
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube
✍ O.H. Ibarra; M.H. Kim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 864 KB

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec