Class xlifepp::ReductionMethod#

class ReductionMethod#

Collaboration diagram for xlifepp::ReductionMethod:

digraph { graph [bgcolor="#00000000"] node [shape=rectangle style=filled fillcolor="#FFFFFF" font=Helvetica padding=2] edge [color="#1414CE"] "1" [label="xlifepp::ReductionMethod" tooltip="xlifepp::ReductionMethod" fillcolor="#BFBFBF"] }

handling constraints reduction method information when dealing with essential conditions (constraints), several methods are available

  • pseudo reduction

  • full reduction

  • penalization

  • duality (not yet available)

pseudo-reduction is the full reduction method where eliminated row are replaced by the constraints matrix C: | beta*I + alpha*C | eliminated rows Ap= | | | 0 Ae | default is alpha=1 and beta=0, good choice when solving a problem choose alpha=0 and beta!=0 when dealing with eigenvalue problem

Public Members

complex_t alpha#

diagonal or penalization coefficient

complex_t beta#

additional penalization coefficient

ReductionMethodType method#

type of reduction method

On this page