Go to the source code of this file.
|
enum class | tlapack::BidiagVariant : char { Level2 = '2'
, Blocked = 'B'
} |
| Variant of the bidiagonal reduction algorithm.
|
|
|
template<TLAPACK_SMATRIX matrix_t, TLAPACK_SVECTOR vector_t> |
int | tlapack::bidiag (matrix_t &A, vector_t &tauv, vector_t &tauw, const BidiagOpts &opts={}) |
| Reduces a general m by n matrix A to an upper real bidiagonal form B by a unitary transformation:
|
|
template<TLAPACK_SMATRIX matrix_t, TLAPACK_SVECTOR vector_t, TLAPACK_WORKSPACE work_t> |
int | tlapack::bidiag_work (matrix_t &A, vector_t &tauv, vector_t &tauw, work_t &work, const BidiagOpts &opts={}) |
| Reduces a general m by n matrix A to an upper real bidiagonal form B by a unitary transformation: Workspace is provided as an argument.
|
|
template<class T , TLAPACK_SMATRIX matrix_t, TLAPACK_SVECTOR vector_t> |
constexpr WorkInfo | tlapack::bidiag_worksize (const matrix_t &A, const vector_t &tauv, const vector_t &tauw, const BidiagOpts &opts={}) |
| Worspace query of bidiag()
|
|
- Author
- Weslley S Pereira, University of Colorado Denver, USA