A binary algorithm for solving n by n systems of integer equations (Q2266352)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3892470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A binary algorithm for solving n by n systems of integer equations |
scientific article; zbMATH DE number 3892470 |
Statements
A binary algorithm for solving n by n systems of integer equations (English)
0 references
1983
0 references
We discuss a ''binary'' algorithm for solving systems of linear equations with integer coefficients. So-called ''binary'' algorithms differ from ordinary ones in that there is no roundoff error, but only overflow, and the underlying analysis is p-adic analysis rather than conventional real analysis. The advantages of this algorithm are especially apparent when extremely large numbers are involved and roundoff error can be tolerated. VLSI implementation of this and other ''binary'' algorithms is very appealing because of the extreme regularity of the circuits involved.
0 references
binary algorithm
0 references
integer coefficients
0 references
roundoff error
0 references
p-adic analysis
0 references
0.7532564997673035
0 references
0.7374595999717712
0 references
0.727554440498352
0 references
