|
GRASS Programmer's Manual
6.5.svn(2012)-r51648
|
00001 /* chousv.c CCMATH mathematics library source code. 00002 * 00003 * Copyright (C) 2000 Daniel A. Atkinson All rights reserved. 00004 * This code may be redistributed under the terms of the GNU library 00005 * public license (LGPL). ( See the lgpl.license file for details.) 00006 * ------------------------------------------------------------------------ 00007 */ 00008 #include <stdlib.h> 00009 #include "ccmath.h" 00010 void chousv(Cpx * a, double *d, double *dp, int n) 00011 { 00012 double sc, x, y; 00013 00014 Cpx cc, u, *qs; 00015 00016 int i, j, k, m, e; 00017 00018 Cpx *qw, *pc, *p, *q; 00019 00020 qs = (Cpx *) calloc(2 * n, sizeof(Cpx)); 00021 q = qs + n; 00022 for (j = 0, pc = a; j < n - 2; ++j, pc += n + 1, ++q) { 00023 m = n - j - 1; 00024 for (i = 1, sc = 0.; i <= m; ++i) 00025 sc += pc[i].re * pc[i].re + pc[i].im * pc[i].im; 00026 if (sc > 0.) { 00027 sc = sqrt(sc); 00028 p = pc + 1; 00029 y = sc + (x = sqrt(p->re * p->re + p->im * p->im)); 00030 if (x > 0.) { 00031 cc.re = p->re / x; 00032 cc.im = p->im / x; 00033 } 00034 else { 00035 cc.re = 1.; 00036 cc.im = 0.; 00037 } 00038 q->re = -cc.re; 00039 q->im = -cc.im; 00040 x = 1. / sqrt(2. * sc * y); 00041 y *= x; 00042 for (i = 0, qw = pc + 1; i < m; ++i) { 00043 qs[i].re = qs[i].im = 0.; 00044 if (i) { 00045 qw[i].re *= x; 00046 qw[i].im *= -x; 00047 } 00048 else { 00049 qw[0].re = y * cc.re; 00050 qw[0].im = -y * cc.im; 00051 } 00052 } 00053 for (i = 0, e = j + 2, p = pc + n + 1, y = 0.; i < m; 00054 ++i, p += e++) { 00055 qs[i].re += (u.re = qw[i].re) * p->re - (u.im = 00056 qw[i].im) * p->im; 00057 qs[i].im += u.re * p->im + u.im * p->re; 00058 ++p; 00059 for (k = i + 1; k < m; ++k, ++p) { 00060 qs[i].re += qw[k].re * p->re - qw[k].im * p->im; 00061 qs[i].im += qw[k].im * p->re + qw[k].re * p->im; 00062 qs[k].re += u.re * p->re + u.im * p->im; 00063 qs[k].im += u.im * p->re - u.re * p->im; 00064 } 00065 y += u.re * qs[i].re + u.im * qs[i].im; 00066 } 00067 for (i = 0; i < m; ++i) { 00068 qs[i].re -= y * qw[i].re; 00069 qs[i].re += qs[i].re; 00070 qs[i].im -= y * qw[i].im; 00071 qs[i].im += qs[i].im; 00072 } 00073 for (i = 0, e = j + 2, p = pc + n + 1; i < m; ++i, p += e++) { 00074 for (k = i; k < m; ++k, ++p) { 00075 p->re -= qw[i].re * qs[k].re + qw[i].im * qs[k].im 00076 + qs[i].re * qw[k].re + qs[i].im * qw[k].im; 00077 p->im -= qw[i].im * qs[k].re - qw[i].re * qs[k].im 00078 + qs[i].im * qw[k].re - qs[i].re * qw[k].im; 00079 } 00080 } 00081 } 00082 d[j] = pc->re; 00083 dp[j] = sc; 00084 } 00085 d[j] = pc->re; 00086 cc = *(pc + 1); 00087 d[j + 1] = (pc += n + 1)->re; 00088 dp[j] = sc = sqrt(cc.re * cc.re + cc.im * cc.im); 00089 q->re = cc.re /= sc; 00090 q->im = cc.im /= sc; 00091 for (i = 0, m = n + n, p = pc; i < m; ++i, --p) 00092 p->re = p->im = 0.; 00093 pc->re = 1.; 00094 (pc -= n + 1)->re = 1.; 00095 qw = pc - n; 00096 for (m = 2; m < n; ++m, qw -= n + 1) { 00097 for (j = 0, p = pc, pc->re = 1.; j < m; ++j, p += n) { 00098 for (i = 0, q = p, u.re = u.im = 0.; i < m; ++i, ++q) { 00099 u.re += qw[i].re * q->re - qw[i].im * q->im; 00100 u.im += qw[i].re * q->im + qw[i].im * q->re; 00101 } 00102 for (i = 0, q = p, u.re += u.re, u.im += u.im; i < m; ++i, ++q) { 00103 q->re -= u.re * qw[i].re + u.im * qw[i].im; 00104 q->im -= u.im * qw[i].re - u.re * qw[i].im; 00105 } 00106 } 00107 for (i = 0, p = qw + m - 1; i < n; ++i, --p) 00108 p->re = p->im = 0.; 00109 (pc -= n + 1)->re = 1.; 00110 } 00111 for (j = 1, p = a + n + 1, q = qs + n, u.re = 1., u.im = 0.; j < n; 00112 ++j, ++p, ++q) { 00113 sc = u.re * q->re - u.im * q->im; 00114 u.im = u.im * q->re + u.re * q->im; 00115 u.re = sc; 00116 for (i = 1; i < n; ++i, ++p) { 00117 sc = u.re * p->re - u.im * p->im; 00118 p->im = u.re * p->im + u.im * p->re; 00119 p->re = sc; 00120 } 00121 } 00122 free(qs); 00123 }