[cig-commits] commit: move example_inputs/ to input/ and make a separate copy of linear_pressure
Mercurial
hg at geodynamics.org
Fri Feb 25 14:16:56 PST 2011
changeset: 88:dccf1e82152f
user: Walter Landry <wlandry at caltech.edu>
date: Sun Feb 13 19:49:51 2011 -0800
files: example_inputs/const_refine.2d.input example_inputs/const_refine.3d.input example_inputs/otherbc.2d.input example_inputs/otherbc.3d.input input/const_refine.2d.input input/const_refine.3d.input input/linear_pressure.input input/otherbc.2d.input input/otherbc.3d.input
description:
move example_inputs/ to input/ and make a separate copy of linear_pressure
diff -r b29d1a9dfc25 -r dccf1e82152f example_inputs/const_refine.2d.input
--- a/example_inputs/const_refine.2d.input Sun Feb 13 11:47:45 2011 -0800
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,146 +0,0 @@
-/*************************************************************************
- *
- * This file is part of the SAMRAI distribution. For full copyright
- * information, see COPYRIGHT and COPYING.LESSER.
- *
- * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
- * Description: Input file for example FAC Stokes solver
- *
- ************************************************************************/
-// This is the input file for the 2D FAC example
-// demonstrating changes in boundary conditions.
-//
-// Note that using constant refine prolongation
-// lead to slower convergence.
-
-Main {
- dim = 2
- // Base name for output files.
- base_name = "constantrefine2"
- // Whether to log all nodes in a parallel run.
- log_all_nodes = TRUE
- // Visualization writers to write files for.
- vis_writer = "Vizamrai", "VisIt"
-}
-
-FACStokes {
- // The FACStokes class is the "user class" in this example.
- // It owns the solver and contains the code to set up the solver.
- // The inputs for FACStokes is simply the inputs for the individual
- // parts owned by the FACStokes class.
- fac_solver {
- // This is the input for the cell-centered Stokes FAC solver
- // class in the SAMRAI library.
- enable_logging = TRUE // Bool flag to switch logging on/off
- max_cycles = 20 // Max number of FAC cycles to use
- residual_tol = 1e-8 // Residual tolerance to solve for
- num_pre_sweeps = 5 // Number of presmoothing sweeps to use
- num_post_sweeps = 5 // Number of postsmoothing sweeps to use
- coarse_solver_max_iterations = 100
- coarse_solver_tolerance = 1e-10
- p_prolongation_method = "P_REFINE" // Type of refinement
- // used in prolongation.
- // Suggested values are
- // "LINEAR_REFINE"
- // "CONSTANT_REFINE"
- v_prolongation_method = "V_REFINE" // Type of refinement
- // used in prolongation.
- // Suggested values are
- // "LINEAR_REFINE"
- // "CONSTANT_REFINE"
- use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
- }
- bc_coefs {
- // These are the boundary condition specifications. The number
- // after "boundary_" is the location index of the boundary.
- // The inputs are arrays of strings where the first string
- // indicates the type of values you want to set. "slope" means
- // boundary slope, "value" means boundary value, and "coefficients"
- // mean the raw Robin boundary condition coefficients.
- // The remaining strings are converted into numbers as
- // appropriate for what boundary condition you specified with
- // the first string. Other boundary conditions are possible.
- // see the solv_RobinBcCoefStrategy class.
- // Examples:
- // boundary_0 = "slope", "0"
- // boundary_1 = "coefficients", "0", "0"
- // boundary_2 = "value", "0"
- // boundary_3 = "value", "0"
- boundary_0 = "value", "0"
- boundary_1 = "value", "0"
- boundary_2 = "value", "0"
- boundary_3 = "value", "0"
- }
-}
-
-CartesianGridGeometry {
- // Specify lower/upper corners of the computational domain and a
- // set of non-overlapping boxes defining domain interior. If union
- // of boxes is not a parallelpiped, lower/upper corner data corresponds
- // to min/max corner indices over all boxes given.
- // x_lo -- (double array) lower corner of computational domain [REQD]
- // x_up -- (double array) upper corner of computational domain [REQD]
- // domain_boxes -- (box array) set of boxes that define interior of
- // hysical domain. [REQD]
- // periodic_dimension -- (int array) coordinate directions in which
- // domain is periodic. Zero indicates not
- // periodic, non-zero value indicates periodicity.
- // [0]
- domain_boxes = [(0,0), (3,3)]
- x_lo = 0, 0
- x_up = 1, 1
-}
-
-StandardTagAndInitialize {
- tagging_method = "REFINE_BOXES"
- RefineBoxes {
- level_0 = [(0,0),(3,3)]
- // level_1 = [(0,0),(7,7)]
- // level_2 = [(0,0),(15,15)]
- level_1 = [(2,2),(3,3)]
- level_2 = [(4,4),(5,5)]
- // level_3 = [(0,0),(1,1)]
- //etc.
- }
-}
-
-PatchHierarchy {
- // Information used to create patches in AMR hierarchy.
- // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
- //
- // For most of the following parameters, the number of precribed data
- // values need not match the number of levels in the hierarchy
- // (determined by max_levels). If more values are given than number
- // of levels, extraneous values will be ignored. If less are give, then
- // values that correspond to individual levels will apply to those
- // levels. Missing values will be taken from those for the finest
- // level specified.
- //
- // ratio_to_coarser {
- // level_1 -- (int array) ratio between index spaces on
- // level 1 to level 0 [REQD]
- // level_2 -- (int array) ratio between index spaces on
- // level 2 to level 1 [REQD]
- // etc....
- // }
- // largest_patch_size {
- // level_0 -- (int array) largest patch allowed on level 0.
- // [REQD]
- // level_1 -- (int array) " " " " level 1
- // [level 0 entry]
- // etc....
- // }
- max_levels = 3
- ratio_to_coarser {
- level_1 = 2, 2
- level_2 = 2, 2
- }
- largest_patch_size {
- level_0 = 32, 32
- // level_0 = 8, 8
- // all finer levels will use same values as level_0...
- }
-}
-
-GriddingAlgorithm {
-}
diff -r b29d1a9dfc25 -r dccf1e82152f example_inputs/const_refine.3d.input
--- a/example_inputs/const_refine.3d.input Sun Feb 13 11:47:45 2011 -0800
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,135 +0,0 @@
-/*************************************************************************
- *
- * This file is part of the SAMRAI distribution. For full copyright
- * information, see COPYRIGHT and COPYING.LESSER.
- *
- * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
- * Description: Input file for example FAC Poisson solver
- *
- ************************************************************************/
-// This is the input file for the 3D FAC example
-// demonstrating changes in boundary conditions.
-//
-// Note that using constant refine prolongation
-// lead to slower convergence.
-
-Main {
- dim = 3
- // Base name for output files.
- base_name = "constantrefine3"
- // Whether to log all nodes in a parallel run.
- log_all_nodes = FALSE
- // Visualization writers to write files for.
- vis_writer = "Vizamrai", "VisIt"
-}
-
-FACPoisson {
- // The FACPoisson class is the "user class" in this example.
- // It owns the solver and contains the code to set up the solver.
- // The inputs for FACPoisson is simply the inputs for the individual
- // parts owned by the FACPoisson class.
- fac_solver {
- // This is the input for the cell-centered Poisson FAC solver
- // class in the SAMRAI library.
- enable_logging = TRUE // Bool flag to switch logging on/off
- max_cycles = 20 // Max number of FAC cycles to use
- residual_tol = 1e-8 // Residual tolerance to solve for
- num_pre_sweeps = 1 // Number of presmoothing sweeps to use
- num_post_sweeps = 3 // Number of postsmoothing sweeps to use
- prolongation_method = "CONSTANT_REFINE" // Type of refinement
- // used in prolongation.
- // Suggested values are
- // "LINEAR_REFINE"
- // "CONSTANT_REFINE"
- use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
- }
- bc_coefs {
- // These are the boundary condition specifications. The number
- // after "boundary_" is the location index of the boundary.
- // The inputs are arrays of strings where the first string
- // indicates the type of values you want to set. "slope" means
- // boundary slope, "value" means boundary value, and "coefficients"
- // mean the raw Robin boundary condition coefficients.
- // The remaining strings are converted into numbers as
- // appropriate for what boundary condition you specified with
- // the first string. Other boundary conditions are possible.
- // see the solv_RobinBcCoefStrategy class.
- // Examples:
- // boundary_0 = "slope", "0"
- // boundary_1 = "coefficients", "0", "0"
- // boundary_2 = "value", "0"
- // boundary_3 = "value", "0"
- boundary_0 = "value", "0"
- boundary_1 = "value", "0"
- boundary_2 = "value", "0"
- boundary_3 = "value", "0"
- boundary_4 = "value", "0"
- boundary_5 = "value", "0"
- }
-}
-
-CartesianGridGeometry {
- // Specify lower/upper corners of the computational domain and a
- // set of non-overlapping boxes defining domain interior. If union
- // of boxes is not a parallelpiped, lower/upper corner data corresponds
- // to min/max corner indices over all boxes given.
- // x_lo -- (double array) lower corner of computational domain [REQD]
- // x_up -- (double array) upper corner of computational domain [REQD]
- // domain_boxes -- (box array) set of boxes that define interior of
- // hysical domain. [REQD]
- // periodic_dimension -- (int array) coordinate directions in which
- // domain is periodic. Zero indicates not
- // periodic, non-zero value indicates periodicity.
- // [0]
- domain_boxes = [(0,0,0), (15,15,15)]
- x_lo = 0, 0, 0
- x_up = 1, 1, 1
-}
-
-StandardTagAndInitialize {
- tagging_method = "REFINE_BOXES"
- RefineBoxes {
- level_0 = [(0,0,0),(7,7,7)]
- level_1 = [(0,0,0),(7,7,7)]
- }
-}
-
-PatchHierarchy {
- // Information used to create patches in AMR hierarchy.
- // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
- //
- // For most of the following parameters, the number of precribed data
- // values need not match the number of levels in the hierarchy
- // (determined by max_levels). If more values are given than number
- // of levels, extraneous values will be ignored. If less are give, then
- // values that correspond to individual levels will apply to those
- // levels. Missing values will be taken from those for the finest
- // level specified.
- //
- // ratio_to_coarser {
- // level_1 -- (int array) ratio between index spaces on
- // level 1 to level 0 [REQD]
- // level_2 -- (int array) ratio between index spaces on
- // level 2 to level 1 [REQD]
- // etc....
- // }
- // largest_patch_size {
- // level_0 -- (int array) largest patch allowed on level 0.
- // [REQD]
- // level_1 -- (int array) " " " " level 1
- // [level 0 entry]
- // etc....
- // }
- max_levels = 3
- ratio_to_coarser {
- level_1 = 2, 2, 2
- level_2 = 2, 2, 2
- }
- largest_patch_size {
- level_0 = 32, 32, 32
- // all finer levels will use same values as level_0...
- }
-}
-
-GriddingAlgorithm {
-}
diff -r b29d1a9dfc25 -r dccf1e82152f example_inputs/otherbc.2d.input
--- a/example_inputs/otherbc.2d.input Sun Feb 13 11:47:45 2011 -0800
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,137 +0,0 @@
-/*************************************************************************
- *
- * This file is part of the SAMRAI distribution. For full copyright
- * information, see COPYRIGHT and COPYING.LESSER.
- *
- * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
- * Description: Input file for example FAC Poisson solver
- *
- ************************************************************************/
-// This is the input file for the 2D FAC example
-// demonstrating changes in boundary conditions.
-//
-// Note that you should not compare the computed
-// solution with the exact solution in the example.
-// The exact solution is only for the boundary
-// condition of 0 on all boundaries.
-
-Main {
- dim = 2
- // Base name for output files.
- base_name = "otherbc2"
- // Whether to log all nodes in a parallel run.
- log_all_nodes = FALSE
- // Visualization writers to write files for.
- vis_writer = "Vizamrai", "VisIt"
-}
-
-FACPoisson {
- // The FACPoisson class is the "user class" in this example.
- // It owns the solver and contains the code to set up the solver.
- // The inputs for FACPoisson is simply the inputs for the individual
- // parts owned by the FACPoisson class.
- fac_solver {
- // This is the input for the cell-centered Poisson FAC solver
- // class in the SAMRAI library.
- enable_logging = TRUE // Bool flag to switch logging on/off
- max_cycles = 10 // Max number of FAC cycles to use
- residual_tol = 1e-8 // Residual tolerance to solve for
- num_pre_sweeps = 1 // Number of presmoothing sweeps to use
- num_post_sweeps = 3 // Number of postsmoothing sweeps to use
- prolongation_method = "LINEAR_REFINE" // Type of refinement
- // used in prolongation.
- // Suggested values are
- // "LINEAR_REFINE"
- // "CONSTANT_REFINE"
- use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
- }
- bc_coefs {
- // These are the boundary condition specifications. The number
- // after "boundary_" is the location index of the boundary.
- // The inputs are arrays of strings where the first string
- // indicates the type of values you want to set. "slope" means
- // boundary slope, "value" means boundary value, and "coefficients"
- // mean the raw Robin boundary condition coefficients.
- // The remaining strings are converted into numbers as
- // appropriate for what boundary condition you specified with
- // the first string. Other boundary conditions are possible.
- // see the solv_RobinBcCoefStrategy class.
- // Examples:
- // boundary_0 = "slope", "0"
- // boundary_1 = "coefficients", "0", "0"
- // boundary_2 = "value", "0"
- // boundary_3 = "value", "0"
- boundary_0 = "slope", "0"
- boundary_1 = "coefficients", "0", "0"
- boundary_2 = "value", "0"
- boundary_3 = "value", "0"
- }
-}
-
-CartesianGridGeometry {
- // Specify lower/upper corners of the computational domain and a
- // set of non-overlapping boxes defining domain interior. If union
- // of boxes is not a parallelpiped, lower/upper corner data corresponds
- // to min/max corner indices over all boxes given.
- // x_lo -- (double array) lower corner of computational domain [REQD]
- // x_up -- (double array) upper corner of computational domain [REQD]
- // domain_boxes -- (box array) set of boxes that define interior of
- // hysical domain. [REQD]
- // periodic_dimension -- (int array) coordinate directions in which
- // domain is periodic. Zero indicates not
- // periodic, non-zero value indicates periodicity.
- // [0]
- domain_boxes = [(0,0), (31,31)]
- x_lo = 0, 0
- x_up = 1, 1
-}
-
-StandardTagAndInitialize {
- tagging_method = "REFINE_BOXES"
- RefineBoxes {
- level_0 = [(0,0),(31,15)]
- level_1 = [(0,0),(63,15)]
- level_2 = [(0,0),(16,16)]
- //etc.
- }
-}
-
-PatchHierarchy {
- // Information used to create patches in AMR hierarchy.
- // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
- //
- // For most of the following parameters, the number of precribed data
- // values need not match the number of levels in the hierarchy
- // (determined by max_levels). If more values are given than number
- // of levels, extraneous values will be ignored. If less are give, then
- // values that correspond to individual levels will apply to those
- // levels. Missing values will be taken from those for the finest
- // level specified.
- //
- // ratio_to_coarser {
- // level_1 -- (int array) ratio between index spaces on
- // level 1 to level 0 [REQD]
- // level_2 -- (int array) ratio between index spaces on
- // level 2 to level 1 [REQD]
- // etc....
- // }
- // largest_patch_size {
- // level_0 -- (int array) largest patch allowed on level 0.
- // [REQD]
- // level_1 -- (int array) " " " " level 1
- // [level 0 entry]
- // etc....
- // }
- max_levels = 3
- ratio_to_coarser {
- level_1 = 2, 2
- level_2 = 2, 2
- }
- largest_patch_size {
- level_0 = 32, 32
- // all finer levels will use same values as level_0...
- }
-}
-
-GriddingAlgorithm {
-}
diff -r b29d1a9dfc25 -r dccf1e82152f example_inputs/otherbc.3d.input
--- a/example_inputs/otherbc.3d.input Sun Feb 13 11:47:45 2011 -0800
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,137 +0,0 @@
-/*************************************************************************
- *
- * This file is part of the SAMRAI distribution. For full copyright
- * information, see COPYRIGHT and COPYING.LESSER.
- *
- * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
- * Description: Input file for example FAC Poisson solver
- *
- ************************************************************************/
-// This is the input file for the 3D FAC example
-// demonstrating changes in boundary conditions.
-//
-// Note that you should not compare the computed
-// solution with the exact solution in the example.
-// The exact solution is only for the boundary
-// condition of 0 on all boundaries.
-
-Main {
- dim = 3
- // Base name for output files.
- base_name = "otherbc3"
- // Whether to log all nodes in a parallel run.
- log_all_nodes = FALSE
- // Visualization writers to write files for.
- vis_writer = "Vizamrai", "VisIt"
-}
-
-FACPoisson {
- // The FACPoisson class is the "user class" in this example.
- // It owns the solver and contains the code to set up the solver.
- // The inputs for FACPoisson is simply the inputs for the individual
- // parts owned by the FACPoisson class.
- fac_solver {
- // This is the input for the cell-centered Poisson FAC solver
- // class in the SAMRAI library.
- enable_logging = TRUE // Bool flag to switch logging on/off
- max_cycles = 10 // Max number of FAC cycles to use
- residual_tol = 1e-8 // Residual tolerance to solve for
- num_pre_sweeps = 1 // Number of presmoothing sweeps to use
- num_post_sweeps = 3 // Number of postsmoothing sweeps to use
- prolongation_method = "LINEAR_REFINE" // Type of refinement
- // used in prolongation.
- // Suggested values are
- // "LINEAR_REFINE"
- // "CONSTANT_REFINE"
- use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
- }
- bc_coefs {
- // These are the boundary condition specifications. The number
- // after "boundary_" is the location index of the boundary.
- // The inputs are arrays of strings where the first string
- // indicates the type of values you want to set. "slope" means
- // boundary slope, "value" means boundary value, and "coefficients"
- // mean the raw Robin boundary condition coefficients.
- // The remaining strings are converted into numbers as
- // appropriate for what boundary condition you specified with
- // the first string. Other boundary conditions are possible.
- // see the solv_RobinBcCoefStrategy class.
- // Examples:
- // boundary_0 = "slope", "0"
- // boundary_1 = "coefficients", "0", "0"
- // boundary_2 = "value", "0"
- // boundary_3 = "value", "0"
- boundary_0 = "slope", "0"
- boundary_1 = "coefficients", "0", "0"
- boundary_2 = "value", "0"
- boundary_3 = "value", "0"
- boundary_4 = "value", "0"
- boundary_5 = "value", "0"
- }
-}
-
-CartesianGridGeometry {
- // Specify lower/upper corners of the computational domain and a
- // set of non-overlapping boxes defining domain interior. If union
- // of boxes is not a parallelpiped, lower/upper corner data corresponds
- // to min/max corner indices over all boxes given.
- // x_lo -- (double array) lower corner of computational domain [REQD]
- // x_up -- (double array) upper corner of computational domain [REQD]
- // domain_boxes -- (box array) set of boxes that define interior of
- // hysical domain. [REQD]
- // periodic_dimension -- (int array) coordinate directions in which
- // domain is periodic. Zero indicates not
- // periodic, non-zero value indicates periodicity.
- // [0]
- domain_boxes = [(0,0,0), (15,15,15)]
- x_lo = 0, 0, 0
- x_up = 1, 1, 1
-}
-
-StandardTagAndInitialize {
- tagging_method = "REFINE_BOXES"
- RefineBoxes {
- level_0 = [(0,0,0),(7,7,7)]
- level_1 = [(0,0,0),(7,7,7)]
- }
-}
-
-PatchHierarchy {
- // Information used to create patches in AMR hierarchy.
- // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
- //
- // For most of the following parameters, the number of precribed data
- // values need not match the number of levels in the hierarchy
- // (determined by max_levels). If more values are given than number
- // of levels, extraneous values will be ignored. If less are give, then
- // values that correspond to individual levels will apply to those
- // levels. Missing values will be taken from those for the finest
- // level specified.
- //
- // ratio_to_coarser {
- // level_1 -- (int array) ratio between index spaces on
- // level 1 to level 0 [REQD]
- // level_2 -- (int array) ratio between index spaces on
- // level 2 to level 1 [REQD]
- // etc....
- // }
- // largest_patch_size {
- // level_0 -- (int array) largest patch allowed on level 0.
- // [REQD]
- // level_1 -- (int array) " " " " level 1
- // [level 0 entry]
- // etc....
- // }
- max_levels = 3
- ratio_to_coarser {
- level_1 = 2, 2, 2
- level_2 = 2, 2, 2
- }
- largest_patch_size {
- level_0 = 32, 32, 32
- // all finer levels will use same values as level_0...
- }
-}
-
-GriddingAlgorithm {
-}
diff -r b29d1a9dfc25 -r dccf1e82152f input/const_refine.2d.input
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/input/const_refine.2d.input Sun Feb 13 19:49:51 2011 -0800
@@ -0,0 +1,148 @@
+/*************************************************************************
+ *
+ * This file is part of the SAMRAI distribution. For full copyright
+ * information, see COPYRIGHT and COPYING.LESSER.
+ *
+ * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
+ * Description: Input file for example FAC Stokes solver
+ *
+ ************************************************************************/
+// This is the input file for the 2D FAC example
+// demonstrating changes in boundary conditions.
+//
+// Note that using constant refine prolongation
+// lead to slower convergence.
+
+Main {
+ dim = 2
+ // Base name for output files.
+ base_name = "constantrefine2"
+ // Whether to log all nodes in a parallel run.
+ log_all_nodes = TRUE
+ // Visualization writers to write files for.
+ vis_writer = "Vizamrai", "VisIt"
+}
+
+FACStokes {
+ // The FACStokes class is the "user class" in this example.
+ // It owns the solver and contains the code to set up the solver.
+ // The inputs for FACStokes is simply the inputs for the individual
+ // parts owned by the FACStokes class.
+ fac_solver {
+ // This is the input for the cell-centered Stokes FAC solver
+ // class in the SAMRAI library.
+ enable_logging = TRUE // Bool flag to switch logging on/off
+ max_cycles = 100 // Max number of FAC cycles to use
+ residual_tol = 1e-8 // Residual tolerance to solve for
+ num_pre_sweeps = 5 // Number of presmoothing sweeps to use
+ num_post_sweeps = 5 // Number of postsmoothing sweeps to use
+ coarse_solver_max_iterations = 1000
+ coarse_solver_tolerance = 1e-10
+ p_prolongation_method = "P_REFINE" // Type of refinement
+ // used in prolongation.
+ // Suggested values are
+ // "LINEAR_REFINE"
+ // "CONSTANT_REFINE"
+ v_prolongation_method = "V_REFINE" // Type of refinement
+ // used in prolongation.
+ // Suggested values are
+ // "LINEAR_REFINE"
+ // "CONSTANT_REFINE"
+ use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
+ }
+ bc_coefs {
+ // These are the boundary condition specifications. The number
+ // after "boundary_" is the location index of the boundary.
+ // The inputs are arrays of strings where the first string
+ // indicates the type of values you want to set. "slope" means
+ // boundary slope, "value" means boundary value, and "coefficients"
+ // mean the raw Robin boundary condition coefficients.
+ // The remaining strings are converted into numbers as
+ // appropriate for what boundary condition you specified with
+ // the first string. Other boundary conditions are possible.
+ // see the solv_RobinBcCoefStrategy class.
+ // Examples:
+ // boundary_0 = "slope", "0"
+ // boundary_1 = "coefficients", "0", "0"
+ // boundary_2 = "value", "0"
+ // boundary_3 = "value", "0"
+ boundary_0 = "value", "0"
+ boundary_1 = "value", "0"
+ boundary_2 = "value", "0"
+ boundary_3 = "value", "0"
+ }
+}
+
+CartesianGridGeometry {
+ // Specify lower/upper corners of the computational domain and a
+ // set of non-overlapping boxes defining domain interior. If union
+ // of boxes is not a parallelpiped, lower/upper corner data corresponds
+ // to min/max corner indices over all boxes given.
+ // x_lo -- (double array) lower corner of computational domain [REQD]
+ // x_up -- (double array) upper corner of computational domain [REQD]
+ // domain_boxes -- (box array) set of boxes that define interior of
+ // physical domain. [REQD]
+ // periodic_dimension -- (int array) coordinate directions in which
+ // domain is periodic. Zero indicates not
+ // periodic, non-zero value indicates periodicity.
+ // [0]
+ domain_boxes = [(0,0), (3,3)]
+ x_lo = 0, 0
+ x_up = 1, 1
+}
+
+StandardTagAndInitialize {
+ tagging_method = "REFINE_BOXES"
+ RefineBoxes {
+ level_0 = [(0,0),(3,3)]
+ // level_1 = [(0,0),(7,7)]
+ // level_2 = [(0,0),(15,15)]
+ level_1 = [(2,2),(5,5)]
+ level_2 = [(4,4),(10,10)]
+ // level_3 = [(8,8),(20,20)]
+ //etc.
+ }
+}
+
+PatchHierarchy {
+ // Information used to create patches in AMR hierarchy.
+ // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
+ //
+ // For most of the following parameters, the number of precribed data
+ // values need not match the number of levels in the hierarchy
+ // (determined by max_levels). If more values are given than number
+ // of levels, extraneous values will be ignored. If less are give, then
+ // values that correspond to individual levels will apply to those
+ // levels. Missing values will be taken from those for the finest
+ // level specified.
+ //
+ // ratio_to_coarser {
+ // level_1 -- (int array) ratio between index spaces on
+ // level 1 to level 0 [REQD]
+ // level_2 -- (int array) ratio between index spaces on
+ // level 2 to level 1 [REQD]
+ // etc....
+ // }
+ // largest_patch_size {
+ // level_0 -- (int array) largest patch allowed on level 0.
+ // [REQD]
+ // level_1 -- (int array) " " " " level 1
+ // [level 0 entry]
+ // etc....
+ // }
+ max_levels = 3
+ ratio_to_coarser {
+ level_1 = 2, 2
+ level_2 = 2, 2
+ level_3 = 2, 2
+ level_4 = 2, 2
+ }
+ largest_patch_size {
+ level_0 = 32, 32
+ // level_0 = 4, 4
+ // all finer levels will use same values as level_0...
+ }
+}
+
+GriddingAlgorithm {
+}
diff -r b29d1a9dfc25 -r dccf1e82152f input/const_refine.3d.input
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/input/const_refine.3d.input Sun Feb 13 19:49:51 2011 -0800
@@ -0,0 +1,135 @@
+/*************************************************************************
+ *
+ * This file is part of the SAMRAI distribution. For full copyright
+ * information, see COPYRIGHT and COPYING.LESSER.
+ *
+ * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
+ * Description: Input file for example FAC Poisson solver
+ *
+ ************************************************************************/
+// This is the input file for the 3D FAC example
+// demonstrating changes in boundary conditions.
+//
+// Note that using constant refine prolongation
+// lead to slower convergence.
+
+Main {
+ dim = 3
+ // Base name for output files.
+ base_name = "constantrefine3"
+ // Whether to log all nodes in a parallel run.
+ log_all_nodes = FALSE
+ // Visualization writers to write files for.
+ vis_writer = "Vizamrai", "VisIt"
+}
+
+FACPoisson {
+ // The FACPoisson class is the "user class" in this example.
+ // It owns the solver and contains the code to set up the solver.
+ // The inputs for FACPoisson is simply the inputs for the individual
+ // parts owned by the FACPoisson class.
+ fac_solver {
+ // This is the input for the cell-centered Poisson FAC solver
+ // class in the SAMRAI library.
+ enable_logging = TRUE // Bool flag to switch logging on/off
+ max_cycles = 20 // Max number of FAC cycles to use
+ residual_tol = 1e-8 // Residual tolerance to solve for
+ num_pre_sweeps = 1 // Number of presmoothing sweeps to use
+ num_post_sweeps = 3 // Number of postsmoothing sweeps to use
+ prolongation_method = "CONSTANT_REFINE" // Type of refinement
+ // used in prolongation.
+ // Suggested values are
+ // "LINEAR_REFINE"
+ // "CONSTANT_REFINE"
+ use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
+ }
+ bc_coefs {
+ // These are the boundary condition specifications. The number
+ // after "boundary_" is the location index of the boundary.
+ // The inputs are arrays of strings where the first string
+ // indicates the type of values you want to set. "slope" means
+ // boundary slope, "value" means boundary value, and "coefficients"
+ // mean the raw Robin boundary condition coefficients.
+ // The remaining strings are converted into numbers as
+ // appropriate for what boundary condition you specified with
+ // the first string. Other boundary conditions are possible.
+ // see the solv_RobinBcCoefStrategy class.
+ // Examples:
+ // boundary_0 = "slope", "0"
+ // boundary_1 = "coefficients", "0", "0"
+ // boundary_2 = "value", "0"
+ // boundary_3 = "value", "0"
+ boundary_0 = "value", "0"
+ boundary_1 = "value", "0"
+ boundary_2 = "value", "0"
+ boundary_3 = "value", "0"
+ boundary_4 = "value", "0"
+ boundary_5 = "value", "0"
+ }
+}
+
+CartesianGridGeometry {
+ // Specify lower/upper corners of the computational domain and a
+ // set of non-overlapping boxes defining domain interior. If union
+ // of boxes is not a parallelpiped, lower/upper corner data corresponds
+ // to min/max corner indices over all boxes given.
+ // x_lo -- (double array) lower corner of computational domain [REQD]
+ // x_up -- (double array) upper corner of computational domain [REQD]
+ // domain_boxes -- (box array) set of boxes that define interior of
+ // hysical domain. [REQD]
+ // periodic_dimension -- (int array) coordinate directions in which
+ // domain is periodic. Zero indicates not
+ // periodic, non-zero value indicates periodicity.
+ // [0]
+ domain_boxes = [(0,0,0), (15,15,15)]
+ x_lo = 0, 0, 0
+ x_up = 1, 1, 1
+}
+
+StandardTagAndInitialize {
+ tagging_method = "REFINE_BOXES"
+ RefineBoxes {
+ level_0 = [(0,0,0),(7,7,7)]
+ level_1 = [(0,0,0),(7,7,7)]
+ }
+}
+
+PatchHierarchy {
+ // Information used to create patches in AMR hierarchy.
+ // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
+ //
+ // For most of the following parameters, the number of precribed data
+ // values need not match the number of levels in the hierarchy
+ // (determined by max_levels). If more values are given than number
+ // of levels, extraneous values will be ignored. If less are give, then
+ // values that correspond to individual levels will apply to those
+ // levels. Missing values will be taken from those for the finest
+ // level specified.
+ //
+ // ratio_to_coarser {
+ // level_1 -- (int array) ratio between index spaces on
+ // level 1 to level 0 [REQD]
+ // level_2 -- (int array) ratio between index spaces on
+ // level 2 to level 1 [REQD]
+ // etc....
+ // }
+ // largest_patch_size {
+ // level_0 -- (int array) largest patch allowed on level 0.
+ // [REQD]
+ // level_1 -- (int array) " " " " level 1
+ // [level 0 entry]
+ // etc....
+ // }
+ max_levels = 3
+ ratio_to_coarser {
+ level_1 = 2, 2, 2
+ level_2 = 2, 2, 2
+ }
+ largest_patch_size {
+ level_0 = 32, 32, 32
+ // all finer levels will use same values as level_0...
+ }
+}
+
+GriddingAlgorithm {
+}
diff -r b29d1a9dfc25 -r dccf1e82152f input/linear_pressure.input
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/input/linear_pressure.input Sun Feb 13 19:49:51 2011 -0800
@@ -0,0 +1,148 @@
+/*************************************************************************
+ *
+ * This file is part of the SAMRAI distribution. For full copyright
+ * information, see COPYRIGHT and COPYING.LESSER.
+ *
+ * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
+ * Description: Input file for example FAC Stokes solver
+ *
+ ************************************************************************/
+// This is the input file for the 2D FAC example
+// demonstrating changes in boundary conditions.
+//
+// Note that using constant refine prolongation
+// lead to slower convergence.
+
+Main {
+ dim = 2
+ // Base name for output files.
+ base_name = "constantrefine2"
+ // Whether to log all nodes in a parallel run.
+ log_all_nodes = TRUE
+ // Visualization writers to write files for.
+ vis_writer = "Vizamrai", "VisIt"
+}
+
+FACStokes {
+ // The FACStokes class is the "user class" in this example.
+ // It owns the solver and contains the code to set up the solver.
+ // The inputs for FACStokes is simply the inputs for the individual
+ // parts owned by the FACStokes class.
+ fac_solver {
+ // This is the input for the cell-centered Stokes FAC solver
+ // class in the SAMRAI library.
+ enable_logging = TRUE // Bool flag to switch logging on/off
+ max_cycles = 100 // Max number of FAC cycles to use
+ residual_tol = 1e-8 // Residual tolerance to solve for
+ num_pre_sweeps = 5 // Number of presmoothing sweeps to use
+ num_post_sweeps = 5 // Number of postsmoothing sweeps to use
+ coarse_solver_max_iterations = 1000
+ coarse_solver_tolerance = 1e-10
+ p_prolongation_method = "P_REFINE" // Type of refinement
+ // used in prolongation.
+ // Suggested values are
+ // "LINEAR_REFINE"
+ // "CONSTANT_REFINE"
+ v_prolongation_method = "V_REFINE" // Type of refinement
+ // used in prolongation.
+ // Suggested values are
+ // "LINEAR_REFINE"
+ // "CONSTANT_REFINE"
+ use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
+ }
+ bc_coefs {
+ // These are the boundary condition specifications. The number
+ // after "boundary_" is the location index of the boundary.
+ // The inputs are arrays of strings where the first string
+ // indicates the type of values you want to set. "slope" means
+ // boundary slope, "value" means boundary value, and "coefficients"
+ // mean the raw Robin boundary condition coefficients.
+ // The remaining strings are converted into numbers as
+ // appropriate for what boundary condition you specified with
+ // the first string. Other boundary conditions are possible.
+ // see the solv_RobinBcCoefStrategy class.
+ // Examples:
+ // boundary_0 = "slope", "0"
+ // boundary_1 = "coefficients", "0", "0"
+ // boundary_2 = "value", "0"
+ // boundary_3 = "value", "0"
+ boundary_0 = "value", "0"
+ boundary_1 = "value", "0"
+ boundary_2 = "value", "0"
+ boundary_3 = "value", "0"
+ }
+}
+
+CartesianGridGeometry {
+ // Specify lower/upper corners of the computational domain and a
+ // set of non-overlapping boxes defining domain interior. If union
+ // of boxes is not a parallelpiped, lower/upper corner data corresponds
+ // to min/max corner indices over all boxes given.
+ // x_lo -- (double array) lower corner of computational domain [REQD]
+ // x_up -- (double array) upper corner of computational domain [REQD]
+ // domain_boxes -- (box array) set of boxes that define interior of
+ // physical domain. [REQD]
+ // periodic_dimension -- (int array) coordinate directions in which
+ // domain is periodic. Zero indicates not
+ // periodic, non-zero value indicates periodicity.
+ // [0]
+ domain_boxes = [(0,0), (3,3)]
+ x_lo = 0, 0
+ x_up = 1, 1
+}
+
+StandardTagAndInitialize {
+ tagging_method = "REFINE_BOXES"
+ RefineBoxes {
+ level_0 = [(0,0),(3,3)]
+ // level_1 = [(0,0),(7,7)]
+ // level_2 = [(0,0),(15,15)]
+ level_1 = [(2,2),(5,5)]
+ level_2 = [(4,4),(10,10)]
+ // level_3 = [(8,8),(20,20)]
+ //etc.
+ }
+}
+
+PatchHierarchy {
+ // Information used to create patches in AMR hierarchy.
+ // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
+ //
+ // For most of the following parameters, the number of precribed data
+ // values need not match the number of levels in the hierarchy
+ // (determined by max_levels). If more values are given than number
+ // of levels, extraneous values will be ignored. If less are give, then
+ // values that correspond to individual levels will apply to those
+ // levels. Missing values will be taken from those for the finest
+ // level specified.
+ //
+ // ratio_to_coarser {
+ // level_1 -- (int array) ratio between index spaces on
+ // level 1 to level 0 [REQD]
+ // level_2 -- (int array) ratio between index spaces on
+ // level 2 to level 1 [REQD]
+ // etc....
+ // }
+ // largest_patch_size {
+ // level_0 -- (int array) largest patch allowed on level 0.
+ // [REQD]
+ // level_1 -- (int array) " " " " level 1
+ // [level 0 entry]
+ // etc....
+ // }
+ max_levels = 3
+ ratio_to_coarser {
+ level_1 = 2, 2
+ level_2 = 2, 2
+ level_3 = 2, 2
+ level_4 = 2, 2
+ }
+ largest_patch_size {
+ level_0 = 32, 32
+ // level_0 = 4, 4
+ // all finer levels will use same values as level_0...
+ }
+}
+
+GriddingAlgorithm {
+}
diff -r b29d1a9dfc25 -r dccf1e82152f input/otherbc.2d.input
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/input/otherbc.2d.input Sun Feb 13 19:49:51 2011 -0800
@@ -0,0 +1,137 @@
+/*************************************************************************
+ *
+ * This file is part of the SAMRAI distribution. For full copyright
+ * information, see COPYRIGHT and COPYING.LESSER.
+ *
+ * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
+ * Description: Input file for example FAC Poisson solver
+ *
+ ************************************************************************/
+// This is the input file for the 2D FAC example
+// demonstrating changes in boundary conditions.
+//
+// Note that you should not compare the computed
+// solution with the exact solution in the example.
+// The exact solution is only for the boundary
+// condition of 0 on all boundaries.
+
+Main {
+ dim = 2
+ // Base name for output files.
+ base_name = "otherbc2"
+ // Whether to log all nodes in a parallel run.
+ log_all_nodes = FALSE
+ // Visualization writers to write files for.
+ vis_writer = "Vizamrai", "VisIt"
+}
+
+FACPoisson {
+ // The FACPoisson class is the "user class" in this example.
+ // It owns the solver and contains the code to set up the solver.
+ // The inputs for FACPoisson is simply the inputs for the individual
+ // parts owned by the FACPoisson class.
+ fac_solver {
+ // This is the input for the cell-centered Poisson FAC solver
+ // class in the SAMRAI library.
+ enable_logging = TRUE // Bool flag to switch logging on/off
+ max_cycles = 10 // Max number of FAC cycles to use
+ residual_tol = 1e-8 // Residual tolerance to solve for
+ num_pre_sweeps = 1 // Number of presmoothing sweeps to use
+ num_post_sweeps = 3 // Number of postsmoothing sweeps to use
+ prolongation_method = "LINEAR_REFINE" // Type of refinement
+ // used in prolongation.
+ // Suggested values are
+ // "LINEAR_REFINE"
+ // "CONSTANT_REFINE"
+ use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
+ }
+ bc_coefs {
+ // These are the boundary condition specifications. The number
+ // after "boundary_" is the location index of the boundary.
+ // The inputs are arrays of strings where the first string
+ // indicates the type of values you want to set. "slope" means
+ // boundary slope, "value" means boundary value, and "coefficients"
+ // mean the raw Robin boundary condition coefficients.
+ // The remaining strings are converted into numbers as
+ // appropriate for what boundary condition you specified with
+ // the first string. Other boundary conditions are possible.
+ // see the solv_RobinBcCoefStrategy class.
+ // Examples:
+ // boundary_0 = "slope", "0"
+ // boundary_1 = "coefficients", "0", "0"
+ // boundary_2 = "value", "0"
+ // boundary_3 = "value", "0"
+ boundary_0 = "slope", "0"
+ boundary_1 = "coefficients", "0", "0"
+ boundary_2 = "value", "0"
+ boundary_3 = "value", "0"
+ }
+}
+
+CartesianGridGeometry {
+ // Specify lower/upper corners of the computational domain and a
+ // set of non-overlapping boxes defining domain interior. If union
+ // of boxes is not a parallelpiped, lower/upper corner data corresponds
+ // to min/max corner indices over all boxes given.
+ // x_lo -- (double array) lower corner of computational domain [REQD]
+ // x_up -- (double array) upper corner of computational domain [REQD]
+ // domain_boxes -- (box array) set of boxes that define interior of
+ // hysical domain. [REQD]
+ // periodic_dimension -- (int array) coordinate directions in which
+ // domain is periodic. Zero indicates not
+ // periodic, non-zero value indicates periodicity.
+ // [0]
+ domain_boxes = [(0,0), (31,31)]
+ x_lo = 0, 0
+ x_up = 1, 1
+}
+
+StandardTagAndInitialize {
+ tagging_method = "REFINE_BOXES"
+ RefineBoxes {
+ level_0 = [(0,0),(31,15)]
+ level_1 = [(0,0),(63,15)]
+ level_2 = [(0,0),(16,16)]
+ //etc.
+ }
+}
+
+PatchHierarchy {
+ // Information used to create patches in AMR hierarchy.
+ // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
+ //
+ // For most of the following parameters, the number of precribed data
+ // values need not match the number of levels in the hierarchy
+ // (determined by max_levels). If more values are given than number
+ // of levels, extraneous values will be ignored. If less are give, then
+ // values that correspond to individual levels will apply to those
+ // levels. Missing values will be taken from those for the finest
+ // level specified.
+ //
+ // ratio_to_coarser {
+ // level_1 -- (int array) ratio between index spaces on
+ // level 1 to level 0 [REQD]
+ // level_2 -- (int array) ratio between index spaces on
+ // level 2 to level 1 [REQD]
+ // etc....
+ // }
+ // largest_patch_size {
+ // level_0 -- (int array) largest patch allowed on level 0.
+ // [REQD]
+ // level_1 -- (int array) " " " " level 1
+ // [level 0 entry]
+ // etc....
+ // }
+ max_levels = 3
+ ratio_to_coarser {
+ level_1 = 2, 2
+ level_2 = 2, 2
+ }
+ largest_patch_size {
+ level_0 = 32, 32
+ // all finer levels will use same values as level_0...
+ }
+}
+
+GriddingAlgorithm {
+}
diff -r b29d1a9dfc25 -r dccf1e82152f input/otherbc.3d.input
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/input/otherbc.3d.input Sun Feb 13 19:49:51 2011 -0800
@@ -0,0 +1,137 @@
+/*************************************************************************
+ *
+ * This file is part of the SAMRAI distribution. For full copyright
+ * information, see COPYRIGHT and COPYING.LESSER.
+ *
+ * Copyright: (c) 1997-2010 Lawrence Livermore National Security, LLC
+ * Description: Input file for example FAC Poisson solver
+ *
+ ************************************************************************/
+// This is the input file for the 3D FAC example
+// demonstrating changes in boundary conditions.
+//
+// Note that you should not compare the computed
+// solution with the exact solution in the example.
+// The exact solution is only for the boundary
+// condition of 0 on all boundaries.
+
+Main {
+ dim = 3
+ // Base name for output files.
+ base_name = "otherbc3"
+ // Whether to log all nodes in a parallel run.
+ log_all_nodes = FALSE
+ // Visualization writers to write files for.
+ vis_writer = "Vizamrai", "VisIt"
+}
+
+FACPoisson {
+ // The FACPoisson class is the "user class" in this example.
+ // It owns the solver and contains the code to set up the solver.
+ // The inputs for FACPoisson is simply the inputs for the individual
+ // parts owned by the FACPoisson class.
+ fac_solver {
+ // This is the input for the cell-centered Poisson FAC solver
+ // class in the SAMRAI library.
+ enable_logging = TRUE // Bool flag to switch logging on/off
+ max_cycles = 10 // Max number of FAC cycles to use
+ residual_tol = 1e-8 // Residual tolerance to solve for
+ num_pre_sweeps = 1 // Number of presmoothing sweeps to use
+ num_post_sweeps = 3 // Number of postsmoothing sweeps to use
+ prolongation_method = "LINEAR_REFINE" // Type of refinement
+ // used in prolongation.
+ // Suggested values are
+ // "LINEAR_REFINE"
+ // "CONSTANT_REFINE"
+ use_smg = TRUE // Whether to use HYPRE's SMG instead of PFMG.
+ }
+ bc_coefs {
+ // These are the boundary condition specifications. The number
+ // after "boundary_" is the location index of the boundary.
+ // The inputs are arrays of strings where the first string
+ // indicates the type of values you want to set. "slope" means
+ // boundary slope, "value" means boundary value, and "coefficients"
+ // mean the raw Robin boundary condition coefficients.
+ // The remaining strings are converted into numbers as
+ // appropriate for what boundary condition you specified with
+ // the first string. Other boundary conditions are possible.
+ // see the solv_RobinBcCoefStrategy class.
+ // Examples:
+ // boundary_0 = "slope", "0"
+ // boundary_1 = "coefficients", "0", "0"
+ // boundary_2 = "value", "0"
+ // boundary_3 = "value", "0"
+ boundary_0 = "slope", "0"
+ boundary_1 = "coefficients", "0", "0"
+ boundary_2 = "value", "0"
+ boundary_3 = "value", "0"
+ boundary_4 = "value", "0"
+ boundary_5 = "value", "0"
+ }
+}
+
+CartesianGridGeometry {
+ // Specify lower/upper corners of the computational domain and a
+ // set of non-overlapping boxes defining domain interior. If union
+ // of boxes is not a parallelpiped, lower/upper corner data corresponds
+ // to min/max corner indices over all boxes given.
+ // x_lo -- (double array) lower corner of computational domain [REQD]
+ // x_up -- (double array) upper corner of computational domain [REQD]
+ // domain_boxes -- (box array) set of boxes that define interior of
+ // hysical domain. [REQD]
+ // periodic_dimension -- (int array) coordinate directions in which
+ // domain is periodic. Zero indicates not
+ // periodic, non-zero value indicates periodicity.
+ // [0]
+ domain_boxes = [(0,0,0), (15,15,15)]
+ x_lo = 0, 0, 0
+ x_up = 1, 1, 1
+}
+
+StandardTagAndInitialize {
+ tagging_method = "REFINE_BOXES"
+ RefineBoxes {
+ level_0 = [(0,0,0),(7,7,7)]
+ level_1 = [(0,0,0),(7,7,7)]
+ }
+}
+
+PatchHierarchy {
+ // Information used to create patches in AMR hierarchy.
+ // max_levels -- (int) max number of mesh levels in hierarchy [REQD]
+ //
+ // For most of the following parameters, the number of precribed data
+ // values need not match the number of levels in the hierarchy
+ // (determined by max_levels). If more values are given than number
+ // of levels, extraneous values will be ignored. If less are give, then
+ // values that correspond to individual levels will apply to those
+ // levels. Missing values will be taken from those for the finest
+ // level specified.
+ //
+ // ratio_to_coarser {
+ // level_1 -- (int array) ratio between index spaces on
+ // level 1 to level 0 [REQD]
+ // level_2 -- (int array) ratio between index spaces on
+ // level 2 to level 1 [REQD]
+ // etc....
+ // }
+ // largest_patch_size {
+ // level_0 -- (int array) largest patch allowed on level 0.
+ // [REQD]
+ // level_1 -- (int array) " " " " level 1
+ // [level 0 entry]
+ // etc....
+ // }
+ max_levels = 3
+ ratio_to_coarser {
+ level_1 = 2, 2, 2
+ level_2 = 2, 2, 2
+ }
+ largest_patch_size {
+ level_0 = 32, 32, 32
+ // all finer levels will use same values as level_0...
+ }
+}
+
+GriddingAlgorithm {
+}
More information about the CIG-COMMITS
mailing list