NAME

dgeqrf - compute a QR factorization of a real M-by-N matrix A


SYNOPSIS

  SUBROUTINE DGEQRF( M, N, A, LDA, TAU, WORK, LDWORK, INFO)
  INTEGER M, N, LDA, LDWORK, INFO
  DOUBLE PRECISION A(LDA,*), TAU(*), WORK(*)
  SUBROUTINE DGEQRF_64( M, N, A, LDA, TAU, WORK, LDWORK, INFO)
  INTEGER*8 M, N, LDA, LDWORK, INFO
  DOUBLE PRECISION A(LDA,*), TAU(*), WORK(*)

F95 INTERFACE

  SUBROUTINE GEQRF( [M], [N], A, [LDA], TAU, [WORK], [LDWORK], [INFO])
  INTEGER :: M, N, LDA, LDWORK, INFO
  REAL(8), DIMENSION(:) :: TAU, WORK
  REAL(8), DIMENSION(:,:) :: A
  SUBROUTINE GEQRF_64( [M], [N], A, [LDA], TAU, [WORK], [LDWORK], 
 *       [INFO])
  INTEGER(8) :: M, N, LDA, LDWORK, INFO
  REAL(8), DIMENSION(:) :: TAU, WORK
  REAL(8), DIMENSION(:,:) :: A

C INTERFACE

#include <sunperf.h>

void dgeqrf(int m, int n, double *a, int lda, double *tau, int *info);

void dgeqrf_64(long m, long n, double *a, long lda, double *tau, long *info);


PURPOSE

dgeqrf computes a QR factorization of a real M-by-N matrix A: A = Q * R.


ARGUMENTS


FURTHER DETAILS

The matrix Q is represented as a product of elementary reflectors

   Q  = H(1) H(2) . . . H(k), where k  = min(m,n).

Each H(i) has the form

   H(i)  = I - tau * v * v'

where tau is a real scalar, and v is a real vector with

v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), and tau in TAU(i).