|
Packit |
67cb25 |
/* linalg/hermtd.c
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* Copyright (C) 2001, 2007, 2009 Brian Gough
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is free software; you can redistribute it and/or modify
|
|
Packit |
67cb25 |
* it under the terms of the GNU General Public License as published by
|
|
Packit |
67cb25 |
* the Free Software Foundation; either version 3 of the License, or (at
|
|
Packit |
67cb25 |
* your option) any later version.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is distributed in the hope that it will be useful, but
|
|
Packit |
67cb25 |
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Packit |
67cb25 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Packit |
67cb25 |
* General Public License for more details.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* You should have received a copy of the GNU General Public License
|
|
Packit |
67cb25 |
* along with this program; if not, write to the Free Software
|
|
Packit |
67cb25 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
Packit |
67cb25 |
*/
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Factorise a hermitian matrix A into
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* A = U T U'
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* where U is unitary and T is real symmetric tridiagonal. Only the
|
|
Packit |
67cb25 |
* diagonal and lower triangular part of A is referenced and modified.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* On exit, T is stored in the diagonal and first subdiagonal of
|
|
Packit |
67cb25 |
* A. Since T is symmetric the upper diagonal is not stored.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* U is stored as a packed set of Householder transformations in the
|
|
Packit |
67cb25 |
* lower triangular part of the input matrix below the first subdiagonal.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* The full matrix for U can be obtained as the product
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* U = U_N ... U_2 U_1
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* where
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* U_i = (I - tau_i * v_i * v_i')
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* and where v_i is a Householder vector
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* v_i = [0, ..., 0, 1, A(i+2,i), A(i+3,i), ... , A(N,i)]
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This storage scheme is the same as in LAPACK. See LAPACK's
|
|
Packit |
67cb25 |
* chetd2.f for details.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* See Golub & Van Loan, "Matrix Computations" (3rd ed), Section 8.3 */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
#include <config.h>
|
|
Packit |
67cb25 |
#include <stdlib.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_math.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_vector.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_matrix.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_blas.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_complex_math.h>
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
#include <gsl/gsl_linalg.h>
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
gsl_linalg_hermtd_decomp (gsl_matrix_complex * A, gsl_vector_complex * tau)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
if (A->size1 != A->size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("hermitian tridiagonal decomposition requires square matrix",
|
|
Packit |
67cb25 |
GSL_ENOTSQR);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (tau->size + 1 != A->size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("size of tau must be (matrix size - 1)", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t N = A->size1;
|
|
Packit |
67cb25 |
size_t i;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const gsl_complex zero = gsl_complex_rect (0.0, 0.0);
|
|
Packit |
67cb25 |
const gsl_complex one = gsl_complex_rect (1.0, 0.0);
|
|
Packit |
67cb25 |
const gsl_complex neg_one = gsl_complex_rect (-1.0, 0.0);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0 ; i < N - 1; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_vector_complex_view c = gsl_matrix_complex_column (A, i);
|
|
Packit |
67cb25 |
gsl_vector_complex_view v = gsl_vector_complex_subvector (&c.vector, i + 1, N - (i + 1));
|
|
Packit |
67cb25 |
gsl_complex tau_i = gsl_linalg_complex_householder_transform (&v.vector);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Apply the transformation H^T A H to the remaining columns */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if ((i + 1) < (N - 1)
|
|
Packit |
67cb25 |
&& !(GSL_REAL(tau_i) == 0.0 && GSL_IMAG(tau_i) == 0.0))
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_matrix_complex_view m =
|
|
Packit |
67cb25 |
gsl_matrix_complex_submatrix (A, i + 1, i + 1,
|
|
Packit |
67cb25 |
N - (i+1), N - (i+1));
|
|
Packit |
67cb25 |
gsl_complex ei = gsl_vector_complex_get(&v.vector, 0);
|
|
Packit |
67cb25 |
gsl_vector_complex_view x = gsl_vector_complex_subvector (tau, i, N-(i+1));
|
|
Packit |
67cb25 |
gsl_vector_complex_set (&v.vector, 0, one);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* x = tau * A * v */
|
|
Packit |
67cb25 |
gsl_blas_zhemv (CblasLower, tau_i, &m.matrix, &v.vector, zero, &x.vector);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* w = x - (1/2) tau * (x' * v) * v */
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_complex xv, txv, alpha;
|
|
Packit |
67cb25 |
gsl_blas_zdotc(&x.vector, &v.vector, &xv);
|
|
Packit |
67cb25 |
txv = gsl_complex_mul(tau_i, xv);
|
|
Packit |
67cb25 |
alpha = gsl_complex_mul_real(txv, -0.5);
|
|
Packit |
67cb25 |
gsl_blas_zaxpy(alpha, &v.vector, &x.vector);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* apply the transformation A = A - v w' - w v' */
|
|
Packit |
67cb25 |
gsl_blas_zher2(CblasLower, neg_one, &v.vector, &x.vector, &m.matrix);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_vector_complex_set (&v.vector, 0, ei);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_vector_complex_set (tau, i, tau_i);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Form the orthogonal matrix U from the packed QR matrix */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
gsl_linalg_hermtd_unpack (const gsl_matrix_complex * A,
|
|
Packit |
67cb25 |
const gsl_vector_complex * tau,
|
|
Packit |
67cb25 |
gsl_matrix_complex * U,
|
|
Packit |
67cb25 |
gsl_vector * diag,
|
|
Packit |
67cb25 |
gsl_vector * sdiag)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
if (A->size1 != A->size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("matrix A must be sqaure", GSL_ENOTSQR);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (tau->size + 1 != A->size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("size of tau must be (matrix size - 1)", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (U->size1 != A->size1 || U->size2 != A->size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("size of U must match size of A", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (diag->size != A->size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("size of diagonal must match size of A", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (sdiag->size + 1 != A->size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("size of subdiagonal must be (matrix size - 1)", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t N = A->size1;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t i;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Initialize U to the identity */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_matrix_complex_set_identity (U);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = N - 1; i-- > 0;)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_complex ti = gsl_vector_complex_get (tau, i);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_vector_complex_const_view c = gsl_matrix_complex_const_column (A, i);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_vector_complex_const_view h =
|
|
Packit |
67cb25 |
gsl_vector_complex_const_subvector (&c.vector, i + 1, N - (i+1));
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_matrix_complex_view m =
|
|
Packit |
67cb25 |
gsl_matrix_complex_submatrix (U, i + 1, i + 1, N-(i+1), N-(i+1));
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_linalg_complex_householder_hm (ti, &h.vector, &m.matrix);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Copy diagonal into diag */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < N; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_complex Aii = gsl_matrix_complex_get (A, i, i);
|
|
Packit |
67cb25 |
gsl_vector_set (diag, i, GSL_REAL(Aii));
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Copy subdiagonal into sdiag */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < N - 1; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_complex Aji = gsl_matrix_complex_get (A, i+1, i);
|
|
Packit |
67cb25 |
gsl_vector_set (sdiag, i, GSL_REAL(Aji));
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
gsl_linalg_hermtd_unpack_T (const gsl_matrix_complex * A,
|
|
Packit |
67cb25 |
gsl_vector * diag,
|
|
Packit |
67cb25 |
gsl_vector * sdiag)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
if (A->size1 != A->size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("matrix A must be sqaure", GSL_ENOTSQR);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (diag->size != A->size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("size of diagonal must match size of A", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (sdiag->size + 1 != A->size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("size of subdiagonal must be (matrix size - 1)", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t N = A->size1;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t i;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Copy diagonal into diag */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < N; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_complex Aii = gsl_matrix_complex_get (A, i, i);
|
|
Packit |
67cb25 |
gsl_vector_set (diag, i, GSL_REAL(Aii));
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* Copy subdiagonal into sd */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < N - 1; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
gsl_complex Aji = gsl_matrix_complex_get (A, i+1, i);
|
|
Packit |
67cb25 |
gsl_vector_set (sdiag, i, GSL_REAL(Aji));
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|