<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>MPQC: mops.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<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>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<h1>mops.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">//</span>
<a name="l00002"></a>00002 <span class="comment">// mops.h --- block matrix operations</span>
<a name="l00003"></a>00003 <span class="comment">//</span>
<a name="l00004"></a>00004 <span class="comment">// Copyright (C) 1997 Limit Point Systems, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// Author: Edward Seidl <seidl@janed.com></span>
<a name="l00007"></a>00007 <span class="comment">// Maintainer: LPS</span>
<a name="l00008"></a>00008 <span class="comment">//</span>
<a name="l00009"></a>00009 <span class="comment">// This file is part of the SC Toolkit.</span>
<a name="l00010"></a>00010 <span class="comment">//</span>
<a name="l00011"></a>00011 <span class="comment">// The SC Toolkit is free software; you can redistribute it and/or modify</span>
<a name="l00012"></a>00012 <span class="comment">// it under the terms of the GNU Library General Public License as published by</span>
<a name="l00013"></a>00013 <span class="comment">// the Free Software Foundation; either version 2, or (at your option)</span>
<a name="l00014"></a>00014 <span class="comment">// any later version.</span>
<a name="l00015"></a>00015 <span class="comment">//</span>
<a name="l00016"></a>00016 <span class="comment">// The SC Toolkit is distributed in the hope that it will be useful,</span>
<a name="l00017"></a>00017 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00018"></a>00018 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00019"></a>00019 <span class="comment">// GNU Library General Public License for more details.</span>
<a name="l00020"></a>00020 <span class="comment">//</span>
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU Library General Public License</span>
<a name="l00022"></a>00022 <span class="comment">// along with the SC Toolkit; see the file COPYING.LIB. If not, write to</span>
<a name="l00023"></a>00023 <span class="comment">// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.</span>
<a name="l00024"></a>00024 <span class="comment">//</span>
<a name="l00025"></a>00025 <span class="comment">// The U.S. Government is granted a limited license as per AL 91-7.</span>
<a name="l00026"></a>00026 <span class="comment">//</span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="preprocessor">#ifndef _math_scmat_mops_h</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#define _math_scmat_mops_h</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span>
<a name="l00031"></a>00031 <span class="preprocessor">#define D1 32</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span>
<a name="l00033"></a>00033 <span class="comment">// copy a chunk of rectangular matrix source into dest. dest is D1xD1, and is</span>
<a name="l00034"></a>00034 <span class="comment">// padded with zeros</span>
<a name="l00035"></a>00035
<a name="l00036"></a>00036 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00037"></a>00037 copy_block(<span class="keywordtype">double</span> **dest, <span class="keywordtype">double</span> **source,
<a name="l00038"></a>00038 <span class="keywordtype">int</span> istart, <span class="keywordtype">int</span> ni, <span class="keywordtype">int</span> jstart, <span class="keywordtype">int</span> nj)
<a name="l00039"></a>00039 {
<a name="l00040"></a>00040 <span class="keywordtype">int</span> ii,jj;
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <span class="keywordflow">for</span> (ii=0; ii < ni; ii++) {
<a name="l00043"></a>00043 <span class="keywordtype">double</span> *di = dest[ii];
<a name="l00044"></a>00044 <span class="keywordtype">double</span> *si = &source[istart+ii][jstart];
<a name="l00045"></a>00045 <span class="keywordflow">for</span> (jj=0; jj < nj; jj++)
<a name="l00046"></a>00046 di[jj] = si[jj];
<a name="l00047"></a>00047 <span class="keywordflow">for</span> (; jj < D1; jj++)
<a name="l00048"></a>00048 di[jj] = 0;
<a name="l00049"></a>00049 }
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="keywordtype">int</span> left=D1-ii;
<a name="l00052"></a>00052 <span class="keywordflow">if</span> (left)
<a name="l00053"></a>00053 memset(dest[ii], 0, <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>)*left*D1);
<a name="l00054"></a>00054 }
<a name="l00055"></a>00055
<a name="l00056"></a>00056 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00057"></a>00057 copy_trans_block(<span class="keywordtype">double</span> **dest, <span class="keywordtype">double</span> **source,
<a name="l00058"></a>00058 <span class="keywordtype">int</span> istart, <span class="keywordtype">int</span> ni, <span class="keywordtype">int</span> jstart, <span class="keywordtype">int</span> nj)
<a name="l00059"></a>00059 {
<a name="l00060"></a>00060 <span class="keywordtype">int</span> ii,jj;
<a name="l00061"></a>00061
<a name="l00062"></a>00062 memset(dest[0], 0, <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>)*D1*D1);
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="keywordflow">for</span> (jj=0; jj < nj; jj++) {
<a name="l00065"></a>00065 <span class="keywordtype">double</span> *sj = &source[jstart+jj][istart];
<a name="l00066"></a>00066 <span class="keywordflow">for</span> (ii=0; ii < ni; ii++)
<a name="l00067"></a>00067 dest[ii][jj] = sj[ii];
<a name="l00068"></a>00068 }
<a name="l00069"></a>00069 }
<a name="l00070"></a>00070
<a name="l00071"></a>00071 <span class="comment">// copy a chunk of symmetric matrix source into dest. dest is D1xD1, and is</span>
<a name="l00072"></a>00072 <span class="comment">// padded with zeros</span>
<a name="l00073"></a>00073 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00074"></a>00074 copy_sym_block(<span class="keywordtype">double</span> **dest, <span class="keywordtype">double</span> **source,
<a name="l00075"></a>00075 <span class="keywordtype">int</span> istart, <span class="keywordtype">int</span> ni, <span class="keywordtype">int</span> jstart, <span class="keywordtype">int</span> nj)
<a name="l00076"></a>00076 {
<a name="l00077"></a>00077 <span class="keywordtype">int</span> ii,jj;
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="keywordflow">for</span> (ii=0; ii < ni; ii++) {
<a name="l00080"></a>00080 <span class="keywordtype">double</span> *di = dest[ii];
<a name="l00081"></a>00081 <span class="keywordtype">double</span> *si = &source[istart+ii][jstart];
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="keywordflow">if</span> (jstart < istart)
<a name="l00084"></a>00084 <span class="keywordflow">for</span> (jj=0; jj < nj; jj++)
<a name="l00085"></a>00085 di[jj] = si[jj];
<a name="l00086"></a>00086 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (jstart==istart)
<a name="l00087"></a>00087 <span class="keywordflow">for</span> (jj=0; jj <= ii; jj++)
<a name="l00088"></a>00088 di[jj] = dest[jj][ii] = si[jj];
<a name="l00089"></a>00089 <span class="keywordflow">else</span>
<a name="l00090"></a>00090 <span class="keywordflow">for</span> (jj=0; jj < nj; jj++)
<a name="l00091"></a>00091 di[jj] = source[jstart+jj][istart+ii];
<a name="l00092"></a>00092
<a name="l00093"></a>00093 <span class="keywordflow">for</span> (jj=nj; jj < D1; jj++)
<a name="l00094"></a>00094 di[jj] = 0;
<a name="l00095"></a>00095 }
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="keywordtype">int</span> left=D1-ii;
<a name="l00098"></a>00098 <span class="keywordflow">if</span> (left)
<a name="l00099"></a>00099 memset(dest[ii], 0, <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>)*left*D1);
<a name="l00100"></a>00100 }
<a name="l00101"></a>00101
<a name="l00102"></a>00102 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00103"></a>00103 return_block(<span class="keywordtype">double</span> **dest, <span class="keywordtype">double</span> **source,
<a name="l00104"></a>00104 <span class="keywordtype">int</span> istart, <span class="keywordtype">int</span> ni, <span class="keywordtype">int</span> jstart, <span class="keywordtype">int</span> nj)
<a name="l00105"></a>00105 {
<a name="l00106"></a>00106 <span class="keywordtype">int</span> ii,jj;
<a name="l00107"></a>00107
<a name="l00108"></a>00108 <span class="keywordflow">for</span> (ii=0; ii < ni; ii++)
<a name="l00109"></a>00109 <span class="keywordflow">for</span> (jj=0; jj < nj; jj++)
<a name="l00110"></a>00110 dest[istart+ii][jstart+jj] = source[ii][jj];
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112
<a name="l00113"></a>00113 <span class="comment">// a, b, and c are all D1xD1 blocks</span>
<a name="l00114"></a>00114 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00115"></a>00115 mult_block(<span class="keywordtype">double</span> **a, <span class="keywordtype">double</span> **b, <span class="keywordtype">double</span> **c, <span class="keywordtype">int</span> ni, <span class="keywordtype">int</span> nj, <span class="keywordtype">int</span> nk)
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 <span class="keywordtype">int</span> ii,jj,kk;
<a name="l00118"></a>00118 <span class="keywordtype">double</span> t00,t10,t20,t30;
<a name="l00119"></a>00119 <span class="keywordtype">double</span> *a0, *a1, *a2, *a3;
<a name="l00120"></a>00120 <span class="keywordtype">double</span> *c0, *c1, *c2, *c3;
<a name="l00121"></a>00121
<a name="l00122"></a>00122 <span class="keywordflow">for</span> (ii=0; ii < ni; ii += 4) {
<a name="l00123"></a>00123 a0=a[ii]; a1=a[ii+1]; a2=a[ii+2]; a3=a[ii+3];
<a name="l00124"></a>00124 c0=c[ii]; c1=c[ii+1]; c2=c[ii+2]; c3=c[ii+3];
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="keywordflow">for</span> (jj=0; jj < nj; jj++) {
<a name="l00127"></a>00127 <span class="keywordtype">double</span> *bt = b[jj];
<a name="l00128"></a>00128 t00=c0[jj]; t10=c1[jj]; t20=c2[jj]; t30=c3[jj];
<a name="l00129"></a>00129
<a name="l00130"></a>00130 <span class="keywordflow">for</span> (kk=0; kk < nk; kk += 2) {
<a name="l00131"></a>00131 <span class="keyword">register</span> <span class="keywordtype">double</span> b0=bt[kk], b1=bt[kk+1];
<a name="l00132"></a>00132 t00 += a0[kk]*b0 + a0[kk+1]*b1;
<a name="l00133"></a>00133 t10 += a1[kk]*b0 + a1[kk+1]*b1;
<a name="l00134"></a>00134 t20 += a2[kk]*b0 + a2[kk+1]*b1;
<a name="l00135"></a>00135 t30 += a3[kk]*b0 + a3[kk+1]*b1;
<a name="l00136"></a>00136 }
<a name="l00137"></a>00137
<a name="l00138"></a>00138 c0[jj]=t00;
<a name="l00139"></a>00139 c1[jj]=t10;
<a name="l00140"></a>00140 c2[jj]=t20;
<a name="l00141"></a>00141 c3[jj]=t30;
<a name="l00142"></a>00142 }
<a name="l00143"></a>00143 }
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="preprocessor">#endif</span>
<a name="l00147"></a>00147 <span class="preprocessor"></span>
<a name="l00148"></a>00148 <span class="comment">// Local Variables:</span>
<a name="l00149"></a>00149 <span class="comment">// mode: c++</span>
<a name="l00150"></a>00150 <span class="comment">// c-file-style: "ETS"</span>
<a name="l00151"></a>00151 <span class="comment">// End:</span>
</pre></div></div>
<hr>
<address>
<small>
Generated at Wed Oct 14 14:12:10 2009 for <a
href="http://www.mpqc.org">MPQC</a>
2.3.1 using the documentation package <a
href="http://www.doxygen.org">Doxygen</a>
1.5.9.
</small>
</address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
247b28499c443e092731ffba814075f2
>
files
>
1230
