TrioCFD 1.9.8
TrioCFD documentation
Loading...
Searching...
No Matches
Schema_Adams_Bashforth_order_3.h
1/****************************************************************************
2* Copyright (c) 2022, CEA
3* All rights reserved.
4*
5* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
6* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
7* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
8* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
9*
10* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
11* IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
12* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
13*
14*****************************************************************************/
15
16#ifndef Schema_Adams_Bashforth_order_3_included
17#define Schema_Adams_Bashforth_order_3_included
18
19
20#include <Schema_Adams_Bashforth_base.h>
21
22/*! @brief classe Schema_Adams_Bashforth_order_3 Cette classe represente un schema en temps d'Adams-Bashforth d'ordre 3
23 *
24 * a pas de temps variable :
25 * U(n+1) = U(n) + dt*(23/12*(dU/dt)(n)-4/3(dU/dt)(n-1)+5/12(dU/dt)(n-2))
26 * si le pas de temps est constant
27 *
28 * @sa Schema_Temps_base
29 */
31{
32
33 Declare_instanciable(Schema_Adams_Bashforth_order_3);
34
35public :
36
37 int nb_pas_dt_seuil() const override ;
38 int nb_valeurs_passees() const override ;
39 int nb_valeurs_temporelles() const override ;
40
41 void compute_adams_bashforth_coefficients(double time_step, const DoubleTab& times) override ;
42};
43
44#endif
classe Schema_Adams_Bashforth_base
classe Schema_Adams_Bashforth_order_3 Cette classe represente un schema en temps d'Adams-Bashforth d'...
int nb_valeurs_passees() const override
Renvoie le nombre de valeurs temporelles du passe.
int nb_pas_dt_seuil() const override
Renvoie le nombre de pas de temps strictement au dela duquel on applique le schema d Adams-Bahshforth...
int nb_valeurs_temporelles() const override
Renvoie le nombre de valeurs temporelles a conserver.
void compute_adams_bashforth_coefficients(double time_step, const DoubleTab &times) override