.TH "laqr5" 3 "Version 3.12.0" "LAPACK" \" -*- nroff -*-
.ad l
.nh
.SH NAME
laqr5 \- laqr5: step in hseqr
.SH SYNOPSIS
.br
.PP
.SS "Functions"

.in +1c
.ti -1c
.RI "subroutine \fBclaqr5\fP (wantt, wantz, kacc22, n, ktop, kbot, nshfts, s, h, ldh, iloz, ihiz, z, ldz, v, ldv, u, ldu, nv, wv, ldwv, nh, wh, ldwh)"
.br
.RI "\fBCLAQR5\fP performs a single small-bulge multi-shift QR sweep\&. "
.ti -1c
.RI "subroutine \fBdlaqr5\fP (wantt, wantz, kacc22, n, ktop, kbot, nshfts, sr, si, h, ldh, iloz, ihiz, z, ldz, v, ldv, u, ldu, nv, wv, ldwv, nh, wh, ldwh)"
.br
.RI "\fBDLAQR5\fP performs a single small-bulge multi-shift QR sweep\&. "
.ti -1c
.RI "subroutine \fBslaqr5\fP (wantt, wantz, kacc22, n, ktop, kbot, nshfts, sr, si, h, ldh, iloz, ihiz, z, ldz, v, ldv, u, ldu, nv, wv, ldwv, nh, wh, ldwh)"
.br
.RI "\fBSLAQR5\fP performs a single small-bulge multi-shift QR sweep\&. "
.ti -1c
.RI "subroutine \fBzlaqr5\fP (wantt, wantz, kacc22, n, ktop, kbot, nshfts, s, h, ldh, iloz, ihiz, z, ldz, v, ldv, u, ldu, nv, wv, ldwv, nh, wh, ldwh)"
.br
.RI "\fBZLAQR5\fP performs a single small-bulge multi-shift QR sweep\&. "
.in -1c
.SH "Detailed Description"
.PP 

.SH "Function Documentation"
.PP 
.SS "subroutine claqr5 (logical wantt, logical wantz, integer kacc22, integer n, integer ktop, integer kbot, integer nshfts, complex, dimension( * ) s, complex, dimension( ldh, * ) h, integer ldh, integer iloz, integer ihiz, complex, dimension( ldz, * ) z, integer ldz, complex, dimension( ldv, * ) v, integer ldv, complex, dimension( ldu, * ) u, integer ldu, integer nv, complex, dimension( ldwv, * ) wv, integer ldwv, integer nh, complex, dimension( ldwh, * ) wh, integer ldwh)"

.PP
\fBCLAQR5\fP performs a single small-bulge multi-shift QR sweep\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!>    CLAQR5 called by CLAQR0 performs a
!>    single small-bulge multi-shift QR sweep\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIWANTT\fP 
.PP
.nf
!>          WANTT is LOGICAL
!>             WANTT = \&.true\&. if the triangular Schur factor
!>             is being computed\&.  WANTT is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIWANTZ\fP 
.PP
.nf
!>          WANTZ is LOGICAL
!>             WANTZ = \&.true\&. if the unitary Schur factor is being
!>             computed\&.  WANTZ is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIKACC22\fP 
.PP
.nf
!>          KACC22 is INTEGER with value 0, 1, or 2\&.
!>             Specifies the computation mode of far-from-diagonal
!>             orthogonal updates\&.
!>        = 0: CLAQR5 does not accumulate reflections and does not
!>             use matrix-matrix multiply to update far-from-diagonal
!>             matrix entries\&.
!>        = 1: CLAQR5 accumulates reflections and uses matrix-matrix
!>             multiply to update the far-from-diagonal matrix entries\&.
!>        = 2: Same as KACC22 = 1\&. This option used to enable exploiting
!>             the 2-by-2 structure during matrix multiplications, but
!>             this is no longer supported\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>             N is the order of the Hessenberg matrix H upon which this
!>             subroutine operates\&.
!> 
.fi
.PP
.br
\fIKTOP\fP 
.PP
.nf
!>          KTOP is INTEGER
!> 
.fi
.PP
.br
\fIKBOT\fP 
.PP
.nf
!>          KBOT is INTEGER
!>             These are the first and last rows and columns of an
!>             isolated diagonal block upon which the QR sweep is to be
!>             applied\&. It is assumed without a check that
!>                       either KTOP = 1  or   H(KTOP,KTOP-1) = 0
!>             and
!>                       either KBOT = N  or   H(KBOT+1,KBOT) = 0\&.
!> 
.fi
.PP
.br
\fINSHFTS\fP 
.PP
.nf
!>          NSHFTS is INTEGER
!>             NSHFTS gives the number of simultaneous shifts\&.  NSHFTS
!>             must be positive and even\&.
!> 
.fi
.PP
.br
\fIS\fP 
.PP
.nf
!>          S is COMPLEX array, dimension (NSHFTS)
!>             S contains the shifts of origin that define the multi-
!>             shift QR sweep\&.  On output S may be reordered\&.
!> 
.fi
.PP
.br
\fIH\fP 
.PP
.nf
!>          H is COMPLEX array, dimension (LDH,N)
!>             On input H contains a Hessenberg matrix\&.  On output a
!>             multi-shift QR sweep with shifts SR(J)+i*SI(J) is applied
!>             to the isolated diagonal block in rows and columns KTOP
!>             through KBOT\&.
!> 
.fi
.PP
.br
\fILDH\fP 
.PP
.nf
!>          LDH is INTEGER
!>             LDH is the leading dimension of H just as declared in the
!>             calling procedure\&.  LDH >= MAX(1,N)\&.
!> 
.fi
.PP
.br
\fIILOZ\fP 
.PP
.nf
!>          ILOZ is INTEGER
!> 
.fi
.PP
.br
\fIIHIZ\fP 
.PP
.nf
!>          IHIZ is INTEGER
!>             Specify the rows of Z to which transformations must be
!>             applied if WANTZ is \&.TRUE\&.\&. 1 <= ILOZ <= IHIZ <= N
!> 
.fi
.PP
.br
\fIZ\fP 
.PP
.nf
!>          Z is COMPLEX array, dimension (LDZ,IHIZ)
!>             If WANTZ = \&.TRUE\&., then the QR Sweep unitary
!>             similarity transformation is accumulated into
!>             Z(ILOZ:IHIZ,ILOZ:IHIZ) from the right\&.
!>             If WANTZ = \&.FALSE\&., then Z is unreferenced\&.
!> 
.fi
.PP
.br
\fILDZ\fP 
.PP
.nf
!>          LDZ is INTEGER
!>             LDA is the leading dimension of Z just as declared in
!>             the calling procedure\&. LDZ >= N\&.
!> 
.fi
.PP
.br
\fIV\fP 
.PP
.nf
!>          V is COMPLEX array, dimension (LDV,NSHFTS/2)
!> 
.fi
.PP
.br
\fILDV\fP 
.PP
.nf
!>          LDV is INTEGER
!>             LDV is the leading dimension of V as declared in the
!>             calling procedure\&.  LDV >= 3\&.
!> 
.fi
.PP
.br
\fIU\fP 
.PP
.nf
!>          U is COMPLEX array, dimension (LDU,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDU\fP 
.PP
.nf
!>          LDU is INTEGER
!>             LDU is the leading dimension of U just as declared in the
!>             in the calling subroutine\&.  LDU >= 2*NSHFTS\&.
!> 
.fi
.PP
.br
\fINV\fP 
.PP
.nf
!>          NV is INTEGER
!>             NV is the number of rows in WV agailable for workspace\&.
!>             NV >= 1\&.
!> 
.fi
.PP
.br
\fIWV\fP 
.PP
.nf
!>          WV is COMPLEX array, dimension (LDWV,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDWV\fP 
.PP
.nf
!>          LDWV is INTEGER
!>             LDWV is the leading dimension of WV as declared in the
!>             in the calling subroutine\&.  LDWV >= NV\&.
!> 
.fi
.PP
 
.br
\fINH\fP 
.PP
.nf
!>          NH is INTEGER
!>             NH is the number of columns in array WH available for
!>             workspace\&. NH >= 1\&.
!> 
.fi
.PP
.br
\fIWH\fP 
.PP
.nf
!>          WH is COMPLEX array, dimension (LDWH,NH)
!> 
.fi
.PP
.br
\fILDWH\fP 
.PP
.nf
!>          LDWH is INTEGER
!>             Leading dimension of WH just as declared in the
!>             calling procedure\&.  LDWH >= 2*NSHFTS\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Karen Braman and Ralph Byers, Department of Mathematics, University of Kansas, USA
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang

.PP
Thijs Steel, Department of Computer science, KU Leuven, Belgium 
.PP
\fBReferences:\fP
.RS 4
K\&. Braman, R\&. Byers and R\&. Mathias, The Multi-Shift QR Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 Performance, SIAM Journal of Matrix Analysis, volume 23, pages 929--947, 2002\&.
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang, Optimally packed chains of bulges in multishift QR algorithms\&. ACM Trans\&. Math\&. Softw\&. 40, 2, Article 12 (February 2014)\&. 
.PP
Definition at line \fB254\fP of file \fBclaqr5\&.f\fP\&.
.SS "subroutine dlaqr5 (logical wantt, logical wantz, integer kacc22, integer n, integer ktop, integer kbot, integer nshfts, double precision, dimension( * ) sr, double precision, dimension( * ) si, double precision, dimension( ldh, * ) h, integer ldh, integer iloz, integer ihiz, double precision, dimension( ldz, * ) z, integer ldz, double precision, dimension( ldv, * ) v, integer ldv, double precision, dimension( ldu, * ) u, integer ldu, integer nv, double precision, dimension( ldwv, * ) wv, integer ldwv, integer nh, double precision, dimension( ldwh, * ) wh, integer ldwh)"

.PP
\fBDLAQR5\fP performs a single small-bulge multi-shift QR sweep\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!>    DLAQR5, called by DLAQR0, performs a
!>    single small-bulge multi-shift QR sweep\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIWANTT\fP 
.PP
.nf
!>          WANTT is LOGICAL
!>             WANTT = \&.true\&. if the quasi-triangular Schur factor
!>             is being computed\&.  WANTT is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIWANTZ\fP 
.PP
.nf
!>          WANTZ is LOGICAL
!>             WANTZ = \&.true\&. if the orthogonal Schur factor is being
!>             computed\&.  WANTZ is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIKACC22\fP 
.PP
.nf
!>          KACC22 is INTEGER with value 0, 1, or 2\&.
!>             Specifies the computation mode of far-from-diagonal
!>             orthogonal updates\&.
!>        = 0: DLAQR5 does not accumulate reflections and does not
!>             use matrix-matrix multiply to update far-from-diagonal
!>             matrix entries\&.
!>        = 1: DLAQR5 accumulates reflections and uses matrix-matrix
!>             multiply to update the far-from-diagonal matrix entries\&.
!>        = 2: Same as KACC22 = 1\&. This option used to enable exploiting
!>             the 2-by-2 structure during matrix multiplications, but
!>             this is no longer supported\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>             N is the order of the Hessenberg matrix H upon which this
!>             subroutine operates\&.
!> 
.fi
.PP
.br
\fIKTOP\fP 
.PP
.nf
!>          KTOP is INTEGER
!> 
.fi
.PP
.br
\fIKBOT\fP 
.PP
.nf
!>          KBOT is INTEGER
!>             These are the first and last rows and columns of an
!>             isolated diagonal block upon which the QR sweep is to be
!>             applied\&. It is assumed without a check that
!>                       either KTOP = 1  or   H(KTOP,KTOP-1) = 0
!>             and
!>                       either KBOT = N  or   H(KBOT+1,KBOT) = 0\&.
!> 
.fi
.PP
.br
\fINSHFTS\fP 
.PP
.nf
!>          NSHFTS is INTEGER
!>             NSHFTS gives the number of simultaneous shifts\&.  NSHFTS
!>             must be positive and even\&.
!> 
.fi
.PP
.br
\fISR\fP 
.PP
.nf
!>          SR is DOUBLE PRECISION array, dimension (NSHFTS)
!> 
.fi
.PP
.br
\fISI\fP 
.PP
.nf
!>          SI is DOUBLE PRECISION array, dimension (NSHFTS)
!>             SR contains the real parts and SI contains the imaginary
!>             parts of the NSHFTS shifts of origin that define the
!>             multi-shift QR sweep\&.  On output SR and SI may be
!>             reordered\&.
!> 
.fi
.PP
.br
\fIH\fP 
.PP
.nf
!>          H is DOUBLE PRECISION array, dimension (LDH,N)
!>             On input H contains a Hessenberg matrix\&.  On output a
!>             multi-shift QR sweep with shifts SR(J)+i*SI(J) is applied
!>             to the isolated diagonal block in rows and columns KTOP
!>             through KBOT\&.
!> 
.fi
.PP
.br
\fILDH\fP 
.PP
.nf
!>          LDH is INTEGER
!>             LDH is the leading dimension of H just as declared in the
!>             calling procedure\&.  LDH >= MAX(1,N)\&.
!> 
.fi
.PP
.br
\fIILOZ\fP 
.PP
.nf
!>          ILOZ is INTEGER
!> 
.fi
.PP
.br
\fIIHIZ\fP 
.PP
.nf
!>          IHIZ is INTEGER
!>             Specify the rows of Z to which transformations must be
!>             applied if WANTZ is \&.TRUE\&.\&. 1 <= ILOZ <= IHIZ <= N
!> 
.fi
.PP
.br
\fIZ\fP 
.PP
.nf
!>          Z is DOUBLE PRECISION array, dimension (LDZ,IHIZ)
!>             If WANTZ = \&.TRUE\&., then the QR Sweep orthogonal
!>             similarity transformation is accumulated into
!>             Z(ILOZ:IHIZ,ILOZ:IHIZ) from the right\&.
!>             If WANTZ = \&.FALSE\&., then Z is unreferenced\&.
!> 
.fi
.PP
.br
\fILDZ\fP 
.PP
.nf
!>          LDZ is INTEGER
!>             LDA is the leading dimension of Z just as declared in
!>             the calling procedure\&. LDZ >= N\&.
!> 
.fi
.PP
.br
\fIV\fP 
.PP
.nf
!>          V is DOUBLE PRECISION array, dimension (LDV,NSHFTS/2)
!> 
.fi
.PP
.br
\fILDV\fP 
.PP
.nf
!>          LDV is INTEGER
!>             LDV is the leading dimension of V as declared in the
!>             calling procedure\&.  LDV >= 3\&.
!> 
.fi
.PP
.br
\fIU\fP 
.PP
.nf
!>          U is DOUBLE PRECISION array, dimension (LDU,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDU\fP 
.PP
.nf
!>          LDU is INTEGER
!>             LDU is the leading dimension of U just as declared in the
!>             in the calling subroutine\&.  LDU >= 2*NSHFTS\&.
!> 
.fi
.PP
.br
\fINV\fP 
.PP
.nf
!>          NV is INTEGER
!>             NV is the number of rows in WV agailable for workspace\&.
!>             NV >= 1\&.
!> 
.fi
.PP
.br
\fIWV\fP 
.PP
.nf
!>          WV is DOUBLE PRECISION array, dimension (LDWV,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDWV\fP 
.PP
.nf
!>          LDWV is INTEGER
!>             LDWV is the leading dimension of WV as declared in the
!>             in the calling subroutine\&.  LDWV >= NV\&.
!> 
.fi
.PP
 
.br
\fINH\fP 
.PP
.nf
!>          NH is INTEGER
!>             NH is the number of columns in array WH available for
!>             workspace\&. NH >= 1\&.
!> 
.fi
.PP
.br
\fIWH\fP 
.PP
.nf
!>          WH is DOUBLE PRECISION array, dimension (LDWH,NH)
!> 
.fi
.PP
.br
\fILDWH\fP 
.PP
.nf
!>          LDWH is INTEGER
!>             Leading dimension of WH just as declared in the
!>             calling procedure\&.  LDWH >= 2*NSHFTS\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Karen Braman and Ralph Byers, Department of Mathematics, University of Kansas, USA
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang

.PP
Thijs Steel, Department of Computer science, KU Leuven, Belgium 
.PP
\fBReferences:\fP
.RS 4
K\&. Braman, R\&. Byers and R\&. Mathias, The Multi-Shift QR Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 Performance, SIAM Journal of Matrix Analysis, volume 23, pages 929--947, 2002\&.
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang, Optimally packed chains of bulges in multishift QR algorithms\&. ACM Trans\&. Math\&. Softw\&. 40, 2, Article 12 (February 2014)\&. 
.PP
Definition at line \fB262\fP of file \fBdlaqr5\&.f\fP\&.
.SS "subroutine slaqr5 (logical wantt, logical wantz, integer kacc22, integer n, integer ktop, integer kbot, integer nshfts, real, dimension( * ) sr, real, dimension( * ) si, real, dimension( ldh, * ) h, integer ldh, integer iloz, integer ihiz, real, dimension( ldz, * ) z, integer ldz, real, dimension( ldv, * ) v, integer ldv, real, dimension( ldu, * ) u, integer ldu, integer nv, real, dimension( ldwv, * ) wv, integer ldwv, integer nh, real, dimension( ldwh, * ) wh, integer ldwh)"

.PP
\fBSLAQR5\fP performs a single small-bulge multi-shift QR sweep\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!>    SLAQR5, called by SLAQR0, performs a
!>    single small-bulge multi-shift QR sweep\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIWANTT\fP 
.PP
.nf
!>          WANTT is LOGICAL
!>             WANTT = \&.true\&. if the quasi-triangular Schur factor
!>             is being computed\&.  WANTT is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIWANTZ\fP 
.PP
.nf
!>          WANTZ is LOGICAL
!>             WANTZ = \&.true\&. if the orthogonal Schur factor is being
!>             computed\&.  WANTZ is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIKACC22\fP 
.PP
.nf
!>          KACC22 is INTEGER with value 0, 1, or 2\&.
!>             Specifies the computation mode of far-from-diagonal
!>             orthogonal updates\&.
!>        = 0: SLAQR5 does not accumulate reflections and does not
!>             use matrix-matrix multiply to update far-from-diagonal
!>             matrix entries\&.
!>        = 1: SLAQR5 accumulates reflections and uses matrix-matrix
!>             multiply to update the far-from-diagonal matrix entries\&.
!>        = 2: Same as KACC22 = 1\&. This option used to enable exploiting
!>             the 2-by-2 structure during matrix multiplications, but
!>             this is no longer supported\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>             N is the order of the Hessenberg matrix H upon which this
!>             subroutine operates\&.
!> 
.fi
.PP
.br
\fIKTOP\fP 
.PP
.nf
!>          KTOP is INTEGER
!> 
.fi
.PP
.br
\fIKBOT\fP 
.PP
.nf
!>          KBOT is INTEGER
!>             These are the first and last rows and columns of an
!>             isolated diagonal block upon which the QR sweep is to be
!>             applied\&. It is assumed without a check that
!>                       either KTOP = 1  or   H(KTOP,KTOP-1) = 0
!>             and
!>                       either KBOT = N  or   H(KBOT+1,KBOT) = 0\&.
!> 
.fi
.PP
.br
\fINSHFTS\fP 
.PP
.nf
!>          NSHFTS is INTEGER
!>             NSHFTS gives the number of simultaneous shifts\&.  NSHFTS
!>             must be positive and even\&.
!> 
.fi
.PP
.br
\fISR\fP 
.PP
.nf
!>          SR is REAL array, dimension (NSHFTS)
!> 
.fi
.PP
.br
\fISI\fP 
.PP
.nf
!>          SI is REAL array, dimension (NSHFTS)
!>             SR contains the real parts and SI contains the imaginary
!>             parts of the NSHFTS shifts of origin that define the
!>             multi-shift QR sweep\&.  On output SR and SI may be
!>             reordered\&.
!> 
.fi
.PP
.br
\fIH\fP 
.PP
.nf
!>          H is REAL array, dimension (LDH,N)
!>             On input H contains a Hessenberg matrix\&.  On output a
!>             multi-shift QR sweep with shifts SR(J)+i*SI(J) is applied
!>             to the isolated diagonal block in rows and columns KTOP
!>             through KBOT\&.
!> 
.fi
.PP
.br
\fILDH\fP 
.PP
.nf
!>          LDH is INTEGER
!>             LDH is the leading dimension of H just as declared in the
!>             calling procedure\&.  LDH >= MAX(1,N)\&.
!> 
.fi
.PP
.br
\fIILOZ\fP 
.PP
.nf
!>          ILOZ is INTEGER
!> 
.fi
.PP
.br
\fIIHIZ\fP 
.PP
.nf
!>          IHIZ is INTEGER
!>             Specify the rows of Z to which transformations must be
!>             applied if WANTZ is \&.TRUE\&.\&. 1 <= ILOZ <= IHIZ <= N
!> 
.fi
.PP
.br
\fIZ\fP 
.PP
.nf
!>          Z is REAL array, dimension (LDZ,IHIZ)
!>             If WANTZ = \&.TRUE\&., then the QR Sweep orthogonal
!>             similarity transformation is accumulated into
!>             Z(ILOZ:IHIZ,ILOZ:IHIZ) from the right\&.
!>             If WANTZ = \&.FALSE\&., then Z is unreferenced\&.
!> 
.fi
.PP
.br
\fILDZ\fP 
.PP
.nf
!>          LDZ is INTEGER
!>             LDA is the leading dimension of Z just as declared in
!>             the calling procedure\&. LDZ >= N\&.
!> 
.fi
.PP
.br
\fIV\fP 
.PP
.nf
!>          V is REAL array, dimension (LDV,NSHFTS/2)
!> 
.fi
.PP
.br
\fILDV\fP 
.PP
.nf
!>          LDV is INTEGER
!>             LDV is the leading dimension of V as declared in the
!>             calling procedure\&.  LDV >= 3\&.
!> 
.fi
.PP
.br
\fIU\fP 
.PP
.nf
!>          U is REAL array, dimension (LDU,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDU\fP 
.PP
.nf
!>          LDU is INTEGER
!>             LDU is the leading dimension of U just as declared in the
!>             in the calling subroutine\&.  LDU >= 2*NSHFTS\&.
!> 
.fi
.PP
.br
\fINV\fP 
.PP
.nf
!>          NV is INTEGER
!>             NV is the number of rows in WV agailable for workspace\&.
!>             NV >= 1\&.
!> 
.fi
.PP
.br
\fIWV\fP 
.PP
.nf
!>          WV is REAL array, dimension (LDWV,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDWV\fP 
.PP
.nf
!>          LDWV is INTEGER
!>             LDWV is the leading dimension of WV as declared in the
!>             in the calling subroutine\&.  LDWV >= NV\&.
!> 
.fi
.PP
 
.br
\fINH\fP 
.PP
.nf
!>          NH is INTEGER
!>             NH is the number of columns in array WH available for
!>             workspace\&. NH >= 1\&.
!> 
.fi
.PP
.br
\fIWH\fP 
.PP
.nf
!>          WH is REAL array, dimension (LDWH,NH)
!> 
.fi
.PP
.br
\fILDWH\fP 
.PP
.nf
!>          LDWH is INTEGER
!>             Leading dimension of WH just as declared in the
!>             calling procedure\&.  LDWH >= 2*NSHFTS\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Karen Braman and Ralph Byers, Department of Mathematics, University of Kansas, USA
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang

.PP
Thijs Steel, Department of Computer science, KU Leuven, Belgium 
.PP
\fBReferences:\fP
.RS 4
K\&. Braman, R\&. Byers and R\&. Mathias, The Multi-Shift QR Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 Performance, SIAM Journal of Matrix Analysis, volume 23, pages 929--947, 2002\&.
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang, Optimally packed chains of bulges in multishift QR algorithms\&. ACM Trans\&. Math\&. Softw\&. 40, 2, Article 12 (February 2014)\&. 
.PP
Definition at line \fB262\fP of file \fBslaqr5\&.f\fP\&.
.SS "subroutine zlaqr5 (logical wantt, logical wantz, integer kacc22, integer n, integer ktop, integer kbot, integer nshfts, complex*16, dimension( * ) s, complex*16, dimension( ldh, * ) h, integer ldh, integer iloz, integer ihiz, complex*16, dimension( ldz, * ) z, integer ldz, complex*16, dimension( ldv, * ) v, integer ldv, complex*16, dimension( ldu, * ) u, integer ldu, integer nv, complex*16, dimension( ldwv, * ) wv, integer ldwv, integer nh, complex*16, dimension( ldwh, * ) wh, integer ldwh)"

.PP
\fBZLAQR5\fP performs a single small-bulge multi-shift QR sweep\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
!>
!>    ZLAQR5, called by ZLAQR0, performs a
!>    single small-bulge multi-shift QR sweep\&.
!> 
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIWANTT\fP 
.PP
.nf
!>          WANTT is LOGICAL
!>             WANTT = \&.true\&. if the triangular Schur factor
!>             is being computed\&.  WANTT is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIWANTZ\fP 
.PP
.nf
!>          WANTZ is LOGICAL
!>             WANTZ = \&.true\&. if the unitary Schur factor is being
!>             computed\&.  WANTZ is set to \&.false\&. otherwise\&.
!> 
.fi
.PP
.br
\fIKACC22\fP 
.PP
.nf
!>          KACC22 is INTEGER with value 0, 1, or 2\&.
!>             Specifies the computation mode of far-from-diagonal
!>             orthogonal updates\&.
!>        = 0: ZLAQR5 does not accumulate reflections and does not
!>             use matrix-matrix multiply to update far-from-diagonal
!>             matrix entries\&.
!>        = 1: ZLAQR5 accumulates reflections and uses matrix-matrix
!>             multiply to update the far-from-diagonal matrix entries\&.
!>        = 2: Same as KACC22 = 1\&. This option used to enable exploiting
!>             the 2-by-2 structure during matrix multiplications, but
!>             this is no longer supported\&.
!> 
.fi
.PP
.br
\fIN\fP 
.PP
.nf
!>          N is INTEGER
!>             N is the order of the Hessenberg matrix H upon which this
!>             subroutine operates\&.
!> 
.fi
.PP
.br
\fIKTOP\fP 
.PP
.nf
!>          KTOP is INTEGER
!> 
.fi
.PP
.br
\fIKBOT\fP 
.PP
.nf
!>          KBOT is INTEGER
!>             These are the first and last rows and columns of an
!>             isolated diagonal block upon which the QR sweep is to be
!>             applied\&. It is assumed without a check that
!>                       either KTOP = 1  or   H(KTOP,KTOP-1) = 0
!>             and
!>                       either KBOT = N  or   H(KBOT+1,KBOT) = 0\&.
!> 
.fi
.PP
.br
\fINSHFTS\fP 
.PP
.nf
!>          NSHFTS is INTEGER
!>             NSHFTS gives the number of simultaneous shifts\&.  NSHFTS
!>             must be positive and even\&.
!> 
.fi
.PP
.br
\fIS\fP 
.PP
.nf
!>          S is COMPLEX*16 array, dimension (NSHFTS)
!>             S contains the shifts of origin that define the multi-
!>             shift QR sweep\&.  On output S may be reordered\&.
!> 
.fi
.PP
.br
\fIH\fP 
.PP
.nf
!>          H is COMPLEX*16 array, dimension (LDH,N)
!>             On input H contains a Hessenberg matrix\&.  On output a
!>             multi-shift QR sweep with shifts SR(J)+i*SI(J) is applied
!>             to the isolated diagonal block in rows and columns KTOP
!>             through KBOT\&.
!> 
.fi
.PP
.br
\fILDH\fP 
.PP
.nf
!>          LDH is INTEGER
!>             LDH is the leading dimension of H just as declared in the
!>             calling procedure\&.  LDH >= MAX(1,N)\&.
!> 
.fi
.PP
.br
\fIILOZ\fP 
.PP
.nf
!>          ILOZ is INTEGER
!> 
.fi
.PP
.br
\fIIHIZ\fP 
.PP
.nf
!>          IHIZ is INTEGER
!>             Specify the rows of Z to which transformations must be
!>             applied if WANTZ is \&.TRUE\&.\&. 1 <= ILOZ <= IHIZ <= N
!> 
.fi
.PP
.br
\fIZ\fP 
.PP
.nf
!>          Z is COMPLEX*16 array, dimension (LDZ,IHIZ)
!>             If WANTZ = \&.TRUE\&., then the QR Sweep unitary
!>             similarity transformation is accumulated into
!>             Z(ILOZ:IHIZ,ILOZ:IHIZ) from the right\&.
!>             If WANTZ = \&.FALSE\&., then Z is unreferenced\&.
!> 
.fi
.PP
.br
\fILDZ\fP 
.PP
.nf
!>          LDZ is INTEGER
!>             LDA is the leading dimension of Z just as declared in
!>             the calling procedure\&. LDZ >= N\&.
!> 
.fi
.PP
.br
\fIV\fP 
.PP
.nf
!>          V is COMPLEX*16 array, dimension (LDV,NSHFTS/2)
!> 
.fi
.PP
.br
\fILDV\fP 
.PP
.nf
!>          LDV is INTEGER
!>             LDV is the leading dimension of V as declared in the
!>             calling procedure\&.  LDV >= 3\&.
!> 
.fi
.PP
.br
\fIU\fP 
.PP
.nf
!>          U is COMPLEX*16 array, dimension (LDU,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDU\fP 
.PP
.nf
!>          LDU is INTEGER
!>             LDU is the leading dimension of U just as declared in the
!>             in the calling subroutine\&.  LDU >= 2*NSHFTS\&.
!> 
.fi
.PP
.br
\fINV\fP 
.PP
.nf
!>          NV is INTEGER
!>             NV is the number of rows in WV agailable for workspace\&.
!>             NV >= 1\&.
!> 
.fi
.PP
.br
\fIWV\fP 
.PP
.nf
!>          WV is COMPLEX*16 array, dimension (LDWV,2*NSHFTS)
!> 
.fi
.PP
.br
\fILDWV\fP 
.PP
.nf
!>          LDWV is INTEGER
!>             LDWV is the leading dimension of WV as declared in the
!>             in the calling subroutine\&.  LDWV >= NV\&.
!> 
.fi
.PP
 
.br
\fINH\fP 
.PP
.nf
!>          NH is INTEGER
!>             NH is the number of columns in array WH available for
!>             workspace\&. NH >= 1\&.
!> 
.fi
.PP
.br
\fIWH\fP 
.PP
.nf
!>          WH is COMPLEX*16 array, dimension (LDWH,NH)
!> 
.fi
.PP
.br
\fILDWH\fP 
.PP
.nf
!>          LDWH is INTEGER
!>             Leading dimension of WH just as declared in the
!>             calling procedure\&.  LDWH >= 2*NSHFTS\&.
!> 
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 

.PP
Univ\&. of California Berkeley 

.PP
Univ\&. of Colorado Denver 

.PP
NAG Ltd\&. 
.RE
.PP
\fBContributors:\fP
.RS 4
Karen Braman and Ralph Byers, Department of Mathematics, University of Kansas, USA
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang

.PP
Thijs Steel, Department of Computer science, KU Leuven, Belgium 
.PP
\fBReferences:\fP
.RS 4
K\&. Braman, R\&. Byers and R\&. Mathias, The Multi-Shift QR Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 Performance, SIAM Journal of Matrix Analysis, volume 23, pages 929--947, 2002\&.
.RE
.PP
Lars Karlsson, Daniel Kressner, and Bruno Lang, Optimally packed chains of bulges in multishift QR algorithms\&. ACM Trans\&. Math\&. Softw\&. 40, 2, Article 12 (February 2014)\&. 
.PP
Definition at line \fB254\fP of file \fBzlaqr5\&.f\fP\&.
.SH "Author"
.PP 
Generated automatically by Doxygen for LAPACK from the source code\&.