Skip to content

Commit

Permalink
Update abstract of François' talk
Browse files Browse the repository at this point in the history
  • Loading branch information
ffevotte committed Sep 30, 2019
1 parent 858cbd3 commit 7520631
Showing 1 changed file with 15 additions and 9 deletions.
24 changes: 15 additions & 9 deletions index.html
Original file line number Diff line number Diff line change
Expand Up @@ -66,17 +66,23 @@ <h3> First meetup expected soon!</h3>
talk about <i>"Accurate and Efficiently Vectorized Sums and Dot
Products in Julia"</i>.
<div class="summary">
This talk will present how basic algorithmic
blocks such as sums or dot products can be implemented in
Julia (and have been developed
This talk will present how basic algorithmic blocks such as
sums or dot products can be implemented in Julia (and have
been developed
in <a href="https://github.com/JuliaMath/AccurateArithmetic.jl"
style="font-family:monospace">AccurateArithmetic.jl</a>) in a
way that is both accurate and efficient. This example
illustrates how Julia can help efficiently mix
Floating-Point-related concerns with hardware, SIMD-related
constraints in order to get the performance of
double-precision state-of-the-art BLAS libraries and the
accuracy of quadruple-precision algorithms.
way that is both accurate and efficient. Besides naive
algorithms, compensated algorithms are implemented, which
effectively double the working precision, producing much more
accurate results while incurring little to no overhead,
especially for large input vectors. Although the vectorization
of such algorithms is no particularly simple task, Julia makes
it relatively easy and straightforward. This talk will
illustrate how Julia can help efficiently mix
Floating-Point-related concerns with SIMD-related constraints
in order to get the performance of double-precision
state-of-the-art BLAS libraries and the accuracy of
quadruple-precision algorithms.
</div>
</p>
</td>
Expand Down

0 comments on commit 7520631

Please sign in to comment.