| /external/eigen/doc/snippets/ |
| ComplexSchur_compute.cpp | 2 ComplexSchur<MatrixXcf> schur(4);
3 schur.compute(A);
4 cout << "The matrix T in the decomposition of A is:" << endl << schur.matrixT() << endl;
5 schur.compute(A.inverse());
6 cout << "The matrix T in the decomposition of A^(-1) is:" << endl << schur.matrixT() << endl;
|
| RealSchur_compute.cpp | 2 RealSchur<MatrixXf> schur(4);
3 schur.compute(A, /* computeU = */ false);
4 cout << "The matrix T in the decomposition of A is:" << endl << schur.matrixT() << endl;
5 schur.compute(A.inverse(), /* computeU = */ false);
6 cout << "The matrix T in the decomposition of A^(-1) is:" << endl << schur.matrixT() << endl;
|
| RealSchur_RealSchur_MatrixType.cpp | 4 RealSchur<MatrixXd> schur(A);
5 cout << "The orthogonal matrix U is:" << endl << schur.matrixU() << endl;
6 cout << "The quasi-triangular matrix T is:" << endl << schur.matrixT() << endl << endl;
8 MatrixXd U = schur.matrixU();
9 MatrixXd T = schur.matrixT();
|
| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement.h | 31 // An iterative solver for solving the Schur complement/reduced camera
50 // to the Schur complement without explicitly forming it.
64 // and the Schur complement system is given by
69 // is to form this Schur complement system and solve it using
73 // matrix vector product with the Schur complement
82 // auxilliary bits needed to implement a CG solver on the Schur
95 // should be computed or not as a preconditioner for the Schur
103 // Initialize the Schur complement for a linear least squares
115 // y += Sx, where S is the Schur complement.
118 // The Schur complement is a symmetric positive definite matrix
[all...] |
| iterative_schur_complement_solver.h | 55 // The key idea is that one can run Conjugate Gradients on the Schur
56 // Complement system without explicitly forming the Schur Complement
58 // ImplicitSchurComplement class. Not forming the Schur complement in
65 // For the curious, running CG on the Schur complement is the same as
|
| reorder_program.h | 53 // Schur eliminator, which works on these "row blocks" in the jacobian.
58 // Schur type solvers require that all parameter blocks eliminated
59 // by the Schur eliminator occur before others and the residuals be
69 // columns of the schur complement matrix are ordered to reduce the
|
| visibility_based_preconditioner.h | 79 // entries in the Schur complement matrix corresponding to these
80 // camera pairs as an approximation to the full Schur complement.
133 // It has the same structural requirement as other Schur complement
168 // Number of parameter blocks in the schur complement.
172 // Sizes of the blocks in the schur complement.
178 // Non-zero camera pairs from the schur complement matrix that are
|
| implicit_schur_complement_test.cc | 142 // The i^th column of the implicit schur complement is the same as
143 // the explicit schur complement.
164 // Backsubstituted solution from the implicit schur solver using the
187 // Verify that the Schur Complement matrix implied by the
|
| preconditioner.h | 78 // The most common use is for Schur type solvers, where there
82 // num_eliminate_blocks in the Schur type solvers.
86 // some cases the Schur complement based solvers can detect and
100 // e-blocks, ITERATIVE_SCHUR with a Schur type preconditioner cannot
|
| schur_complement_solver.h | 59 // Base class for Schur complement based linear least squares
91 // DenseSchurComplementSolver: For problems where the Schur complement
96 // SparseSchurComplementSolver: For problems where the Schur
99 // sparse Cholesky factorization of the Schur complement. This solver
179 // Size of the blocks in the Schur complement.
|
| schur_eliminator.h | 57 // class provides the functionality to compute the Schur complement
151 // be interested in all of the Schur Complement S. However, it is also
153 // the full Schur complement. When the eliminator is generating the
157 // is interested in constructing a preconditioner based on the Schur
177 // Compute the Schur complement system from the augmented linear
184 // the full or a submatrix of the Schur complement will be computed.
186 // Since the Schur complement is a symmetric matrix, only the upper
187 // triangular part of the Schur complement is computed.
|
| schur_jacobi_preconditioner.h | 82 // It has the same structural requirement as other Schur complement
98 // Sizes of the blocks in the schur complement.
|
| implicit_schur_complement.cc | 96 // Compute the RHS of the Schur complement system.
192 // corresponds to the Schur complement system, so we just copy those
193 // values from the solution to the Schur complement.
197 // Compute the RHS of the Schur complement system.
|
| iterative_schur_complement_solver.cc | 88 VLOG(2) << "No parameter blocks left in the schur complement.";
96 // Initialize the solution to the Schur complement system to zero.
100 // Instantiate a conjugate gradient solver that runs on the Schur
|
| linear_solver.h | 140 // The most common use is for Schur type solvers, where there
144 // num_eliminate_blocks in the Schur type solvers.
155 // some cases the Schur complement based solvers can detect and
278 // e-blocks, a Schur type linear solver cannot be used. If the
279 // linear solver is of Schur type, this function implements a policy
|
| linear_least_squares_problems.h | 54 // If using the schur eliminator then how many of the variable
|
| partitioned_matrix_view.h | 53 // structure as required by the Schur complement based solver, found
60 // the Schur complement solver it will result in unpredictable and
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 28 * \brief Performs a complex Schur decomposition of a real or complex square matrix
31 * computing the Schur decomposition; this is expected to be an
35 * Schur decomposition: \f$ A = U T U^*\f$ where U is a unitary
40 * Call the function compute() to compute the Schur decomposition of
43 * the Schur decomposition at construction time. Once the
76 /** \brief Type for the matrices in the Schur decomposition.
85 * \param [in] size Positive integer, size of the matrix whose Schur decomposition will be computed.
103 /** \brief Constructor; computes Schur decomposition of given matrix.
105 * \param[in] matrix Square matrix whose Schur decomposition is to be computed.
108 * This constructor calls compute() to compute the Schur decomposition
[all...] |
| RealSchur.h | 23 * \brief Performs a real Schur decomposition of a square matrix
26 * real Schur decomposition; this is expected to be an instantiation of the
29 * Given a real square matrix A, this class computes the real Schur
36 * A, and thus the real Schur decomposition is used in EigenSolver to compute
39 * Call the function compute() to compute the real Schur decomposition of a
41 * constructor which computes the real Schur decomposition at construction
74 * \param [in] size Positive integer, size of the matrix whose Schur decomposition will be computed.
93 /** \brief Constructor; computes real Schur decomposition of given matrix.
95 * \param[in] matrix Square matrix whose Schur decomposition is to be computed.
98 * This constructor calls compute() to compute the Schur decomposition
[all...] |
| ComplexEigenSolver.h | 200 * The matrix is first reduced to Schur form using the
201 * ComplexSchur class. The Schur decomposition is then used to
205 * Schur decomposition, which is \f$ O(n^3) \f$ where \f$ n \f$
257 // Do a complex Schur decomposition, A = U T U^*
|
| /external/eigen/test/ |
| schur_complex.cpp | 14 template<typename MatrixType> void schur(int size = MatrixType::ColsAtCompileTime) function
84 CALL_SUBTEST_1(( schur<Matrix4cd>() ));
85 CALL_SUBTEST_2(( schur<MatrixXcf>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4)) ));
86 CALL_SUBTEST_3(( schur<Matrix<std::complex<float>, 1, 1> >() ));
87 CALL_SUBTEST_4(( schur<Matrix<float, 3, 3, Eigen::RowMajor> >() ));
|
| schur_real.cpp | 40 template<typename MatrixType> void schur(int size = MatrixType::ColsAtCompileTime) function
105 CALL_SUBTEST_1(( schur<Matrix4f>() ));
106 CALL_SUBTEST_2(( schur<MatrixXd>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4)) ));
107 CALL_SUBTEST_3(( schur<Matrix<float, 1, 1> >() ));
108 CALL_SUBTEST_4(( schur<Matrix<double, 3, 3, Eigen::RowMajor> >() ));
|
| /external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
| auto_corr_to_refl_coef.c | 83 // Last iteration; don't do Schur recursion.
87 // Schur recursion.
|
| /external/webrtc/src/common_audio/signal_processing/ |
| auto_corr_to_refl_coef.c | 83 // Last iteration; don't do Schur recursion.
87 // Schur recursion.
|
| /external/eigen/unsupported/Eigen/ |
| MatrixFunctions | 187 This function computes the matrix logarithm using the Schur-Parlett
243 This function computes the matrix power using the Schur-Padé
250 Lijing Lin, "A Schur-Padé algorithm for fractional powers of a
272 MatrixPower can save the result of Schur decomposition, so it's
311 "A Schur-Parlett algorithm for computing matrix functions",
399 quasi-triangular form with the real Schur decomposition. The square
401 cost is approximately \f$ 25 n^3 \f$ real flops for the real Schur
421 complex Schur decomposition is used to reduce the matrix to a
423 Åke Björck and Sven Hammarling, "A Schur method for the
|
