newton_solver.h

Go to the documentation of this file.

// SPDX-FileCopyrightText: © 2025 PRISMS Center at the University of Michigan
// SPDX-License-Identifier: GNU Lesser General Public Version 2.1
 
#pragma once
 
#include <deal.II/lac/affine_constraints.h>
#include <deal.II/lac/solver_cg.h>
 
#include <prismspf/core/group_solution_handler.h>
#include <prismspf/core/types.h>
 
#include <prismspf/solvers/linear_solver.h>
#include <prismspf/solvers/mf_operator.h>
#include <prismspf/solvers/solver_base.h>
 
#include <prismspf/config.h>
 
PRISMS_PF_BEGIN_NAMESPACE
 
template <unsigned int dim, unsigned int degree, typename number>
class SolveContext;

template <unsigned int dim, unsigned int degree, typename number>
class NewtonSolver : public LinearSolver<dim, degree, number>
{
protected:
  using SolverBase<dim, degree, number>::solutions;
  using SolverBase<dim, degree, number>::solve_context;
  using SolverBase<dim, degree, number>::solve_block;
  using LinearSolver<dim, degree, number>::do_linear_solve;
  using LinearSolver<dim, degree, number>::normalization_value;
  using LinearSolver<dim, degree, number>::lhs_operator;
  using LinearSolver<dim, degree, number>::rhs_operator;
  using LinearSolver<dim, degree, number>::rhs_vector;
 
public:
  NewtonSolver(SolveBlock                               _solve_block,
               const SolveContext<dim, degree, number> &_solve_context)
    : LinearSolver<dim, degree, number>(_solve_block, _solve_context)
  {}

  void
  init(const std::list<SolveBlock> &all_solve_blocks) override
  {
    LinearSolver<dim, degree, number>::init(all_solve_blocks);
    newton_update.reinit(solutions.get_solution_full_vector());
  }

  void
  reinit() override
  {
    LinearSolver<dim, degree, number>::reinit();
    newton_update.reinit(solutions.get_solution_full_vector());
  }

  void
  solve_impl() override
  {
    const number newton_step_length = newton_params().step_length;
    const number newton_tolerance =
      newton_params().tolerance_value * normalization_value();
    unsigned int newton_max_iterations = newton_params().max_iterations;
 
    BlockVector<number>             &newton_residual = rhs_vector;
    MFOperator<dim, degree, number> &rhs_op          = rhs_operator;
    MFOperator<dim, degree, number> &lhs_op          = lhs_operator;
    // TODO: setup initial guess for solution vector. Maybe use old_solution if
    // available.
    if (!solutions.get_primary_solutions().old_solutions.empty())
      {
        solutions.get_solution_full_vector() = solutions.get_old_solution_full_vector(0);
      }
 
    // Newton iteration loop.
    bool         newton_unconverged = true;
    unsigned int iter               = 0;
    number       l2_norm            = -1.0;
    int          total_lin_iters    = 0;
    while (newton_unconverged && iter < newton_max_iterations)
      {
        // Apply constraints to solution vector
        solutions.apply_constraints();
        solutions.update_ghosts();
 
        // Solve for Newton-residual (r)
        Timer::start_section("Zero ghosts");
        newton_residual.zero_out_ghost_values();
        Timer::end_section("Zero ghosts");
        rhs_op.compute_operator(newton_residual);
        newton_residual.update_ghost_values();
 
        // Check convergence.
        l2_norm            = newton_residual.l2_norm();
        newton_unconverged = l2_norm > newton_tolerance;
        if (!newton_unconverged || iter == newton_max_iterations)
          {
            continue;
          }
 
        // Solve for Newton update. (-dr/du|Du)
        if (solutions.num_levels() > 1)
          {
            solutions.mg_transfer_down(
              solve_context->get_dof_manager(),
              solve_context->get_user_inputs().spatial_discretization.global_refinement,
              false);
          }
        total_lin_iters += do_linear_solve(newton_residual, lhs_op, newton_update);
        newton_update.update_ghost_values();
 
        // Zero out the ghosts
        solutions.get_solution_full_vector().zero_out_ghost_values();
 
        // Perform Newton update.
        solutions.get_solution_full_vector().add(newton_step_length, newton_update);
 
        // Update the ghosts
        Timer::start_section("Update ghosts");
        solutions.update_ghosts();
        Timer::end_section("Update ghosts");
 
        iter++;
        // Todo: implement some super simple backtracking. Something like if the residual
        // increases instead of decreasing, try again with a smaller step length.
      }
    if (solve_context->get_user_inputs().output_parameters.should_output(
          solve_context->get_simulation_timer().get_increment()))
      {
        ConditionalOStreams::pout_summary()
          << " Newton solve final residual : " << l2_norm / normalization_value()
          << " Newton steps: " << iter << " Total linear steps: " << total_lin_iters
          << "\n"
          << std::flush;
      }
    if (iter >= newton_max_iterations)
      {
        ConditionalOStreams::pout_base()
          << "[Increment " << solve_context->get_simulation_timer().get_increment()
          << "] "
          << "Warning: Newton solver did not converge before " << newton_max_iterations
          << " iterations.\n\n";
      }
  }
 
private:
  BlockVector<number> newton_update; //"change" term
 
  [[nodiscard]] const NonlinearSolverParameters &
  newton_params() const
  {
    return solve_block.nonlinear_solver_parameters;
  };
};
 
PRISMS_PF_END_NAMESPACE