A new algorithm for special Vandermonde systems
From MaRDI portal
Special linear algebraic systems with Vandermonde coefficient matrices are solved by a new algorithm which is based on inverting the corresponding matrix. The matrix inversion is computed by Kronecker products. The approach suits well not only for sequential but also for parallel implementations. Both versions are analyzed from the point of view of arithmetic computational complexity.
Recommendations
Cites work
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- Matrix Differential Equations and Kronecker Products
- Norms of analytic interpolation projections on general domains
- On the overconvergence of complex interpolating polynomials
- Solution of Vandermonde systems of equations
- The block decomposition of a Vandermonde matrix and its applications
Cited in
(7)- On the arithmetic operational complexity for solving Vandermonde linear equations
- Virtual Poincaré polynomial of the space of stable pairs supported on quintic curves
- Moduli spaces of \(\alpha\)-stable pairs and wall-crossing on \(\mathbb{P}^2\)
- About the generation of parallel block predictor-corrector algorithms for ode's
- scientific article; zbMATH DE number 870899 (Why is no real title available?)
- Complexity reduction of least squares problems involving special Vandermonde matrices
- A new study on some Vandermonde matrices and systems
This page was built for publication: A new algorithm for special Vandermonde systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200537)