Reference documentation for deal.II version GIT b206511199 2023-01-31 13:40:02+00:00

#include <deal.II/lac/solver_bicgstab.h>

## Public Member Functions

AdditionalData (const bool exact_residual=true, const double breakdown=std::numeric_limits< typename VectorType::value_type >::min())

## Public Attributes

bool exact_residual

double breakdown

## Detailed Description

### template<typename VectorType = Vector<double>> struct SolverBicgstab< VectorType >::AdditionalData

There are two possibilities to compute the residual: one is an estimate using the computed value tau. The other is exact computation using another matrix vector multiplication. This increases the costs of the algorithm, so it is should be set to false whenever the problem allows it.

Bicgstab is susceptible to breakdowns, so we need a parameter telling us, which numbers are considered zero.

Definition at line 92 of file solver_bicgstab.h.

## Constructor & Destructor Documentation

template<typename VectorType = Vector<double>>
 SolverBicgstab< VectorType >::AdditionalData::AdditionalData ( const bool exact_residual = true, const double breakdown = std::numeric_limits::min() )
inlineexplicit

Constructor.

The default is to perform an exact residual computation and breakdown parameter is the minimum finite value representable by the value_type of VectorType.

Definition at line 101 of file solver_bicgstab.h.

## ◆ exact_residual

template<typename VectorType = Vector<double>>

Flag for exact computation of residual.

Definition at line 111 of file solver_bicgstab.h.

## ◆ breakdown

template<typename VectorType = Vector<double>>