Go to the documentation of this file.
145 int upper_level,
bool calc_lambda);
147 int ndlqr_ComputeShurCompliment(
NdLqrSolver* solver,
int index,
int level,
int upper_level);
Stores info about a Cholesky decomposition.
Definition: linalg.h:53
int ndlqr_UpdateShurFactor(NdData *fact, NdData *soln, int index, int i, int level, int upper_level, bool calc_lambda)
Calculates and to complete the factorization at the current level.
Definition: nested_dissection.c:154
High-level methods for the nsLQR solver.
int ndlqr_FactorInnerProduct(NdData *data, NdData *fact, int index, int data_level, int fact_level)
Calculates one of the inner products needed at level data_level.
Definition: nested_dissection.c:114
The binary tree for the rsLQR solver.
Definition: binary_tree.h:64
Main solver for rsLQR.
Definition: solver.h:114
int ndlqr_SolveCholeskyFactor(NdData *fact, CholeskyInfo *cholinfo, int index, int level, int upper_level)
Use the precomputed Cholesky factorization to solve for y at each parent level.
Definition: nested_dissection.c:136
Core storage container for the rsLQR solver.
Definition: nddata.h:83
bool ndlqr_ShouldCalcLambda(OrderedBinaryTree *tree, int index, int i)
Determines if the should be updated during ndlqr_UpdateSchurFactor()
Definition: nested_dissection.c:173
int ndlqr_SolveLeaf(NdLqrSolver *solver, int index)
Solve all the equations for the lowest-level diagonal blocks, by timestep.
Definition: nested_dissection.c:10