Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 1 | // Ceres Solver - A fast non-linear least squares minimizer |
| 2 | // Copyright 2010, 2011, 2012 Google Inc. All rights reserved. |
| 3 | // http://code.google.com/p/ceres-solver/ |
| 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 dense matrix implemented under the SparseMatrix interface. |
| 32 | |
| 33 | #ifndef CERES_INTERNAL_DENSE_SPARSE_MATRIX_H_ |
| 34 | #define CERES_INTERNAL_DENSE_SPARSE_MATRIX_H_ |
| 35 | |
Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 36 | #include "ceres/sparse_matrix.h" |
| 37 | #include "ceres/internal/eigen.h" |
| 38 | #include "ceres/internal/macros.h" |
| 39 | #include "ceres/internal/scoped_ptr.h" |
| 40 | #include "ceres/types.h" |
| 41 | |
| 42 | namespace ceres { |
| 43 | namespace internal { |
| 44 | |
| 45 | class SparseMatrixProto; |
| 46 | class TripletSparseMatrix; |
| 47 | |
| 48 | class DenseSparseMatrix : public SparseMatrix { |
| 49 | public: |
| 50 | // Build a matrix with the same content as the TripletSparseMatrix |
| 51 | // m. This assumes that m does not have any repeated entries. |
| 52 | explicit DenseSparseMatrix(const TripletSparseMatrix& m); |
Sameer Agarwal | 31730ef | 2013-02-28 11:20:28 -0800 | [diff] [blame] | 53 | explicit DenseSparseMatrix(const ColMajorMatrix& m); |
Sameer Agarwal | dd2b17d | 2012-08-16 19:34:57 -0700 | [diff] [blame] | 54 | #ifndef CERES_NO_PROTOCOL_BUFFERS |
Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 55 | explicit DenseSparseMatrix(const SparseMatrixProto& proto); |
| 56 | #endif |
| 57 | |
| 58 | DenseSparseMatrix(int num_rows, int num_cols); |
Sameer Agarwal | 5bfa7e4 | 2012-10-05 10:06:27 -0700 | [diff] [blame] | 59 | DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal); |
Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 60 | |
| 61 | virtual ~DenseSparseMatrix() {} |
| 62 | |
| 63 | // SparseMatrix interface. |
| 64 | virtual void SetZero(); |
| 65 | virtual void RightMultiply(const double* x, double* y) const; |
| 66 | virtual void LeftMultiply(const double* x, double* y) const; |
| 67 | virtual void SquaredColumnNorm(double* x) const; |
| 68 | virtual void ScaleColumns(const double* scale); |
| 69 | virtual void ToDenseMatrix(Matrix* dense_matrix) const; |
Sameer Agarwal | dd2b17d | 2012-08-16 19:34:57 -0700 | [diff] [blame] | 70 | #ifndef CERES_NO_PROTOCOL_BUFFERS |
Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 71 | virtual void ToProto(SparseMatrixProto* proto) const; |
| 72 | #endif |
Sameer Agarwal | 82f4b88 | 2012-05-06 21:05:28 -0700 | [diff] [blame] | 73 | virtual void ToTextFile(FILE* file) const; |
Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 74 | virtual int num_rows() const; |
| 75 | virtual int num_cols() const; |
| 76 | virtual int num_nonzeros() const; |
| 77 | virtual const double* values() const { return m_.data(); } |
| 78 | virtual double* mutable_values() { return m_.data(); } |
| 79 | |
Sameer Agarwal | 31730ef | 2013-02-28 11:20:28 -0800 | [diff] [blame] | 80 | ConstColMajorMatrixRef matrix() const; |
| 81 | ColMajorMatrixRef mutable_matrix(); |
Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 82 | |
| 83 | // Only one diagonal can be appended at a time. The diagonal is appended to |
| 84 | // as a new set of rows, e.g. |
| 85 | // |
| 86 | // Original matrix: |
| 87 | // |
| 88 | // x x x |
| 89 | // x x x |
| 90 | // x x x |
| 91 | // |
| 92 | // After append diagonal (1, 2, 3): |
| 93 | // |
| 94 | // x x x |
| 95 | // x x x |
| 96 | // x x x |
| 97 | // 1 0 0 |
| 98 | // 0 2 0 |
| 99 | // 0 0 3 |
| 100 | // |
| 101 | // Calling RemoveDiagonal removes the block. It is a fatal error to append a |
| 102 | // diagonal to a matrix that already has an appended diagonal, and it is also |
| 103 | // a fatal error to remove a diagonal from a matrix that has none. |
| 104 | void AppendDiagonal(double *d); |
| 105 | void RemoveDiagonal(); |
| 106 | |
| 107 | private: |
Sameer Agarwal | 31730ef | 2013-02-28 11:20:28 -0800 | [diff] [blame] | 108 | ColMajorMatrix m_; |
Keir Mierle | 8ebb073 | 2012-04-30 23:09:08 -0700 | [diff] [blame] | 109 | bool has_diagonal_appended_; |
| 110 | bool has_diagonal_reserved_; |
| 111 | }; |
| 112 | |
| 113 | } // namespace internal |
| 114 | } // namespace ceres |
| 115 | |
| 116 | #endif // CERES_INTERNAL_DENSE_SPARSE_MATRIX_H_ |