---
title: "Computing Machine for the Solution of Large Systems of Linear Algebraic Equations"
authors:
  - "John V. Atanasoff"
year: 1940
venue: "Iowa State College manuscript"
arxiv: null
doi: null
source: "https://digitalcollections.lib.iastate.edu/atanasoff/items/atanasoff143.html"
topics:
  - abc
  - atanasoff
  - electronic-computing
  - history
seed_rank: 574
seed_batch: "foundations-greats-2026-08-13"
reviewed: "2026-08-13"
pool: "systems"
relevance_score: 8
lineage: foundations-of-computing
cites:
  - title: "A Symbolic Analysis of Relay and Switching Circuits"
    url: "https://doi.org/10.1109/T-AIEE.1938.5057767"
    year: 1938
    arxiv: null
    doi: "10.1109/T-AIEE.1938.5057767"
see:
  - "552-a-symbolic-analysis-of-relay-and-switching-circuits"
---

# Computing Machine for the Solution of Large Systems of Linear Algebraic Equations

## One-sentence takeaway

Atanasoff's August 1940 manuscript specifies an electronic binary machine that solves large linear systems by mechanized elimination — the ABC design.

## Why it matters here

Electronic digital arithmetic for linear algebra predates the EDVAC draft. Engine numerics sit on that hardware idea, whatever later courtroom priority fights said.

## Key ideas

- Target problems: least squares, multiple correlation, circuit analysis, elasticity, quantum mechanics — all large \(Ax=b\).
- Arithmetic is binary; logic is electronic; coefficients live on a rotating drum / capacitor memory.
- Gaussian elimination is the algorithm, carried out by a special-purpose digital data path rather than a stored-program general computer.
- Iowa State catalog item atanasoff143 (31 pages, RS 13/20/51) is the archival source.
- Honeywell v. Sperry Rand later treated this manuscript as evidence of prior electronic digital technique.

## Caveats

## Links

- URL: https://digitalcollections.lib.iastate.edu/atanasoff/items/atanasoff143.html