Loading…

The multifacet graphically contracted function method. II. A general procedure for the parameterization of orthogonal matrices and its application to arc factors

Practical algorithms are presented for the parameterization of orthogonal matrices Q ∈ R(m×n) in terms of the minimal number of essential parameters {φ}. Both square n = m and rectangular n < m situations are examined. Two separate kinds of parameterizations are considered, one in which the indiv...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of chemical physics 2014-08, Vol.141 (6), p.064106-064106
Main Authors: Shepard, Ron, Gidofalvi, Gergely, Brozell, Scott R
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Practical algorithms are presented for the parameterization of orthogonal matrices Q ∈ R(m×n) in terms of the minimal number of essential parameters {φ}. Both square n = m and rectangular n < m situations are examined. Two separate kinds of parameterizations are considered, one in which the individual columns of Q are distinct, and the other in which only Span(Q) is significant. The latter is relevant to chemical applications such as the representation of the arc factors in the multifacet graphically contracted function method and the representation of orbital coefficients in SCF and DFT methods. The parameterizations are represented formally using products of elementary Householder reflector matrices. Standard mathematical libraries, such as LAPACK, may be used to perform the basic low-level factorization, reduction, and other algebraic operations. Some care must be taken with the choice of phase factors in order to ensure stability and continuity. The transformation of gradient arrays between the Q and {φ} parameterizations is also considered. Operation counts for all factorizations and transformations are determined. Numerical results are presented which demonstrate the robustness, stability, and accuracy of these algorithms.
ISSN:0021-9606
1089-7690
DOI:10.1063/1.4890735