$x_{n+1}=x_n+2 x_n (A-x_n^2)/(3 x_n^2+A)$ for $x_1>0<A,$ converges to $\sqrt A$ faster than $y_{n+1}=y_n+(A-y_n^2)/2 y_n.$
$\pi$ is close to $355/113=3+16/113=3+1/(7+1/16)=3.14159292.... $
$e^2$ is about $2.72^2=2.7^2+2(2.7)(0.02)=0.2^2=7.29+0.108+.0004....$. Use basic algebra to break a product into parts, using the Distributive law.
For $\log x,$ if have a good approximation for $\log y$ with $y/x$ close to $1$, then $\log x=\log y+\log (1+(x-y)/y)=\log y +(z-z^2/2+z^3/3-...)$ where $z=(x-y)/y.$
A quick method of approximate long division: Example:$ X=1/2.7376:$ $$X=0.3/0.82128.$$ Add $6\times 0.1$ to LHS and $6\times 2.7376$ to RHS ,giving $$X=0.36/0.985536.$$ Add $ 5\times 0.01$ to LHS and $5\times 0.026378$ to RHS giving $$X=0.366/0.999194.$$ The next step will show that $X$ is quite close to $0.3663$. The idea is to add (or subtract)a multiple of some LHS already obtained, to the LHS,and add (or subtract) the corresponding multiple to the RHS, getting the RHS closer to $1$.
An analogous method works for some approximate multiplication. e.g $$e^2=(2.71828...)^2=(0.90609...)(8.15484)=(1.00677 [approx])(7.34645...)$$ (For the next step multiply $7.34645$ by $(1-1/150)$ to get a good approximation to $e^2$).
Look at The Trachtenburg (Trachtenberg?) Speed System of Basic Mathematics. There was a Q similar to yours and several people recommended this book, and the OP was very impressed with it.I have it myself.