Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A binary algorithm for solving n by n systems of integer equations

From MaRDI portal
Publication:2266352
Jump to:navigation, search

DOI10.1016/0898-1221(83)90136-0zbMath0559.65024OpenAlexW1972413857WikidataQ126789645 ScholiaQ126789645MaRDI QIDQ2266352

George B. Purdy

Publication date: 1983

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(83)90136-0


zbMATH Keywords

roundoff errorbinary algorithmp-adic analysisinteger coefficients


Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • A carry-free algorithm for finding the greatest common divisor of two integers
  • Computational problems associated with Racah algebra
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2266352&oldid=14826605"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 10:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki