From bd7b6c34326f4cfbbaaf700ba532d93f456dd578 Mon Sep 17 00:00:00 2001 From: Luke Roberts Date: Mon, 10 Jun 2024 17:15:31 -0600 Subject: [PATCH] maybe link the notes --- doc/sphinx/src/mesh/mesh.rst | 4 +++- doc/sphinx/src/solvers.rst | 5 ++++- 2 files changed, 7 insertions(+), 2 deletions(-) diff --git a/doc/sphinx/src/mesh/mesh.rst b/doc/sphinx/src/mesh/mesh.rst index a20328df932e..48e5357db821 100644 --- a/doc/sphinx/src/mesh/mesh.rst +++ b/doc/sphinx/src/mesh/mesh.rst @@ -135,4 +135,6 @@ Parthenon implements AMR via a forest of octrees type approach. - Unlike in the Athena++ ``MeshBlockTree`` implementation that was historically used by Parthenon, the entire logical index space of each tree is within the domain of the problem. Even for some hyper-rectangular base meshes, this can result in forests that contain - multiple trees. \ No newline at end of file + multiple trees. + + Some implementation notes about our forest can be found in :ref:`these notes `. \ No newline at end of file diff --git a/doc/sphinx/src/solvers.rst b/doc/sphinx/src/solvers.rst index 6377ac117b4a..cadd20862d05 100644 --- a/doc/sphinx/src/solvers.rst +++ b/doc/sphinx/src/solvers.rst @@ -16,7 +16,10 @@ of a multi-grid based linear solver in Parthenon is also given in preconditioner for BiCGStab). We plan to build wrappers that simplify the use of these methods in down stream codes in the future. Note that the example code does not currently rely on the Stencil and SparseMatrixAccessor -code described below. +code described below. + +Some implementation notes about geometric multi-grid can be found in +:ref:`these notes `. Stencil -------