blob: b1251ca5cf552b647f509470daf23a1cb077d3a6 [file] [log] [blame]
Austin Schuh70cc9552019-01-21 19:46:48 -08001// Ceres Solver - A fast non-linear least squares minimizer
2// Copyright 2015 Google Inc. All rights reserved.
3// http://ceres-solver.org/
4//
5// Redistribution and use in source and binary forms, with or without
6// modification, are permitted provided that the following conditions are met:
7//
8// * Redistributions of source code must retain the above copyright notice,
9// this list of conditions and the following disclaimer.
10// * Redistributions in binary form must reproduce the above copyright notice,
11// this list of conditions and the following disclaimer in the documentation
12// and/or other materials provided with the distribution.
13// * Neither the name of Google Inc. nor the names of its contributors may be
14// used to endorse or promote products derived from this software without
15// specific prior written permission.
16//
17// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27// POSSIBILITY OF SUCH DAMAGE.
28//
29// Author: keir@google.com (Keir Mierle)
30//
31// A jacobian writer that directly writes to compressed row sparse matrices.
32
33#ifndef CERES_INTERNAL_COMPRESSED_ROW_JACOBIAN_WRITER_H_
34#define CERES_INTERNAL_COMPRESSED_ROW_JACOBIAN_WRITER_H_
35
36#include <utility>
37#include <vector>
38
39#include "ceres/evaluator.h"
40#include "ceres/scratch_evaluate_preparer.h"
41
42namespace ceres {
43namespace internal {
44
45class CompressedRowSparseMatrix;
46class Program;
47class SparseMatrix;
48
49class CompressedRowJacobianWriter {
50 public:
51 CompressedRowJacobianWriter(Evaluator::Options /* ignored */,
52 Program* program)
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080053 : program_(program) {}
Austin Schuh70cc9552019-01-21 19:46:48 -080054
55 // PopulateJacobianRowAndColumnBlockVectors sets col_blocks and
56 // row_blocks for a CompressedRowSparseMatrix, based on the
57 // parameter block sizes and residual sizes respectively from the
58 // program. This is useful when Solver::Options::use_block_amd =
59 // true;
60 //
61 // This function is static so that it is available to other jacobian
62 // writers which use CompressedRowSparseMatrix (or derived types).
63 // (Jacobian writers do not fall under any type hierarchy; they only
64 // have to provide an interface as specified in program_evaluator.h).
65 static void PopulateJacobianRowAndColumnBlockVectors(
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080066 const Program* program, CompressedRowSparseMatrix* jacobian);
Austin Schuh70cc9552019-01-21 19:46:48 -080067
68 // It is necessary to determine the order of the jacobian blocks
69 // before copying them into a CompressedRowSparseMatrix (or derived
70 // type). Just because a cost function uses parameter blocks 1
71 // after 2 in its arguments does not mean that the block 1 occurs
72 // before block 2 in the column layout of the jacobian. Thus,
73 // GetOrderedParameterBlocks determines the order by sorting the
74 // jacobian blocks by their position in the state vector.
75 //
76 // This function is static so that it is available to other jacobian
77 // writers which use CompressedRowSparseMatrix (or derived types).
78 // (Jacobian writers do not fall under any type hierarchy; they only
79 // have to provide an interface as specified in
80 // program_evaluator.h).
81 static void GetOrderedParameterBlocks(
82 const Program* program,
83 int residual_id,
84 std::vector<std::pair<int, int>>* evaluated_jacobian_blocks);
85
86 // JacobianWriter interface.
87
88 // Since the compressed row matrix has different layout than that
89 // assumed by the cost functions, use scratch space to store the
90 // jacobians temporarily then copy them over to the larger jacobian
91 // in the Write() function.
92 ScratchEvaluatePreparer* CreateEvaluatePreparers(int num_threads) {
93 return ScratchEvaluatePreparer::Create(*program_, num_threads);
94 }
95
96 SparseMatrix* CreateJacobian() const;
97
98 void Write(int residual_id,
99 int residual_offset,
Austin Schuh1d1e6ea2020-12-23 21:56:30 -0800100 double** jacobians,
Austin Schuh70cc9552019-01-21 19:46:48 -0800101 SparseMatrix* base_jacobian);
102
103 private:
104 Program* program_;
105};
106
107} // namespace internal
108} // namespace ceres
109
110#endif // CERES_INTERNAL_COMPRESSED_ROW_JACOBIAN_WRITER_H_