Loading [MathJax]/extensions/tex2jax.js
Plugins
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
linear_implicit_timestep.h
Go to the documentation of this file.
1/*
2 * SPDX-FileCopyrightText: Copyright (c) 2014-2025: G-CSC, Goethe University Frankfurt
3 * SPDX-License-Identifier: LicenseRef-UG4-LGPL-3.0
4 *
5 * Author: Arne Naegel
6 *
7 * This file is part of UG4.
8 *
9 * UG4 is free software: you can redistribute it and/or modify it under the
10 * terms of the GNU Lesser General Public License version 3 (as published by the
11 * Free Software Foundation) with the following additional attribution
12 * requirements (according to LGPL/GPL v3 §7):
13 *
14 * (1) The following notice must be displayed in the Appropriate Legal Notices
15 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
16 *
17 * (2) The following notice must be displayed at a prominent place in the
18 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
19 *
20 * (3) The following bibliography is recommended for citation and must be
21 * preserved in all covered files:
22 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
23 * parallel geometric multigrid solver on hierarchically distributed grids.
24 * Computing and visualization in science 16, 4 (2013), 151-164"
25 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
26 * flexible software system for simulating pde based models on high performance
27 * computers. Computing and visualization in science 16, 4 (2013), 165-179"
28 *
29 * This program is distributed in the hope that it will be useful,
30 * but WITHOUT ANY WARRANTY; without even the implied warranty of
31 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
32 * GNU Lesser General Public License for more details.
33 */
34
35#ifndef LIMEX_H_
36#define LIMEX_H_
37
38// extern libraries
39#include <vector>
40#include <cmath>
41
42// ug libraries
43#include "common/common.h"
45
50
53
54namespace ug{
55
59
71template <class TAlgebra>
73: public ITimeDiscretization<TAlgebra>,
74 public DebugWritingObject<TAlgebra>
75
76{
77public:
80
82 typedef TAlgebra algebra_type;
83
85 typedef typename algebra_type::matrix_type matrix_type;
86
88 typedef typename algebra_type::vector_type vector_type;
89
92
93public:
104
116
129
132
133public:
135 virtual size_t num_prev_steps() const {return m_prevSteps;}
136
139 number dt);
140
143 number dt, const GridLevel& gl);
144
147
150 const GridLevel& gl);
151
152 virtual number future_time() const {return m_futureTime;}
153
154public:
155
157 void assemble_jacobian(matrix_type& J, const vector_type& u, const GridLevel& gl);
158
160 void assemble_defect(vector_type& d, const vector_type& u, const GridLevel& gl);
161
163 void assemble_linear(matrix_type& A, vector_type& b, const GridLevel& gl);
164
165 void assemble_rhs(vector_type& b, const vector_type& u, const GridLevel& gl);
166
167 void assemble_rhs(vector_type& b, const GridLevel& gl);
168
169 void adjust_solution(vector_type& u, const GridLevel& gl);
170
171 virtual size_t num_stages() const {return 1;};
172 virtual void set_stage(size_t stage) {};
173
174
178 bool use_linear_mode() const { return m_useLinearMode; }
179
182 void set_matrix_cache(bool useCache) { m_useCachedMatrices = useCache; }
183
184protected:
185
186 virtual number update_scaling(std::vector<number>& vSM,
187 std::vector<number>& vSA,
188 number dt, number currentTime,
190
191 {
192 // resize scaling factors
193 vSM.resize(1);
194 vSM[0] = 1.0;
195
196 vSA.resize(1);
197 vSA[0] = dt;
198
199 return currentTime + dt;
200 }
201
202 static const size_t m_prevSteps=1;
203 std::vector<number> m_vScaleMass;
204 std::vector<number> m_vScaleStiff;
205
209
210 // discretization for defect
212
213
214 // constant matrix $$ \tau J$$
219
220 // Matrix: $\Gamma[u0, u0']$
224
226
228
229public:
230
233 {
237 }
238
242
245
246 using DebugWritingObject<TAlgebra>::set_debug;
247
248protected:
249 using DebugWritingObject<TAlgebra>::write_debug;
250 using DebugWritingObject<TAlgebra>::debug_writer;
251
252};
253
254// end group limex
256
257} // namespace ug
258#endif
virtual void set_debug(SmartPtr< IDebugWriter< algebra_type > > spDebugWriter)
void write_debug(const matrix_type &mat, const char *filename)
SmartPtr< IDebugWriter< algebra_type > > debug_writer()
SmartPtr< IDomainDiscretization< TAlgebra > > m_spDomDisc
Definition linear_implicit_timestep.h:76
ITimeDiscretization< TAlgebra > base_type
Type of base class.
Definition linear_implicit_timestep.h:79
static const size_t m_prevSteps
number of previous steps needed.
Definition linear_implicit_timestep.h:202
void disable_linear_mode()
Definition linear_implicit_timestep.h:177
void assemble_jacobian(matrix_type &J, const vector_type &u, const GridLevel &gl)
Meant to assemble J(u) c = d(u), but abused here... (u not used!)
Definition linear_implicit_timestep.cpp:197
virtual number future_time() const
Definition linear_implicit_timestep.h:152
SmartPtr< AssembledLinearOperator< algebra_type > > m_spGammaOp
Gamma operator.
Definition linear_implicit_timestep.h:222
algebra_type::vector_type vector_type
Type of algebra vector.
Definition linear_implicit_timestep.h:88
SmartPtr< matrix_type > m_spMatrixCacheMk
Definition linear_implicit_timestep.h:225
bool use_linear_mode() const
Definition linear_implicit_timestep.h:178
SmartPtr< IDomainDiscretization< algebra_type > > m_spMatrixJDisc
Definition linear_implicit_timestep.h:215
TAlgebra algebra_type
Type of algebra.
Definition linear_implicit_timestep.h:82
LinearImplicitEuler(SmartPtr< IDomainDiscretization< algebra_type > > spDD)
CTOR.
Definition linear_implicit_timestep.h:95
std::vector< number > m_vScaleMass
Scaling for mass part.
Definition linear_implicit_timestep.h:203
void enable_linear_mode()
Some simplifications for linear systems. (In this case, the mass matrix is not re-assembled....
Definition linear_implicit_timestep.h:176
LinearImplicitEuler(SmartPtr< IDomainDiscretization< algebra_type > > spDefectDisc, SmartPtr< IDomainDiscretization< algebra_type > > spMatrixJDisc, SmartPtr< IDomainDiscretization< algebra_type > > spGammaDisc)
CTOR.
Definition linear_implicit_timestep.h:118
IDomainDiscretization< algebra_type > domain_discretization_type
Domain Discretization type.
Definition linear_implicit_timestep.h:91
virtual size_t num_prev_steps() const
Definition linear_implicit_timestep.h:135
virtual ~LinearImplicitEuler()
DTOR.
Definition linear_implicit_timestep.h:131
bool m_bMatrixJNeedsUpdate
Definition linear_implicit_timestep.h:217
virtual void set_stage(size_t stage)
Definition linear_implicit_timestep.h:172
bool m_useCachedMatrices
Definition linear_implicit_timestep.h:227
SmartPtr< IDomainDiscretization< algebra_type > > m_spGammaDisc
Gamma disc.
Definition linear_implicit_timestep.h:221
void set_gamma_disc(SmartPtr< IDomainDiscretization< algebra_type > > spGammaDisc)
Definition linear_implicit_timestep.h:243
void assemble_linear(matrix_type &A, vector_type &b, const GridLevel &gl)
Should return (M+tau A) delta = tau f.
Definition linear_implicit_timestep.cpp:382
number m_futureTime
Future Time.
Definition linear_implicit_timestep.h:208
void set_matrix_cache(bool useCache)
Definition linear_implicit_timestep.h:182
SmartPtr< AssembledLinearOperator< algebra_type > > m_spMatrixJOp
Operator.
Definition linear_implicit_timestep.h:216
void adjust_solution(vector_type &u, const GridLevel &gl)
Definition linear_implicit_timestep.cpp:149
virtual void prepare_step(SmartPtr< VectorTimeSeries< vector_type > > prevSol, number dt)
Definition linear_implicit_timestep.cpp:52
void assemble_defect(vector_type &d, const vector_type &u, const GridLevel &gl)
Meant to assemble d(u), but abused here... (u not used!)
Definition linear_implicit_timestep.cpp:307
LinearImplicitEuler(SmartPtr< IDomainDiscretization< algebra_type > > spDefectDisc, SmartPtr< IDomainDiscretization< algebra_type > > spMatrixJDisc)
CTOR.
Definition linear_implicit_timestep.h:106
void invalidate()
Invalidate all cached operators.
Definition linear_implicit_timestep.h:232
bool m_useLinearMode
Definition linear_implicit_timestep.h:218
virtual void finish_step(SmartPtr< VectorTimeSeries< vector_type > > currSol)
Definition linear_implicit_timestep.h:146
algebra_type::matrix_type matrix_type
Type of algebra matrix.
Definition linear_implicit_timestep.h:85
number m_dt
Time Step size.
Definition linear_implicit_timestep.h:207
virtual void finish_step_elem(SmartPtr< VectorTimeSeries< vector_type > > currSol, const GridLevel &gl)
Definition linear_implicit_timestep.cpp:165
virtual size_t num_stages() const
Definition linear_implicit_timestep.h:171
virtual void prepare_step_elem(SmartPtr< VectorTimeSeries< vector_type > > prevSol, number dt, const GridLevel &gl)
Definition linear_implicit_timestep.cpp:104
SmartPtr< VectorTimeSeries< vector_type > > m_pPrevSol
Previous solutions.
Definition linear_implicit_timestep.h:206
void disable_matrix_cache()
Definition linear_implicit_timestep.h:181
void assemble_rhs(vector_type &b, const vector_type &u, const GridLevel &gl)
Definition linear_implicit_timestep.cpp:356
void invalidate_gamma()
Invalidate Gamma operator.
Definition linear_implicit_timestep.h:240
virtual number update_scaling(std::vector< number > &vSM, std::vector< number > &vSA, number dt, number currentTime, ConstSmartPtr< VectorTimeSeries< vector_type > > prevSol)
Definition linear_implicit_timestep.h:186
void enable_matrix_cache()
Definition linear_implicit_timestep.h:180
std::vector< number > m_vScaleStiff
Scaling for stiffness part.
Definition linear_implicit_timestep.h:204
bool m_bGammaNeedsUpdate
Definition linear_implicit_timestep.h:223
const NullSmartPtr SPNULL
double number