9#include <deal.II/lac/vector.h>
40 const std::vector<double> &time_steps);
68delta(
unsigned int order,
71 const Vector<double> ×);
131template <
typename DataType>
134 const std::vector<std::vector<DataType>> &solution_vector,
136 std::vector<DataType> &extrapolated_solution)
142 for (
unsigned int q = 0; q < extrapolated_solution.size(); ++q)
143 extrapolated_solution[q] = solution_vector[0][q];
148 for (
unsigned int q = 0; q < extrapolated_solution.size(); ++q)
151 extrapolated_solution[q] = 0;
165 factor *= (time_vector[0] - time_vector[k + 1]) /
166 (time_vector[p + 1] - time_vector[k + 1]);
171 extrapolated_solution[q] += solution_vector[p][q] * factor;
unsigned int maximum_number_of_previous_solutions()
Get the maximum number of previous time steps supposed by the BDF schemes implemented in Lethe.
void bdf_extrapolate(const std::vector< double > &time_vector, const std::vector< std::vector< DataType > > &solution_vector, const unsigned int number_of_previous_solutions, std::vector< DataType > &extrapolated_solution)
Extrapolate vector of solution to time_vector[0] using previous solution times and previous solutions...
Vector< double > calculate_bdf_coefficients(Parameters::SimulationControl::TimeSteppingMethod method, const std::vector< double > &time_steps)
Calculate the coefficients required for backward differentiation formula (BDF) integration of order .
unsigned int number_of_previous_solutions(const Parameters::SimulationControl::TimeSteppingMethod method)
Get the number of previous time steps for a specific BDF scheme.
Vector< double > delta(unsigned int order, unsigned int n, unsigned int j, const Vector< double > ×)
Recursive function for calculating the order divided differences ( ) that is used for calculating ba...