![]() |
![]()
| ![]() |
![]()
NAMESRC/dlaqr5.f SYNOPSISFunctions/Subroutinessubroutine dlaqr5 (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)
Function/Subroutine Documentationsubroutine 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)DLAQR5 performs a single small-bulge multi-shift QR sweep. Purpose:
Parameters 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
Author Univ. of Tennessee
Univ. of California Berkeley Univ. of Colorado Denver NAG Ltd. Contributors: Karen Braman and Ralph Byers, Department of Mathematics,
University of Kansas, USA
Lars Karlsson, Daniel Kressner, and Bruno Lang Thijs Steel, Department of Computer science, KU Leuven, Belgium References: 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.
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). Definition at line 262 of file dlaqr5.f. AuthorGenerated automatically by Doxygen for LAPACK from the source code.
|