dT                 61 old_code/2015linfty/backup_dune_heat_algo.hpp 	double dT = 
dT                 65 old_code/2015linfty/backup_dune_heat_algo.hpp 	const int itno = (t_end - t_0)/dT + .1;
dT                 90 old_code/2015linfty/backup_dune_heat_algo.hpp 	timeProvider.init(dT);     // Do your first action before you enter the for loop.
dT                152 old_code/2015linfty/backup_dune_heat_algo.hpp 	for(timeProvider.next(dT); iter < itno; timeProvider.next(dT), ++iter)
dT                213 old_code/2015linfty/backup_dune_heat_algo.hpp 	double dT = 
dT                217 old_code/2015linfty/backup_dune_heat_algo.hpp 	const int time_step_no_max = (t_end - t_0)/dT + .1;
dT                242 old_code/2015linfty/backup_dune_heat_algo.hpp 	timeProvider.init(dT);     // Do your first action before you enter the for loop.
dT                307 old_code/2015linfty/backup_dune_heat_algo.hpp 	for(timeProvider.next(dT); time_step_no < time_step_no_max; timeProvider.next(dT), ++time_step_no)
dT                365 old_code/2015linfty/backup_dune_heat_algo.hpp 	double dT = 
dT                369 old_code/2015linfty/backup_dune_heat_algo.hpp 	const int itno = (t_end - t_0)/dT + .1;
dT                400 old_code/2015linfty/backup_dune_heat_algo.hpp 	timeProvider.init(dT);     // Do your first action before you enter the for loop.
dT                469 old_code/2015linfty/backup_dune_heat_algo.hpp 		++i, ++iter, timeProvider.next(dT)){
dT                538 old_code/2015linfty/backup_dune_heat_algo.hpp 		timeProvider.next(dT), ++iter)
dT                 62 old_code/2015linfty/dune_heat_algorithm.hpp   double dT = 
dT                 66 old_code/2015linfty/dune_heat_algorithm.hpp   const int time_step_no_max = (t_end - t_0)/dT + .1;
dT                179 old_code/2015linfty/dune_heat_algorithm.hpp   timeProvider.init(dT);     // Do your first action before you enter the for loop.
dT                188 old_code/2015linfty/dune_heat_algorithm.hpp       ++time_step_no, timeProvider.next(dT)){
dT                218 old_code/2015linfty/dune_heat_algorithm.hpp       timeProvider.next(dT), ++time_step_no){
dT                 61 old_code/tumor_growth/tumor_code.h   double dT = 
dT                 65 old_code/tumor_growth/tumor_code.h   const int time_step_no_max = (t_end - t_0)/dT + .1;
dT                178 old_code/tumor_growth/tumor_code.h   timeProvider.init(dT);     // Do your first action before you enter the for loop.
dT                187 old_code/tumor_growth/tumor_code.h       ++time_step_no, timeProvider.next(dT)){
dT                217 old_code/tumor_growth/tumor_code.h       timeProvider.next(dT), ++time_step_no){
dT                383 old_code/tumor_growth/tumor_code.h   double dT = 
dT                387 old_code/tumor_growth/tumor_code.h   const int time_step_no_max = (t_end - t_0)/dT + .1;
dT                472 old_code/tumor_growth/tumor_code.h   const Tumor_Brusselator_model u_model {dT, gamma, a, Growth::promoting};
dT                473 old_code/tumor_growth/tumor_code.h   const Tumor_Brusselator_model w_model {dT, gamma, b, Growth::inhibiting, dc};
dT                516 old_code/tumor_growth/tumor_code.h   timeProvider.init(dT);     // Do your first action before you enter the for-loop.
dT                533 old_code/tumor_growth/tumor_code.h       timeProvider.next(dT), ++time_step_no){
dT                371 src/brusselator_algo.cpp   const auto dT = fix_grid.time_provider().deltaT();
dT                373 src/brusselator_algo.cpp   io.u << dT << '\t'
dT                376 src/brusselator_algo.cpp   io.w << dT << '\t'
dT                380 src/brusselator_algo.cpp   io.surface << dT << '\t'
dT                386 src/brusselator_algo.cpp   io.velocity << dT << '\t'
dT                439 src/brusselator_algo.h       const double dT = fix_grid.time_provider().deltaT();
dT                441 src/brusselator_algo.h 	*v_first = (*xn_first - *xo_first)/dT;
dT                112 src/grid_GridAndTime.cpp void Esfem::Grid::Grid_and_time::next_timeStep(const double dT){
dT                113 src/grid_GridAndTime.cpp   d_ptr -> tp.next(dT);
dT                 36 src/io_parameter.cpp   const double dT;
dT                 64 src/io_parameter.cpp   dT {Dune::Fem::Parameter::getValue<double>("heat.timestep",0.1)},
dT                100 src/io_parameter.cpp     ( dT > eps, Assert::compose(__FILE__, __LINE__, "Time step too small."));
dT                173 src/io_parameter.cpp   return d_ptr -> dT;
dT                178 src/io_parameter.cpp   return (t_n - t_0)/d_ptr->dT + .1;
dT                183 src/io_parameter.cpp   return (t_n - t_0)/d_ptr->dT + .1;
dT                188 src/io_parameter.cpp   return (t_n - t_0)/d_ptr->dT; // may narrow
dT                247 src/io_parameter.cpp      << "dT: " << p->dT << '\n'
dT                113 src/secOrd_op_brusselator_impl.cpp   const auto dT = gt.time_provider().deltaT();
dT                116 src/secOrd_op_brusselator_impl.cpp     massMatrix_lhs = 1 + dT * p.tg_gamma();
dT                117 src/secOrd_op_brusselator_impl.cpp     stiffnessMatrix_lhs = dT;
dT                118 src/secOrd_op_brusselator_impl.cpp     quadMassMatrix_lhs = (-1) * dT * p.tg_gamma();
dT                119 src/secOrd_op_brusselator_impl.cpp     massMatrix_rhs = dT * p.tg_gamma() * p.tg_a(); 
dT                123 src/secOrd_op_brusselator_impl.cpp     stiffnessMatrix_lhs = dT * p.tg_Dc();
dT                124 src/secOrd_op_brusselator_impl.cpp     quadMassMatrix_lhs = dT * p.tg_gamma();
dT                125 src/secOrd_op_brusselator_impl.cpp     massMatrix_rhs = dT * p.tg_gamma() * p.tg_b(); 
dT                 53 src/secOrd_op_linearHeat.cpp void matrixFree_assembly(const double dT, const Geometry&, const Quadrature&,
dT                165 src/secOrd_op_linearHeat.cpp void matrixFree_assembly(const double dT, const Geometry& g,
dT                181 src/secOrd_op_linearHeat.cpp     Au *= dT * weight;