/usr/include/trilinos/Thyra_DefaultBlockedLinearOp_def.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
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 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 | // @HEADER
// ***********************************************************************
//
// Thyra: Interfaces and Support for Abstract Numerical Algorithms
// Copyright (2004) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can 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.
//
// This library 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
// @HEADER
#ifndef THYRA_DEFAULT_BLOCKED_LINEAR_OP_DEF_HPP
#define THYRA_DEFAULT_BLOCKED_LINEAR_OP_DEF_HPP
#include "Thyra_DefaultBlockedLinearOp_decl.hpp"
#include "Thyra_DefaultProductVectorSpace.hpp"
#include "Thyra_DefaultProductVector.hpp"
#include "Thyra_DefaultProductMultiVector.hpp"
#include "Thyra_MultiVectorStdOps.hpp"
#include "Thyra_AssertOp.hpp"
namespace Thyra {
// Constructors
template<class Scalar>
DefaultBlockedLinearOp<Scalar>::DefaultBlockedLinearOp()
:numRowBlocks_(0), numColBlocks_(0), blockFillIsActive_(false)
{}
// Overridden from PhysicallyBlockedLinearOpBase
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::beginBlockFill()
{
assertBlockFillIsActive(false);
uninitialize();
resetStorage(0,0);
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::beginBlockFill(
const int numRowBlocks, const int numColBlocks
)
{
assertBlockFillIsActive(false);
uninitialize();
resetStorage(numRowBlocks,numColBlocks);
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::beginBlockFill(
const RCP<const ProductVectorSpaceBase<Scalar> > &new_productRange
,const RCP<const ProductVectorSpaceBase<Scalar> > &new_productDomain
)
{
using Teuchos::rcp_dynamic_cast;
assertBlockFillIsActive(false);
uninitialize();
productRange_ = new_productRange.assert_not_null();
productDomain_ = new_productDomain.assert_not_null();
defaultProductRange_ =
rcp_dynamic_cast<const DefaultProductVectorSpace<Scalar> >(productRange_);
defaultProductDomain_ =
rcp_dynamic_cast<const DefaultProductVectorSpace<Scalar> >(productDomain_);
// Note: the above spaces must be set before calling the next function!
resetStorage(productRange_->numBlocks(), productDomain_->numBlocks());
}
template<class Scalar>
bool DefaultBlockedLinearOp<Scalar>::blockFillIsActive() const
{
return blockFillIsActive_;
}
template<class Scalar>
bool DefaultBlockedLinearOp<Scalar>::acceptsBlock(
const int i, const int j
) const
{
assertBlockFillIsActive(true);
assertBlockRowCol(i,j);
return true;
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::setNonconstBlock(
const int i, const int j
,const RCP<LinearOpBase<Scalar> > &block
)
{
setBlockImpl(i, j, block);
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::setBlock(
const int i, const int j
,const RCP<const LinearOpBase<Scalar> > &block
)
{
setBlockImpl(i, j, block);
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::endBlockFill()
{
using Teuchos::as;
assertBlockFillIsActive(true);
// 2009/05/06: rabartl: ToDo: When doing a flexible block fill
// (Ops_stack_.size() > 0), we need to assert that all of the block rows and
// columns have been filled in. I don't think we do that here.
// Get the number of block rows and columns
if (nonnull(productRange_)) {
numRowBlocks_ = productRange_->numBlocks();
numColBlocks_ = productDomain_->numBlocks();
}
else {
numRowBlocks_ = rangeBlocks_.size();
numColBlocks_ = domainBlocks_.size();
// NOTE: Above, whether doing a flexible fill or not, all of the blocks
// must be set in order to have a valid filled operator so this
// calculation should be correct.
}
// Assert that all of the block rows and columns have at least one entry if
// the spaces were not given up front.
#ifdef TEUCHOS_DEBUG
if (is_null(productRange_)) {
for (int i = 0; i < numRowBlocks_; ++i) {
TEST_FOR_EXCEPTION(
!rangeBlocks_[i].get(), std::logic_error
,"DefaultBlockedLinearOp<Scalar>::endBlockFill():"
" Error, no linear operator block for the i="<<i<<" block row was added"
" and we can not complete the block fill!"
);
}
for(int j = 0; j < numColBlocks_; ++j) {
TEST_FOR_EXCEPTION(
!domainBlocks_[j].get(), std::logic_error
,"DefaultBlockedLinearOp<Scalar>::endBlockFill():"
" Error, no linear operator block for the j="
<<j<<" block column was added"
" and we can not complete the block fill!"
);
}
}
#endif
// Insert the block LOB objects if doing a flexible fill.
if (Ops_stack_.size()) {
Ops_.resize(numRowBlocks_*numColBlocks_);
for ( int k = 0; k < as<int>(Ops_stack_.size()); ++k ) {
const BlockEntry<Scalar> &block_i_j = Ops_stack_[k];
Ops_[numRowBlocks_*block_i_j.j + block_i_j.i] = block_i_j.block;
}
Ops_stack_.resize(0);
}
// Set the product range and domain spaces if not already set
if (is_null(productRange_)) {
adjustBlockSpaces();
defaultProductRange_ = productVectorSpace<Scalar>(rangeBlocks_());
defaultProductDomain_ = productVectorSpace<Scalar>(domainBlocks_());
productRange_ = defaultProductRange_;
productDomain_ = defaultProductDomain_;
}
rangeBlocks_.resize(0);
domainBlocks_.resize(0);
blockFillIsActive_ = false;
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::uninitialize()
{
productRange_ = Teuchos::null;
productDomain_ = Teuchos::null;
numRowBlocks_ = 0;
numColBlocks_ = 0;
Ops_.resize(0);
Ops_stack_.resize(0);
rangeBlocks_.resize(0);
domainBlocks_.resize(0);
blockFillIsActive_ = false;
}
// Overridden from BlockedLinearOpBase
template<class Scalar>
RCP<const ProductVectorSpaceBase<Scalar> >
DefaultBlockedLinearOp<Scalar>::productRange() const
{
return productRange_;
}
template<class Scalar>
RCP<const ProductVectorSpaceBase<Scalar> >
DefaultBlockedLinearOp<Scalar>::productDomain() const
{
return productDomain_;
}
template<class Scalar>
bool DefaultBlockedLinearOp<Scalar>::blockExists(
const int i, const int j
) const
{
assertBlockFillIsActive(false);
assertBlockRowCol(i,j);
return true;
}
template<class Scalar>
bool DefaultBlockedLinearOp<Scalar>::blockIsConst(
const int i, const int j
) const
{
#ifdef TEUCHOS_DEBUG
TEST_FOR_EXCEPT(!blockExists(i,j));
#endif
assertBlockFillIsActive(false);
assertBlockRowCol(i,j);
return Ops_[numRowBlocks_*j+i].isConst();
}
template<class Scalar>
RCP<LinearOpBase<Scalar> >
DefaultBlockedLinearOp<Scalar>::getNonconstBlock(const int i, const int j)
{
#ifdef TEUCHOS_DEBUG
TEST_FOR_EXCEPT(!blockExists(i,j));
#endif
assertBlockFillIsActive(false);
assertBlockRowCol(i,j);
return Ops_[numRowBlocks_*j+i].getNonconstObj();
}
template<class Scalar>
RCP<const LinearOpBase<Scalar> >
DefaultBlockedLinearOp<Scalar>::getBlock(const int i, const int j) const
{
#ifdef TEUCHOS_DEBUG
TEST_FOR_EXCEPT(!blockExists(i,j));
#endif
assertBlockFillIsActive(false);
assertBlockRowCol(i,j);
return Ops_[numRowBlocks_*j+i];
}
// Overridden from LinearOpBase
template<class Scalar>
RCP< const VectorSpaceBase<Scalar> >
DefaultBlockedLinearOp<Scalar>::range() const
{
return productRange_;
}
template<class Scalar>
RCP< const VectorSpaceBase<Scalar> >
DefaultBlockedLinearOp<Scalar>::domain() const
{
return productDomain_;
}
template<class Scalar>
RCP<const LinearOpBase<Scalar> >
DefaultBlockedLinearOp<Scalar>::clone() const
{
return Teuchos::null; // ToDo: Implement this when needed!
}
// Overridden from Teuchos::Describable
template<class Scalar>
std::string DefaultBlockedLinearOp<Scalar>::description() const
{
assertBlockFillIsActive(false);
std::ostringstream oss;
oss
<< Teuchos::Describable::description() << "{"
<< "numRowBlocks="<<numRowBlocks_
<< ",numColBlocks="<<numColBlocks_
<< "}";
return oss.str();
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::describe(
Teuchos::FancyOStream &out_arg
,const Teuchos::EVerbosityLevel verbLevel
) const
{
typedef Teuchos::ScalarTraits<Scalar> ST;
using Teuchos::rcpFromRef;
using Teuchos::FancyOStream;
using Teuchos::OSTab;
assertBlockFillIsActive(false);
RCP<FancyOStream> out = rcpFromRef(out_arg);
OSTab tab1(out);
switch(verbLevel) {
case Teuchos::VERB_DEFAULT:
case Teuchos::VERB_LOW:
*out << this->description() << std::endl;
break;
case Teuchos::VERB_MEDIUM:
case Teuchos::VERB_HIGH:
case Teuchos::VERB_EXTREME:
{
*out
<< Teuchos::Describable::description() << "{"
<< "rangeDim=" << this->range()->dim()
<< ",domainDim=" << this->domain()->dim()
<< ",numRowBlocks=" << numRowBlocks_
<< ",numColBlocks=" << numColBlocks_
<< "}\n";
OSTab tab2(out);
*out
<< "Constituent LinearOpBase objects for M = [ Op[0,0] ..."
<< " ; ... ; ... Op[numRowBlocks-1,numColBlocks-1] ]:\n";
tab2.incrTab();
for( int i = 0; i < numRowBlocks_; ++i ) {
for( int j = 0; j < numColBlocks_; ++j ) {
*out << "Op["<<i<<","<<j<<"] = ";
RCP<const LinearOpBase<Scalar> >
block_i_j = getBlock(i,j);
if(block_i_j.get())
*out << Teuchos::describe(*getBlock(i,j),verbLevel);
else
*out << "NULL\n";
}
}
break;
}
default:
TEST_FOR_EXCEPT(true); // Should never get here!
}
}
// protected
// Overridden from LinearOpBase
template<class Scalar>
bool DefaultBlockedLinearOp<Scalar>::opSupportedImpl(EOpTransp M_trans) const
{
bool supported = true;
for( int i = 0; i < numRowBlocks_; ++i ) {
for( int j = 0; j < numColBlocks_; ++j ) {
RCP<const LinearOpBase<Scalar> >
block_i_j = getBlock(i,j);
if( block_i_j.get() && !Thyra::opSupported(*block_i_j,M_trans) )
supported = false;
}
}
return supported;
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::applyImpl(
const EOpTransp M_trans,
const MultiVectorBase<Scalar> &X_in,
const Ptr<MultiVectorBase<Scalar> > &Y_inout,
const Scalar alpha,
const Scalar beta
) const
{
using Teuchos::rcpFromRef;
typedef Teuchos::ScalarTraits<Scalar> ST;
typedef RCP<MultiVectorBase<Scalar> > MultiVectorPtr;
typedef RCP<const MultiVectorBase<Scalar> > ConstMultiVectorPtr;
typedef RCP<const LinearOpBase<Scalar> > ConstLinearOpPtr;
#ifdef TEUCHOS_DEBUG
THYRA_ASSERT_LINEAR_OP_MULTIVEC_APPLY_SPACES(
"DefaultBlockedLinearOp<Scalar>::apply(...)", *this, M_trans, X_in, &*Y_inout
);
#endif // TEUCHOS_DEBUG
const bool
struct_transp = (real_trans(M_trans)!=NOTRANS); // Structural transpose?
const int
opNumRowBlocks = ( !struct_transp ? numRowBlocks_ : numColBlocks_ ),
opNumColBlocks = ( !struct_transp ? numColBlocks_ : numRowBlocks_ );
//
// Y = alpha * op(M) * X + beta*Y
//
// =>
//
// Y[i] = beta+Y[i] + sum(alpha*op(Op)[i,j]*X[j],j=0...opNumColBlocks-1)
//
// , for i=0...opNumRowBlocks-1
//
const RCP<const DefaultProductVectorSpace<Scalar> >
defaultProductRange_op = ( real_trans(M_trans)==NOTRANS
? defaultProductRange_ : defaultProductDomain_ ),
defaultProductDomain_op = ( real_trans(M_trans)==NOTRANS
? defaultProductDomain_ : defaultProductRange_ );
const RCP<const ProductMultiVectorBase<Scalar> >
X = castOrCreateSingleBlockProductMultiVector<Scalar>(
defaultProductDomain_op, rcpFromRef(X_in));
const RCP<ProductMultiVectorBase<Scalar> >
Y = nonconstCastOrCreateSingleBlockProductMultiVector<Scalar>(
defaultProductRange_op, rcpFromPtr(Y_inout));
for( int i = 0; i < opNumRowBlocks; ++i ) {
MultiVectorPtr Y_i = Y->getNonconstMultiVectorBlock(i);
for( int j = 0; j < opNumColBlocks; ++j ) {
ConstLinearOpPtr
Op_i_j = ( !struct_transp ? getBlock(i,j) : getBlock(j,i) );
ConstMultiVectorPtr
X_j = X->getMultiVectorBlock(j);
if(j==0) {
if (nonnull(Op_i_j))
Thyra::apply(*Op_i_j, M_trans,* X_j, Y_i.ptr(), alpha, beta);
else
scale(beta, Y_i.ptr());
}
else {
if (nonnull(Op_i_j))
Thyra::apply(*Op_i_j, M_trans, *X_j, Y_i.ptr(), alpha, ST::one());
}
}
}
}
// private
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::resetStorage(
const int numRowBlocks, const int numColBlocks
)
{
numRowBlocks_ = numRowBlocks;
numColBlocks_ = numColBlocks;
Ops_.resize(numRowBlocks_*numColBlocks_);
if (is_null(productRange_)) {
rangeBlocks_.resize(numRowBlocks);
domainBlocks_.resize(numColBlocks);
}
blockFillIsActive_ = true;
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::assertBlockFillIsActive(
bool wantedValue
) const
{
#ifdef TEUCHOS_DEBUG
TEST_FOR_EXCEPT(!(blockFillIsActive_==wantedValue));
#endif
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::assertBlockRowCol(
const int i, const int j
) const
{
#ifdef TEUCHOS_DEBUG
TEST_FOR_EXCEPTION(
!( 0 <= i ), std::logic_error
,"Error, i="<<i<<" is invalid!"
);
TEST_FOR_EXCEPTION(
!( 0 <= j ), std::logic_error
,"Error, j="<<j<<" is invalid!"
);
// Only validate upper range if the number of row and column blocks is
// fixed!
if(Ops_.size()) {
TEST_FOR_EXCEPTION(
!( 0 <= i && i < numRowBlocks_ ), std::logic_error
,"Error, i="<<i<<" does not fall in the range [0,"<<numRowBlocks_-1<<"]!"
);
TEST_FOR_EXCEPTION(
!( 0 <= j && j < numColBlocks_ ), std::logic_error
,"Error, j="<<j<<" does not fall in the range [0,"<<numColBlocks_-1<<"]!"
);
}
#endif
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::setBlockSpaces(
const int i, const int j, const LinearOpBase<Scalar> &block
)
{
typedef std::string s;
using Teuchos::toString;
assertBlockFillIsActive(true);
assertBlockRowCol(i,j);
// Validate that if the vector space block is already set that it is
// compatible with the block that is being set.
if( i < numRowBlocks_ && j < numColBlocks_ ) {
#ifdef TEUCHOS_DEBUG
RCP<const VectorSpaceBase<Scalar> >
rangeBlock = (
productRange_.get()
? productRange_->getBlock(i)
: rangeBlocks_[i]
),
domainBlock = (
productDomain_.get()
? productDomain_->getBlock(j)
: domainBlocks_[j]
);
if(rangeBlock.get()) {
THYRA_ASSERT_VEC_SPACES_NAMES(
"DefaultBlockedLinearOp<Scalar>::setBlockSpaces(i,j,block):\n\n"
"Adding block: " + block.description(),
*rangeBlock,("(*productRange->getBlock("+toString(i)+"))"),
*block.range(),("(*block["+toString(i)+","+toString(j)+"].range())")
);
}
if(domainBlock.get()) {
THYRA_ASSERT_VEC_SPACES_NAMES(
"DefaultBlockedLinearOp<Scalar>::setBlockSpaces(i,j,block):\n\n"
"Adding block: " + block.description(),
*domainBlock,("(*productDomain->getBlock("+toString(j)+"))"),
*block.domain(),("(*block["+toString(i)+","+toString(j)+"].domain())")
);
}
#endif // TEUCHOS_DEBUG
}
// Add spaces missing range and domain space blocks if we are doing a
// flexible fill (otherwise these loops will not be executed)
for( int k = numRowBlocks_; k <= i; ++k )
rangeBlocks_.push_back(Teuchos::null);
for( int k = numColBlocks_; k <= j; ++k )
domainBlocks_.push_back(Teuchos::null);
// Set the incoming range and domain blocks if not already set
if(!productRange_.get()) {
if(!rangeBlocks_[i].get())
rangeBlocks_[i] = block.range().assert_not_null();
if(!domainBlocks_[j].get()) {
domainBlocks_[j] = block.domain().assert_not_null();
}
}
// Update the current number of row and columns blocks if doing a flexible
// fill.
if(!Ops_.size()) {
numRowBlocks_ = rangeBlocks_.size();
numColBlocks_ = domainBlocks_.size();
}
}
template<class Scalar>
template<class LinearOpType>
void DefaultBlockedLinearOp<Scalar>::setBlockImpl(
const int i, const int j,
const RCP<LinearOpType> &block
)
{
setBlockSpaces(i, j, *block);
if (Ops_.size()) {
// We are doing a fill with a fixed number of row and column blocks so we
// can just set this.
Ops_[numRowBlocks_*j+i] = block;
}
else {
// We are doing a flexible fill so add the block to the stack of blocks or
// replace a block that already exists.
bool foundBlock = false;
for( unsigned int k = 0; k < Ops_stack_.size(); ++k ) {
BlockEntry<Scalar> &block_i_j = Ops_stack_[k];
if( block_i_j.i == i && block_i_j.j == j ) {
block_i_j.block = block;
foundBlock = true;
break;
}
}
if(!foundBlock)
Ops_stack_.push_back(BlockEntry<Scalar>(i,j,block));
}
}
template<class Scalar>
void DefaultBlockedLinearOp<Scalar>::adjustBlockSpaces()
{
#ifdef TEUCHOS_DEBUG
TEUCHOS_ASSERT_INEQUALITY(Ops_.size(), !=, 0);
#endif
//
// Loop through the rows and columns looking for rows with mixed
// single-space range and/or domain spaces on operators and set the single
// spaces as the block space if it exists.
//
// NOTE: Once we get here, we can safely assume that all of the operators
// are compatible w.r.t. their spaces so if there are rows and/or columns
// with mixed product and single vector spaces that we can just pick the
// single vector space for the whole row and/or column.
//
// Adjust blocks in the range space
for (int i = 0; i < numRowBlocks_; ++i) {
for (int j = 0; j < numColBlocks_; ++j) {
const RCP<const LinearOpBase<Scalar> >
op_i_j = Ops_[numRowBlocks_*j+i];
if (is_null(op_i_j))
continue;
const RCP<const VectorSpaceBase<Scalar> > range_i_j = op_i_j->range();
if (is_null(productVectorSpaceBase<Scalar>(range_i_j, false))) {
rangeBlocks_[i] = range_i_j;
break;
}
}
}
// Adjust blocks in the domain space
for (int j = 0; j < numColBlocks_; ++j) {
for (int i = 0; i < numRowBlocks_; ++i) {
const RCP<const LinearOpBase<Scalar> >
op_i_j = Ops_[numRowBlocks_*j+i];
if (is_null(op_i_j))
continue;
const RCP<const VectorSpaceBase<Scalar> >
domain_i_j = op_i_j->domain();
if (is_null(productVectorSpaceBase<Scalar>(domain_i_j, false))) {
domainBlocks_[j] = domain_i_j;
break;
}
}
}
}
} // namespace Thyra
template<class Scalar>
Teuchos::RCP<Thyra::DefaultBlockedLinearOp<Scalar> >
Thyra::defaultBlockedLinearOp()
{
return Teuchos::rcp(new DefaultBlockedLinearOp<Scalar>());
}
template<class Scalar>
Teuchos::RCP<const Thyra::LinearOpBase<Scalar> >
Thyra::block1x1(
const RCP<const LinearOpBase<Scalar> > &A00,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(1,1);
M->setBlock(0, 0, A00);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
template<class Scalar>
Teuchos::RCP<const Thyra::LinearOpBase<Scalar> >
Thyra::block1x2(
const RCP<const LinearOpBase<Scalar> > &A00,
const RCP<const LinearOpBase<Scalar> > &A01,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(1,2);
if(A00.get()) M->setBlock(0,0,A00);
if(A01.get()) M->setBlock(0,1,A01);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
template<class Scalar>
Teuchos::RCP<const Thyra::LinearOpBase<Scalar> >
Thyra::block2x1(
const RCP<const LinearOpBase<Scalar> > &A00,
const RCP<const LinearOpBase<Scalar> > &A10,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(2,1);
if(A00.get()) M->setBlock(0,0,A00);
if(A10.get()) M->setBlock(1,0,A10);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
template<class Scalar>
Teuchos::RCP<const Thyra::LinearOpBase<Scalar> >
Thyra::block2x2(
const RCP<const LinearOpBase<Scalar> > &A00,
const RCP<const LinearOpBase<Scalar> > &A01,
const RCP<const LinearOpBase<Scalar> > &A10,
const RCP<const LinearOpBase<Scalar> > &A11,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(2,2);
if(A00.get()) M->setBlock(0,0,A00);
if(A01.get()) M->setBlock(0,1,A01);
if(A10.get()) M->setBlock(1,0,A10);
if(A11.get()) M->setBlock(1,1,A11);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
template<class Scalar>
Teuchos::RCP<Thyra::LinearOpBase<Scalar> >
Thyra::nonconstBlock1x1(
const RCP<LinearOpBase<Scalar> > &A00,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(1, 1);
M->setNonconstBlock(0, 0, A00);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
template<class Scalar>
Teuchos::RCP<Thyra::LinearOpBase<Scalar> >
Thyra::nonconstBlock1x2(
const RCP<LinearOpBase<Scalar> > &A00,
const RCP<LinearOpBase<Scalar> > &A01,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(1,2);
if(A00.get()) M->setNonconstBlock(0,0,A00);
if(A01.get()) M->setNonconstBlock(0,1,A01);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
template<class Scalar>
Teuchos::RCP<Thyra::LinearOpBase<Scalar> >
Thyra::nonconstBlock2x1(
const RCP<LinearOpBase<Scalar> > &A00,
const RCP<LinearOpBase<Scalar> > &A10,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(2,1);
if(A00.get()) M->setNonconstBlock(0,0,A00);
if(A10.get()) M->setNonconstBlock(1,0,A10);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
template<class Scalar>
Teuchos::RCP<Thyra::LinearOpBase<Scalar> >
Thyra::nonconstBlock2x2(
const RCP<LinearOpBase<Scalar> > &A00,
const RCP<LinearOpBase<Scalar> > &A01,
const RCP<LinearOpBase<Scalar> > &A10,
const RCP<LinearOpBase<Scalar> > &A11,
const std::string &label
)
{
RCP<PhysicallyBlockedLinearOpBase<Scalar> >
M = defaultBlockedLinearOp<Scalar>();
M->beginBlockFill(2,2);
if(A00.get()) M->setNonconstBlock(0,0,A00);
if(A01.get()) M->setNonconstBlock(0,1,A01);
if(A10.get()) M->setNonconstBlock(1,0,A10);
if(A11.get()) M->setNonconstBlock(1,1,A11);
M->endBlockFill();
if (label.length())
M->setObjectLabel(label);
return M;
}
//
// Explicit instantiation macro
//
// Must be expanded from within the Thyra namespace!
//
#define THYRA_DEFAULT_BLOCKED_LINEAR_OP_INSTANT(SCALAR) \
\
template class DefaultBlockedLinearOp<SCALAR >; \
\
template RCP<DefaultBlockedLinearOp<SCALAR > > \
defaultBlockedLinearOp<SCALAR >(); \
\
template RCP<const LinearOpBase<SCALAR > > \
block1x1( \
const RCP<const LinearOpBase<SCALAR > > &A00, \
const std::string &label \
); \
\
template RCP<const LinearOpBase<SCALAR > > \
block1x2( \
const RCP<const LinearOpBase<SCALAR > > &A00, \
const RCP<const LinearOpBase<SCALAR > > &A01, \
const std::string &label \
); \
\
template RCP<const LinearOpBase<SCALAR > > \
block2x1( \
const RCP<const LinearOpBase<SCALAR > > &A00, \
const RCP<const LinearOpBase<SCALAR > > &A10, \
const std::string &label \
); \
\
template RCP<const LinearOpBase<SCALAR > > \
block2x2( \
const RCP<const LinearOpBase<SCALAR > > &A00, \
const RCP<const LinearOpBase<SCALAR > > &A01, \
const RCP<const LinearOpBase<SCALAR > > &A10, \
const RCP<const LinearOpBase<SCALAR > > &A11, \
const std::string &label \
); \
\
template RCP<LinearOpBase<SCALAR > > \
nonconstBlock1x1( \
const RCP<LinearOpBase<SCALAR > > &A00, \
const std::string &label \
); \
\
template RCP<LinearOpBase<SCALAR > > \
nonconstBlock1x2( \
const RCP<LinearOpBase<SCALAR > > &A00, \
const RCP<LinearOpBase<SCALAR > > &A01, \
const std::string &label \
); \
\
template RCP<LinearOpBase<SCALAR > > \
nonconstBlock2x1( \
const RCP<LinearOpBase<SCALAR > > &A00, \
const RCP<LinearOpBase<SCALAR > > &A10, \
const std::string &label \
); \
\
template RCP<LinearOpBase<SCALAR > > \
nonconstBlock2x2( \
const RCP<LinearOpBase<SCALAR > > &A00, \
const RCP<LinearOpBase<SCALAR > > &A01, \
const RCP<LinearOpBase<SCALAR > > &A10, \
const RCP<LinearOpBase<SCALAR > > &A11, \
const std::string &label \
);
#endif // THYRA_DEFAULT_BLOCKED_LINEAR_OP_DEF_HPP
|