Skip to content

Commit

Permalink
Add precision-preserving ops from AstroPy
Browse files Browse the repository at this point in the history
  • Loading branch information
helgee committed Jun 4, 2018
1 parent 5028565 commit f1246c0
Show file tree
Hide file tree
Showing 2 changed files with 108 additions and 0 deletions.
2 changes: 2 additions & 0 deletions src/AstroTime.jl
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,8 @@ import RemoteFiles: path, isfile

export @timescale

include("utils.jl")

include("LeapSeconds.jl")
include("TimeScales.jl")
include("Periods.jl")
Expand Down
106 changes: 106 additions & 0 deletions src/utils.jl
Original file line number Diff line number Diff line change
@@ -0,0 +1,106 @@
"""
Return the sum of ``val1`` and ``val2`` as two float64s, an integer part
and the fractional remainder. If ``factor`` is not 1.0 then multiply the
sum by ``factor``. If ``divisor`` is not 1.0 then divide the sum by
``divisor``.
The arithmetic is all done with exact floating point operations so no
precision is lost to rounding error. This routine assumes the sum is less
than about 1e16, otherwise the ``frac`` part will be greater than 1.0.
Returns
-------
day, frac : float64
Integer and fractional part of val1 + val2.
"""
function day_frac(val1, val2; factor=1.0, divisor=1.0)
# Add val1 and val2 exactly, returning the result as two float64s.
# The first is the approximate sum (with some floating point error)
# and the second is the error of the float64 sum.
sum12, err12 = two_sum(val1, val2)

if factor != 1.0
sum12, carry = two_product(sum12, factor)
carry += err12 * factor
sum12, err12 = two_sum(sum12, carry)
end

if divisor != 1.0
q1 = sum12 / divisor
p1, p2 = two_product(q1, divisor)
d1, d2 = two_sum(sum12, -p1)
d2 += err12
d2 -= p2
q2 = (d1 + d2) / divisor # 3-part float fine here; nothing can be lost
sum12, err12 = two_sum(q1, q2)
end

# get integer fraction
day = Int(round(sum12))
extra, frac = two_sum(sum12, -day)
frac += extra + err12
day, frac
end


"""
Add ``a`` and ``b`` exactly, returning the result as two float64s.
The first is the approximate sum (with some floating point error)
and the second is the error of the float64 sum.
Using the procedure of Shewchuk, 1997,
Discrete & Computational Geometry 18(3):305-363
http://www.cs.berkeley.edu/~jrs/papers/robustr.pdf
Returns
-------
sum, err : float64
Approximate sum of a + b and the exact floating point error
"""
function two_sum(a, b)
x = a + b
eb = x - a
eb = b - eb
ea = x - b
ea = a - ea
x, ea + eb
end


"""
Multiple ``a`` and ``b`` exactly, returning the result as two float64s.
The first is the approximate product (with some floating point error)
and the second is the error of the float64 product.
Uses the procedure of Shewchuk, 1997,
Discrete & Computational Geometry 18(3):305-363
http://www.cs.berkeley.edu/~jrs/papers/robustr.pdf
Returns
-------
prod, err : float64
Approximate product a * b and the exact floating point error
"""
function two_product(a, b)
x = a * b
ah, al = split(a)
bh, bl = split(b)
y1 = ah * bh
y = x - y1
y2 = al * bh
y -= y2
y3 = ah * bl
y -= y3
y4 = al * bl
y = y4 - y
x, y
end


"""
Split float64 in two aligned parts.
Uses the procedure of Shewchuk, 1997,
Discrete & Computational Geometry 18(3):305-363
http://www.cs.berkeley.edu/~jrs/papers/robustr.pdf
"""
function split(a)
c = 134217729.0 * a # 2**27+1.
abig = c - a
ah = c - abig
al = a - ah
ah, al
end

0 comments on commit f1246c0

Please sign in to comment.