<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>SphinxBase: src/libsphinxbase/util/matrix.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">SphinxBase <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('matrix_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/matrix.c</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4 -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 1997-2006 Carnegie Mellon University. All rights </span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037 <span class="preprocessor">#include <string.h></span>
<a name="l00038"></a>00038 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="preprocessor">#ifdef HAVE_CONFIG_H</span>
<a name="l00041"></a>00041 <span class="preprocessor"></span><span class="preprocessor">#include "config.h"</span>
<a name="l00042"></a>00042 <span class="preprocessor">#endif</span>
<a name="l00043"></a>00043 <span class="preprocessor"></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include "sphinxbase/clapack_lite.h"</span>
<a name="l00045"></a>00045 <span class="preprocessor">#include "sphinxbase/matrix.h"</span>
<a name="l00046"></a>00046 <span class="preprocessor">#include "sphinxbase/err.h"</span>
<a name="l00047"></a>00047 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="keywordtype">void</span>
<a name="l00050"></a><a class="code" href="matrix_8h.html#af209fc89926fd184f5a02919ec7c9818">00050</a> <a class="code" href="matrix_8h.html#af209fc89926fd184f5a02919ec7c9818" title="Norm an array.">norm_3d</a>(float32 ***arr,
<a name="l00051"></a>00051 uint32 d1,
<a name="l00052"></a>00052 uint32 d2,
<a name="l00053"></a>00053 uint32 d3)
<a name="l00054"></a>00054 {
<a name="l00055"></a>00055 uint32 i, j, k;
<a name="l00056"></a>00056 float64 s;
<a name="l00057"></a>00057
<a name="l00058"></a>00058 <span class="keywordflow">for</span> (i = 0; i < d1; i++) {
<a name="l00059"></a>00059 <span class="keywordflow">for</span> (j = 0; j < d2; j++) {
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <span class="comment">/* compute sum (i, j) as over all k */</span>
<a name="l00062"></a>00062 <span class="keywordflow">for</span> (k = 0, s = 0; k < d3; k++) {
<a name="l00063"></a>00063 s += arr[i][j][k];
<a name="l00064"></a>00064 }
<a name="l00065"></a>00065
<a name="l00066"></a>00066 <span class="comment">/* do 1 floating point divide */</span>
<a name="l00067"></a>00067 s = 1.0 / s;
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="comment">/* divide all k by sum over k */</span>
<a name="l00070"></a>00070 <span class="keywordflow">for</span> (k = 0; k < d3; k++) {
<a name="l00071"></a>00071 arr[i][j][k] *= s;
<a name="l00072"></a>00072 }
<a name="l00073"></a>00073 }
<a name="l00074"></a>00074 }
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="keywordtype">void</span>
<a name="l00078"></a><a class="code" href="matrix_8h.html#abf02a99f3dac599148c0e1ee5640b568">00078</a> <a class="code" href="matrix_8h.html#abf02a99f3dac599148c0e1ee5640b568" title="Floor 3-d array.">accum_3d</a>(float32 ***out,
<a name="l00079"></a>00079 float32 ***in,
<a name="l00080"></a>00080 uint32 d1,
<a name="l00081"></a>00081 uint32 d2,
<a name="l00082"></a>00082 uint32 d3)
<a name="l00083"></a>00083 {
<a name="l00084"></a>00084 uint32 i, j, k;
<a name="l00085"></a>00085
<a name="l00086"></a>00086 <span class="keywordflow">for</span> (i = 0; i < d1; i++) {
<a name="l00087"></a>00087 <span class="keywordflow">for</span> (j = 0; j < d2; j++) {
<a name="l00088"></a>00088 <span class="keywordflow">for</span> (k = 0; k < d3; k++) {
<a name="l00089"></a>00089 out[i][j][k] += in[i][j][k];
<a name="l00090"></a>00090 }
<a name="l00091"></a>00091 }
<a name="l00092"></a>00092 }
<a name="l00093"></a>00093 }
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="keywordtype">void</span>
<a name="l00096"></a><a class="code" href="matrix_8h.html#a7b18b907fca64a8057f7406b8996d9c9">00096</a> <a class="code" href="matrix_8h.html#a7b18b907fca64a8057f7406b8996d9c9" title="Floor 3-d array.">floor_nz_3d</a>(float32 ***m,
<a name="l00097"></a>00097 uint32 d1,
<a name="l00098"></a>00098 uint32 d2,
<a name="l00099"></a>00099 uint32 d3,
<a name="l00100"></a>00100 float32 floor)
<a name="l00101"></a>00101 {
<a name="l00102"></a>00102 uint32 i, j, k;
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="keywordflow">for</span> (i = 0; i < d1; i++) {
<a name="l00105"></a>00105 <span class="keywordflow">for</span> (j = 0; j < d2; j++) {
<a name="l00106"></a>00106 <span class="keywordflow">for</span> (k = 0; k < d3; k++) {
<a name="l00107"></a>00107 <span class="keywordflow">if</span> ((m[i][j][k] != 0) && (m[i][j][k] < floor))
<a name="l00108"></a>00108 m[i][j][k] = floor;
<a name="l00109"></a>00109 }
<a name="l00110"></a>00110 }
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113 <span class="keywordtype">void</span>
<a name="l00114"></a><a class="code" href="matrix_8h.html#a0ec7000944b98cce317e0b63ce437b99">00114</a> <a class="code" href="matrix_8h.html#a0ec7000944b98cce317e0b63ce437b99" title="Floor 1-d array.">floor_nz_1d</a>(float32 *v,
<a name="l00115"></a>00115 uint32 d1,
<a name="l00116"></a>00116 float32 floor)
<a name="l00117"></a>00117 {
<a name="l00118"></a>00118 uint32 i;
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="keywordflow">for</span> (i = 0; i < d1; i++) {
<a name="l00121"></a>00121 <span class="keywordflow">if</span> ((v[i] != 0) && (v[i] < floor))
<a name="l00122"></a>00122 v[i] = floor;
<a name="l00123"></a>00123 }
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="keywordtype">void</span>
<a name="l00127"></a><a class="code" href="matrix_8h.html#a859d32f6b8e86fb215f676245c8deeaf">00127</a> <a class="code" href="matrix_8h.html#a859d32f6b8e86fb215f676245c8deeaf" title="Ensures that non-zero values x such that -band &lt; x &lt; band, band &gt; 0 are set to -band if x &l...">band_nz_1d</a>(float32 *v,
<a name="l00128"></a>00128 uint32 d1,
<a name="l00129"></a>00129 float32 band)
<a name="l00130"></a>00130 {
<a name="l00131"></a>00131 uint32 i;
<a name="l00132"></a>00132
<a name="l00133"></a>00133 <span class="keywordflow">for</span> (i = 0; i < d1; i++) {
<a name="l00134"></a>00134 <span class="keywordflow">if</span> (v[i] != 0) {
<a name="l00135"></a>00135 <span class="keywordflow">if</span> ((v[i] > 0) && (v[i] < band)) {
<a name="l00136"></a>00136 v[i] = band;
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((v[i] < 0) && (v[i] > -band)) {
<a name="l00139"></a>00139 v[i] = -band;
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141 }
<a name="l00142"></a>00142 }
<a name="l00143"></a>00143 }
<a name="l00144"></a>00144
<a name="l00145"></a>00145 <span class="preprocessor">#ifndef WITH_LAPACK</span>
<a name="l00146"></a>00146 <span class="preprocessor"></span>float64
<a name="l00147"></a><a class="code" href="matrix_8h.html#a0c810028195f6078c9e99f3b5c29c42b">00147</a> <a class="code" href="matrix_8h.html#a0c810028195f6078c9e99f3b5c29c42b" title="Calculate the determinant of a positive definite matrix.">determinant</a>(float32 **a, int32 n)
<a name="l00148"></a>00148 {
<a name="l00149"></a>00149 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"No LAPACK library available, cannot compute determinant (FIXME)\n"</span>);
<a name="l00150"></a>00150 <span class="keywordflow">return</span> 0.0;
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152 int32
<a name="l00153"></a><a class="code" href="matrix_8h.html#aa20f437dbe9fcd6f0adda31f181bfbea">00153</a> <a class="code" href="matrix_8h.html#aa20f437dbe9fcd6f0adda31f181bfbea" title="Invert (if possible) a positive definite matrix.">invert</a>(float32 **ainv, float32 **a, int32 n)
<a name="l00154"></a>00154 {
<a name="l00155"></a>00155 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"No LAPACK library available, cannot compute matrix inverse (FIXME)\n"</span>);
<a name="l00156"></a>00156 <span class="keywordflow">return</span> 0;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158 int32
<a name="l00159"></a><a class="code" href="matrix_8h.html#a174a82dac39a15828af6c87edcba3708">00159</a> <a class="code" href="matrix_8h.html#a174a82dac39a15828af6c87edcba3708" title="Solve (if possible) a positive-definite system of linear equations AX=B for X.">solve</a>(float32 **a, float32 *b, float32 *out_x, int32 n)
<a name="l00160"></a>00160 {
<a name="l00161"></a>00161 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"No LAPACK library available, cannot solve linear equations (FIXME)\n"</span>);
<a name="l00162"></a>00162 <span class="keywordflow">return</span> 0;
<a name="l00163"></a>00163 }
<a name="l00164"></a>00164
<a name="l00165"></a>00165 <span class="keywordtype">void</span>
<a name="l00166"></a><a class="code" href="matrix_8h.html#acaaf5d2c02d9d12f10abc462ac65cde9">00166</a> <a class="code" href="matrix_8h.html#acaaf5d2c02d9d12f10abc462ac65cde9" title="Multiply C=AB where A and B are symmetric matrices.">matrixmultiply</a>(float32 ** c, float32 ** a, float32 ** b, int32 n)
<a name="l00167"></a>00167 {
<a name="l00168"></a>00168 int32 i, j, k;
<a name="l00169"></a>00169
<a name="l00170"></a>00170 memset(c[0], 0, n*n*<span class="keyword">sizeof</span>(float32));
<a name="l00171"></a>00171 <span class="keywordflow">for</span> (i = 0; i < n; ++i) {
<a name="l00172"></a>00172 <span class="keywordflow">for</span> (j = 0; j < n; ++j) {
<a name="l00173"></a>00173 <span class="keywordflow">for</span> (k = 0; k < n; ++k) {
<a name="l00174"></a>00174 c[i][k] += a[i][j] * b[j][k];
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179 <span class="preprocessor">#else </span><span class="comment">/* WITH_LAPACK */</span>
<a name="l00180"></a>00180 <span class="comment">/* Find determinant through LU decomposition. */</span>
<a name="l00181"></a>00181 float64
<a name="l00182"></a>00182 <a class="code" href="matrix_8h.html#a0c810028195f6078c9e99f3b5c29c42b" title="Calculate the determinant of a positive definite matrix.">determinant</a>(float32 ** a, int32 n)
<a name="l00183"></a>00183 {
<a name="l00184"></a>00184 float32 **tmp_a;
<a name="l00185"></a>00185 float64 det;
<a name="l00186"></a>00186 <span class="keywordtype">char</span> uplo;
<a name="l00187"></a>00187 int32 info, i;
<a name="l00188"></a>00188
<a name="l00189"></a>00189 <span class="comment">/* a is assumed to be symmetric, so we don't need to switch the</span>
<a name="l00190"></a>00190 <span class="comment"> * ordering of the data. But we do need to copy it since it is</span>
<a name="l00191"></a>00191 <span class="comment"> * overwritten by LAPACK. */</span>
<a name="l00192"></a>00192 tmp_a = (float32 **)<a class="code" href="ckd__alloc_8h.html#a949e7b50fcd9697b1563fa57f50e9c4f" title="Macro for __ckd_calloc_2d__.">ckd_calloc_2d</a>(n, n, <span class="keyword">sizeof</span>(float32));
<a name="l00193"></a>00193 memcpy(tmp_a[0], a[0], n*n*<span class="keyword">sizeof</span>(float32));
<a name="l00194"></a>00194
<a name="l00195"></a>00195 uplo = <span class="charliteral">'L'</span>;
<a name="l00196"></a>00196 spotrf_(&uplo, &n, tmp_a[0], &n, &info);
<a name="l00197"></a>00197 det = tmp_a[0][0];
<a name="l00198"></a>00198 <span class="comment">/* det = prod(diag(l))^2 */</span>
<a name="l00199"></a>00199 <span class="keywordflow">for</span> (i = 1; i < n; ++i)
<a name="l00200"></a>00200 det *= tmp_a[i][i];
<a name="l00201"></a>00201 <a class="code" href="ckd__alloc_8h.html#a8246c071ac12e98b7e1df9fe6da15aef" title="Free a 2-D array (ptr) previously allocated by ckd_calloc_2d.">ckd_free_2d</a>((<span class="keywordtype">void</span> **)tmp_a);
<a name="l00202"></a>00202 <span class="keywordflow">if</span> (info > 0)
<a name="l00203"></a>00203 <span class="keywordflow">return</span> -1.0; <span class="comment">/* Generic "not positive-definite" answer */</span>
<a name="l00204"></a>00204 <span class="keywordflow">else</span>
<a name="l00205"></a>00205 <span class="keywordflow">return</span> det * det;
<a name="l00206"></a>00206 }
<a name="l00207"></a>00207
<a name="l00208"></a>00208 int32
<a name="l00209"></a>00209 <a class="code" href="matrix_8h.html#a174a82dac39a15828af6c87edcba3708" title="Solve (if possible) a positive-definite system of linear equations AX=B for X.">solve</a>(float32 **a, <span class="comment">/*Input : an n*n matrix A */</span>
<a name="l00210"></a>00210 float32 *b, <span class="comment">/*Input : a n dimesion vector b */</span>
<a name="l00211"></a>00211 float32 *out_x, <span class="comment">/*Output : a n dimesion vector x */</span>
<a name="l00212"></a>00212 int32 n)
<a name="l00213"></a>00213 {
<a name="l00214"></a>00214 <span class="keywordtype">char</span> uplo;
<a name="l00215"></a>00215 float32 **tmp_a;
<a name="l00216"></a>00216 int32 info, nrhs;
<a name="l00217"></a>00217
<a name="l00218"></a>00218 <span class="comment">/* a is assumed to be symmetric, so we don't need to switch the</span>
<a name="l00219"></a>00219 <span class="comment"> * ordering of the data. But we do need to copy it since it is</span>
<a name="l00220"></a>00220 <span class="comment"> * overwritten by LAPACK. */</span>
<a name="l00221"></a>00221 tmp_a = (float32 **)<a class="code" href="ckd__alloc_8h.html#a949e7b50fcd9697b1563fa57f50e9c4f" title="Macro for __ckd_calloc_2d__.">ckd_calloc_2d</a>(n, n, <span class="keyword">sizeof</span>(float32));
<a name="l00222"></a>00222 memcpy(tmp_a[0], a[0], n*n*<span class="keyword">sizeof</span>(float32));
<a name="l00223"></a>00223 memcpy(out_x, b, n*<span class="keyword">sizeof</span>(float32));
<a name="l00224"></a>00224 uplo = <span class="charliteral">'L'</span>;
<a name="l00225"></a>00225 nrhs = 1;
<a name="l00226"></a>00226 sposv_(&uplo, &n, &nrhs, tmp_a[0], &n, out_x, &n, &info);
<a name="l00227"></a>00227 <a class="code" href="ckd__alloc_8h.html#a8246c071ac12e98b7e1df9fe6da15aef" title="Free a 2-D array (ptr) previously allocated by ckd_calloc_2d.">ckd_free_2d</a>((<span class="keywordtype">void</span> **)tmp_a);
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="keywordflow">if</span> (info != 0)
<a name="l00230"></a>00230 <span class="keywordflow">return</span> -1;
<a name="l00231"></a>00231 <span class="keywordflow">else</span>
<a name="l00232"></a>00232 <span class="keywordflow">return</span> info;
<a name="l00233"></a>00233 }
<a name="l00234"></a>00234
<a name="l00235"></a>00235 <span class="comment">/* Find inverse by solving AX=I. */</span>
<a name="l00236"></a>00236 int32
<a name="l00237"></a>00237 <a class="code" href="matrix_8h.html#aa20f437dbe9fcd6f0adda31f181bfbea" title="Invert (if possible) a positive definite matrix.">invert</a>(float32 ** ainv, float32 ** a, int32 n)
<a name="l00238"></a>00238 {
<a name="l00239"></a>00239 <span class="keywordtype">char</span> uplo;
<a name="l00240"></a>00240 float32 **tmp_a;
<a name="l00241"></a>00241 int32 info, nrhs, i;
<a name="l00242"></a>00242
<a name="l00243"></a>00243 <span class="comment">/* Construct an identity matrix. */</span>
<a name="l00244"></a>00244 memset(ainv[0], 0, <span class="keyword">sizeof</span>(float32) * n * n);
<a name="l00245"></a>00245 <span class="keywordflow">for</span> (i = 0; i < n; i++)
<a name="l00246"></a>00246 ainv[i][i] = 1.0;
<a name="l00247"></a>00247 <span class="comment">/* a is assumed to be symmetric, so we don't need to switch the</span>
<a name="l00248"></a>00248 <span class="comment"> * ordering of the data. But we do need to copy it since it is</span>
<a name="l00249"></a>00249 <span class="comment"> * overwritten by LAPACK. */</span>
<a name="l00250"></a>00250 tmp_a = (float32 **)<a class="code" href="ckd__alloc_8h.html#a949e7b50fcd9697b1563fa57f50e9c4f" title="Macro for __ckd_calloc_2d__.">ckd_calloc_2d</a>(n, n, <span class="keyword">sizeof</span>(float32));
<a name="l00251"></a>00251 memcpy(tmp_a[0], a[0], n*n*<span class="keyword">sizeof</span>(float32));
<a name="l00252"></a>00252 uplo = <span class="charliteral">'L'</span>;
<a name="l00253"></a>00253 nrhs = n;
<a name="l00254"></a>00254 sposv_(&uplo, &n, &nrhs, tmp_a[0], &n, ainv[0], &n, &info);
<a name="l00255"></a>00255 <a class="code" href="ckd__alloc_8h.html#a8246c071ac12e98b7e1df9fe6da15aef" title="Free a 2-D array (ptr) previously allocated by ckd_calloc_2d.">ckd_free_2d</a>((<span class="keywordtype">void</span> **)tmp_a);
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="keywordflow">if</span> (info != 0)
<a name="l00258"></a>00258 <span class="keywordflow">return</span> -1;
<a name="l00259"></a>00259 <span class="keywordflow">else</span>
<a name="l00260"></a>00260 <span class="keywordflow">return</span> info;
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262
<a name="l00263"></a>00263 <span class="keywordtype">void</span>
<a name="l00264"></a>00264 <a class="code" href="matrix_8h.html#acaaf5d2c02d9d12f10abc462ac65cde9" title="Multiply C=AB where A and B are symmetric matrices.">matrixmultiply</a>(float32 ** c, float32 ** a, float32 ** b, int32 n)
<a name="l00265"></a>00265 {
<a name="l00266"></a>00266 <span class="keywordtype">char</span> side, uplo;
<a name="l00267"></a>00267 float32 alpha;
<a name="l00268"></a>00268
<a name="l00269"></a>00269 side = <span class="charliteral">'L'</span>;
<a name="l00270"></a>00270 uplo = <span class="charliteral">'L'</span>;
<a name="l00271"></a>00271 alpha = 1.0;
<a name="l00272"></a>00272 ssymm_(&side, &uplo, &n, &n, &alpha, a[0], &n, b[0], &n, &alpha, c[0], &n);
<a name="l00273"></a>00273 }
<a name="l00274"></a>00274
<a name="l00275"></a>00275 <span class="preprocessor">#endif </span><span class="comment">/* WITH_LAPACK */</span>
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="keywordtype">void</span>
<a name="l00278"></a><a class="code" href="matrix_8h.html#aa2d31d63ec277fd389d4ef51d3b2bc2b">00278</a> <a class="code" href="matrix_8h.html#aa2d31d63ec277fd389d4ef51d3b2bc2b" title="Calculate the outer product of two vectors.">outerproduct</a>(float32 ** a, float32 * x, float32 * y, int32 len)
<a name="l00279"></a>00279 {
<a name="l00280"></a>00280 int32 i, j;
<a name="l00281"></a>00281
<a name="l00282"></a>00282 <span class="keywordflow">for</span> (i = 0; i < len; ++i) {
<a name="l00283"></a>00283 a[i][i] = x[i] * y[i];
<a name="l00284"></a>00284 <span class="keywordflow">for</span> (j = i + 1; j < len; ++j) {
<a name="l00285"></a>00285 a[i][j] = x[i] * y[j];
<a name="l00286"></a>00286 a[j][i] = x[j] * y[i];
<a name="l00287"></a>00287 }
<a name="l00288"></a>00288 }
<a name="l00289"></a>00289 }
<a name="l00290"></a>00290
<a name="l00291"></a>00291 <span class="keywordtype">void</span>
<a name="l00292"></a><a class="code" href="matrix_8h.html#adc8ee5f4e4792328e4f33309bc99ebfb">00292</a> <a class="code" href="matrix_8h.html#adc8ee5f4e4792328e4f33309bc99ebfb" title="Multiply a symmetric matrix by a constant in-place.">scalarmultiply</a>(float32 ** a, float32 x, int32 n)
<a name="l00293"></a>00293 {
<a name="l00294"></a>00294 int32 i, j;
<a name="l00295"></a>00295
<a name="l00296"></a>00296 <span class="keywordflow">for</span> (i = 0; i < n; ++i) {
<a name="l00297"></a>00297 a[i][i] *= x;
<a name="l00298"></a>00298 <span class="keywordflow">for</span> (j = i+1; j < n; ++j) {
<a name="l00299"></a>00299 a[i][j] *= x;
<a name="l00300"></a>00300 a[j][i] *= x;
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="keywordtype">void</span>
<a name="l00306"></a><a class="code" href="matrix_8h.html#a545d251a51cc473bad38a83b2a05f61c">00306</a> <a class="code" href="matrix_8h.html#a545d251a51cc473bad38a83b2a05f61c" title="Add A += B.">matrixadd</a>(float32 ** a, float32 ** b, int32 n)
<a name="l00307"></a>00307 {
<a name="l00308"></a>00308 int32 i, j;
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <span class="keywordflow">for</span> (i = 0; i < n; ++i)
<a name="l00311"></a>00311 <span class="keywordflow">for</span> (j = 0; j < n; ++j)
<a name="l00312"></a>00312 a[i][j] += b[i][j];
<a name="l00313"></a>00313 }
<a name="l00314"></a>00314
<a name="l00315"></a>00315
<a name="l00316"></a>00316 <span class="comment">/*</span>
<a name="l00317"></a>00317 <span class="comment"> * Log record. Maintained by RCS.</span>
<a name="l00318"></a>00318 <span class="comment"> *</span>
<a name="l00319"></a>00319 <span class="comment"> * $Log$</span>
<a name="l00320"></a>00320 <span class="comment"> * Revision 1.4 2004/07/21 18:05:40 egouvea</span>
<a name="l00321"></a>00321 <span class="comment"> * Changed the license terms to make it the same as sphinx2 and sphinx3.</span>
<a name="l00322"></a>00322 <span class="comment"> * </span>
<a name="l00323"></a>00323 <span class="comment"> * Revision 1.3 2001/04/05 20:02:30 awb</span>
<a name="l00324"></a>00324 <span class="comment"> * *** empty log message ***</span>
<a name="l00325"></a>00325 <span class="comment"> *</span>
<a name="l00326"></a>00326 <span class="comment"> * Revision 1.2 2000/09/29 22:35:13 awb</span>
<a name="l00327"></a>00327 <span class="comment"> * *** empty log message ***</span>
<a name="l00328"></a>00328 <span class="comment"> *</span>
<a name="l00329"></a>00329 <span class="comment"> * Revision 1.1 2000/09/24 21:38:31 awb</span>
<a name="l00330"></a>00330 <span class="comment"> * *** empty log message ***</span>
<a name="l00331"></a>00331 <span class="comment"> *</span>
<a name="l00332"></a>00332 <span class="comment"> * Revision 1.1 97/07/16 11:36:22 eht</span>
<a name="l00333"></a>00333 <span class="comment"> * Initial revision</span>
<a name="l00334"></a>00334 <span class="comment"> * </span>
<a name="l00335"></a>00335 <span class="comment"> *</span>
<a name="l00336"></a>00336 <span class="comment"> */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>matrix.c</b> </li>
<li class="footer">Generated on Tue Apr 19 2011 for SphinxBase by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
0b420d0fce195cf4115dc6a3be5c2da2
>
files
>
281
