Looks for a small subdiagonal element from the bottom of the matrix that it can safely set to zero.
Multiplies a general matrix by the orthogonal/unitary matrix from an LQ factorization determined by p?gelqf (unblocked algorithm).
Provides limited bisection to locate eigenvalues for more accuracy.
Solves a symmetric (Hermitian) positive-definite tridiagonal system of linear equations, using the L*D*LH factorization computed by ?pttrf.
Replaces routine which handles Intel MKL PARDISO pivots with user-defined routine.
Computes the approximate solution vector.
Extended Eigensolver interface for generalized eigenvalue problem with dense matrices.