~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

Linux Cross Reference
Tina6/tina-libs/tina/math/mathMatv_gs.c

Version: ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  1 /**********
  2  *
  3  * Copyright (c) 2003, Division of Imaging Science and Biomedical Engineering,
  4  * University of Manchester, UK.  All rights reserved.
  5  * 
  6  * Redistribution and use in source and binary forms, with or without modification, 
  7  * are permitted provided that the following conditions are met:
  8  * 
  9  *   . Redistributions of source code must retain the above copyright notice, 
 10  *     this list of conditions and the following disclaimer.
 11  *    
 12  *   . Redistributions in binary form must reproduce the above copyright notice,
 13  *     this list of conditions and the following disclaimer in the documentation 
 14  *     and/or other materials provided with the distribution.
 15  * 
 16  *   . Neither the name of the University of Manchester nor the names of its
 17  *     contributors may be used to endorse or promote products derived from this 
 18  *     software without specific prior written permission.
 19  * 
 20  * 
 21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
 22  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
 23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 
 25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
 26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
 27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 
 29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
 30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
 31  * POSSIBILITY OF SUCH DAMAGE.
 32  *
 33  **********
 34  *
 35  * Program :    TINA
 36  * File    :  $Source: /home/tina/cvs/tina-libs/tina/math/mathMatv_gs.c,v $
 37  * Date    :  $Date: 2003/09/23 11:32:20 $
 38  * Version :  $Revision: 1.4 $
 39  * CVS Id  :  $Id: mathMatv_gs.c,v 1.4 2003/09/23 11:32:20 matts Exp $
 40  *
 41  * Author  :  Legacy TINA
 42  *
 43  * Notes : Routines using Gram-Schmidt orthogonalisation process.
 44  *
 45  *********
 46 */
 47 /** 
 48  *  @file
 49  *  @brief  Routines using Gram-Schmidt orthogonalisation process.      
 50  *
 51  *  NB, uses Mat structure, not Matrix.
 52  * 
 53 */
 54 
 55 #include "mathMatv_gs.h"
 56 
 57 #if HAVE_CONFIG_H
 58 #include <config.h>
 59 #endif
 60 
 61 
 62 #include <tina/sys/sysDef.h>
 63 #include <tina/sys/sysPro.h>
 64 #include <tina/math/math_MatvDef.h>
 65 #include <tina/math/mathMatv_vec.h>
 66 #include <tina/math/mathMatv_mat.h>
 67 
 68 
 69 void            vec_gram_schmidt(int p, Vec ** basis)
 70 {
 71         int             i, j;
 72         for (i = 0; i < p; i++)
 73         {
 74                 for (j = 0; j < i; j++)
 75                 {
 76                         double          d = vec_dot(basis[i], basis[j]);
 77                         vec_accum(basis[i], -d, basis[j]);
 78                 }
 79                 vec_unit(basis[i]);
 80         }
 81 }
 82 
 83 void            vec_basis_complete(int p, Vec ** basis)
 84 {
 85         int             i, j, n = basis[0]->n;
 86         for (i = p; i < n; i++)
 87                 vec_rand_unif(basis[i], -1, 1);
 88         for (i = p; i < n; i++)
 89         {
 90                 for (j = 0; j < i; j++)
 91                 {
 92                         double          d = vec_dot(basis[i], basis[j]);
 93                         vec_accum(basis[i], -d, basis[j]);
 94                 }
 95                 vec_unit(basis[i]);
 96         }
 97 }
 98 
 99 void            mat_rand_orthonormal(Mat * r)
100 {
101         int             i, n = r->n;
102         Vec           **basis = tvector_alloc(0, n, Vec *);
103         for (i = 0; i < n; i++)
104         {
105                 basis[i] = vec_make(n);
106                 vec_rand_normal(basis[i], 0, 1);
107         }
108         vec_gram_schmidt(n, basis);
109         for (i = 0; i < n; i++)
110                 mat_col_set(r, i, basis[i]);
111         for (i = 0; i < n; i++)
112                 vec_free(basis[0]);
113         tvector_free(basis, 0, Vec *);
114 }
115 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

This page was automatically generated by the LXR engine.
Visit the LXR main site for more information.