On the arithmetic operational complexity for solving Vandermonde linear equations

DOI10.1007/BF03167332zbMath1306.65183MaRDI QIDQ2258368

Lei Li

Publication date: 3 March 2015

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexitylinear systemsVandermonde

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Semialgebraic sets and real binary forms decompositions

Cites Work

• Unnamed Item
• A new upper bound on the complexity of derivative evaluation
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Fast Parallel Matrix Inversion Algorithms
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

This page was built for publication: On the arithmetic operational complexity for solving Vandermonde linear equations