An efficient and fast algorithm for solving generalized Vandermonde systems
From MaRDI portal
Recommendations
- A fast Björck-Pereyra-type algorithm for solving Hessenberg-quasiseparable-Vandermonde systems
- On the arithmetic operational complexity for solving Vandermonde linear equations
- An efficient and fast algorithm for the inverse of the generalized Vandermonde matrix
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
- scientific article; zbMATH DE number 870899
Cited in
(13)- A new study on some Vandermonde matrices and systems
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Solving some generalized Vandermonde systems and inverse of their associate matrices via new approaches for the Binet formula
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- An iterative error-free algorithm to solve Vandermonde systems
- scientific article; zbMATH DE number 4129873 (Why is no real title available?)
- On the arithmetic operational complexity for solving Vandermonde linear equations
- A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices
- A fast Björck-Pereyra-type algorithm for solving Hessenberg-quasiseparable-Vandermonde systems
- A new algorithm for special Vandermonde systems
- An efficient and fast algorithm for the inverse of the generalized Vandermonde matrix
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
- scientific article; zbMATH DE number 5670956 (Why is no real title available?)
This page was built for publication: An efficient and fast algorithm for solving generalized Vandermonde systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072326)