SchurComplement

Source: solvers/schur_complement.py

Schur complement linear solver. Solves a block-partitioned system A x = b by forming and solving the Schur complement of the primary block.

The six-step factorisation reads naturally on top of the Tensor-backed AssembledMatrix / AssembledVector arithmetic – A_pp.solve(...), A_sp @ Y, A_ss - A_sp @ Y all forward to the typed primitive.

Other options

residual_primary_groupint · default 0

Row (residual) group index of the primary block. The system must have exactly 2 residual groups; the other group is automatically the Schur complement residual group.

unknown_primary_groupint · default 0

Column (unknown) group index of the primary block. The system must have exactly 2 unknown groups; the other group is automatically the Schur complement unknown group.

primary_solverstr · required

Linear solver used for the primary block A_pp

schur_solverstr · required

Linear solver used for the Schur complement block S