geqrt3 Interface

public interface geqrt3

GEQRT3 recursively computes a QR factorization of a complex M-by-N matrix A, using the compact WY representation of Q. Based on the algorithm of Elmroth and Gustavson, IBM J. Res. Develop. Vol 44 No. 4 July 2000.


Subroutines

public pure recursive subroutine cgeqrt3(m, n, a, lda, t, ldt, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
complex(kind=sp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
complex(kind=sp), intent(out) :: t(ldt,*)
integer(kind=ilp), intent(in) :: ldt
integer(kind=ilp), intent(out) :: info

public pure recursive subroutine dgeqrt3(m, n, a, lda, t, ldt, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
real(kind=dp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
real(kind=dp), intent(out) :: t(ldt,*)
integer(kind=ilp), intent(in) :: ldt
integer(kind=ilp), intent(out) :: info

public pure recursive subroutine sgeqrt3(m, n, a, lda, t, ldt, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
real(kind=sp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
real(kind=sp), intent(out) :: t(ldt,*)
integer(kind=ilp), intent(in) :: ldt
integer(kind=ilp), intent(out) :: info

public pure recursive subroutine zgeqrt3(m, n, a, lda, t, ldt, info)

Arguments

Type IntentOptional Attributes Name
integer(kind=ilp), intent(in) :: m
integer(kind=ilp), intent(in) :: n
complex(kind=dp), intent(inout) :: a(lda,*)
integer(kind=ilp), intent(in) :: lda
complex(kind=dp), intent(out) :: t(ldt,*)
integer(kind=ilp), intent(in) :: ldt
integer(kind=ilp), intent(out) :: info

Module Procedures

public interface stdlib_cgeqrt3()

Arguments

None

public interface stdlib_dgeqrt3()

Arguments

None

public interface stdlib_sgeqrt3()

Arguments

None

public interface stdlib_zgeqrt3()

Arguments

None