10 #define NEWMATAP_LIB 0 86 bool=
true,
bool=
true);
91 bool withU =
true) {
SVD(A, D, U, U, withU,
false); }
146 static bool ar_1d_ft (
int PTS,
Real* X,
Real *Y);
147 static bool CanFactor(
int PTS);
210 bool Swap()
const {
return reverse < counter; }
void DST_inverse(const ColumnVector &, ColumnVector &)
const SimpleIntArray & Radix
SymmetricMatrix backtransform
ReturnMatrix Helmert_transpose(const ColumnVector &Y, bool full=false)
void UpdateCholesky(UpperTriangularMatrix &chol, const RowVector &x)
void UpdateQRZT(Matrix &X, LowerTriangularMatrix &L)
void DowndateCholesky(UpperTriangularMatrix &chol, const RowVector &x)
void RealFFTI(const ColumnVector &, const ColumnVector &, ColumnVector &)
ReturnMatrix Helmert(int n, bool full=false)
void FFT(const ColumnVector &, const ColumnVector &, ColumnVector &, ColumnVector &)
void downdate_Cholesky(UpperTriangularMatrix &chol, RowVector x)
void EigenValues(const SymmetricMatrix &A, DiagonalMatrix &D)
void DCT_II_inverse(const ColumnVector &, ColumnVector &)
#define FREE_CHECK(Class)
void LeftCircularUpdateCholesky(UpperTriangularMatrix &chol, int k, int l)
void SortAscending(GeneralMatrix &gm)
void DCT(const ColumnVector &, ColumnVector &)
void update_Cholesky(UpperTriangularMatrix &chol, RowVector x)
void FFT2(const Matrix &U, const Matrix &V, Matrix &X, Matrix &Y)
void RightCircularUpdateCholesky(UpperTriangularMatrix &chol, int k, int l)
void right_circular_update_Cholesky(UpperTriangularMatrix &chol, int k, int l)
void RealFFT(const ColumnVector &, ColumnVector &, ColumnVector &)
void extend_orthonormal(Matrix &A, int n)
void left_circular_update_Cholesky(UpperTriangularMatrix &chol, int k, int l)
void updateQRZ(Matrix &X, UpperTriangularMatrix &U)
void sort_descending(GeneralMatrix &)
void DCT_inverse(const ColumnVector &, ColumnVector &)
void SVD(const Matrix &, DiagonalMatrix &, Matrix &, Matrix &, bool=true, bool=true)
void FFT2I(const Matrix &U, const Matrix &V, Matrix &X, Matrix &Y)
void DST_II(const ColumnVector &, ColumnVector &)
The usual rectangular matrix.
void SortDescending(GeneralMatrix &gm)
ReturnMatrix Cholesky(const SymmetricMatrix &)
void eigenvalues(const SymmetricMatrix &, DiagonalMatrix &)
void DCT_II(const ColumnVector &, ColumnVector &)
void DST(const ColumnVector &, ColumnVector &)
Decide which fft method to use and carry out new fft function.
void UpdateQRZ(Matrix &X, UpperTriangularMatrix &U)
void DST_II_inverse(const ColumnVector &, ColumnVector &)
void HHDecompose(Matrix &X, LowerTriangularMatrix &L)
void QRZ(Matrix &, UpperTriangularMatrix &)
void FFTI(const ColumnVector &, const ColumnVector &, ColumnVector &, ColumnVector &)
void Jacobi(const SymmetricMatrix &, DiagonalMatrix &)
void QRZT(Matrix &, LowerTriangularMatrix &)
The classes for matrices that can contain data are derived from this.
void sort_ascending(GeneralMatrix &)
void SortSV(DiagonalMatrix &D, Matrix &U, bool ascending=false)
void updateQRZT(Matrix &X, LowerTriangularMatrix &L)