|
Packit |
67cb25 |
/* matrix/swap_source.c
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Gerard Jungman, 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 |
int
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, swap_rows) (TYPE (gsl_matrix) * m,
|
|
Packit |
67cb25 |
const size_t i, const size_t j)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t size1 = m->size1;
|
|
Packit |
67cb25 |
const size_t size2 = m->size2;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (i >= size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("first row index is out of range", GSL_EINVAL);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (j >= size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("second row index is out of range", GSL_EINVAL);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (i != j)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
ATOMIC *row1 = m->data + MULTIPLICITY * i * m->tda;
|
|
Packit |
67cb25 |
ATOMIC *row2 = m->data + MULTIPLICITY * j * m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t k;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY * size2; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
ATOMIC tmp = row1[k] ;
|
|
Packit |
67cb25 |
row1[k] = row2[k] ;
|
|
Packit |
67cb25 |
row2[k] = tmp ;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, swap_columns) (TYPE (gsl_matrix) * m,
|
|
Packit |
67cb25 |
const size_t i, const size_t j)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t size1 = m->size1;
|
|
Packit |
67cb25 |
const size_t size2 = m->size2;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (i >= size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("first column index is out of range", GSL_EINVAL);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (j >= size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("second column index is out of range", GSL_EINVAL);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (i != j)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
ATOMIC *col1 = m->data + MULTIPLICITY * i;
|
|
Packit |
67cb25 |
ATOMIC *col2 = m->data + MULTIPLICITY * j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t p;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (p = 0; p < size1; p++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t k;
|
|
Packit |
67cb25 |
size_t n = p * MULTIPLICITY * m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
ATOMIC tmp = col1[n+k] ;
|
|
Packit |
67cb25 |
col1[n+k] = col2[n+k] ;
|
|
Packit |
67cb25 |
col2[n+k] = tmp ;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, swap_rowcol) (TYPE (gsl_matrix) * m,
|
|
Packit |
67cb25 |
const size_t i, const size_t j)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t size1 = m->size1;
|
|
Packit |
67cb25 |
const size_t size2 = m->size2;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (size1 != size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("matrix must be square to swap row and column", GSL_ENOTSQR);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (i >= size1)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("row index is out of range", GSL_EINVAL);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (j >= size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("column index is out of range", GSL_EINVAL);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
ATOMIC *row = m->data + MULTIPLICITY * i * m->tda;
|
|
Packit |
67cb25 |
ATOMIC *col = m->data + MULTIPLICITY * j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t p;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (p = 0; p < size1; p++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t k;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t r = p * MULTIPLICITY;
|
|
Packit |
67cb25 |
size_t c = p * MULTIPLICITY * m->tda;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
ATOMIC tmp = col[c+k] ;
|
|
Packit |
67cb25 |
col[c+k] = row[r+k] ;
|
|
Packit |
67cb25 |
row[r+k] = tmp ;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, transpose) (TYPE (gsl_matrix) * m)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t size1 = m->size1;
|
|
Packit |
67cb25 |
const size_t size2 = m->size2;
|
|
Packit |
67cb25 |
size_t i, j, k;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (size1 != size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("matrix must be square to take transpose", GSL_ENOTSQR);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < size1; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = i + 1 ; j < size2 ; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t e1 = (i * m->tda + j) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
size_t e2 = (j * m->tda + i) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
ATOMIC tmp = m->data[e1] ;
|
|
Packit |
67cb25 |
m->data[e1] = m->data[e2] ;
|
|
Packit |
67cb25 |
m->data[e2] = tmp ;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, transpose_memcpy) (TYPE (gsl_matrix) * dest,
|
|
Packit |
67cb25 |
const TYPE (gsl_matrix) * src)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t src_size1 = src->size1;
|
|
Packit |
67cb25 |
const size_t src_size2 = src->size2;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const size_t dest_size1 = dest->size1;
|
|
Packit |
67cb25 |
const size_t dest_size2 = dest->size2;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
size_t i, j, k;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (dest_size2 != src_size1 || dest_size1 != src_size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("dimensions of dest matrix must be transpose of src matrix",
|
|
Packit |
67cb25 |
GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < dest_size1; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0 ; j < dest_size2; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t e1 = (i * dest->tda + j) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
size_t e2 = (j * src->tda + i) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
dest->data[e1] = src->data[e2] ;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
FUNCTION (gsl_matrix, transpose_tricpy) (const char uplo_src,
|
|
Packit |
67cb25 |
const int copy_diag, TYPE (gsl_matrix) * dest,
|
|
Packit |
67cb25 |
const TYPE (gsl_matrix) * src)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t src_size1 = src->size1;
|
|
Packit |
67cb25 |
const size_t src_size2 = src->size2;
|
|
Packit |
67cb25 |
const size_t dest_size1 = dest->size1;
|
|
Packit |
67cb25 |
const size_t dest_size2 = dest->size2;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (src_size1 != dest_size1 || src_size2 != dest_size2)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("matrix sizes are different", GSL_EBADLEN);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
const size_t src_tda = src->tda ;
|
|
Packit |
67cb25 |
const size_t dest_tda = dest->tda ;
|
|
Packit |
67cb25 |
size_t i, j, k;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (uplo_src == 'L')
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* copy lower triangle of src to upper triangle of dest */
|
|
Packit |
67cb25 |
for (i = 0; i < src_size1 ; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = 0; j < i; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t e1 = (j * dest_tda + i) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
size_t e2 = (i * src_tda + j) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
dest->data[e1] = src->data[e2];
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else if (uplo_src == 'U')
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
/* copy upper triangle of src to lower triangle of dest */
|
|
Packit |
67cb25 |
for (i = 0; i < src_size1 ; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (j = i + 1; j < src_size2; j++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t e1 = (j * dest_tda + i) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
size_t e2 = (i * src_tda + j) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
dest->data[e1] = src->data[e2];
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
GSL_ERROR ("invalid uplo_src parameter", GSL_EINVAL);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (copy_diag)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (i = 0; i < src_size1 ; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
for (k = 0; k < MULTIPLICITY; k++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t e1 = (i * dest_tda + i) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
size_t e2 = (i * src_tda + i) * MULTIPLICITY + k ;
|
|
Packit |
67cb25 |
dest->data[e1] = src->data[e2];
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return GSL_SUCCESS;
|
|
Packit |
67cb25 |
}
|