Changes between Version 12 and Version 13 of doc/app/stg_par


Ignore:
Timestamp:
Aug 25, 2020 6:06:17 AM (5 years ago)
Author:
raasch
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • doc/app/stg_par

    v12 v13  
    1414|----------------
    1515{{{#!td style="vertical-align:top"
     16[=#compute_velocity_seeds_local '''compute_velocity_seeds_local''']
     17}}}
     18{{{#!td style="vertical-align:top"
     19L
     20}}}
     21{{{#!td style="vertical-align:top"
     22.F.
     23}}}
     24{{{#!td
     25Flag to control the computation of velocity seeds that are the basis of the imposed disturbances.
     26If .FALSE., the computation of the seeds at the boundary is
     27distributed to all processes along the respective 1D communicator. Subsequently, seeds are gathered on the respective boundary process.
     28This option is especially useful for large length scales where the computational effort can become quite huge (it scales with the turbulent length scales), so that gain by parallelization exceeds the costs by the subsequent communication.
     29
     30If .TRUE., velocity seeds are computed only locally and no communication is necessary. This performs better when the turbulent length scales are small and thus the loops are smaller.
     31}}}
     32|----------------
     33{{{#!td style="vertical-align:top"
    1634[=#dt_stg_adjust '''dt_stg_adjust''']
    1735}}}
     
    2038}}}
    2139{{{#!td style="vertical-align:top"
    22 1800
     401800.0
    2341}}}
    2442{{{#!td
     
    5371Using turbulence recycling ([../initialization_parameters#turbulent_inflow turbulent_inflow]=.T.) together with the synthetic turbulence generator is not allowed.
    5472}}}
    55 |----------------
    56 {{{#!td style="vertical-align:top"
    57 [=#compute_velocity_seeds_local '''compute_velocity_seeds_local''']
    58 }}}
    59 {{{#!td style="vertical-align:top"
    60 L
    61 }}}
    62 {{{#!td style="vertical-align:top"
    63 .F.
    64 }}}
    65 {{{#!td
    66 Flag to control the computation of velocity seeds that are the basis of the imposed disturbances.
    67 If .FALSE., the computation of the seeds at the boundary is
    68 distributed to all processes along the respective 1D communicator. Subsequently, seeds are gathered on the respective boundary process.
    69 This option is especially useful for large length scales where the computational effort can become quite huge (it scales with the turbulent length scales), so that gain by parallelization exceeds the costs by the subsequent communication.
    70 
    71 If .TRUE., velocity seeds are computed only locally and no communication is necessary. This performs better when the turbulent length scales are small and thus the loops are smaller.
    72 }}}