0
votes
1answer
23 views

Comparing the order of convergence $\mathcal{O}( h^2 |\log(h)|)$

I don't have any intuition in judging how fast a term of the order $\mathcal{O}( h^2 |\log(h)|)$ is decreasing as $h \to 0$, so i tried comparing it with terms of the form $\mathcal{O}( h^\alpha )$ ...
1
vote
0answers
58 views

Solving ${c_1}^x+\sqrt{\frac{\log(x)x}{2}}+3\log(x)x \le c_2$

Is there any way to solve $${c_1}^x+\sqrt{\frac{\log(x)x}{2}}+3\log(x)x\le c_2,$$ for $x>1$, $0<c_1<1$, and $0<c_2<<1$? Thanks
0
votes
0answers
32 views

Calculating log and trigonometric functions using only +,-,/,*

How to calculate logarithm and trigonometric functions (sin, cos etc.) on base n with using +,-,/,* ? Is there any way to do it?
0
votes
2answers
43 views

Avoiding substraction for finite difference with log and exp

I want to approximate the derivative of f(x) Finite difference $f'(x) \approx \frac{f(x+h)-f(x)}{h}$ I was taught that the error from the substraction is blown up for small h. This I can verify ...
4
votes
5answers
125 views

Calculate ln(x) using 8-digit calculator

I have a bit of a unique problem. Well, maybe not a problem because I'm really just curious about it, but... I have a simple 8 digit calculator. It has +, -, x, /, and a constant operation function. ...
0
votes
1answer
39 views

Numerical Analysis - show something about the rate of convergence

We are given an iterative method for finding roots, $x_{n+1}=g(x_n)$, we are given the rate of convergence of this method is $p$, and also that: $$\lim _{n \to \infty} \frac{|e_{n+1}|}{|e_{n}|^p} = ...
1
vote
1answer
119 views

I wonder whether the system of equations and inequations below have a solution.

I wonder whether the system of equations and inequations below have a solution. If there are solutions, what are they? A numerical solution is also desired. $$\begin{cases} ...
0
votes
2answers
58 views

logarithm and exponent computation performance

Using glibc on a x86 processor, which takes more CPU time? $a\ log\ b$ or $b^a$? For which values of $a$ is one faster than the other? Optional: Does the base used matter? See also: What algorithm ...
2
votes
2answers
75 views

Scale-invariance of Simpson's rule approximations to log

If I was trapped on a desert island and needed to compute $\log(2)$, the natural logaritm of $2$, one thing I could do is use the equality $$\log(2) = \int_1^2 \frac{1}{x} \ dx$$ and approximate the ...
1
vote
1answer
88 views

How to numerically integrate expression using its log transform

I am trying to use numerical integration to compute the integral $\int_0^1 f(\rho) d\rho$ where $f(\rho)$ is calculated as $\ln f(\rho)$ for improved numerical precision and stability. At the moment ...
3
votes
1answer
223 views

Understanding accuracy of Newton's Method

In a numerical analysis book I'm reading it says that using the Newton error formula we can find an expression for the number of correct digits in an approximation using Newton's Method. Here's the ...
0
votes
1answer
76 views

Approximating a simple sum

Can somone help me find an assymptotic formula for n, for fixed x , for this sum , perhaps an inequality would be even better, or some bound on the error. $$\sum_{k=1}^n \frac{1}{\log(kx)}$$ I need ...
5
votes
1answer
260 views

Explain this code to compute $\log(1+x)$

It's well known that you need to take care when writing a function to compute $\log(1+x)$ when $x$ is small. Because of floating point roundoff, $1+x$ may have less precision than $x$, which can ...
6
votes
6answers
1k views

An alternative way to calculate $\log(x)$

How can I replace the $\log(x)$ function by simple math operators like $+,-,\div$, and $\times$? I am writing a computer code and I must use $\log(x)$ in it. However, the technology I am using does ...
5
votes
1answer
1k views

How does Knuth's algorithm for calculating logarithm work?

I had a look at Knuth's The Art of Computer Programming, book 1. In chapter 1, section 1.2.2, exercise 25, he presents the following algorithm for calculating logarithm: given $x\in[1,2)$, do the ...
13
votes
5answers
5k views

Calculate logarithms by hand

I'm thinking of making a table of logarithms ranging from 100-999 with 5 significant digits. By pen and paper that is. I'm doing this old school. What first came to mind was to use $\log(ab) = ...
25
votes
3answers
7k views

What algorithm is used by computers to calculate logarithms?

I would like to know how are logarithms calculated by computers. The GNU C library, for example, uses a call to the fyl2x() assembler instruction, which means that ...
9
votes
1answer
406 views

Is there a binary spigot algorithm for log(23) or log(89)?

The Bailey-Borwein-Plouffe formula yields a binary spigot algorithm for π, and related formulas give the bits of log(2) and those of the logarithms of some other integers. I got stuck (over a year ...