blob: 6fc40e9464f96f119fb0f5da4a28afa535bdc119 [file] [log] [blame]
Austin Schuh70cc9552019-01-21 19:46:48 -08001// Ceres Solver - A fast non-linear least squares minimizer
Austin Schuh3de38b02024-06-25 18:25:10 -07002// Copyright 2023 Google Inc. All rights reserved.
Austin Schuh70cc9552019-01-21 19:46:48 -08003// 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
Austin Schuh3de38b02024-06-25 18:25:10 -070036#include <memory>
Austin Schuh70cc9552019-01-21 19:46:48 -080037#include <utility>
38#include <vector>
39
40#include "ceres/evaluator.h"
Austin Schuh3de38b02024-06-25 18:25:10 -070041#include "ceres/internal/export.h"
Austin Schuh70cc9552019-01-21 19:46:48 -080042#include "ceres/scratch_evaluate_preparer.h"
43
Austin Schuh3de38b02024-06-25 18:25:10 -070044namespace ceres::internal {
Austin Schuh70cc9552019-01-21 19:46:48 -080045
46class CompressedRowSparseMatrix;
47class Program;
48class SparseMatrix;
49
Austin Schuh3de38b02024-06-25 18:25:10 -070050class CERES_NO_EXPORT CompressedRowJacobianWriter {
Austin Schuh70cc9552019-01-21 19:46:48 -080051 public:
52 CompressedRowJacobianWriter(Evaluator::Options /* ignored */,
53 Program* program)
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080054 : program_(program) {}
Austin Schuh70cc9552019-01-21 19:46:48 -080055
56 // PopulateJacobianRowAndColumnBlockVectors sets col_blocks and
57 // row_blocks for a CompressedRowSparseMatrix, based on the
58 // parameter block sizes and residual sizes respectively from the
59 // program. This is useful when Solver::Options::use_block_amd =
60 // true;
61 //
62 // This function is static so that it is available to other jacobian
63 // writers which use CompressedRowSparseMatrix (or derived types).
64 // (Jacobian writers do not fall under any type hierarchy; they only
65 // have to provide an interface as specified in program_evaluator.h).
66 static void PopulateJacobianRowAndColumnBlockVectors(
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080067 const Program* program, CompressedRowSparseMatrix* jacobian);
Austin Schuh70cc9552019-01-21 19:46:48 -080068
69 // It is necessary to determine the order of the jacobian blocks
70 // before copying them into a CompressedRowSparseMatrix (or derived
71 // type). Just because a cost function uses parameter blocks 1
72 // after 2 in its arguments does not mean that the block 1 occurs
73 // before block 2 in the column layout of the jacobian. Thus,
74 // GetOrderedParameterBlocks determines the order by sorting the
75 // jacobian blocks by their position in the state vector.
76 //
77 // This function is static so that it is available to other jacobian
78 // writers which use CompressedRowSparseMatrix (or derived types).
79 // (Jacobian writers do not fall under any type hierarchy; they only
80 // have to provide an interface as specified in
81 // program_evaluator.h).
82 static void GetOrderedParameterBlocks(
83 const Program* program,
84 int residual_id,
85 std::vector<std::pair<int, int>>* evaluated_jacobian_blocks);
86
87 // JacobianWriter interface.
88
89 // Since the compressed row matrix has different layout than that
90 // assumed by the cost functions, use scratch space to store the
91 // jacobians temporarily then copy them over to the larger jacobian
92 // in the Write() function.
Austin Schuh3de38b02024-06-25 18:25:10 -070093 std::unique_ptr<ScratchEvaluatePreparer[]> CreateEvaluatePreparers(
94 int num_threads) {
Austin Schuh70cc9552019-01-21 19:46:48 -080095 return ScratchEvaluatePreparer::Create(*program_, num_threads);
96 }
97
Austin Schuh3de38b02024-06-25 18:25:10 -070098 std::unique_ptr<SparseMatrix> CreateJacobian() const;
Austin Schuh70cc9552019-01-21 19:46:48 -080099
100 void Write(int residual_id,
101 int residual_offset,
Austin Schuh1d1e6ea2020-12-23 21:56:30 -0800102 double** jacobians,
Austin Schuh70cc9552019-01-21 19:46:48 -0800103 SparseMatrix* base_jacobian);
104
105 private:
106 Program* program_;
107};
108
Austin Schuh3de38b02024-06-25 18:25:10 -0700109} // namespace ceres::internal
Austin Schuh70cc9552019-01-21 19:46:48 -0800110
111#endif // CERES_INTERNAL_COMPRESSED_ROW_JACOBIAN_WRITER_H_