⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 init_source.c

📁 开放gsl矩阵运算
💻 C
字号:
/* matrix/init_source.c *  * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough *  * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or (at * your option) any later version. *  * This program is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU * General Public License for more details. *  * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */TYPE (gsl_matrix) *FUNCTION (gsl_matrix, alloc) (const size_t n1, const size_t n2){  TYPE (gsl_block) * block;  TYPE (gsl_matrix) * m;  if (n1 == 0)    {      GSL_ERROR_VAL ("matrix dimension n1 must be positive integer",			GSL_EINVAL, 0);    }  else if (n2 == 0)    {      GSL_ERROR_VAL ("matrix dimension n2 must be positive integer",			GSL_EINVAL, 0);    }  m = (TYPE (gsl_matrix) *) malloc (sizeof (TYPE (gsl_matrix)));  if (m == 0)    {      GSL_ERROR_VAL ("failed to allocate space for matrix struct",			GSL_ENOMEM, 0);    }  /* FIXME: n1*n2 could overflow for large dimensions */  block = FUNCTION(gsl_block, alloc) (n1 * n2) ;  if (block == 0)    {      GSL_ERROR_VAL ("failed to allocate space for block",			GSL_ENOMEM, 0);    }  m->data = block->data;  m->size1 = n1;  m->size2 = n2;  m->tda = n2;   m->block = block;  m->owner = 1;  return m;}TYPE (gsl_matrix) *FUNCTION (gsl_matrix, calloc) (const size_t n1, const size_t n2){  size_t i;  TYPE (gsl_matrix) * m = FUNCTION (gsl_matrix, alloc) (n1, n2);  if (m == 0)    return 0;  /* initialize matrix to zero */  for (i = 0; i < MULTIPLICITY * n1 * n2; i++)    {      m->data[i] = 0;    }  return m;}TYPE (gsl_matrix) *FUNCTION (gsl_matrix, alloc_from_block) (TYPE(gsl_block) * block,                                          const size_t offset,                                         const size_t n1,                                          const size_t n2,                                         const size_t d2){  TYPE (gsl_matrix) * m;  if (n1 == 0)    {      GSL_ERROR_VAL ("matrix dimension n1 must be positive integer",			GSL_EINVAL, 0);    }  else if (n2 == 0)    {      GSL_ERROR_VAL ("matrix dimension n2 must be positive integer",			GSL_EINVAL, 0);    }  else if (d2 < n2)    {      GSL_ERROR_VAL ("matrix dimension d2 must be greater than n2",			GSL_EINVAL, 0);    }  else if (block->size < offset + n1 * d2)    {      GSL_ERROR_VAL ("matrix size exceeds available block size",			GSL_EINVAL, 0);    }  m = (TYPE (gsl_matrix) *) malloc (sizeof (TYPE (gsl_matrix)));  if (m == 0)    {      GSL_ERROR_VAL ("failed to allocate space for matrix struct",			GSL_ENOMEM, 0);    }  m->data = block->data + MULTIPLICITY * offset;  m->size1 = n1;  m->size2 = n2;  m->tda = d2;  m->block = block;  m->owner = 0;  return m;}TYPE (gsl_matrix) *FUNCTION (gsl_matrix, alloc_from_matrix) (TYPE(gsl_matrix) * mm,                                           const size_t k1,                                          const size_t k2,                                          const size_t n1,                                           const size_t n2){  TYPE (gsl_matrix) * m;  if (n1 == 0)    {      GSL_ERROR_VAL ("matrix dimension n1 must be positive integer",			GSL_EINVAL, 0);    }  else if (n2 == 0)    {      GSL_ERROR_VAL ("matrix dimension n2 must be positive integer",			GSL_EINVAL, 0);    }  else if (k1 + n1 > mm->size1)    {      GSL_ERROR_VAL ("submatrix dimension 1 exceeds size of original",			GSL_EINVAL, 0);    }  else if (k2 + n2 > mm->size2)    {      GSL_ERROR_VAL ("submatrix dimension 2 exceeds size of original",			GSL_EINVAL, 0);    }  m = (TYPE (gsl_matrix) *) malloc (sizeof (TYPE (gsl_matrix)));  if (m == 0)    {      GSL_ERROR_VAL ("failed to allocate space for matrix struct",			GSL_ENOMEM, 0);    }  m->data = mm->data + k1 * mm->tda + k2 ;  m->size1 = n1;  m->size2 = n2;  m->tda = mm->tda;  m->block = mm->block;  m->owner = 0;  return m;}voidFUNCTION (gsl_matrix, free) (TYPE (gsl_matrix) * m){  if (m->owner)    {      FUNCTION(gsl_block, free) (m->block);    }  free (m);}voidFUNCTION (gsl_matrix, set_identity) (TYPE (gsl_matrix) * m){  size_t i, j;  ATOMIC * const data = m->data;  const size_t p = m->size1 ;  const size_t q = m->size2 ;  const size_t tda = m->tda ;  const BASE zero = ZERO;  const BASE one = ONE;  for (i = 0; i < p; i++)    {      for (j = 0; j < q; j++)        {          *(BASE *) (data + MULTIPLICITY * (i * tda + j)) = ((i == j) ? one : zero);        }    }}voidFUNCTION (gsl_matrix, set_zero) (TYPE (gsl_matrix) * m){  size_t i, j;  ATOMIC * const data = m->data;  const size_t p = m->size1 ;  const size_t q = m->size2 ;  const size_t tda = m->tda ;  const BASE zero = ZERO;  for (i = 0; i < p; i++)    {      for (j = 0; j < q; j++)        {          *(BASE *) (data + MULTIPLICITY * (i * tda + j)) = zero;        }    }}voidFUNCTION (gsl_matrix, set_all) (TYPE (gsl_matrix) * m, BASE x){  size_t i, j;  ATOMIC * const data = m->data;  const size_t p = m->size1 ;  const size_t q = m->size2 ;  const size_t tda = m->tda ;  for (i = 0; i < p; i++)    {      for (j = 0; j < q; j++)        {          *(BASE *) (data + MULTIPLICITY * (i * tda + j)) = x;        }    }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -