An iterative error-free algorithm to solve Vandermonde systems
From MaRDI portal
Publication:5931675
DOI10.1016/S0096-3003(99)00154-XzbMath1023.65020MaRDI QIDQ5931675
Publication date: 25 April 2001
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
comparison of methodsnumerical examplescost analysiserror-free algorithmlinear equationsrounding-off errorsVandermonde system
Related Items (4)
On the relationship between the discrete and continuous bounding moment problems and their numerical solutions ⋮ Error-free algorithms to solve special and general discrete systems of linear equations ⋮ New efficient and practical verifiable multi-secret sharing schemes ⋮ Exact algorithm of multidimensional circulant deconvolution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An error-free Levison algorithm to solve integer Toeplitz system
- k-dimensional error-free deconvolution using the Fermat number transform
- An algorithm to solve Hilbert systems of linear equations precisely
- Precise deconvolution using the Fermat number transform
- Precise multidimensional deconvolution using the polynomial algebra concept
- Digital filtering using pseudo fermat number transforms
- Error-free deconvolution based on cyclic determinant calculation approach
- Solving equations exactly
- Discrete Convolutions via Mersenne Transforms
This page was built for publication: An iterative error-free algorithm to solve Vandermonde systems