/usr/include/trilinos/Sacado_UQ_PCE.hpp is in libtrilinos-stokhos-dev 12.12.1-5.
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 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 | // @HEADER
// ***********************************************************************
//
// Stokhos Package
// Copyright (2009) 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.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Eric T. Phipps (etphipp@sandia.gov).
//
// ***********************************************************************
// @HEADER
#ifndef SACADO_UQ_PCE_HPP
#define SACADO_UQ_PCE_HPP
#include "Stokhos_ConfigDefs.h"
#ifdef HAVE_STOKHOS_SACADO
#include "Kokkos_Macros.hpp"
#include "Sacado_Traits.hpp"
#include "Sacado_mpl_apply.hpp"
#include "Stokhos_Is_Constant.hpp"
#include "Stokhos_CrsProductTensor.hpp"
#include <cmath>
#include <algorithm> // for std::min and std::max
#include <ostream> // for std::ostream
#include <initializer_list>
namespace Sacado {
// Forward declaration
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool is_constant(const Sacado::UQ::PCE<Storage>& x);
//! Namespace for UQ classes classes
namespace UQ {
//! Generalized polynomial chaos expansion class
/*!
* Uses a handle and a "copy-on-write" strategy for efficient copying, but
* no expression templating.
*/
template <typename Storage >
class PCE {
template <class> friend class PCE;
public:
//! Typename of storage class
typedef Storage storage_type;
typedef typename storage_type::value_type value_type;
typedef typename storage_type::ordinal_type ordinal_type;
typedef typename storage_type::execution_space execution_space;
typedef typename storage_type::pointer pointer;
typedef typename storage_type::volatile_pointer volatile_pointer;
typedef typename storage_type::const_pointer const_pointer;
typedef typename storage_type::const_volatile_pointer const_volatile_pointer;
typedef typename storage_type::reference reference;
typedef typename storage_type::volatile_reference volatile_reference;
typedef typename storage_type::const_reference const_reference;
typedef typename storage_type::const_volatile_reference const_volatile_reference;
//! Typename of scalar's (which may be different from value_type)
typedef typename ScalarType<value_type>::type scalar_type;
//! Basis type
//typedef Stokhos::OrthogPolyBasis<ordinal_type,value_type> basis_type;
//! Cijk type
typedef Stokhos::CrsProductTensor<value_type, execution_space, Kokkos::MemoryUnmanaged> my_cijk_type;
typedef Stokhos::CrsProductTensor<value_type, execution_space> cijk_type;
//! Turn PCE into a meta-function class usable with mpl::apply
template <typename S>
struct apply {
typedef PCE<S> type;
};
//! Default constructor
/*!
* May not intialize the coefficient array.
*/
KOKKOS_INLINE_FUNCTION
PCE() = default;
//! Constructor with supplied value \c x
/*!
* Sets size to 1 and first coefficient to x (represents a constant).
*/
KOKKOS_INLINE_FUNCTION
PCE(const value_type& x) : cijk_(), s_(1, x) {}
//! Constructor with Cijk \c cijk (General case)
/*!
* Creates array of correct size and initializes coeffiencts to 0.
*/
template <typename M>
KOKKOS_INLINE_FUNCTION
PCE(const Stokhos::CrsProductTensor<value_type, execution_space, M>& cijkVal) :
cijk_(cijkVal), s_(cijk_.dimension()) {}
//! Constructor with Cijk \c cijk and specified size \c sz
/*!
* Creates array of size \c sz and initializes coeffiencts to 0.
*/
template <typename M>
KOKKOS_INLINE_FUNCTION
PCE(const Stokhos::CrsProductTensor<value_type, execution_space, M>& cijkVal,
ordinal_type sz) : cijk_(cijkVal), s_(sz) {}
//! View constructor
/*!
* Creates PCE with pre-allocated data. Set \c owned = true
* if this PCE should take over management of the data.
*/
template <typename M>
KOKKOS_INLINE_FUNCTION
PCE(const Stokhos::CrsProductTensor<value_type, execution_space, M>& cijkVal,
ordinal_type sz, pointer v, bool owned) :
cijk_(cijkVal), s_(sz,v,owned) {}
//! Copy constructor
KOKKOS_INLINE_FUNCTION
PCE(const PCE& x) : cijk_(x.cijk_), s_(1,x.fastAccessCoeff(0)) {
if (x.size() > 1 && !is_constant(x))
s_ = x.s_;
}
//! Copy constructor
KOKKOS_INLINE_FUNCTION
PCE(const volatile PCE& x) :
cijk_(const_cast<const my_cijk_type&>(x.cijk_)),
s_(1,value_type(x.fastAccessCoeff(0))) {
if (x.size() > 1 && !is_constant(x))
s_ = x.s_;
}
//! Intialize from initializer_list
/*!
* No KOKKOS_INLINE_FUNCTION as it is not callable from the device
*/
PCE(std::initializer_list<value_type> l) :
cijk_(), s_(l.size(), l.begin()) {}
//! Destructor
KOKKOS_INLINE_FUNCTION
~PCE() = default;
//! Initialize coefficients to value
KOKKOS_INLINE_FUNCTION
void init(const_reference v) { s_.init(v); }
//! Initialize coefficients to value
KOKKOS_INLINE_FUNCTION
void init(const_reference v) volatile { s_.init(v); }
//! Initialize coefficients to an array of values
KOKKOS_INLINE_FUNCTION
void init(const_pointer v) { s_.init(v); }
//! Initialize coefficients to an array of values
KOKKOS_INLINE_FUNCTION
void init(const_pointer v) volatile { s_.init(v); }
//! Initialize coefficients from an PCE with different storage
template <typename S>
KOKKOS_INLINE_FUNCTION
void init(const PCE<S>& v) { s_.init(v.coeff()); }
//! Initialize coefficients from an PCE with different storage
template <typename S>
KOKKOS_INLINE_FUNCTION
void init(const PCE<S>& v) volatile { s_.init(v.coeff()); }
//! Load coefficients to an array of values
KOKKOS_INLINE_FUNCTION
void load(pointer v) { s_.load(v); }
//! Load coefficients to an array of values
KOKKOS_INLINE_FUNCTION
void load(pointer v) volatile { s_.load(v); }
//! Load coefficients into an PCE with different storage
template <typename S>
KOKKOS_INLINE_FUNCTION
void load(PCE<S>& v) { s_.load(v.coeff()); }
//! Load coefficients into an PCE with different storage
template <typename S>
KOKKOS_INLINE_FUNCTION
void load(PCE<S>& v) volatile { s_.load(v.coeff()); }
//! Reset expansion
/*!
* May change size of array. Coefficients are preserved.
*/
template <typename M>
KOKKOS_INLINE_FUNCTION
void reset(const Stokhos::CrsProductTensor<value_type, execution_space, M>& cijkVal) {
cijk_ = cijkVal;
s_.resize(cijk_.dimension());
}
//! Reset expansion
/*!
* May change size of array. Coefficients are preserved.
*/
template <typename M>
KOKKOS_INLINE_FUNCTION
void reset(const Stokhos::CrsProductTensor<value_type, execution_space, M>& cijkVal) volatile {
cijk_ = cijkVal;
s_.resize(cijk_.dimension());
}
//! Reset expansion and size
/*!
* Coefficients are preserved.
*/
template <typename M>
KOKKOS_INLINE_FUNCTION
void reset(const Stokhos::CrsProductTensor<value_type, execution_space, M>& cijkVal, ordinal_type sz) {
cijk_ = cijkVal;
s_.resize(sz);
}
//! Reset expansion and size
/*!
* Coefficients are preserved.
*/
template <typename M>
KOKKOS_INLINE_FUNCTION
void reset(const Stokhos::CrsProductTensor<value_type, execution_space, M>& cijkVal, ordinal_type sz) volatile {
cijk_ = cijkVal;
s_.resize(sz);
}
//! Prepare polynomial for writing
/*!
* This method prepares the polynomial for writing through coeff() and
* fastAccessCoeff() member functions. It ensures the handle for the
* %PCE coefficients is not shared among any other %PCE polynomial
* objects. If the handle is not shared it does nothing, so there
* is no cost in calling this method in this case. If the handle is
* shared and this method is not called, any changes to the coefficients
* by coeff() or fastAccessCoeff() may change other polynomial objects.
*/
KOKKOS_INLINE_FUNCTION
void copyForWrite() { }
/*
//! Evaluate polynomial approximation at a point
KOKKOS_INLINE_FUNCTION
value_type evaluate(const Teuchos::Array<value_type>& point) const;
//! Evaluate polynomial approximation at a point with given basis values
KOKKOS_INLINE_FUNCTION
value_type evaluate(const Teuchos::Array<value_type>& point,
const Teuchos::Array<value_type>& bvals) const;
*/
//! Compute mean of expansion
KOKKOS_INLINE_FUNCTION
value_type mean() const { return this->fastAccessCoeff(0); }
//! Compute standard deviation of expansion
KOKKOS_INLINE_FUNCTION
value_type standard_deviation() const;
//! Compute the two-norm of expansion
KOKKOS_INLINE_FUNCTION
value_type two_norm() const {
return std::sqrt(this->two_norm_squared());
}
//! Compute the squared two-norm of expansion
KOKKOS_INLINE_FUNCTION
value_type two_norm_squared() const;
//! Compute the L2 inner product of 2 PCEs
KOKKOS_INLINE_FUNCTION
value_type inner_product(const PCE& x) const;
//! Returns whether two PCE objects have the same values
KOKKOS_INLINE_FUNCTION
bool isEqualTo(const PCE& x) const;
//! Returns whether two PCE objects have the same values
KOKKOS_INLINE_FUNCTION
bool isEqualTo(const PCE& x) const volatile;
/*!
* @name Assignment operators
*/
//@{
//! Assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
PCE<Storage>& operator=(const value_type val);
//! Assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE<Storage>& operator=(const value_type val) volatile;
//! Assignment with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE<Storage>& operator=(const PCE<Storage>& x);
//! Assignment with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE<Storage>& operator=(const volatile PCE<Storage>& x);
//! Assignment with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE<Storage>& operator=(const PCE<Storage>& x) volatile;
//! Assignment with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE<Storage>& operator=(const volatile PCE<Storage>& x) volatile;
//! Assignment with PCE right-hand-side and different storage
template <typename S>
KOKKOS_INLINE_FUNCTION
PCE<Storage>& operator=(const PCE<S>& x) {
// Don't copy cijk as it may be on a different device
const ordinal_type sz_new = x.size();
s_.resize(sz_new);
for (ordinal_type i=0; i<sz_new; i++)
s_[i] = x.s_[i];
// For DyamicStorage as a view (is_owned=false), we need to set
// the trailing entries when assigning a constant vector (because
// the copy constructor in this case doesn't reset the size of this)
const ordinal_type sz = s_.size();
if (sz > sz_new)
for (ordinal_type i=sz_new; i<sz; i++)
s_[i] = value_type(0);
return *this;
}
//! Assignment from initializer_list
/*!
* No KOKKOS_INLINE_FUNCTION as it is not callable from the device
*/
PCE& operator=(std::initializer_list<value_type> l) {
const ordinal_type lsz = l.size();
if (lsz != s_.size())
s_.resize(lsz);
s_.init(l.begin(), lsz);
return *this;
}
//! Assignment from initializer_list
/*!
* No KOKKOS_INLINE_FUNCTION as it is not callable from the device
*/
/*volatile*/ PCE&
operator=(std::initializer_list<value_type> l) volatile {
const ordinal_type lsz = l.size();
if (lsz != s_.size())
s_.resize(lsz);
s_.init(l.begin(), lsz);
return const_cast<PCE&>(*this);
}
//@}
/*!
* Accessor methods
*/
//@{
/*
//! Get basis
KOKKOS_INLINE_FUNCTION
Teuchos::RCP<const basis_type> basis() const { return s_.basis(); }
*/
//! Get cijk
KOKKOS_INLINE_FUNCTION
my_cijk_type cijk() const { return cijk_; }
//! Get cijk
KOKKOS_INLINE_FUNCTION
my_cijk_type cijk() const volatile {
return const_cast<const my_cijk_type&>(cijk_);
}
//@}
/*!
* @name Value accessor methods
*/
//@{
//! Returns value
KOKKOS_INLINE_FUNCTION
const_volatile_reference val() const volatile { return s_[0]; }
//! Returns value
KOKKOS_INLINE_FUNCTION
const_reference val() const { return s_[0]; }
//! Returns value
KOKKOS_INLINE_FUNCTION
volatile_reference val() volatile { return s_[0]; }
//! Returns value
KOKKOS_INLINE_FUNCTION
reference val() { return s_[0]; }
//@}
/*!
* @name Coefficient accessor methods
*/
//@{
//! Returns size of polynomial
KOKKOS_INLINE_FUNCTION
ordinal_type size() const { return s_.size();}
//! Returns size of polynomial
KOKKOS_INLINE_FUNCTION
ordinal_type size() const volatile { return s_.size();}
//! Returns true if polynomial has size >= sz
KOKKOS_INLINE_FUNCTION
bool hasFastAccess(ordinal_type sz) const { return s_.size()>=sz;}
//! Returns true if polynomial has size >= sz
KOKKOS_INLINE_FUNCTION
bool hasFastAccess(ordinal_type sz) const volatile {
return s_.size()>=sz;
}
//! Returns coefficient array
KOKKOS_INLINE_FUNCTION
const_pointer coeff() const { return s_.coeff();}
//! Returns coefficient array
KOKKOS_INLINE_FUNCTION
const_volatile_pointer coeff() const volatile { return s_.coeff();}
//! Returns coefficient array
KOKKOS_INLINE_FUNCTION
volatile_pointer coeff() volatile { return s_.coeff();}
//! Returns coefficient array
KOKKOS_INLINE_FUNCTION
pointer coeff() { return s_.coeff();}
//! Returns degree \c i term with bounds checking
KOKKOS_INLINE_FUNCTION
value_type coeff(ordinal_type i) const {
value_type tmp= i<s_.size() ? s_[i]:value_type(0.); return tmp;}
//! Returns degree \c i term with bounds checking
KOKKOS_INLINE_FUNCTION
value_type coeff(ordinal_type i) const volatile {
value_type tmp= i<s_.size() ? s_[i]:value_type(0.); return tmp;}
//! Returns degree \c i term without bounds checking
KOKKOS_INLINE_FUNCTION
const_volatile_reference fastAccessCoeff(ordinal_type i) const volatile {
return s_[i];}
//! Returns degree \c i term without bounds checking
KOKKOS_INLINE_FUNCTION
const_reference fastAccessCoeff(ordinal_type i) const {
return s_[i];}
//! Returns degree \c i term without bounds checking
KOKKOS_INLINE_FUNCTION
volatile_reference fastAccessCoeff(ordinal_type i) volatile {
return s_[i];}
//! Returns degree \c i term without bounds checking
KOKKOS_INLINE_FUNCTION
reference fastAccessCoeff(ordinal_type i) {
return s_[i];}
/*
//! Get coefficient term for given dimension and order
KOKKOS_INLINE_FUNCTION
reference term(ordinal_type dimension, ordinal_type order) {
return s_.term(dimension, order); }
//! Get coefficient term for given dimension and order
KOKKOS_INLINE_FUNCTION
const_reference term(ordinal_type dimension, ordinal_type order) const {
return s_.term(dimension, order); }
//! Get orders for a given term
KOKKOS_INLINE_FUNCTION
Teuchos::Array<ordinal_type> order(ordinal_type term) const {
return s_.order(term); }
*/
//! Return iterator to first element of coefficient array
KOKKOS_INLINE_FUNCTION
pointer begin() { return s_.coeff(); }
//! Return iterator to first element of coefficient array
KOKKOS_INLINE_FUNCTION
const_pointer begin() const { return s_.coeff(); }
//! Return iterator to first element of coefficient array
KOKKOS_INLINE_FUNCTION
volatile_pointer begin() volatile { return s_.coeff(); }
//! Return iterator to first element of coefficient array
KOKKOS_INLINE_FUNCTION
const_volatile_pointer begin() const volatile { return s_.coeff(); }
//! Return iterator to first element of coefficient array
KOKKOS_INLINE_FUNCTION
const_pointer cbegin() const { return s_.coeff(); }
//! Return iterator to first element of coefficient array
KOKKOS_INLINE_FUNCTION
const_volatile_pointer cbegin() const volatile { return s_.coeff(); }
//! Return iterator following last element of coefficient array
KOKKOS_INLINE_FUNCTION
pointer end() { return s_.coeff() + s_.size(); }
//! Return iterator following last element of coefficient array
KOKKOS_INLINE_FUNCTION
const_pointer end() const { return s_.coeff() + s_.size(); }
//! Return iterator following last element of coefficient array
KOKKOS_INLINE_FUNCTION
volatile_pointer end() volatile { return s_.coeff() + s_.size(); }
//! Return iterator following last element of coefficient array
KOKKOS_INLINE_FUNCTION
const_volatile_pointer end() const volatile { return s_.coeff() + s_.size(); }
//! Return iterator following last element of coefficient array
KOKKOS_INLINE_FUNCTION
const_pointer cend() const { return s_.coeff()+ s_.size(); }
//! Return iterator following last element of coefficient array
KOKKOS_INLINE_FUNCTION
const_volatile_pointer cend() const volatile { return s_.coeff()+ s_.size(); }
//@}
/*!
* @name Unary operators
*/
//@{
//! Unary-plus operator
KOKKOS_INLINE_FUNCTION
PCE operator + () const { return *this; }
//! Unary-plus operator
KOKKOS_INLINE_FUNCTION
PCE operator + () const volatile { return *this; }
//! Unary-minus operator
KOKKOS_INLINE_FUNCTION
PCE operator - () const;
//! Unary-minus operator
KOKKOS_INLINE_FUNCTION
PCE operator - () const volatile;
//! Addition-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator += (const value_type x) {
s_[0] += x;
return *this;
}
//! Addition-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator += (const value_type x) volatile {
s_[0] += x;
return const_cast<PCE&>(*this);
}
//! Subtraction-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator -= (const value_type x) {
s_[0] -= x;
return *this;
}
//! Subtraction-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator -= (const value_type x) volatile {
s_[0] -= x;
return const_cast<PCE&>(*this);
}
//! Multiplication-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator *= (const value_type x);
//! Multiplication-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator *= (const value_type x) volatile;
//! Division-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator /= (const value_type x);
//! Division-assignment operator with constant right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator /= (const value_type x) volatile;
//! Addition-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator += (const PCE& x);
//! Addition-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator += (const volatile PCE& x) {
return *this += const_cast<const PCE&>(x);
}
//! Addition-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator += (const PCE& x) volatile {
return const_cast<PCE&>(*this) += x;
}
//! Addition-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator += (const volatile PCE& x) volatile {
return const_cast<PCE&>(*this) += const_cast<const PCE&>(x);
}
//! Subtraction-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator -= (const PCE& x);
//! Subtraction-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator -= (const volatile PCE& x) {
return *this -= const_cast<const PCE&>(x);
}
//! Subtraction-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator -= (const PCE& x) volatile {
return const_cast<PCE&>(*this) -= x;
}
//! Subtraction-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator -= (const volatile PCE& x) volatile {
return const_cast<PCE&>(*this) -= const_cast<const PCE&>(x);
}
//! Multiplication-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator *= (const PCE& x);
//! Multiplication-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator *= (const volatile PCE& x) {
return *this *= const_cast<const PCE&>(x);
}
//! Multiplication-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator *= (const PCE& x) volatile {
return const_cast<PCE&>(*this) *= x;
}
//! Multiplication-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator *= (const volatile PCE& x) volatile {
return const_cast<PCE&>(*this) *= const_cast<const PCE&>(x);
}
//! Division-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator /= (const PCE& x);
//! Division-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
PCE& operator /= (const volatile PCE& x) {
return *this /= const_cast<const PCE&>(x);
}
//! Division-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator /= (const PCE& x) volatile {
return const_cast<PCE&>(*this) /= x;
}
//! Division-assignment operator with PCE right-hand-side
KOKKOS_INLINE_FUNCTION
/*volatile*/ PCE& operator /= (const volatile PCE& x) volatile {
return const_cast<PCE&>(*this) /= const_cast<const PCE&>(x);
}
//! Prefix ++
KOKKOS_INLINE_FUNCTION
PCE& operator++() {
++(s_[0]);
return *this;
}
//! Prefix ++
KOKKOS_INLINE_FUNCTION
volatile PCE& operator++() volatile {
++(s_[0]);
return *this;
}
//! Postfix ++
KOKKOS_INLINE_FUNCTION
PCE operator++(int) {
PCE tmp(*this);
++(*this);
return tmp;
}
//! Postfix ++
KOKKOS_INLINE_FUNCTION
PCE operator++(int) volatile {
PCE tmp(*this);
++(*this);
return tmp;
}
//! Prefix --
KOKKOS_INLINE_FUNCTION
PCE& operator--() {
--(s_[0]);
return *this;
}
//! Prefix --
KOKKOS_INLINE_FUNCTION
volatile PCE& operator--() volatile {
--(s_[0]);
return *this;
}
//! Postfix --
KOKKOS_INLINE_FUNCTION
PCE operator--(int) {
PCE tmp(*this);
--(*this);
return tmp;
}
//! Postfix --
KOKKOS_INLINE_FUNCTION
PCE operator--(int) volatile {
PCE tmp(*this);
--(*this);
return tmp;
}
//@}
protected:
typedef typename my_cijk_type::size_type cijk_size_type;
//! Cijk class
my_cijk_type cijk_;
Storage s_;
private:
//PCE division using CG with diagonal preconditioning
// KOKKOS_INLINE_FUNCTION
// void CG_divide(const PCE& a, const PCE& b, PCE& c);
}; // class PCE
template <typename Storage>
KOKKOS_INLINE_FUNCTION
void CG_divide(const PCE<Storage>& a, const PCE<Storage>& b, PCE<Storage>& c);
// Operations
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator+(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator+(const volatile PCE<Storage>& a, const PCE<Storage>& b) {
return const_cast<const PCE<Storage>&>(a) + b;
}
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator+(const PCE<Storage>& a, const volatile PCE<Storage>& b) {
return a + const_cast<const PCE<Storage>&>(b);
}
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator+(const volatile PCE<Storage>& a, const volatile PCE<Storage>& b) {
return const_cast<const PCE<Storage>&>(a) +
const_cast<const PCE<Storage>&>(b);
}
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator+(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator+(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator-(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage> PCE<Storage>
KOKKOS_INLINE_FUNCTION
operator-(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator-(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator*(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator*(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage> PCE<Storage>
KOKKOS_INLINE_FUNCTION
operator*(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator/(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator/(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
operator/(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
exp(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
log(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
void
log(PCE<Storage>& c, const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
log10(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
sqrt(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
cbrt(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
pow(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
pow(const typename PCE<Storage>::value_type& a, const PCE<Storage>& b);
template <typename Storage> PCE<Storage>
KOKKOS_INLINE_FUNCTION
pow(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
cos(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
sin(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
tan(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
cosh(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
sinh(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
tanh(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
acos(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
asin(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
atan(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
atan2(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
atan2(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
atan2(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
acosh(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
asinh(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
atanh(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
abs(const PCE<Storage>& a);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
fabs(const PCE<Storage>& a);
// template <typename Storage>
// KOKKOS_INLINE_FUNCTION
// PCE<Storage>
// max(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
max(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
max(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
// template <typename Storage>
// KOKKOS_INLINE_FUNCTION
// PCE<Storage>
// min(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
min(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
PCE<Storage>
min(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator==(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator==(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator==(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator!=(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator!=(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator!=(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator<=(const PCE<Storage>& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator<=(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator<=(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator>=(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator>=(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator>=(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator<(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator<(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator<(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator>(const PCE<Storage>& a, const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator>(const typename PCE<Storage>::value_type& a,
const PCE<Storage>& b);
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool
operator>(const PCE<Storage>& a,
const typename PCE<Storage>::value_type& b);
template <typename Storage>
std::ostream&
operator << (std::ostream& os, const PCE<Storage>& a);
template <typename Storage>
std::istream&
operator >> (std::istream& os, PCE<Storage>& a);
/**\brief Define a partition of a View of Sacado::UQ::PCE type */
struct PCEPartition {
unsigned begin ;
unsigned end ;
template< typename iType0 , typename iType1 >
KOKKOS_INLINE_FUNCTION
PCEPartition( const iType0 & i0 , const iType1 & i1 ) :
begin(i0), end(i1) {}
};
/* template <typename Storage>
KOKKOS_INLINE_FUNCTION
void
PCE<Storage>::
CG_divide(const PCE<Storage>& a, const PCE<Storage>& b, PCE<Storage>& c) {
// typedef typename PCE<Storage>::ordinal_type ordinal_type;
// typedef typename PCE<Storage>::value_type value_type;
const ordinal_type size = c.size();
//Needed scalars
value_type alpha, beta, rTz, rTz_old, resid;
//Needed temporary PCEs
PCE<Storage> r(a.cijk(),size);
PCE<Storage> p(a.cijk(),size);
PCE<Storage> bp(a.cijk(),size);
PCE<Storage> z(a.cijk(),size);
//compute residual = a - b*c
r = a - b*c;
z = r/b.coeff(0);
p = z;
resid = r.two_norm();
//Compute <r,z>=rTz (L2 inner product)
rTz = r.inner_product(z);
ordinal_type k = 0;
value_type tol = 1e-6;
while ( resid > tol && k < 100){
//Compute b*p
bp = b*p;
//Compute alpha = <r,z>/<p,b*p>
alpha = rTz/p.inner_product(bp);
//Check alpha is positive!
//Update the solution c = c + alpha*p
c = c + alpha*p;
rTz_old = rTz;
//Compute the new residual r = r - alpha*b*p
r = r - alpha*bp;
resid = r.two_norm();
//Compute beta = rTz_new/ rTz_old and new p
z = r/b.coeff(0);
rTz = r.inner_product(z);
beta = rTz/rTz_old;
p = z + beta*p;
k++;
}
// return c;
}
*/
template <typename S>
void memcpy(PCE<S>* dst, const PCE<S>* src, const size_t sz) {
const size_t n = sz / sizeof(PCE<S>);
for (size_t i=0; i<n; ++i)
dst[i] = src[i];
}
} // namespace PCE
//! Trait class to determine if a scalar type is a PCE
template <typename T> struct is_uq_pce {
static const bool value = false;
};
template <typename S> struct is_uq_pce< UQ::PCE<S> > {
static const bool value = true;
};
template <typename T> struct is_uq_pce< const T > {
static const bool value = is_uq_pce<T>::value;
};
template <typename T> struct is_uq_pce< T* > {
static const bool value = is_uq_pce<T>::value;
};
template <typename T> struct is_uq_pce< T[] > {
static const bool value = is_uq_pce<T>::value;
};
template <typename T, unsigned N> struct is_uq_pce< T[N] > {
static const bool value = is_uq_pce<T>::value;
};
// Utility function to see if a PCE is really a constant
template <typename Storage>
KOKKOS_INLINE_FUNCTION
bool is_constant(const Sacado::UQ::PCE<Storage>& x)
{
typedef typename Storage::ordinal_type ordinal_type;
typedef typename Storage::value_type value_type;
// All size-1 expansions are constants
const ordinal_type sz = x.size();
if (sz == 1) return true;
// Maybe use a tolerance????
const value_type zero = 0;
for (ordinal_type i=1; i<sz; ++i)
if (x.fastAccessCoeff(i) != zero) return false;
return true;
}
} // namespace Sacado
#include "Sacado_UQ_PCE_Traits.hpp"
#include "Sacado_UQ_PCE_Imp.hpp"
#endif // HAVE_STOKHOS_SACADO
#endif // SACADO_PCE_ORTHOGPOLY_HPP
|