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

matrix inversionparallel computationVandermonde matrix

Mathematics Subject Classification ID

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

Review text

In this note, we address the problem of computing \(V^{-1}\), where \(V=(\lambda_ j^{i-1})_{ij}\) is a Vandermonde matrix and where the entries of \(V\) are elements of a field \(\mathcal F\). The computation model adopted is the arithmetic network, which is a synchronized interconnection of arithmetic modules, each capable of performing an arithmetic operation over the chosen field in constant time.

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

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

Cited in

(4)

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

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)