Block partitioning

Jump to: navigation, search
This article is incomplete or needs expanding. Please help out by adding your comments.

Block partitioning in ASCEND is the process by which large systems of equations, are divided into smaller blocks that can then sequentially be solved as smaller sub-problems in the QRSlv solver. Block partitioning essentially requires re-ordering the relations and variables such that the Jacobian matrix is as close as possible to lower-triangular form.

See Incidence matrix for some graphical examples.