GEQR2P: computes a QR factorization of a complex m-by-n matrix A: A = Q * ( R ), ( 0 ) where: Q is a m-by-m orthogonal matrix; R is an upper-triangular n-by-n matrix with nonnegative diagonal entries; 0 is a (m-n)-by-n zero matrix, if m > n.
More...
GEQR2P: computes a QR factorization of a complex m-by-n matrix A: A = Q * ( R ), ( 0 ) where: Q is a m-by-m orthogonal matrix; R is an upper-triangular n-by-n matrix with nonnegative diagonal entries; 0 is a (m-n)-by-n zero matrix, if m > n.
◆ la_cgeqr2p()
| la_lapack::geqr2p::la_cgeqr2p |
◆ la_dgeqr2p()
| la_lapack::geqr2p::la_dgeqr2p |
◆ la_qgeqr2p()
| la_lapack::geqr2p::la_qgeqr2p |
◆ la_sgeqr2p()
| la_lapack::geqr2p::la_sgeqr2p |
◆ la_wgeqr2p()
| la_lapack::geqr2p::la_wgeqr2p |
◆ la_zgeqr2p()
| la_lapack::geqr2p::la_zgeqr2p |
The documentation for this interface was generated from the following file: