Lines Matching full:blocks
63 // Callback for updating the user's parameter blocks. Updates are only
322 << " parameter blocks, "
326 << " residual blocks, "
363 summary->error = "Problem contains no parameter blocks.";
369 summary->error = "Problem contains no residual blocks.";
485 << "No non-constant parameter blocks found.";
734 summary->error = "Problem contains no parameter blocks.";
740 summary->error = "Problem contains no residual blocks.";
829 << "No non-constant parameter blocks found.";
912 *error = "Number of parameter blocks in user supplied ordering "
913 "does not match the number of parameter blocks in the problem";
949 // blocks in the same residual block are part of
987 // blocks for the marking.
993 // parameter blocks that appear in residuals.
1025 "removal of fixed residual blocks.", i);
1034 // Filter out unused or fixed parameter blocks, and update
1084 << " parameter blocks, "
1088 << " residual blocks, "
1093 LOG(WARNING) << "No varying parameter blocks to optimize; "
1103 // parameter blocks which are fixed or unused have been removed from
1104 // the program and the ordering, there are no more parameter blocks
1272 // dummy elimination group with zero blocks in it.
1283 // Parameter blocks that have indices greater than num_eliminate_blocks are
1303 // Schur eliminator, which works on these "row blocks" in the jacobian.
1313 // extra bucket at the end to catch all non-eliminated F blocks.
1342 // Fill in each bucket with the residual blocks for its corresponding E block.
1345 // residual blocks. This loop uses the offsets as counters; subtracting one
1499 "has %d blocks while the ordering has %d blocks.",
1669 // Schur type solvers also require that their residual blocks be
