Encapsulates factorizations of Hermitian matrices.
More...
#include <rw/lapack/hermfct.h>
template<class TypeT>
class RWHermFact< TypeT >
A factorization is a representation of a matrix that can be used to efficiently solve systems of equations, and to compute the inverse, determinant, and condition number of a matrix. The class RWHermFact encapsulates factorizations of Hermitian matrices. Provided the matrix being factored is nonsingular, the resulting factorization can always be used to solve a system of equations.
- Synopsis
#include <rw/lapack/hermfct.h>
- Example
#include <iostream>
#include <rw/lapack/hermmat.h>
#include <rw/lapack/hermfct.h>
int main()
{
std::cin >> A >> b;
if (HF.good()) {
std::cout <<
"solution is " <<
solve(HF,b) << std::endl;
} else {
std::cout << "Could not factor A, perhaps it is singular"
<< std::endl;
}
return 0;
}
Default constructor. Builds a factorization of a 0 x 0 matrix. You use the member function factor to fill in the factorization.
Constructs a factorization of the matrix A. This factorization can be used to solve systems of equations, and to calculate inverses and determinants. If the parameter estimateCondition is true, you can use the function condition() to obtain an estimate of the condition number of the matrix. Setting estimateCondition to false can save some computation if the condition number is not needed.
Returns the number of columns in the matrix represented by this factorization.
Calculates the reciprocal condition number of the matrix represented by this factorization. If this number is near 0, the matrix is ill-conditioned and solutions to systems of equations computed using this factorization may not be accurate. If the number is near 1, the matrix is well-conditioned. For the condition number to be computed, the norm of the matrix must be computed at the time the factorization is constructed. If you set the optional boolean parameter in the RWHermFact() or factor() to false, calling condition() generates an exception.
Calculates the determinant of the matrix represented by this factorization.
template<class TypeT>
| void RWHermFact< TypeT >::factor |
( |
const RWHermMat< TypeT > & |
A, |
|
|
bool |
estimateCondition = true |
|
) |
| |
Factors a matrix. Calling factor() replaces the current factorization with the factorization of the matrix A. This is commonly used to initialize a factorization constructed with the default (no arguments) constructor.
Checks whether the factorization is successfully constructed. If fail() returns true, attempting to use the factorization to solve a system of equations results in an exception being thrown.
Checks whether the factorization is successfully constructed. If good() returns false, attempting to use the factorization to solve a system of equations results in an exception being thrown.
Computes the inverse of the matrix represented by this factorization. Although matrix inverses are very useful in theoretical analysis, they are rarely necessary in implementation. A factorization is nearly always as useful as the actual inverse, and can be constructed at far less cost.
Tests if the matrix is singular to within machine precision. If the factorization is a positive definite type and the matrix that was factored is not actually positive definite, then isSingular() may return true regardless of whether or not the matrix is actually singular.
Returns the number of rows in the matrix represented by this factorization.
Solves a system of equations. Returns the vector x, which satisfies \(Ax = b\), where A is the matrix represented by this factorization. It is wise to call one of the member functions good() or fail() to make sure that the factorization was successfully constructed.
Solves a system of equations. Returns the matrix x, which satisfies \(Ax = b\), where A is the matrix represented by this factorization. It is wise to call one of the member functions good() or fail() to make sure that the factorization was successfully constructed.
Calculates the reciprocal condition number of the matrix represented by the factorization A. If this number is near 0, the matrix is ill-conditioned and solutions to systems of equations computed using this factorization may not be accurate. If the number is near 1, the matrix is well-conditioned. For the condition number to be computed, the norm of the matrix must be computed at the time the factorization is constructed. If you set the optional boolean parameter in the RWHermFact() or factor() member function to false, calling condition() generates an exception.
template<class TypeT >
| TypeT determinant |
( |
const RWHermFact< TypeT > & |
A | ) |
|
|
related |
Calculates the determinant of the matrix represented by the factorization A
Computes the inverse of the matrix represented by this factorization. Although matrix inverses are very useful in theoretical analysis, they are rarely necessary in implementation. A factorization is nearly always as useful as the actual inverse, and can be constructed at far less cost.
Solves a system of equations. Returns the vector x, which satisfies \(Ax = b\), where A is the matrix represented by the factorization. It is wise to call one of the member functions good() or fail() to make sure that the factorization was successfully constructed.
Solves a system of equations. Returns the matrix X, which satisfies \(Ax = B\), where A is the matrix represented by the factorization. It is wise to call one of the member functions good() or fail() to make sure that the factorization was successfully constructed.
