tridiag.c

来自「开放gsl矩阵运算」· C语言 代码 · 共 259 行

C
259
字号
/* linalg/tridiag.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. *//* Author: G. Jungman */#include <config.h>#include <stdlib.h>#include <gsl/gsl_errno.h>#include "tridiag.h"#include "gsl_linalg.h"/* for description of method see [Engeln-Mullges + Uhlig, p. 92] * *     diag[0]  offdiag[0]             0   ..... *  offdiag[0]     diag[1]    offdiag[1]   ..... *           0  offdiag[1]       diag[2] *           0           0    offdiag[2]   ..... */staticint solve_tridiag(  const double diag[], size_t d_stride,  const double offdiag[], size_t o_stride,  const double b[], size_t b_stride,  double x[], size_t x_stride,  size_t N){  int status;  double *gamma = (double *) malloc (N * sizeof (double));  double *alpha = (double *) malloc (N * sizeof (double));  double *c = (double *) malloc (N * sizeof (double));  double *z = (double *) malloc (N * sizeof (double));  if (gamma == 0 || alpha == 0 || c == 0 || z == 0)    {      status = GSL_ENOMEM;    }  else    {      size_t i, j;      /* Cholesky decomposition         A = L.D.L^t         lower_diag(L) = gamma         diag(D) = alpha       */      alpha[0] = diag[0];      gamma[0] = offdiag[0] / alpha[0];      for (i = 1; i < N - 1; i++)	{	  alpha[i] = diag[d_stride * i] - offdiag[o_stride*(i - 1)] * gamma[i - 1];	  gamma[i] = offdiag[o_stride * i] / alpha[i];	}      if (N > 1)         {          alpha[N - 1] = diag[d_stride * (N - 1)] - offdiag[o_stride*(N - 2)] * gamma[N - 2];        }      /* update RHS */      z[0] = b[0];      for (i = 1; i < N; i++)	{	  z[i] = b[b_stride * i] - gamma[i - 1] * z[i - 1];	}      for (i = 0; i < N; i++)	{	  c[i] = z[i] / alpha[i];	}      /* backsubstitution */      x[x_stride * (N - 1)] = c[N - 1];      if (N >= 2)	{	  for (i = N - 2, j = 0; j <= N - 2; j++, i--)	    {	      x[x_stride * i] = c[i] - gamma[i] * x[x_stride * (i + 1)];	    }	}      status = GSL_SUCCESS;    }  if (z != 0)    free (z);  if (c != 0)    free (c);  if (alpha != 0)    free (alpha);  if (gamma != 0)    free (gamma);  return status;}/* for description of method see [Engeln-Mullges + Uhlig, p. 96] * *      diag[0]  offdiag[0]             0   .....  offdiag[N-1] *   offdiag[0]     diag[1]    offdiag[1]   ..... *            0  offdiag[1]       diag[2] *            0           0    offdiag[2]   ..... *          ...         ... * offdiag[N-1]         ... * */staticint solve_cyc_tridiag(  const double diag[], size_t d_stride,  const double offdiag[], size_t o_stride,  const double b[], size_t b_stride,  double x[], size_t x_stride,  size_t N){  int status;  double * delta = (double *) malloc (N * sizeof (double));  double * gamma = (double *) malloc (N * sizeof (double));  double * alpha = (double *) malloc (N * sizeof (double));  double * c = (double *) malloc (N * sizeof (double));  double * z = (double *) malloc (N * sizeof (double));  if (delta == 0 || gamma == 0 || alpha == 0 || c == 0 || z == 0)    {      status = GSL_ENOMEM;    }  else    {      size_t i, j;      double sum = 0.0;      /* factor */      alpha[0] = diag[0];      gamma[0] = offdiag[0] / alpha[0];      delta[0] = offdiag[o_stride * (N-1)] / alpha[0];      for (i = 1; i < N - 2; i++)	{	  alpha[i] = diag[d_stride * i] - offdiag[o_stride * (i-1)] * gamma[i - 1];	  gamma[i] = offdiag[o_stride * i] / alpha[i];	  delta[i] = -delta[i - 1] * offdiag[o_stride * (i-1)] / alpha[i];	}      for (i = 0; i < N - 2; i++)	{	  sum += alpha[i] * delta[i] * delta[i];	}      alpha[N - 2] = diag[d_stride * (N - 2)] - offdiag[o_stride * (N - 3)] * gamma[N - 3];      gamma[N - 2] = (offdiag[o_stride * (N - 2)] - offdiag[o_stride * (N - 3)] * delta[N - 3]) / alpha[N - 2];      alpha[N - 1] = diag[d_stride * (N - 1)] - sum - offdiag[o_stride * (N - 2)] * gamma[N - 2] * gamma[N - 2];      /* update */      z[0] = b[0];      for (i = 1; i < N - 1; i++)	{	  z[i] = b[b_stride * i] - z[i - 1] * gamma[i - 1];	}      sum = 0.0;      for (i = 0; i < N - 2; i++)	{	  sum += delta[i] * z[i];	}      z[N - 1] = b[b_stride * (N - 1)] - sum - gamma[N - 2] * z[N - 2];      for (i = 0; i < N; i++)	{	  c[i] = z[i] / alpha[i];	}      /* backsubstitution */      x[x_stride * (N - 1)] = c[N - 1];      x[x_stride * (N - 2)] = c[N - 2] - gamma[N - 2] * x[x_stride * (N - 1)];      if (N >= 3)	{	  for (i = N - 3, j = 0; j <= N - 3; j++, i--)	    {	      x[x_stride * i] = c[i] - gamma[i] * x[x_stride * (i + 1)] - delta[i] * x[x_stride * (N - 1)];	    }	}      status = GSL_SUCCESS;    }  if (z != 0)    free (z);  if (c != 0)    free (c);  if (alpha != 0)    free (alpha);  if (gamma != 0)    free (gamma);  if (delta != 0)    free (delta);  return status;}intgsl_linalg_solve_symm_tridiag(  const gsl_vector * diag,  const gsl_vector * offdiag,  const gsl_vector * rhs,  gsl_vector * solution){  if(diag->size != rhs->size ||          (offdiag->size != rhs->size && offdiag->size != rhs->size-1) ||	  (solution->size != rhs->size)          ) {    return GSL_EBADLEN;  }  else {    return solve_tridiag(diag->data, diag->stride,                         offdiag->data, offdiag->stride,			 rhs->data, rhs->stride,	                 solution->data, solution->stride,	                 diag->size);  }}intgsl_linalg_solve_symm_cyc_tridiag(  const gsl_vector * diag,  const gsl_vector * offdiag,  const gsl_vector * rhs,  gsl_vector * solution){  if(diag->size != rhs->size ||          offdiag->size != rhs->size ||          solution->size != rhs->size          ) {    return GSL_EBADLEN;  }  else {    return solve_cyc_tridiag(diag->data, diag->stride,                             offdiag->data, offdiag->stride,			     rhs->data, rhs->stride,	                     solution->data, solution->stride,	                     diag->size);  }}

⌨️ 快捷键说明

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