eigensparse.h 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  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: sameeragarwal@google.com (Sameer Agarwal)
  30. //
  31. // A simple C++ interface to the Eigen's Sparse Cholesky routines.
  32. #ifndef CERES_INTERNAL_EIGENSPARSE_H_
  33. #define CERES_INTERNAL_EIGENSPARSE_H_
  34. // This include must come before any #ifndef check on Ceres compile options.
  35. #include "ceres/internal/config.h"
  36. #ifdef CERES_USE_EIGEN_SPARSE
  37. #include <memory>
  38. #include <string>
  39. #include "Eigen/SparseCore"
  40. #include "ceres/internal/export.h"
  41. #include "ceres/linear_solver.h"
  42. #include "ceres/sparse_cholesky.h"
  43. namespace ceres::internal {
  44. class EigenSparse {
  45. public:
  46. static constexpr bool IsNestedDissectionAvailable() noexcept {
  47. #ifdef CERES_NO_EIGEN_METIS
  48. return false;
  49. #else
  50. return true;
  51. #endif
  52. }
  53. };
  54. class CERES_NO_EXPORT EigenSparseCholesky : public SparseCholesky {
  55. public:
  56. // Factory
  57. static std::unique_ptr<SparseCholesky> Create(
  58. const OrderingType ordering_type);
  59. // SparseCholesky interface.
  60. ~EigenSparseCholesky() override;
  61. LinearSolverTerminationType Factorize(CompressedRowSparseMatrix* lhs,
  62. std::string* message) override = 0;
  63. CompressedRowSparseMatrix::StorageType StorageType() const override = 0;
  64. LinearSolverTerminationType Solve(const double* rhs,
  65. double* solution,
  66. std::string* message) override = 0;
  67. };
  68. // Even though the input is double precision linear system, this class
  69. // solves it by computing a single precision Cholesky factorization.
  70. class CERES_NO_EXPORT FloatEigenSparseCholesky : public SparseCholesky {
  71. public:
  72. // Factory
  73. static std::unique_ptr<SparseCholesky> Create(
  74. const OrderingType ordering_type);
  75. // SparseCholesky interface.
  76. ~FloatEigenSparseCholesky() override;
  77. LinearSolverTerminationType Factorize(CompressedRowSparseMatrix* lhs,
  78. std::string* message) override = 0;
  79. CompressedRowSparseMatrix::StorageType StorageType() const override = 0;
  80. LinearSolverTerminationType Solve(const double* rhs,
  81. double* solution,
  82. std::string* message) override = 0;
  83. };
  84. } // namespace ceres::internal
  85. #else
  86. namespace ceres::internal {
  87. class EigenSparse {
  88. public:
  89. static constexpr bool IsNestedDissectionAvailable() noexcept { return false; }
  90. };
  91. } // namespace ceres::internal
  92. #endif // CERES_USE_EIGEN_SPARSE
  93. #endif // CERES_INTERNAL_EIGENSPARSE_H_