Line data Source code
1 : //* This file is part of the MOOSE framework 2 : //* https://mooseframework.inl.gov 3 : //* 4 : //* All rights reserved, see COPYRIGHT for full restrictions 5 : //* https://github.com/idaholab/moose/blob/master/COPYRIGHT 6 : //* 7 : //* Licensed under LGPL 2.1, please see LICENSE for details 8 : //* https://www.gnu.org/licenses/lgpl-2.1.html 9 : 10 : #pragma once 11 : 12 : #include "Steady.h" 13 : #include "AdjointSolve.h" 14 : 15 : // Forward declarations 16 : class InputParameters; 17 : 18 : class SteadyAndAdjoint : public Steady 19 : { 20 : public: 21 : static InputParameters validParams(); 22 : 23 : SteadyAndAdjoint(const InputParameters & parameters); 24 : 25 : /** 26 : * This call is basically a copy from Steady without the AMR loop and with a call to the 27 : * adjoint solver after the fixed point solver 28 : */ 29 : virtual void execute() override; 30 : 31 : /** 32 : * Copy of the functionality from Steady to keep track of whether the latest solve converged 33 : */ 34 9765 : virtual bool lastSolveConverged() const override { return _last_solve_converged; } 35 : 36 : protected: 37 : /// The solver which computes the adjoint system. This is where the real magic happens, 38 : /// so it is recommended to look into this object to understand the algorithm. 39 : AdjointSolve _adjoint_solve; 40 : 41 : private: 42 : bool _last_solve_converged = true; 43 : };