On the arithmetic operational complexity for solving Vandermonde linear equations

DOI10.1007/BF03167332MaRDI QIDQ2258368zbMATH OpenFDO

Authors Lei Li

Publication date 3 March 2015

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

Full work available at URL https://doi.org/10.1007/BF03167332

zbMATH Keywords

complexitylinear systemsVandermonde

Mathematics Subject Classification ID

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

Recommendations

• An efficient and fast algorithm for solving generalized Vandermonde systems
• Fast Solution of Confluent Vandermonde Linear Systems
• A fast Björck-Pereyra-type algorithm for solving Hessenberg-quasiseparable-Vandermonde systems
• scientific article; zbMATH DE number 5670956
• A new algorithm for special Vandermonde systems

Cites work

• A new upper bound on the complexity of derivative evaluation
• Fast Parallel Matrix Inversion Algorithms
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• scientific article; zbMATH DE number 4039116 (Why is no real title available?)
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

Cited in

(6)

• Semialgebraic sets and real binary forms decompositions
• An efficient and fast algorithm for solving generalized Vandermonde systems
• Fast Solution of Confluent Vandermonde Linear Systems
• Arithmetic Complexity Of Direct Solvers For Banded Systems
• A solution to certain polynomial equations with applications to nonlinear fitting
• Complexity reduction of least squares problems involving special Vandermonde matrices

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

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