Commit fc5cef33 authored by COULAUD Olivier's avatar COULAUD Olivier
Browse files

Upodate documentation

parent 1df08b87
......@@ -32,7 +32,7 @@ PROJECT_NAME = ScalFmm
# This could be handy for archiving the generated documentation or
# if some version control system is used.
# Using the PROJECT_BRIEF tag one can provide an optional one line description
# for a project that appears at the top of each page and should give viewer
/*! \page mainexamples Main Example
/*! \page mainexamples Main Examples
* \tableofcontents
* \section The repositories structure
......@@ -7,18 +7,18 @@
<li> Src sources folder </li>
<li>Arranger: ??</li>
<li>Arranger: </li>
<li>Components: Basic components.</li>
<li>Containers: The containers used in ScalFMM</li>
<li>Core: The different kind of parallel algorithms: Threads means OpenMP (fork-join, task, ...) while Proc is for MPI.</li>
<li>Extensions: ??</li>
<li>Extensions: classes or methods to extend the FMM.</li>
<li>Files: our different loaders/wrtiters for particule (csvn vtk, FMA, ...)</li>
<li>GroupTree: A grouped octreed used with runtime system to improve the granularity.</li>
<li>Kernels: The different kernels available ins ScalFMM. One forlder per kernel. </li>
<li>Utils: All classes used inside the Library that are not specific to the FFM method.</li>
<li> Examples Main drivers: distribution generation, FMM drivers (Rotation (1/r), Interpolation (Uniform and Chebyschev)</li>
<li> Examples Main drivers: distribution generation, FMM drivers (Rotation (1/r), Interpolation (Uniform/Lagrange and Chebyschev)</li>
<li> Tests. Other examples (prototpes) to understand how you can use the different features of ScalFMM.</li>
<li> UTests unit tests (CTEST)</li>
<li> Addons folder that contains one sub-folder per addon</li>
......@@ -51,9 +51,10 @@ method</b> based on interpolation ( Chebyshev or Lagrange).
* \subsection Publications
* <ul>
*<li>Pierre Blanchard. Fast hierarchical algorithms for the low-rank approximation of matrices, with applications to materials physics, geostatistics and data analysis. PhD of Université de Bordeaux, 2017. <a href=""></a> </li>
*<li> Bridging the gap between OpenMP 4.0 and native runtime systems for the fast multipole method, Emmanuel Agullo, Olivier Aumage, Berenger Bramas, Olivier Coulaud, Samuel Pitoiset. RR-8953, Inria. 2016, pp.49. <a href="">hal-01372022</a></li>
*<li> Task-based FMM for heterogeneous architectures. Emmanuel Agullo, Berenger Bramas, Olivier Coulaud, Eric Darve, Matthias Messner, et al.. Concurrency and Computation: Practice and Experience, Wiley, 2016, 28 (9), <a href=";jsessionid=2AFE0326010BEA7DE21205D13EEB2EE1.f02t03">10.1002/cpe.3723</a></li>
* <li> Fast hierarchical algorithms for generating Gaussian random fields (<a href=""></a>)
* <li> Fast hierarchical algorithms for generating Gaussian random fields. Pierre Blanchard, Olivier Coulaud, Eric Darve, Research Report 8811 (<a href=""></a>)
*<li>Bérenger Bramas. Optimization and parallelization of the boundary element method for the wave equation in time domain. PhD of Université de Bordeaux, 2016. <a href="">pdf</a> </li>
* <li>Task-based FMM for heterogeneous architectures, Emmanuel Agullo; Berenger Bramas; Olivier Coulaud,;Eric Darve; Matthias Messner; Toru Takahashi, Inria Research Report, 2014, pp. 29. <a href="">RR-8513</a>
* <li> Task-Based FMM for Multicore Architectures, Emmanuel Agullo; Berenger Bramas; Olivier Coulaud , Eric Darve; Matthias Messner; Toru Takahashi SIAM Journal on Scientific Computing, SIAM, 2014, 36 (1), pp. 66-93
Copyright ScalFmm 2011-2016 INRIA
Copyright ScalFmm 2011-2018 INRIA
This software is a computer program which purpose is to compute the FMM.
Copyright (c) 2011-2014 Inria, All rights reserved.
Copyright (c) 2011-2018 Inria, All rights reserved.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment