Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options answers only not deleted user 6553
1 vote

Determine machine epsilon

a) Correct! b) This seems to be correct, but I have to say, this representation for exponents is very strange. A four digit exponent plus a sign bit lets you represent an exponent between $-1111_2$ t …
Pseudonym's user avatar
  • 23.8k
1 vote

Theoretical precision needed to get $n$-bits of the evaluation of some sum

I may be misunderstanding the question, but I don't think we have enough information to tell. Consider, for example: $$A = \left\{ \frac{1}{4}, \frac{1}{2}, \frac{3}{4} \right\}$$ and: $$P(x) = \l …
Pseudonym's user avatar
  • 23.8k
4 votes
Accepted

How to represent zero as floating point number?

Note: In the interest of making this somewhat self-contained, I am using terminology from the most recent versions of the IEEE-754 standard. Prior to 2008, "subnormal numbers" were called "denormal nu …
Pseudonym's user avatar
  • 23.8k
19 votes

Is 2**x faster to compute than exp(x)?

Since this is CS and not Stackoverflow, I'm going to assume that you're asking a question about numeric analysis, and (to keep things simple) IEEE-754 floating point in particular. In that case, the a …
Pseudonym's user avatar
  • 23.8k
4 votes
Accepted

How can I compute logarithm when comparison is undecidable?

Even though absolute comparisons may not converge, you should be able to narrow the argument into at least one of several partially overlapping ranges, such that you have a technique that works in tha …
Pseudonym's user avatar
  • 23.8k
3 votes
Accepted

Precise algorithm for finding higher order derivatives

The first thing you should understand is why central differencing gives you a more precise solution. Consider the Taylor expansion of $f$ around $x$: $$f(x + h) = f(x) + h f'(x) + \frac{1}{2} h^2 f''( …
Pseudonym's user avatar
  • 23.8k