dynamic_compressed_row_jacobian_writer.h 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
  1. // Ceres Solver - A fast non-linear least squares minimizer
  2. // Copyright 2023 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: richie.stebbing@gmail.com (Richard Stebbing)
  30. //
  31. // A jacobian writer that directly writes to dynamic compressed row sparse
  32. // matrices.
  33. #ifndef CERES_INTERNAL_DYNAMIC_COMPRESSED_ROW_JACOBIAN_WRITER_H_
  34. #define CERES_INTERNAL_DYNAMIC_COMPRESSED_ROW_JACOBIAN_WRITER_H_
  35. #include <memory>
  36. #include "ceres/evaluator.h"
  37. #include "ceres/internal/export.h"
  38. #include "ceres/scratch_evaluate_preparer.h"
  39. namespace ceres::internal {
  40. class Program;
  41. class SparseMatrix;
  42. class CERES_NO_EXPORT DynamicCompressedRowJacobianWriter {
  43. public:
  44. DynamicCompressedRowJacobianWriter(Evaluator::Options /* ignored */,
  45. Program* program)
  46. : program_(program) {}
  47. // JacobianWriter interface.
  48. // The compressed row matrix has different layout than that assumed by
  49. // the cost functions. The scratch space is therefore used to store
  50. // the jacobians (including zeros) temporarily before only the non-zero
  51. // entries are copied over to the larger jacobian in `Write`.
  52. std::unique_ptr<ScratchEvaluatePreparer[]> CreateEvaluatePreparers(
  53. int num_threads);
  54. // Return a `DynamicCompressedRowSparseMatrix` which is filled by
  55. // `Write`. Note that `Finalize` must be called to make the
  56. // `CompressedRowSparseMatrix` interface valid.
  57. std::unique_ptr<SparseMatrix> CreateJacobian() const;
  58. // Write only the non-zero jacobian entries for a residual block
  59. // (specified by `residual_id`) into `base_jacobian`, starting at the row
  60. // specified by `residual_offset`.
  61. //
  62. // This method is thread-safe over residual blocks (each `residual_id`).
  63. void Write(int residual_id,
  64. int residual_offset,
  65. double** jacobians,
  66. SparseMatrix* base_jacobian);
  67. private:
  68. Program* program_;
  69. };
  70. } // namespace ceres::internal
  71. #endif // CERES_INTERNAL_DYNAMIC_COMPRESSED_ROW_JACOBIAN_WRITER_H_