/usr/include/deal.II/lac/parallel_block_vector.h is in libdeal.ii-dev 8.1.0-6ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 | // ---------------------------------------------------------------------
// $Id: parallel_block_vector.h 31932 2013-12-08 02:15:54Z heister $
//
// Copyright (C) 1999 - 2013 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE at
// the top level of the deal.II distribution.
//
// ---------------------------------------------------------------------
#ifndef __deal2__parallel_block_vector_h
#define __deal2__parallel_block_vector_h
#include <deal.II/base/config.h>
#include <deal.II/base/exceptions.h>
#include <deal.II/lac/block_indices.h>
#include <deal.II/lac/block_vector_base.h>
#include <deal.II/lac/parallel_vector.h>
#include <cstdio>
#include <vector>
DEAL_II_NAMESPACE_OPEN
namespace parallel
{
namespace distributed
{
/*! @addtogroup Vectors
*@{
*/
/**
* An implementation of block vectors based on distribued deal.II
* vectors. While the base class provides for most of the interface, this
* class handles the actual allocation of vectors and provides functions that
* are specific to the underlying vector type.
*
* @note Instantiations for this template are provided for <tt>@<float@> and
* @<double@></tt>; others can be generated in application programs (see the
* section on @ref Instantiations in the manual).
*
* @see @ref GlossBlockLA "Block (linear algebra)"
* @author Katharina Kormann, Martin Kronbichler, 2011
*/
template <typename Number>
class BlockVector : public BlockVectorBase<Vector<Number> >
{
public:
/**
* Typedef the base class for simpler access to its own typedefs.
*/
typedef BlockVectorBase<Vector<Number> > BaseClass;
/**
* Typedef the type of the underlying vector.
*/
typedef typename BaseClass::BlockType BlockType;
/**
* Import the typedefs from the base class.
*/
typedef typename BaseClass::value_type value_type;
typedef typename BaseClass::real_type real_type;
typedef typename BaseClass::pointer pointer;
typedef typename BaseClass::const_pointer const_pointer;
typedef typename BaseClass::reference reference;
typedef typename BaseClass::const_reference const_reference;
typedef typename BaseClass::size_type size_type;
typedef typename BaseClass::iterator iterator;
typedef typename BaseClass::const_iterator const_iterator;
/**
* Constructor. There are three ways to use this constructor. First,
* without any arguments, it generates an object with no blocks. Given
* one argument, it initializes <tt>num_blocks</tt> blocks, but these
* blocks have size zero. The third variant finally initializes all
* blocks to the same size <tt>block_size</tt>.
*
* Confer the other constructor further down if you intend to use
* blocks of different sizes.
*/
explicit BlockVector (const size_type num_blocks = 0,
const size_type block_size = 0);
/**
* Copy-Constructor. Dimension set to that of V, all components are
* copied from V
*/
BlockVector (const BlockVector<Number> &V);
#ifndef DEAL_II_EXPLICIT_CONSTRUCTOR_BUG
/**
* Copy constructor taking a BlockVector of another data type. This will
* fail if there is no conversion path from <tt>OtherNumber</tt> to
* <tt>Number</tt>. Note that you may lose accuracy when copying to a
* BlockVector with data elements with less accuracy.
*
* Older versions of gcc did not honor the @p explicit keyword on
* template constructors. In such cases, it is easy to accidentally
* write code that can be very inefficient, since the compiler starts
* performing hidden conversions. To avoid this, this function is
* disabled if we have detected a broken compiler during configuration.
*/
template <typename OtherNumber>
explicit
BlockVector (const BlockVector<OtherNumber> &v);
#endif
/**
* Constructor. Set the number of blocks to <tt>block_sizes.size()</tt>
* and initialize each block with <tt>block_sizes[i]</tt> zero elements.
*/
BlockVector (const std::vector<size_type> &block_sizes);
/**
* Construct a block vector with an IndexSet for the local range
* and ghost entries for each block.
*/
BlockVector (const std::vector<IndexSet> &local_ranges,
const std::vector<IndexSet> &ghost_indices,
const MPI_Comm communicator);
/**
* Same as above but the ghost indicies are assumed to be empty.
*/
BlockVector (const std::vector<IndexSet> &local_ranges,
const MPI_Comm communicator);
/**
* Destructor. Clears memory.
*/
~BlockVector ();
/**
* Copy operator: fill all components of the vector with the given
* scalar value.
*/
BlockVector &operator = (const value_type s);
/**
* Copy operator for arguments of the same type. Resize the present
* vector if necessary.
*/
BlockVector &
operator= (const BlockVector &V);
/**
* Copy operator for template arguments of different types. Resize the
* present vector if necessary.
*/
template <class Number2>
BlockVector &
operator= (const BlockVector<Number2> &V);
/**
* Copy a regular vector into a block vector.
*/
BlockVector &
operator= (const Vector<Number> &V);
/**
* Reinitialize the BlockVector to contain <tt>num_blocks</tt> blocks of
* size <tt>block_size</tt> each.
*
* If the second argument is left at its default value, then the block
* vector allocates the specified number of blocks but leaves them at
* zero size. You then need to later reinitialize the individual blocks,
* and call collect_sizes() to update the block system's knowledge of
* its individual block's sizes.
*
* If <tt>fast==false</tt>, the vector is filled with zeros.
*/
void reinit (const size_type num_blocks,
const size_type block_size = 0,
const bool fast = false);
/**
* Reinitialize the BlockVector such that it contains
* <tt>block_sizes.size()</tt> blocks. Each block is reinitialized to
* dimension <tt>block_sizes[i]</tt>.
*
* If the number of blocks is the same as before this function was
* called, all vectors remain the same and reinit() is called for each
* vector.
*
* If <tt>fast==false</tt>, the vector is filled with zeros.
*
* Note that you must call this (or the other reinit() functions)
* function, rather than calling the reinit() functions of an individual
* block, to allow the block vector to update its caches of vector
* sizes. If you call reinit() on one of the blocks, then subsequent
* actions on this object may yield unpredictable results since they may
* be routed to the wrong block.
*/
void reinit (const std::vector<size_type> &N,
const bool fast=false);
/**
* Change the dimension to that of the vector <tt>V</tt>. The same
* applies as for the other reinit() function.
*
* The elements of <tt>V</tt> are not copied, i.e. this function is the
* same as calling <tt>reinit (V.size(), fast)</tt>.
*
* Note that you must call this (or the other reinit() functions)
* function, rather than calling the reinit() functions of an individual
* block, to allow the block vector to update its caches of vector
* sizes. If you call reinit() of one of the blocks, then subsequent
* actions of this object may yield unpredictable results since they may
* be routed to the wrong block.
*/
template <typename Number2>
void reinit (const BlockVector<Number2> &V,
const bool fast=false);
/**
* This function copies the data that has accumulated in the data buffer
* for ghost indices to the owning processor. For the meaning of the
* argument @p operation, see the entry on @ref GlossCompress
* "Compressing distributed vectors and matrices" in the glossary.
*
* There are two variants for this function. If called with argument @p
* VectorOperation::add adds all the data accumulated in ghost elements
* to the respective elements on the owning processor and clears the
* ghost array afterwards. If called with argument @p
* VectorOperation::insert, a set operation is performed. Since setting
* elements in a vector with ghost elements is ambiguous (as one can set
* both the element on the ghost site as well as the owning site), this
* operation makes the assumption that all data is set correctly on the
* owning processor. Upon call of compress(VectorOperation::insert), all
* ghost entries are therefore simply zeroed out (using
* zero_ghost_values()). In debug mode, a check is performed that makes
* sure that the data set is actually consistent between processors,
* i.e., whenever a non-zero ghost element is found, it is compared to
* the value on the owning processor and an exception is thrown if these
* elements do not agree.
*
*/
void compress (::dealii::VectorOperation::values operation);
/**
* Fills the data field for ghost indices with the values stored in the
* respective positions of the owning processor. This function is needed
* before reading from ghosts. The function is @p const even though
* ghost data is changed. This is needed to allow functions with a @p
* const vector to perform the data exchange without creating
* temporaries.
*/
void update_ghost_values () const;
/**
* This method zeros the entries on ghost dofs, but does not touch
* locally owned DoFs.
*
* After calling this method, read access to ghost elements of the
* vector is forbidden and an exception is thrown. Only write access to
* ghost elements is allowed in this state.
*/
void zero_out_ghosts ();
/**
* Returns if this Vector contains ghost elements.
*/
bool has_ghost_elements() const;
/**
* Return whether the vector contains only elements with value
* zero. This function is mainly for internal consistency checks and
* should seldom be used when not in debug mode since it uses quite some
* time.
*/
bool all_zero () const;
/**
* Return @p true if the vector has no negative entries, i.e. all
* entries are zero or positive. This function is used, for example, to
* check whether refinement indicators are really all positive (or
* zero).
*
* The function obviously only makes sense if the template argument of
* this class is a real type. If it is a complex type, then an exception
* is thrown.
*/
bool is_non_negative () const;
/**
* Checks for equality of the two vectors.
*/
template <typename Number2>
bool operator == (const BlockVector<Number2> &v) const;
/**
* Checks for inequality of the two vectors.
*/
template <typename Number2>
bool operator != (const BlockVector<Number2> &v) const;
/**
* Perform the inner product of two vectors.
*/
template <typename Number2>
Number operator * (const BlockVector<Number2> &V) const;
/**
* Computes the square of the l<sub>2</sub> norm of the vector (i.e.,
* the sum of the squares of all entries among all processors).
*/
real_type norm_sqr () const;
/**
* Computes the mean value of all the entries in the vector.
*/
Number mean_value () const;
/**
* Returns the l<sub>1</sub> norm of the vector (i.e., the sum of the
* absolute values of all entries among all processors).
*/
real_type l1_norm () const;
/**
* Returns the l<sub>2</sub> norm of the vector (i.e., square root of
* the sum of the square of all entries among all processors).
*/
real_type l2_norm () const;
/**
* Returns the l<sub>p</sub> norm with real @p p of the vector (i.e.,
* the pth root of sum of the pth power of all entries among all
* processors).
*/
real_type lp_norm (const real_type p) const;
/**
* Returns the maximum norm of the vector (i.e., maximum absolute value
* among all entries among all processors).
*/
real_type linfty_norm () const;
/**
* Scale each element of the vector by the given factor.
*
* This function is deprecated and will be removed in a future
* version. Use <tt>operator *=</tt> and <tt>operator /=</tt> instead.
*
* @deprecated Use <tt>operator*=</tt> instead.
*/
void scale (const value_type factor) DEAL_II_DEPRECATED;
/**
* Multiply each element of this vector by the corresponding element of
* <tt>v</tt>.
*/
template <class BlockVector2>
void scale (const BlockVector2 &v);
/**
* Swap the contents of this vector and the other vector <tt>v</tt>. One
* could do this operation with a temporary variable and copying over
* the data elements, but this function is significantly more efficient
* since it only swaps the pointers to the data of the two vectors and
* therefore does not need to allocate temporary storage and move data
* around.
*
* Limitation: right now this function only works if both vectors have
* the same number of blocks. If needed, the numbers of blocks should be
* exchanged, too.
*
* This function is analog to the the swap() function of all C++
* standard containers. Also, there is a global function swap(u,v) that
* simply calls <tt>u.swap(v)</tt>, again in analogy to standard
* functions.
*/
void swap (BlockVector<Number> &v);
/** @addtogroup Exceptions
* @{ */
/**
* Exception
*/
DeclException0 (ExcIteratorRangeDoesNotMatchVectorSize);
//@}
};
/*@}*/
#ifndef DOXYGEN
/*----------------------- Inline functions ----------------------------------*/
template <typename Number>
inline
BlockVector<Number>::BlockVector (const size_type n_blocks,
const size_type block_size)
{
reinit (n_blocks, block_size);
}
template <typename Number>
inline
BlockVector<Number>::BlockVector (const std::vector<size_type> &n)
{
reinit (n, false);
}
template <typename Number>
inline
BlockVector<Number>::BlockVector (const std::vector<IndexSet> &local_ranges,
const std::vector<IndexSet> &ghost_indices,
const MPI_Comm communicator)
{
std::vector<size_type> sizes(local_ranges.size());
for (unsigned int i=0; i<local_ranges.size(); ++i)
sizes[i] = local_ranges[i].size();
this->block_indices.reinit(sizes);
this->components.resize(this->n_blocks());
for (unsigned int i=0; i<this->n_blocks(); ++i)
this->block(i).reinit(local_ranges[i], ghost_indices[i], communicator);
}
template <typename Number>
inline
BlockVector<Number>::BlockVector (const std::vector<IndexSet> &local_ranges,
const MPI_Comm communicator)
{
std::vector<size_type> sizes(local_ranges.size());
for (unsigned int i=0; i<local_ranges.size(); ++i)
sizes[i] = local_ranges[i].size();
this->block_indices.reinit(sizes);
this->components.resize(this->n_blocks());
for (unsigned int i=0; i<this->n_blocks(); ++i)
this->block(i).reinit(local_ranges[i], communicator);
}
template <typename Number>
inline
BlockVector<Number>::BlockVector (const BlockVector<Number> &v)
:
BlockVectorBase<Vector<Number> > ()
{
this->components.resize (v.n_blocks());
this->block_indices = v.block_indices;
for (size_type i=0; i<this->n_blocks(); ++i)
this->components[i] = v.components[i];
}
#ifndef DEAL_II_EXPLICIT_CONSTRUCTOR_BUG
template <typename Number>
template <typename OtherNumber>
inline
BlockVector<Number>::BlockVector (const BlockVector<OtherNumber> &v)
{
reinit (v, true);
*this = v;
}
#endif
template <typename Number>
inline
void BlockVector<Number>::reinit (const size_type n_bl,
const size_type bl_sz,
const bool fast)
{
std::vector<size_type> n(n_bl, bl_sz);
reinit(n, fast);
}
template <typename Number>
inline
void BlockVector<Number>::reinit (const std::vector<size_type> &n,
const bool fast)
{
this->block_indices.reinit (n);
if (this->components.size() != this->n_blocks())
this->components.resize(this->n_blocks());
for (size_type i=0; i<this->n_blocks(); ++i)
this->components[i].reinit(n[i], fast);
}
template <typename Number>
template <typename Number2>
inline
void BlockVector<Number>::reinit (const BlockVector<Number2> &v,
const bool fast)
{
this->block_indices = v.get_block_indices();
if (this->components.size() != this->n_blocks())
this->components.resize(this->n_blocks());
for (unsigned int i=0; i<this->n_blocks(); ++i)
this->block(i).reinit(v.block(i), fast);
}
template <typename Number>
inline
BlockVector<Number>::~BlockVector ()
{}
template <typename Number>
inline
BlockVector<Number> &
BlockVector<Number>::operator = (const value_type s)
{
Assert (numbers::is_finite(s), ExcNumberNotFinite());
BaseClass::operator = (s);
return *this;
}
template <typename Number>
inline
BlockVector<Number> &
BlockVector<Number>::operator = (const BlockVector &v)
{
// we only allow assignment to vectors with the same number of blocks
// or to an empty BlockVector
Assert (this->n_blocks() == 0 || this->n_blocks() == v.n_blocks(),
ExcDimensionMismatch(this->n_blocks(), v.n_blocks()));
if (this->n_blocks() != v.n_blocks())
reinit(v.n_blocks(), true);
for (size_type i=0; i<this->n_blocks(); ++i)
this->components[i] = v.block(i);
this->collect_sizes();
return *this;
}
template <typename Number>
inline
BlockVector<Number> &
BlockVector<Number>::operator = (const Vector<Number> &v)
{
BaseClass::operator = (v);
return *this;
}
template <typename Number>
template <typename Number2>
inline
BlockVector<Number> &
BlockVector<Number>::operator = (const BlockVector<Number2> &v)
{
reinit (v, true);
BaseClass::operator = (v);
return *this;
}
template <typename Number>
inline
void
BlockVector<Number>::compress (::dealii::VectorOperation::values operation)
{
// start all requests for all blocks before finishing the transfers as
// this saves repeated synchronizations
for (unsigned int block=0; block<this->n_blocks(); ++block)
this->block(block).compress_start(block*10 + 8273, operation);
for (unsigned int block=0; block<this->n_blocks(); ++block)
this->block(block).compress_finish(operation);
}
template <typename Number>
inline
void
BlockVector<Number>::update_ghost_values () const
{
for (unsigned int block=0; block<this->n_blocks(); ++block)
this->block(block).update_ghost_values_start(block*10 + 9923);
for (unsigned int block=0; block<this->n_blocks(); ++block)
this->block(block).update_ghost_values_finish();
}
template <typename Number>
inline
void
BlockVector<Number>::zero_out_ghosts ()
{
for (unsigned int block=0; block<this->n_blocks(); ++block)
this->block(block).zero_out_ghosts();
}
template <typename Number>
inline
bool
BlockVector<Number>::has_ghost_elements () const
{
bool has_ghost_elements = false;
for (unsigned int block=0; block<this->n_blocks(); ++block)
if (this->block(block).has_ghost_elements() == true)
has_ghost_elements = true;
return has_ghost_elements;
}
template <typename Number>
inline
bool
BlockVector<Number>::all_zero () const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
// use int instead of bool. in order to make global reduction operations
// work also when MPI_Init was not called, only call MPI_Allreduce
// commands when there is more than one processor (note that reinit()
// functions handle this case correctly through the job_supports_mpi()
// query). this is the same in all the functions below
int local_result = -1;
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result = std::max(local_result,
-static_cast<int>(this->block(i).all_zero_local()));
if (this->block(0).partitioner->n_mpi_processes() > 1)
return -Utilities::MPI::max(local_result,
this->block(0).partitioner->get_communicator());
else
return local_result;
}
template <typename Number>
inline
bool
BlockVector<Number>::is_non_negative () const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
int local_result = -1;
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result = std::max(local_result,
-static_cast<int>(this->block(i).is_non_negative_local()));
if (this->block(0).partitioner->n_mpi_processes() > 1)
return Utilities::MPI::max(local_result,
this->block(0).partitioner->get_communicator());
else
return local_result;
}
template <typename Number>
template <typename Number2>
inline
bool
BlockVector<Number>::operator == (const BlockVector<Number2> &v) const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
AssertDimension (this->n_blocks(), v.n_blocks());
// MPI does not support bools, so use unsigned int instead. Two vectors
// are equal if the check for non-equal fails on all processors
unsigned int local_result = 0;
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result = std::max(local_result,
static_cast<unsigned int>(!this->block(i).vectors_equal_local(v.block(i))));
unsigned int result =
this->block(0).partitioner->n_mpi_processes() > 1
?
Utilities::MPI::max(local_result, this->block(0).partitioner->get_communicator())
:
local_result;
return result==0;
}
template <typename Number>
template <typename Number2>
inline
bool
BlockVector<Number>::operator != (const BlockVector<Number2> &v) const
{
return !(operator == (v));
}
template <typename Number>
template <typename Number2>
inline
Number
BlockVector<Number>::operator * (const BlockVector<Number2> &v) const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
AssertDimension (this->n_blocks(), v.n_blocks());
Number local_result = Number();
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result += this->block(i).inner_product_local(v.block(i));
if (this->block(0).partitioner->n_mpi_processes() > 1)
return Utilities::MPI::sum (local_result,
this->block(0).partitioner->get_communicator());
else
return local_result;
}
template <typename Number>
inline
typename BlockVector<Number>::real_type
BlockVector<Number>::norm_sqr () const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
real_type local_result = real_type();
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result += this->block(i).norm_sqr_local();
if (this->block(0).partitioner->n_mpi_processes() > 1)
return Utilities::MPI::sum (local_result,
this->block(0).partitioner->get_communicator());
else
return local_result;
}
template <typename Number>
inline
Number
BlockVector<Number>::mean_value () const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
Number local_result = Number();
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result += this->block(i).mean_value_local()*(real_type)this->block(i).partitioner->local_size();
if (this->block(0).partitioner->n_mpi_processes() > 1)
return Utilities::MPI::sum (local_result,
this->block(0).partitioner->get_communicator())/
(real_type)this->size();
else
return local_result/(real_type)this->size();
}
template <typename Number>
inline
typename BlockVector<Number>::real_type
BlockVector<Number>::l1_norm () const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
real_type local_result = real_type();
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result += this->block(i).l1_norm_local();
if (this->block(0).partitioner->n_mpi_processes() > 1)
return Utilities::MPI::sum (local_result,
this->block(0).partitioner->get_communicator());
else
return local_result;
}
template <typename Number>
inline
typename BlockVector<Number>::real_type
BlockVector<Number>::l2_norm () const
{
return std::sqrt(norm_sqr());
}
template <typename Number>
inline
typename BlockVector<Number>::real_type
BlockVector<Number>::lp_norm (const real_type p) const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
real_type local_result = real_type();
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result += std::pow(this->block(i).lp_norm_local(p), p);
if (this->block(0).partitioner->n_mpi_processes() > 1)
return std::pow (Utilities::MPI::sum(local_result,
this->block(0).partitioner->get_communicator()),
static_cast<real_type>(1.0/p));
else
return std::pow (local_result, static_cast<real_type>(1.0/p));
}
template <typename Number>
inline
typename BlockVector<Number>::real_type
BlockVector<Number>::linfty_norm () const
{
Assert (this->n_blocks() > 0, ExcEmptyObject());
real_type local_result = real_type();
for (unsigned int i=0; i<this->n_blocks(); ++i)
local_result = std::max(local_result, this->block(i).linfty_norm_local());
if (this->block(0).partitioner->n_mpi_processes() > 1)
return Utilities::MPI::max (local_result,
this->block(0).partitioner->get_communicator());
else
return local_result;
}
template <typename Number>
inline
void BlockVector<Number>::swap (BlockVector<Number> &v)
{
Assert (this->n_blocks() == v.n_blocks(),
ExcDimensionMismatch(this->n_blocks(), v.n_blocks()));
for (size_type i=0; i<this->n_blocks(); ++i)
dealii::swap (this->components[i], v.components[i]);
dealii::swap (this->block_indices, v.block_indices);
}
template <typename Number>
void BlockVector<Number>::scale (const value_type factor)
{
Assert (numbers::is_finite(factor), ExcNumberNotFinite());
for (size_type i=0; i<this->n_blocks(); ++i)
this->components[i].scale(factor);
}
template <typename Number>
template <class BlockVector2>
void BlockVector<Number>::scale (const BlockVector2 &v)
{
BaseClass::scale (v);
}
#endif // DOXYGEN
} // end of namespace distributed
} // end of namespace parallel
/**
* Global function which overloads the default implementation
* of the C++ standard library which uses a temporary object. The
* function simply exchanges the data of the two vectors.
*
* @relates BlockVector
* @author Katharina Kormann, Martin Kronbichler, 2011
*/
template <typename Number>
inline
void swap (parallel::distributed::BlockVector<Number> &u,
parallel::distributed::BlockVector<Number> &v)
{
u.swap (v);
}
DEAL_II_NAMESPACE_CLOSE
#endif
|