One-modulus residue arithmetic algorithm to solve linear equations exactly
From MaRDI portal
The paper presents an error-free algorithm to solve linear equations using the residue arithmetic. Simultaneously with solving the system of linear equations, the exact value of the determinant of the system matrix is calculated. The algorithm avoids roundoff errors and therefore ensures the correctness of the solution. It is suitable for implementation on computers with vector processing facility.
Recommendations
Cites work
- scientific article; zbMATH DE number 3874496 (Why is no real title available?)
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 64181 (Why is no real title available?)
- scientific article; zbMATH DE number 70114 (Why is no real title available?)
- k-dimensional error-free deconvolution using the Fermat number transform
- Precise deconvolution using the Fermat number transform
- Solving equations exactly
Cited in
(6)- Error-free computation of a reflexive generalized inverse
- Error-free computer solution of certain system of linear equations
- Exact algorithm of multidimensional circulant deconvolution
- scientific article; zbMATH DE number 70114 (Why is no real title available?)
- An interval algorithm for solving systems of linear equations to prespecified accuracy
- Error-free algorithms to solve special and general discrete systems of linear equations
This page was built for publication: One-modulus residue arithmetic algorithm to solve linear equations exactly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334720)