Skip to content

Commit

Permalink
Added details about Francois' talk
Browse files Browse the repository at this point in the history
  • Loading branch information
ffevotte committed Sep 27, 2019
1 parent 51d17f2 commit 4e0e9fc
Show file tree
Hide file tree
Showing 2 changed files with 21 additions and 2 deletions.
19 changes: 17 additions & 2 deletions index.html
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@
<br>
<p>
Welcome to the official page of Julia Paris Meetup!
This meetup aims at promoting the programming language <a href="https://julialang.org">Julia</a> in Paris, France.
This meetup aims at promoting the <a href="https://julialang.org">Julia</a> programming language in Paris, France.
<br>
<br>
All people welcome!
Expand All @@ -38,7 +38,22 @@ <h3> First meetup expected soon!</h3>
<a href="https://github.com/mfherbst">Michael</a> will give a talk.
</p>
<p>
<a href="https://github.com/ffevotte">François</a> will give a talk.
<a href="https://github.com/ffevotte">François</a> will give a
talk about "Accurate and Efficiently Vectorized Sums and Dot
Products in Julia".
<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
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.
</div>
</p>
</td>
</tr>
Expand Down
4 changes: 4 additions & 0 deletions main.css
Original file line number Diff line number Diff line change
Expand Up @@ -30,3 +30,7 @@ table p:first-child {
table tr:last-child p {
margin-bottom:0px;
}

.summary {
padding-left: 2em;
}

0 comments on commit 4e0e9fc

Please sign in to comment.