Inverting a Vandermonde matrix in minimum parallel time

DOI10.1016/0020-0190(91)90084-UMaRDI QIDQ1178241zbMATH OpenFDO

Authors F. P. Preparata

Publication date 26 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90084-U

zbMATH Keywords

parallel computationVandermonde matrixmatrix inversion

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Recommendations

• On the inversion of the Vandermonde matrix
• scientific article; zbMATH DE number 4135300
• Fast parallel algorithms for vandermonde determinants
• An inversion formula and fast algorithms for Cauchy-Vandermonde matrices

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Computational Complexity of Fourier Transforms Over Finite Fields
• Exponential error bounds for discrete memoryless channels with sequential decision feedback
• Fast multiplication of large numbers
• Parallel Prefix Computation
• Size-time complexity of Boolean networks for prefix computations

Cited in

(4)

• The enumerability of P collapses P to NC
• A note on Bernstein-Vandermonde matrices
• scientific article; zbMATH DE number 4135300 (Why is no real title available?)
• Resolution of Hartmanis' conjecture for NL-hard sparse sets

This page was built for publication: Inverting a Vandermonde matrix in minimum parallel time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178241)