A Fast Björck–Pereyra-Type Algorithm for Solving Hessenberg-Quasiseparable-Vandermonde Systems

DOI10.1137/060676635zbMath1197.65031OpenAlexW2068374637MaRDI QIDQ3561184

Israel Gohberg, Yu.S.Eidel'man, Vadim Olshevsky, Tom Bella, Israel Koltracht

Publication date: 25 May 2010

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060676635

zbMATH Keywords

numerical examplespolynomial systempolynomial Vandermonde matricesHessenberg matrixquasiseparable matricesBjörck-Pereyra algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Direct numerical methods for linear systems and matrix inversion (65F05) Matrices over function rings in one or more variables (15A54)

Related Items (2)

Computations with quasiseparable polynomials and matrices ⋮ On the closed representation for the inverses of Hessenberg matrices

Uses Software

• mctoolbox

This page was built for publication: A Fast Björck–Pereyra-Type Algorithm for Solving Hessenberg-Quasiseparable-Vandermonde Systems