In his book,[1] Svoboda describes some computing linkages with their error graphs. However, these graphs are made by rather coarse sampling.
Below you find error graphs made with a higher sampling.
Three-bar linkage: X2 ≈ log(X1) for 1 ≤ X1 ≤ 10
Three-bar linkage with eccentric: X2 ≈ log(X1) for 1 ≤ X1 ≤ 10 (solid line: with eccentric; dotted line: without eccentric)
Double three-bar linkage: X2 ≈ log(X1) for 1 ≤ X1 ≤ 50
Multiplier: Xi ≈ Xj ×Xj
Double harmonic transformer: Xk ≈ tan(Xi) for 0° ≤ Xi ≤ 70°