1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464
|
#ifndef __CS_CDO_TOOLBOX_H__
#define __CS_CDO_TOOLBOX_H__
/*============================================================================
* Basic operations: dot product, cross product, sum...
*============================================================================*/
/*
This file is part of Code_Saturne, a general-purpose CFD tool.
Copyright (C) 1998-2016 EDF S.A.
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., 51 Franklin
Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
/*----------------------------------------------------------------------------
* Standard C library headers
*----------------------------------------------------------------------------*/
#include <stdio.h>
#include <math.h>
/*----------------------------------------------------------------------------
* Local headers
*----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------*/
BEGIN_C_DECLS
/*============================================================================
* Macro definitions
*============================================================================*/
/*============================================================================
* Type definitions
*============================================================================*/
/* Structure for managing temporary buffers */
typedef struct {
size_t bufsize;
void *buf;
} cs_tmpbuf_t;
/* Index to scan a mesh connectivity */
typedef struct {
bool owner;
int n;
int *idx; /* from 0, size = n+1 */
int *ids; /* ids from 0 to n-1 (there is no multifold entry) */
} cs_connect_index_t;
/* Structure enabling the repeated usage of local dense square matrix
associated with a local set of entities */
typedef struct {
int n_max_ent; // max number of entities by primal cells
int n_ent; // current number of entities
cs_lnum_t *ids; // list of entity ids (size = n_max_ent)
double *val; // local matrix (size: n_max_ent*n_max_ent)
} cs_locmat_t;
/* Structure enabling the repeated usage of local dense DEC matrix associated
with a local set of entities */
typedef struct {
int n_max_rows; // max number of entries in a row
int n_rows; // current number of rows
cs_lnum_t *row_ids; // list of entity ids in a row (size = n_max_rows)
int n_max_cols; // max number of entries in a column
int n_cols; // current number of columns
cs_lnum_t *col_ids; // list of entity ids in a col (size = n_max_rows)
short int *sgn; // local matrix (size: n_max_rows*n_max_cols)
} cs_locdec_t;
/* ============= *
* DATA ANALYSIS *
* ============= */
typedef union {
cs_lnum_t number;
double value;
} cs_data_t;
typedef struct {
cs_data_t min;
cs_data_t max;
double mean;
double sigma;
double euclidean_norm;
} cs_data_info_t;
/*============================================================================
* Public function prototypes
*============================================================================*/
/*----------------------------------------------------------------------------*/
/*!
* \brief Compute the euclidean norm 2 of a vector of size len
* This algorithm tries to reduce round-off error thanks to
* intermediate sums.
*
* \param[in] len vector dimension
* \param[in] v vector
*
* \return the euclidean norm of a vector
*/
/*----------------------------------------------------------------------------*/
double
cs_euclidean_norm(int len,
const double v[]);
/*----------------------------------------------------------------------------*/
/*!
* \brief Compute the weighted sum of square values of an array
*
* \param[in] n size of arrays v and w
* \param[in] x array of floating-point values
* \param[in] w floating-point values of weights
*
* \return the result of this operation
*/
/*----------------------------------------------------------------------------*/
double
cs_weighted_sum_square(cs_lnum_t n,
const double *restrict x,
const double *restrict weight);
/*----------------------------------------------------------------------------*/
/*!
* \brief Allocate or reallocate a temporary buffer structure
*
* \param[in] bufsize reference size
* \param[in, out] p_tb pointer to the temporary structure to allocate
*/
/*----------------------------------------------------------------------------*/
void
cs_tmpbuf_alloc(size_t bufsize,
cs_tmpbuf_t **p_tb);
/*----------------------------------------------------------------------------*/
/*!
* \brief Free a temporary buffer structure
*
* \param[in] tb pointer to the temporary structure to free
*
* \returns NULL pointer
*/
/*----------------------------------------------------------------------------*/
cs_tmpbuf_t *
cs_tmpbuf_free(cs_tmpbuf_t *tb);
/*----------------------------------------------------------------------------*/
/*!
* \brief Compute some simple statistics from an array
*
* \param[in] n_elts number of couples in data
* \param[in] stride size of a couple of data
* \param[in] datatype datatype
* \param[in] indata buffer containing input data
* \param[in] do_abs analyse the absolute value of indata
*
* \return a cs_data_info_t structure
*/
/*----------------------------------------------------------------------------*/
cs_data_info_t
cs_analysis_data(cs_lnum_t n_elts,
int stride,
cs_datatype_t datatype,
const void *indata,
bool do_abs);
/*----------------------------------------------------------------------------*/
/*!
* \brief Dump a cs_data_info_t structure
*
* \param[in] name filename if not NULL
* \param[in] f output file if not NULL
* \param[in] n_elts number of couples in data
* \param[in] datatype datatype
* \param[in] dinfo cs_data_info_t structure
*/
/*----------------------------------------------------------------------------*/
void
cs_data_info_dump(const char *name,
FILE *f,
cs_lnum_t n_elts,
cs_datatype_t datatype,
const cs_data_info_t dinfo);
/*----------------------------------------------------------------------------*/
/*!
* \brief Create an index structure of size n
*
* \param[in] n number of entries of the indexed list
*
* \return a pointer to a cs_connect_index_t
*/
/*----------------------------------------------------------------------------*/
cs_connect_index_t *
cs_index_create(int n);
/*----------------------------------------------------------------------------*/
/*!
* \brief Map arrays into an index structure of size n (owner = false)
*
* \param[in] n number of entries of the indexed list
* \param[in] idx array of size n+1
* \param[in] ids array of size idx[n]
*
* \return a pointer to a cs_connect_index_t
*/
/*----------------------------------------------------------------------------*/
cs_connect_index_t *
cs_index_map(int n,
int *idx,
int *ids);
/*----------------------------------------------------------------------------*/
/*!
* \brief Destroy a cs_connect_index_t structure
*
* \param[in] pidx pointer of pointer to a cs_connect_index_t structure
*/
/*----------------------------------------------------------------------------*/
void
cs_index_free(cs_connect_index_t **pidx);
/*----------------------------------------------------------------------------*/
/*!
* \brief From 2 indexes : A -> B and B -> C create a new index A -> C
*
* \param[in] nc number of elements in C set
* \param[in] a2b pointer to the index A -> B
* \param[in] b2c pointer to the index B -> C
*
*\return a pointer to the cs_connect_index_t structure A -> C
*/
/*----------------------------------------------------------------------------*/
cs_connect_index_t *
cs_index_compose(int nc,
const cs_connect_index_t *a2b,
const cs_connect_index_t *b2c);
/*----------------------------------------------------------------------------*/
/*!
* \brief From a cs_connect_index_t struct. A -> B create a new index B -> A
*
* \param[in] nb size of the "b" set
* \param[in] a2b pointer to the index A -> B
*
*\return a new pointer to the cs_connect_index_t structure B -> A
*/
/*----------------------------------------------------------------------------*/
cs_connect_index_t *
cs_index_transpose(int nb,
const cs_connect_index_t *a2b);
/*----------------------------------------------------------------------------*/
/*!
* \brief Sort each list related to an entry in a cs_connect_index_t structure
*
* \param[in] x pointer to a cs_connect_index_t structure
*/
/*----------------------------------------------------------------------------*/
void
cs_index_sort(cs_connect_index_t *x);
/*----------------------------------------------------------------------------*/
/*!
* \brief Dump a cs_connect_index_t structure to a file or into the standard
* output
*
* \param[in] name name of the dump file. Can be set to NULL
* \param[in] _f pointer to a FILE structure. Can be set to NULL.
* \param[in] x pointer to a cs_connect_index_t structure
*/
/*----------------------------------------------------------------------------*/
void
cs_index_dump(const char *name,
FILE *_f,
cs_connect_index_t *x);
/*----------------------------------------------------------------------------*/
/*!
* \brief Allocate and initialize a cs_locmat_t structure
*
* \param[in] n_max_ent max number of entities
*
* \return a new allocated cs_locmat_t structure
*/
/*----------------------------------------------------------------------------*/
cs_locmat_t *
cs_locmat_create(int n_max_ent);
/*----------------------------------------------------------------------------*/
/*!
* \brief Free a cs_locmat_t structure
*
* \param[in] lm pointer to a cs_locmat_t struct. to free
*
* \return a NULL pointer
*/
/*----------------------------------------------------------------------------*/
cs_locmat_t *
cs_locmat_free(cs_locmat_t *lm);
/*----------------------------------------------------------------------------*/
/*!
* \brief Copy a cs_locmat_t structure into another cs_locmat_t structure
* which has been already allocated
*
* \param[in, out] recv pointer to a cs_locmat_t struct.
* \param[in] send pointer to a cs_locmat_t struct.
*/
/*----------------------------------------------------------------------------*/
void
cs_locmat_copy(cs_locmat_t *recv,
const cs_locmat_t *send);
/*----------------------------------------------------------------------------*/
/*!
* \brief Compute a local dense matrix-vector product
* matvec has been previously allocated
*
* \param[in] loc local matrix to use
* \param[in] vec local vector to use
* \param[in, out] matvec result of the local matrix-vector product
*/
/*----------------------------------------------------------------------------*/
void
cs_locmat_matvec(const cs_locmat_t *loc,
const cs_real_t *vec,
cs_real_t *matvec);
/*----------------------------------------------------------------------------*/
/*!
* \brief Add two local dense matrices: loc += add
*
* \param[in, out] loc local matrix storing the result
* \param[in] add values to add to loc
*/
/*----------------------------------------------------------------------------*/
void
cs_locmat_add(cs_locmat_t *loc,
const cs_locmat_t *add);
/*----------------------------------------------------------------------------*/
/*!
* \brief Give the result of the following operation: loc = loc + alpha*add
*
* \param[in, out] loc local matrix storing the result
* \param[in] alpha multiplicative coefficient
* \param[in] add values to add to loc
*/
/*----------------------------------------------------------------------------*/
void
cs_locmat_mult_add(cs_locmat_t *loc,
double alpha,
const cs_locmat_t *add);
/*----------------------------------------------------------------------------*/
/*!
* \brief Define a new matrix by adding a local matrix with its transpose.
* Keep the transposed matrix for future use.
*
* \param[in, out] loc local matrix to transpose and add
* \param[in, out] tr transposed of the local matrix
*/
/*----------------------------------------------------------------------------*/
void
cs_locmat_add_transpose(cs_locmat_t *loc,
cs_locmat_t *tr);
/*----------------------------------------------------------------------------*/
/*!
* \brief Dump a local discrete Hodge operator
*
* \param[in] parent_id id of the related parent entity
* \param[in] lm pointer to the cs_sla_locmat_t struct.
*/
/*----------------------------------------------------------------------------*/
void
cs_locmat_dump(int parent_id,
const cs_locmat_t *lm);
/*----------------------------------------------------------------------------*/
/*!
* \brief Allocate and initialize a cs_locdec_t structure
*
* \param[in] n_max_rows max number of rows
* \param[in] n_max_cols max number of columns
*
* \return a new allocated cs_locdec_t structure
*/
/*----------------------------------------------------------------------------*/
cs_locdec_t *
cs_locdec_create(int n_max_rows,
int n_max_cols);
/*----------------------------------------------------------------------------*/
/*!
* \brief Free a cs_locdec_t structure
*
* \param[in, out] m pointer to a cs_locdec_t structure to free
*
* \return a NULL pointer
*/
/*----------------------------------------------------------------------------*/
cs_locdec_t *
cs_locdec_free(cs_locdec_t *m);
/*----------------------------------------------------------------------------*/
END_C_DECLS
#endif /* __CS_TOOLBOX_H__ */
|