All Classes and Interfaces
Classes
Class
Description
This is an abstract class for a Cholesky decomposition.
This implementation of a Cholesky decomposition using the inner-product form.
Functions from
CommonOps_ZDRM with concurrent implementations.Common operations on complex numbers
Contains operations related to creating and evaluating the quality of common matrix decompositions.
Complex Hessenberg decomposition.
A matrix can be easily inverted by solving a system with an identify matrix.
An abstract class that provides some common functionality and a default implementation
of invert that uses the solve function of the child class.
Factory for creating linear solvers of complex matrices
For each column in the B matrix it makes a copy, which is then solved for and
writen into X.
A solver for a generic QR decomposition algorithm.
QR decomposition can be used to solve for systems.
QR decomposition can be used to solve for systems.
QR decomposition can be used to solve for systems.
An LU decomposition algorithm that originally came from Jama.
Contains common data structures and operations for LU decomposition algorithms.
Functions for computing the features of complex matrices
Matrix multiplication routines for complex row matrices in a row-major format.
Matrix multiplication routines for complex row matrices in a row-major format.
Operations for computing different types of norms.
This variation of complex QR decomposition uses reflections to compute the Q matrix.
Householder QR decomposition is rich in operations along the columns of the matrix.
Householder QR decomposition is rich in operations along the columns of the matrix.
Contains different functions that are useful for computing the QR decomposition of a matrix.
Contains a list of functions for creating random row complex matrices and vectors with different structures.
Various highly specialized operations that are probably not of interest to most people.
Algorithms for transposing row complex matrices
This contains algorithms for solving systems of equations where T is a
non-singular triangular complex matrix:
T*x = b
where x and b are vectors, and T is an n by n matrix.
T*x = b
where x and b are vectors, and T is an n by n matrix.
Performs a complex
similar tridiagonal decomposition on a
square Hermitian matrix.Helper functions for generic decompsotions.
Operations that involve multiplication of two vectors.