Error-free algorithms to solve special and general discrete systems of linear equations
From MaRDI portal
Publication:941471
DOI10.1016/j.amc.2007.10.010zbMath1147.65028OpenAlexW2074154805MaRDI QIDQ941471
Publication date: 1 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.10.010
Hilbert systemparallel computationiterative methodVandermonde systempolynomial algebraToeplitz systemVolterra systemerror-free deconvolutionFermat transformround off errors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast error-free algorithm for the determination of kernels of the periodic Volterra representation
- An error-free Levison algorithm to solve integer Toeplitz system
- An error-free algorithm to solve a linear system of polynomial equations
- One-modulus residue arithmetic algorithm to solve linear equations exactly
- Exact algorithm of multidimensional circulant deconvolution
- k-dimensional error-free deconvolution using the Fermat number transform
- An algorithm to solve Hilbert systems of linear equations precisely
- Determination of inverse volterra kernels in nonlinear discrete systems
- Precise deconvolution using the Fermat number transform
- A fast algorithm of nonlinear Volterra filtering
- Precise multidimensional deconvolution using the polynomial algebra concept
- Error-free deconvolution based on cyclic determinant calculation approach
- Solving equations exactly
- An iterative error-free algorithm to solve Vandermonde systems
This page was built for publication: Error-free algorithms to solve special and general discrete systems of linear equations