| 1 |
// |
| 2 |
// ZQUATEV: Diagonalization of quaternionic matrices |
| 3 |
// File : zquatev.h |
| 4 |
// Copyright (c) 2013, Toru Shiozaki ([email protected]) |
| 5 |
// All rights reserved. |
| 6 |
// |
| 7 |
// Redistribution and use in source and binary forms, with or without |
| 8 |
// modification, are permitted provided that the following conditions are met: |
| 9 |
// |
| 10 |
// 1. Redistributions of source code must retain the above copyright notice, this |
| 11 |
// list of conditions and the following disclaimer. |
| 12 |
// 2. Redistributions in binary form must reproduce the above copyright notice, |
| 13 |
// this list of conditions and the following disclaimer in the documentation |
| 14 |
// and/or other materials provided with the distribution. |
| 15 |
// |
| 16 |
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
| 17 |
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
| 18 |
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 19 |
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR |
| 20 |
// ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 21 |
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 22 |
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
| 23 |
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 24 |
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| 25 |
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 |
// |
| 27 |
// The views and conclusions contained in the software and documentation are those |
| 28 |
// of the authors and should not be interpreted as representing official policies, |
| 29 |
// either expressed or implied, of the FreeBSD Project. |
| 30 |
// |
| 31 |
|
| 32 |
#ifndef __TS_ZQUATEV_H |
| 33 |
#define __TS_ZQUATEV_H |
| 34 |
|
| 35 |
#include <memory> |
| 36 |
#include <complex> |
| 37 |
|
| 38 |
namespace ts { |
| 39 |
|
| 40 |
// Diagonalize a quaternion matrix: |
| 41 |
// |
| 42 |
// ( A -B* ) |
| 43 |
// ( B A* ) |
| 44 |
// |
| 45 |
// where A is Hermitian and B is anti-Hermitian. Only the left half of the matrix |
| 46 |
// will be referenced as an input. |
| 47 |
// |
| 48 |
// This matrix has doubly-degenerate eigenvalues, and there is a set of |
| 49 |
// eivenvectors that has the same symmetry property: |
| 50 |
// |
| 51 |
// ( U -V* ) |
| 52 |
// ( V U* ) |
| 53 |
// |
| 54 |
extern int zquatev(const int n2, std::complex<double>* const D, const int nld2, double* const eig); |
| 55 |
|
| 56 |
// internal functions |
| 57 |
namespace impl { |
| 58 |
extern void panel_update(const int current_size, const int block_size, |
| 59 |
std::complex<double>* const D0, std::complex<double>* const D1, |
| 60 |
std::complex<double>* const Q0, std::complex<double>* const Q1, |
| 61 |
const int ld, const int original_size, std::complex<double>* const work); |
| 62 |
extern void unblocked_update(const int current_size, |
| 63 |
std::complex<double>* const D0, std::complex<double>* const D1, |
| 64 |
std::complex<double>* const Q0, std::complex<double>* const Q1, |
| 65 |
const int ld, const int original_size, std::complex<double>* const work); |
| 66 |
|
| 67 |
extern void transpose (const int, const int, const std::complex<double>*, const int, std::complex<double>*, const int); |
| 68 |
extern void transpose_conj(const int, const int, const std::complex<double>*, const int, std::complex<double>*, const int); |
| 69 |
|
| 70 |
namespace { |
| 71 |
void conj_n(std::complex<double>* p, const size_t n) { |
| 72 |
for (size_t i = 0; i != n; ++i) |
| 73 |
p[i] = std::conj(p[i]); |
| 74 |
} |
| 75 |
} |
| 76 |
} |
| 77 |
} |
| 78 |
|
| 79 |
#endif |