Developer Reference

  • 0.9
  • 09/09/2020
  • Public Content
Contents

Generalized Singular Value Decomposition: LAPACK Computational Routines

This
topic
describes LAPACK computational routines used for finding the generalized singular value decomposition (GSVD) of two matrices
A
and
B
as
U
H
AQ
=
D
1
*(0
R
)
,
V
H
BQ
=
D
2
*(0
R
)
,
where
U
,
V
, and
Q
are orthogonal/unitary matrices,
R
is a nonsingular upper triangular matrix, and
D
1
,
D
2
are “diagonal” matrices of the structure detailed in the routines description section.
Table
“Computational Routines for Generalized Singular Value Decomposition”
lists LAPACK routines that perform generalized singular value decomposition of matrices.
Computational Routines for Generalized Singular Value Decomposition
Routine name
Operation performed
Computes the preprocessing decomposition for the generalized SVD
Performs preprocessing for a generalized SVD.
Computes generalized SVD.
Computes the generalized SVD of two upper triangular or trapezoidal matrices
You can use routines listed in the above table as well as the driver routine ggsvd to find the GSVD of a pair of general rectangular matrices.

Product and Performance Information

1

Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804