/usr/include/trilinos/Rythmos_ImplicitBDFStepper_def.hpp is in libtrilinos-rythmos-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 | //@HEADER
// ***********************************************************************
//
// Rythmos Package
// Copyright (2006) 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
// USA
// Questions? Contact Todd S. Coffey (tscoffe@sandia.gov)
//
// ***********************************************************************
//@HEADER
#ifndef Rythmos_IMPLICITBDF_STEPPER_DEF_H
#define Rythmos_IMPLICITBDF_STEPPER_DEF_H
#include "Rythmos_ImplicitBDFStepper_decl.hpp"
#include "Rythmos_StepperHelpers.hpp"
#include "Rythmos_ImplicitBDFStepperStepControl.hpp"
namespace Rythmos {
// ////////////////////////////
// Defintions
// Nonmember constructor
template<class Scalar>
RCP<ImplicitBDFStepper<Scalar> > implicitBDFStepper() {
RCP<ImplicitBDFStepper<Scalar> >
stepper = rcp(new ImplicitBDFStepper<Scalar>() );
return stepper;
}
template<class Scalar>
RCP<ImplicitBDFStepper<Scalar> > implicitBDFStepper(
const RCP<Thyra::ModelEvaluator<Scalar> >& model,
const RCP<Thyra::NonlinearSolverBase<Scalar> >& solver
)
{
RCP<ImplicitBDFStepper<Scalar> >
stepper = Teuchos::rcp(new ImplicitBDFStepper<Scalar>(model, solver));
return stepper;
}
template<class Scalar>
RCP<ImplicitBDFStepper<Scalar> > implicitBDFStepper(
const RCP<Thyra::ModelEvaluator<Scalar> >& model,
const RCP<Thyra::NonlinearSolverBase<Scalar> >& solver,
const RCP<Teuchos::ParameterList>& parameterList
)
{
RCP<ImplicitBDFStepper<Scalar> >
stepper = Teuchos::rcp(new ImplicitBDFStepper<Scalar>(model,
solver,
parameterList));
return stepper;
}
// Constructors, intializers, Misc.
template<class Scalar>
ImplicitBDFStepper<Scalar>::ImplicitBDFStepper()
{
this->defaultInitializeAll_();
haveInitialCondition_ = false;
isInitialized_=false;
}
template<class Scalar>
ImplicitBDFStepper<Scalar>::ImplicitBDFStepper(
const RCP<Thyra::ModelEvaluator<Scalar> >& model
,const RCP<Thyra::NonlinearSolverBase<Scalar> >& solver
,const RCP<Teuchos::ParameterList>& parameterList
)
{
this->defaultInitializeAll_();
this->setParameterList(parameterList);
// Now we instantiate the model and the solver
setModel(model);
setSolver(solver);
haveInitialCondition_ = false;
isInitialized_=false;
}
template<class Scalar>
ImplicitBDFStepper<Scalar>::ImplicitBDFStepper(
const RCP<Thyra::ModelEvaluator<Scalar> >& model
,const RCP<Thyra::NonlinearSolverBase<Scalar> >& solver
)
{
this->defaultInitializeAll_();
// Now we instantiate the model and the solver
setModel(model);
setSolver(solver);
haveInitialCondition_ = false;
isInitialized_=false;
}
template<class Scalar>
const Thyra::VectorBase<Scalar>&
ImplicitBDFStepper<Scalar>::getxHistory(int index) const
{
TEUCHOS_TEST_FOR_EXCEPTION(!isInitialized_,std::logic_error,
"Error, attempting to call getxHistory before initialization!\n");
TEUCHOS_TEST_FOR_EXCEPT( !(( 0 <= index ) && ( index <= maxOrder_ )) );
TEUCHOS_TEST_FOR_EXCEPT( !( index <= usedOrder_+1 ) );
return(*(xHistory_[index]));
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::setStepControlStrategy(const RCP<StepControlStrategyBase<Scalar> >& stepControl)
{
TEUCHOS_TEST_FOR_EXCEPTION(stepControl == Teuchos::null,std::logic_error,"Error, stepControl == Teuchos::null!\n");
stepControl_ = stepControl;
}
template<class Scalar>
RCP<StepControlStrategyBase<Scalar> > ImplicitBDFStepper<Scalar>::getNonconstStepControlStrategy()
{
return(stepControl_);
}
template<class Scalar>
RCP<const StepControlStrategyBase<Scalar> > ImplicitBDFStepper<Scalar>::getStepControlStrategy() const
{
return(stepControl_);
}
// Overridden from SolverAcceptingStepperBase
template<class Scalar>
void ImplicitBDFStepper<Scalar>::setSolver(const RCP<Thyra::NonlinearSolverBase<Scalar> > &solver)
{
TEUCHOS_TEST_FOR_EXCEPT(solver == Teuchos::null)
solver_ = solver;
}
template<class Scalar>
RCP<Thyra::NonlinearSolverBase<Scalar> >
ImplicitBDFStepper<Scalar>::getNonconstSolver()
{
return (solver_);
}
template<class Scalar>
RCP<const Thyra::NonlinearSolverBase<Scalar> >
ImplicitBDFStepper<Scalar>::getSolver() const
{
return (solver_);
}
// Overridden from StepperBase
template<class Scalar>
bool ImplicitBDFStepper<Scalar>::isImplicit() const
{
return true;
}
template<class Scalar>
bool ImplicitBDFStepper<Scalar>::supportsCloning() const
{
return true;
}
template<class Scalar>
RCP<StepperBase<Scalar> >
ImplicitBDFStepper<Scalar>::cloneStepperAlgorithm() const
{
// Just use the interface to clone the algorithm in an basically
// uninitialized state
RCP<ImplicitBDFStepper<Scalar> >
stepper = Teuchos::rcp(new ImplicitBDFStepper<Scalar>());
if (!is_null(model_))
stepper->setModel(model_); // Shallow copy is okay!
if (!is_null(solver_))
stepper->setSolver(solver_->cloneNonlinearSolver().assert_not_null());
if (!is_null(parameterList_))
stepper->setParameterList(Teuchos::parameterList(*parameterList_));
if (!is_null(stepControl_)) {
if (stepControl_->supportsCloning())
stepper->setStepControlStrategy(
stepControl_->cloneStepControlStrategyAlgorithm().assert_not_null());
}
// At this point, we should have a valid algorithm state. What might be
// missing is the initial condition if it was not given in *model_ but was
// set explicitly. However, the specification for this function does not
// guarantee that the full state will be copied in any case!
return stepper;
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::setModel(
const RCP<const Thyra::ModelEvaluator<Scalar> >& model
)
{
// typedef Teuchos::ScalarTraits<Scalar> ST; // unused
TEUCHOS_TEST_FOR_EXCEPT( is_null(model) );
assertValidModel( *this, *model );
model_ = model;
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::setNonconstModel(
const RCP<Thyra::ModelEvaluator<Scalar> >& model
)
{
this->setModel(model); // TODO 09/09/09 tscoffe: use ConstNonconstObjectContainer!
}
template<class Scalar>
RCP<const Thyra::ModelEvaluator<Scalar> >
ImplicitBDFStepper<Scalar>::getModel() const
{
return model_;
}
template<class Scalar>
RCP<Thyra::ModelEvaluator<Scalar> >
ImplicitBDFStepper<Scalar>::getNonconstModel()
{
return Teuchos::null;
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::setInitialCondition(
const Thyra::ModelEvaluatorBase::InArgs<Scalar> &initialCondition
)
{
typedef Teuchos::ScalarTraits<Scalar> ST;
// typedef Thyra::ModelEvaluatorBase MEB; // unused
TEUCHOS_TEST_FOR_EXCEPT(is_null(initialCondition.get_x()));
TEUCHOS_TEST_FOR_EXCEPT(is_null(initialCondition.get_x_dot()));
basePoint_ = initialCondition;
xn0_ = initialCondition.get_x()->clone_v();
xpn0_ = initialCondition.get_x_dot()->clone_v();
time_ = initialCondition.get_t();
// Generate vectors for use in calculations
x_dot_base_ = createMember(xpn0_->space());
V_S(x_dot_base_.ptr(),ST::zero());
ee_ = createMember(xn0_->space());
V_S(ee_.ptr(),ST::zero());
// x history
xHistory_.clear();
xHistory_.push_back(xn0_->clone_v());
xHistory_.push_back(xpn0_->clone_v());
haveInitialCondition_ = true;
if (isInitialized_) {
initialize_();
}
}
template<class Scalar>
Thyra::ModelEvaluatorBase::InArgs<Scalar>
ImplicitBDFStepper<Scalar>::getInitialCondition() const
{
return basePoint_;
}
template<class Scalar>
Scalar ImplicitBDFStepper<Scalar>::takeStep(Scalar dt, StepSizeType stepType)
{
RYTHMOS_FUNC_TIME_MONITOR("Rythmos::ImplicitBDFStepper::takeStep");
using Teuchos::as;
using Teuchos::incrVerbLevel;
typedef Teuchos::ScalarTraits<Scalar> ST;
// typedef typename Thyra::ModelEvaluatorBase::InArgs<Scalar>::ScalarMag TScalarMag; // unused
typedef Thyra::NonlinearSolverBase<Scalar> NSB;
typedef Teuchos::VerboseObjectTempState<NSB> VOTSNSB;
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
Teuchos::OSTab ostab(out,1,"takeStep");
VOTSNSB solver_outputTempState(solver_,out,incrVerbLevel(verbLevel,-1));
if ( !is_null(out) && as<int>(verbLevel) >= as<int>(Teuchos::VERB_LOW) ) {
*out
<< "\nEntering " << this->Teuchos::Describable::description()
<< "::takeStep("<<dt<<","<<toString(stepType)<<") ...\n";
}
if (!isInitialized_) {
initialize_();
}
stepControl_->setOStream(out);
stepControl_->setVerbLevel(verbLevel);
stepControl_->setRequestedStepSize(*this,dt,stepType);
AttemptedStepStatusFlag status;
while (1) {
// Set up problem coefficients (and handle first step)
Scalar hh_old = hh_;
int desiredOrder;
stepControl_->nextStepSize(*this,&hh_,&stepType,&desiredOrder);
TEUCHOS_TEST_FOR_EXCEPT(!((1 <= desiredOrder) &&
(desiredOrder <= maxOrder_)));
TEUCHOS_TEST_FOR_EXCEPT(!(desiredOrder <= usedOrder_+1));
currentOrder_ = desiredOrder;
if (numberOfSteps_ == 0) {
psi_[0] = hh_;
if (nef_ == 0) {
Vt_S(xHistory_[1].ptr(),hh_);
} else {
Vt_S(xHistory_[1].ptr(),hh_/hh_old);
}
}
this->updateCoeffs_();
// compute predictor
obtainPredictor_();
// solve nonlinear problem (as follows)
//
// Setup the nonlinear equations:
//
// f_bar( x_dot_coeff * x_bar + x_dot_base,
// x_coeff * x_bar + x_base, t_base ) = 0
// x_dot_coeff = -alpha_s/dt
// x_dot_base = x_prime_pred + (alpha_s/dt) * x_pred
// x_coeff = 1
// x_base = 0
// t_base = tn+dt
//
Scalar coeff_x_dot = Scalar(-ST::one())*alpha_s_/hh_;
V_StVpStV( x_dot_base_.ptr(), ST::one(), *xpn0_, alpha_s_/hh_, *xn0_ );
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_EXTREME) ) {
*out << "model_ = " << std::endl;
model_->describe(*out,verbLevel);
*out << "basePoint_ = " << std::endl;
basePoint_.describe(*out,verbLevel);
*out << "coeff_x_dot = " << coeff_x_dot << std::endl;
*out << "x_dot_base_ = " << std::endl;
x_dot_base_->describe(*out,verbLevel);
*out << "time_+hh_ = " << time_+hh_ << std::endl;
*out << "xn0_ = " << std::endl;
xn0_->describe(*out,verbLevel);
}
neModel_.initializeSingleResidualModel(
model_, basePoint_,
coeff_x_dot, x_dot_base_,
ST::one(), Teuchos::null,
time_+hh_,
xn0_
);
//
// Solve the implicit nonlinear system to a tolerance of ???
//
if (solver_->getModel().get() != &neModel_) {
solver_->setModel( Teuchos::rcpFromRef(neModel_) );
}
// Rythmos::TimeStepNonlinearSolver uses a built in solveCriteria,
// so you can't pass one in.
// I believe this is the correct solveCriteria for IDA though.
/*
Thyra::SolveMeasureType nonlinear_solve_measure_type(
Thyra::SOLVE_MEASURE_NORM_RESIDUAL,Thyra::SOLVE_MEASURE_ONE);
// This should be changed to match the condition in IDA
TScalarMag tolerance = relErrTol_/TScalarMag(10.0);
Thyra::SolveCriteria<Scalar> nonlinearSolveCriteria(
nonlinear_solve_measure_type, tolerance);
Thyra::SolveStatus<Scalar> nonlinearSolveStatus =
solver_->solve( &*xn0_, &nonlinearSolveCriteria, &*delta_ );
*/
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_EXTREME) ) {
*out << "xn0 = " << std::endl;
xn0_->describe(*out,verbLevel);
*out << "ee = " << std::endl;
ee_->describe(*out,verbLevel);
}
nonlinearSolveStatus_ = solver_->solve( &*xn0_, NULL, &*ee_ );
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_EXTREME) ) {
*out << "xn0 = " << std::endl;
xn0_->describe(*out,verbLevel);
*out << "ee = " << std::endl;
ee_->describe(*out,verbLevel);
}
// In the above solve, on input *xn0_ is the initial guess that comes from
// the predictor. On output, *xn0_ is the solved for solution and *ee_ is
// the difference computed from the intial guess in *xn0_ to the final
// solved value of *xn0_. This is needed for basic numerical stability.
if (nonlinearSolveStatus_.solveStatus == Thyra::SOLVE_STATUS_CONVERGED) {
newtonConvergenceStatus_ = 0;
}
else {
newtonConvergenceStatus_ = -1;
}
// check error and evaluate LTE
stepControl_->setCorrection(*this,xn0_,ee_,newtonConvergenceStatus_);
bool stepPass = stepControl_->acceptStep(*this,&LETvalue_);
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
*out << "xn0_ = " << std::endl;
xn0_->describe(*out,verbLevel);
*out << "xpn0_ = " << std::endl;
xpn0_->describe(*out,verbLevel);
*out << "ee_ = " << std::endl;
ee_->describe(*out,verbLevel);
for (int i=0; i<std::max(2,maxOrder_); ++i) {
*out << "xHistory_[" << i << "] = " << std::endl;
xHistory_[i]->describe(*out,verbLevel);
}
}
// Check LTE here:
if (!stepPass) { // stepPass = false
stepLETStatus_ = STEP_LET_STATUS_FAILED;
status = stepControl_->rejectStep(*this);
nef_++;
if (status == CONTINUE_ANYWAY) {
break;
} else {
restoreHistory_();
}
} else { // stepPass = true
stepLETStatus_ = STEP_LET_STATUS_PASSED;
break;
}
}
// 08/22/07 the history array must be updated before
// stepControl_->completeStep.
completeStep_();
stepControl_->completeStep(*this);
if ( !is_null(out) && as<int>(verbLevel) >= as<int>(Teuchos::VERB_LOW) ) {
*out
<< "\nLeaving " << this->Teuchos::Describable::description()
<< "::takeStep("<<dt<<","<<toString(stepType)<<") ...\n";
}
return(usedStep_);
}
template<class Scalar>
const StepStatus<Scalar> ImplicitBDFStepper<Scalar>::getStepStatus() const
{
// 2007/08/24: rabartl: We agreed that getStepStatus() would be free
// so I have commented out removed all code that is not free
typedef Teuchos::ScalarTraits<Scalar> ST;
StepStatus<Scalar> stepStatus;
if (!isInitialized_) {
stepStatus.message = "This stepper is uninitialized.";
stepStatus.stepStatus = STEP_STATUS_UNINITIALIZED;
stepStatus.stepSize = Scalar(-ST::one());
stepStatus.order = -1;
stepStatus.time = Scalar(-ST::one());
// return(stepStatus);
}
else if (numberOfSteps_ > 0) {
stepStatus.stepStatus = STEP_STATUS_CONVERGED;
} else {
stepStatus.stepStatus = STEP_STATUS_UNKNOWN;
}
stepStatus.stepLETStatus = stepLETStatus_;
stepStatus.stepSize = usedStep_;
stepStatus.order = usedOrder_;
stepStatus.time = time_;
stepStatus.stepLETValue = LETvalue_;
if(xHistory_.size() > 0)
stepStatus.solution = xHistory_[0];
else
stepStatus.solution = Teuchos::null;
stepStatus.solutionDot = Teuchos::null; // This is *not* free!
stepStatus.residual = Teuchos::null; // This is *not* free!
return(stepStatus);
}
// Overridden from InterpolationBufferBase
template<class Scalar>
RCP<const Thyra::VectorSpaceBase<Scalar> >
ImplicitBDFStepper<Scalar>::get_x_space() const
{
//TEUCHOS_TEST_FOR_EXCEPTION(!isInitialized_,std::logic_error,"Error, attempting to call get_x_space before initialization!\n");
return ( !is_null(model_) ? model_->get_x_space() : Teuchos::null );
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::addPoints(
const Array<Scalar>& time_vec,
const Array<RCP<const Thyra::VectorBase<Scalar> > >& x_vec,
const Array<RCP<const Thyra::VectorBase<Scalar> > >& xdot_vec
)
{
TEUCHOS_TEST_FOR_EXCEPTION(true,std::logic_error,
"Error, addPoints is not implemented for ImplicitBDFStepper.\n");
}
template<class Scalar>
TimeRange<Scalar> ImplicitBDFStepper<Scalar>::getTimeRange() const
{
if ( !isInitialized_ && haveInitialCondition_ )
return timeRange<Scalar>(time_,time_);
if ( !isInitialized_ && !haveInitialCondition_ )
return invalidTimeRange<Scalar>();
return timeRange<Scalar>(time_-usedStep_,time_);
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::getPoints(
const Array<Scalar>& time_vec
,Array<RCP<const Thyra::VectorBase<Scalar> > >* x_vec
,Array<RCP<const Thyra::VectorBase<Scalar> > >* xdot_vec
,Array<ScalarMag>* accuracy_vec) const
{
using Teuchos::as;
using Teuchos::constOptInArg;
using Teuchos::null;
using Teuchos::ptr;
typedef Teuchos::ScalarTraits<Scalar> ST;
typedef typename ST::magnitudeType mScalarMag;
TEUCHOS_ASSERT(haveInitialCondition_);
// Only do this if we're being called pre-initialization to get the IC.
if ( (numberOfSteps_ == -1) &&
(time_vec.length() == 1) &&
(compareTimeValues<Scalar>(time_vec[0],time_)==0) ) {
defaultGetPoints<Scalar>(
time_, constOptInArg(*xn0_), constOptInArg(*xpn0_),
time_, constOptInArg(*xn0_), constOptInArg(*xpn0_),
time_vec, ptr(x_vec), ptr(xdot_vec), ptr(accuracy_vec),
Ptr<InterpolatorBase<Scalar> >(null)
);
return;
}
TEUCHOS_ASSERT(isInitialized_);
RYTHMOS_FUNC_TIME_MONITOR("Rythmos::ImplicitBDFStepper::getPoints");
if (x_vec)
x_vec->clear();
if (xdot_vec)
xdot_vec->clear();
for (Teuchos::Ordinal i=0 ; i<time_vec.size() ; ++i) {
RCP<Thyra::VectorBase<Scalar> >
x_temp = createMember(xn0_->space());
RCP<Thyra::VectorBase<Scalar> >
xdot_temp = createMember(xn0_->space());
mScalarMag accuracy = -ST::zero();
interpolateSolution_(
time_vec[i], &*x_temp, &*xdot_temp,
accuracy_vec ? &accuracy : 0
);
if (x_vec)
x_vec->push_back(x_temp);
if (xdot_vec)
xdot_vec->push_back(xdot_temp);
if (accuracy_vec)
accuracy_vec->push_back(accuracy);
}
if ( as<int>(this->getVerbLevel()) >= as<int>(Teuchos::VERB_HIGH) ) {
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::OSTab ostab(out,1,"getPoints");
*out << "Passing out the interpolated values:" << std::endl;
for (Teuchos::Ordinal i=0; i<time_vec.size() ; ++i) {
*out << "time_[" << i << "] = " << time_vec[i] << std::endl;
if (x_vec) {
*out << "x_vec[" << i << "] = " << std::endl;
(*x_vec)[i]->describe(*out,this->getVerbLevel());
}
if (xdot_vec) {
*out << "xdot_vec[" << i << "] = ";
if ( (*xdot_vec)[i] == Teuchos::null) {
*out << "Teuchos::null" << std::endl;
}
else {
*out << std::endl << Teuchos::describe(*(*xdot_vec)[i],this->getVerbLevel());
}
}
if (accuracy_vec)
*out << "accuracy[" << i << "] = " << (*accuracy_vec)[i] << std::endl;
}
}
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::getNodes(Array<Scalar>* time_vec) const
{
TEUCHOS_ASSERT( time_vec != NULL );
time_vec->clear();
if (!haveInitialCondition_) {
return;
}
if (numberOfSteps_ > 0) {
time_vec->push_back(time_-usedStep_);
}
time_vec->push_back(time_);
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::removeNodes(Array<Scalar>& time_vec)
{
TEUCHOS_TEST_FOR_EXCEPTION(true,std::logic_error,
"Error, removeNodes is not implemented for ImplicitBDFStepper.\n");
}
template<class Scalar>
int ImplicitBDFStepper<Scalar>::getOrder() const
{
if (!isInitialized_) {
return(-1);
}
return(usedOrder_);
}
// Overridden from Teuchos::ParameterListAcceptor
template<class Scalar>
void ImplicitBDFStepper<Scalar>::setParameterList(
RCP<Teuchos::ParameterList> const& paramList
)
{
TEUCHOS_TEST_FOR_EXCEPT(paramList == Teuchos::null);
paramList->validateParameters(*this->getValidParameters(),0);
parameterList_ = paramList;
Teuchos::readVerboseObjectSublist(&*parameterList_,this);
}
template<class Scalar>
RCP<Teuchos::ParameterList> ImplicitBDFStepper<Scalar>::getNonconstParameterList()
{
return(parameterList_);
}
template<class Scalar>
RCP<Teuchos::ParameterList>
ImplicitBDFStepper<Scalar>::unsetParameterList()
{
RCP<Teuchos::ParameterList> temp_param_list = parameterList_;
parameterList_ = Teuchos::null;
return(temp_param_list);
}
template<class Scalar>
RCP<const Teuchos::ParameterList>
ImplicitBDFStepper<Scalar>::getValidParameters() const
{
static RCP<Teuchos::ParameterList> validPL;
if (is_null(validPL)) {
RCP<Teuchos::ParameterList> pl = Teuchos::parameterList();
// This line is required to pass StepperValidator UnitTest!
pl->sublist(RythmosStepControlSettings_name);
Teuchos::setupVerboseObjectSublist(&*pl);
validPL = pl;
}
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
if (Teuchos::as<int>(verbLevel) == Teuchos::VERB_HIGH) {
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::OSTab ostab(out,1,"getValidParameters");
*out << "Setting up valid parameterlist." << std::endl;
validPL->print(*out);
}
return (validPL);
}
// Overridden from Teuchos::Describable
template<class Scalar>
std::string ImplicitBDFStepper<Scalar>::description() const
{
std::ostringstream out;
out << this->Teuchos::Describable::description();
const TimeRange<Scalar> timeRange = this->getTimeRange();
if (timeRange.isValid())
out << " (timeRange="<<timeRange<<")";
else
out << " (This stepper is not initialized yet)";
out << std::endl;
return out.str();
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::describe(
Teuchos::FancyOStream &out,
const Teuchos::EVerbosityLevel verbLevel
) const
{
using Teuchos::as;
if (!isInitialized_) {
out << this->description();
return;
}
if ( (as<int>(verbLevel) == as<int>(Teuchos::VERB_DEFAULT) ) ||
(as<int>(verbLevel) >= as<int>(Teuchos::VERB_LOW) )
)
{
out << this->description() << std::endl;
out << "model_ = " << Teuchos::describe(*model_,verbLevel);
out << "solver_ = " << Teuchos::describe(*solver_,verbLevel);
out << "neModel_ = " << Teuchos::describe(neModel_,verbLevel);
}
if (as<int>(verbLevel) >= as<int>(Teuchos::VERB_LOW)) {
out << "time_ = " << time_ << std::endl;
out << "hh_ = " << hh_ << std::endl;
out << "currentOrder_ = " << currentOrder_ << std::endl;
}
if (as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH)) {
out << "xn0_ = " << Teuchos::describe(*xn0_,verbLevel);
out << "xpn0_ = " << Teuchos::describe(*xpn0_,verbLevel);
out << "x_dot_base_ = " << Teuchos::describe(*x_dot_base_,verbLevel);
for (int i=0 ; i < std::max(2,maxOrder_) ; ++i) {
out << "xHistory_[" << i << "] = "
<< Teuchos::describe(*xHistory_[i],verbLevel);
}
out << "ee_ = " << Teuchos::describe(*ee_,verbLevel);
}
}
// private
// 2007/08/24: rabartl: Belos: We really should initialize all of this data in
// a member initialization list but since there are like three constructors
// this would mean that we would have to duplicate code (which is error prone)
// or use a macro (which is not easy to debug). We really should remove all
// but the default constructor which then would set this data once in the
// initialization list.
template<class Scalar>
void ImplicitBDFStepper<Scalar>::defaultInitializeAll_()
{
typedef Teuchos::ScalarTraits<Scalar> ST;
const Scalar nan = ST::nan(), one = ST::one(), zero = ST::zero();
// Initialize some data members to their rightful default values
haveInitialCondition_ = false;
isInitialized_ = false;
currentOrder_ = 1;
usedOrder_ = 1;
usedStep_ = zero;
// Initialize the rest of the private data members to invalid values to
// avoid uninitialed memory
time_ = nan;
hh_ = nan;
maxOrder_ = -1;
LETvalue_ = -one;
stepLETStatus_ = STEP_LET_STATUS_UNKNOWN;
alpha_s_ = -one;
numberOfSteps_ = -1;
nef_ = -1;
nscsco_ = -1;
newtonConvergenceStatus_ = -1;
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::obtainPredictor_()
{
using Teuchos::as;
typedef Teuchos::ScalarTraits<Scalar> ST;
if (!isInitialized_) {
return;
}
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
Teuchos::OSTab ostab(out,1,"obtainPredictor_");
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
*out << "currentOrder_ = " << currentOrder_ << std::endl;
}
// prepare history array for prediction
for (int i=nscsco_;i<=currentOrder_;++i) {
Vt_S(xHistory_[i].ptr(),beta_[i]);
}
// evaluate predictor
V_V(xn0_.ptr(),*xHistory_[0]);
V_S(xpn0_.ptr(),ST::zero());
for (int i=1;i<=currentOrder_;++i) {
Vp_V(xn0_.ptr(),*xHistory_[i]);
Vp_StV(xpn0_.ptr(),gamma_[i],*xHistory_[i]);
}
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
*out << "xn0_ = " << std::endl;
xn0_->describe(*out,verbLevel);
*out << "xpn0_ = " << std::endl;
xpn0_->describe(*out,verbLevel);
}
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::interpolateSolution_(
const Scalar& timepoint,
Thyra::VectorBase<Scalar>* x_ptr,
Thyra::VectorBase<Scalar>* xdot_ptr,
ScalarMag* accuracy_ptr
) const
{
// typedef std::numeric_limits<Scalar> NL; // unused
typedef Teuchos::ScalarTraits<Scalar> ST;
#ifdef HAVE_RYTHMOS_DEBUG
TEUCHOS_TEST_FOR_EXCEPTION(
!isInitialized_,std::logic_error,
"Error, attempting to call interpolateSolution before initialization!\n");
const TimeRange<Scalar> currTimeRange = this->getTimeRange();
TEUCHOS_TEST_FOR_EXCEPTION(
!currTimeRange.isInRange(timepoint), std::logic_error,
"Error, timepoint = " << timepoint << " is not in the time range "
<< currTimeRange << "!" );
#endif
const Scalar tn = time_;
const int kused = usedOrder_;
// order of interpolation
int kord = kused;
if ( (kused == 0) || (timepoint == tn) ) {
kord = 1;
}
// Initialize interploation
Thyra::V_V(ptr(x_ptr),*xHistory_[0]);
Thyra::V_S(ptr(xdot_ptr),ST::zero());
// Add history array contributions
const Scalar delt = timepoint - tn;
Scalar c = ST::one(); // coefficient for interpolation of x
Scalar d = ST::zero(); // coefficient for interpolation of xdot
Scalar gam = delt/psi_[0]; // coefficient for interpolation
for (int j=1 ; j <= kord ; ++j) {
d = d*gam + c/psi_[j-1];
c = c*gam;
gam = (delt + psi_[j-1])/psi_[j];
Thyra::Vp_StV(ptr(x_ptr),c,*xHistory_[j]);
Thyra::Vp_StV(ptr(xdot_ptr),d,*xHistory_[j]);
}
// Set approximate accuracy
if (accuracy_ptr) {
*accuracy_ptr = Teuchos::ScalarTraits<Scalar>::pow(usedStep_,kord);
}
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::updateHistory_()
{
using Teuchos::as;
// Save Newton correction for potential order increase on next step.
if (usedOrder_ < maxOrder_) {
assign( xHistory_[usedOrder_+1].ptr(), *ee_ );
}
// Update history arrays
Vp_V( xHistory_[usedOrder_].ptr(), *ee_ );
for (int j=usedOrder_-1;j>=0;j--) {
Vp_V( xHistory_[j].ptr(), *xHistory_[j+1] );
}
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
Teuchos::OSTab ostab(out,1,"updateHistory_");
if (as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
for (int i=0;i<std::max(2,maxOrder_);++i) {
*out << "xHistory_[" << i << "] = " << std::endl;
xHistory_[i]->describe(*out,verbLevel);
}
}
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::restoreHistory_()
{
using Teuchos::as;
typedef Teuchos::ScalarTraits<Scalar> ST;
// undo preparation of history array for prediction
for (int i=nscsco_;i<=currentOrder_;++i) {
Vt_S( xHistory_[i].ptr(), ST::one()/beta_[i] );
}
for (int i=1;i<=currentOrder_;++i) {
psi_[i-1] = psi_[i] - hh_;
}
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
Teuchos::OSTab ostab(out,1,"restoreHistory_");
if (as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
for (int i=0;i<maxOrder_;++i) {
*out << "psi_[" << i << "] = " << psi_[i] << std::endl;
}
for (int i=0;i<maxOrder_;++i) {
*out << "xHistory_[" << i << "] = " << std::endl;
xHistory_[i]->describe(*out,verbLevel);
}
}
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::updateCoeffs_()
{
using Teuchos::as;
typedef Teuchos::ScalarTraits<Scalar> ST;
// If the number of steps taken with constant order and constant stepsize is
// more than the current order + 1 then we don't bother to update the
// coefficients because we've reached a constant step-size formula. When
// this is is not true, then we update the coefficients for the variable
// step-sizes.
if ((hh_ != usedStep_) || (currentOrder_ != usedOrder_)) {
nscsco_ = 0;
}
nscsco_ = std::min(nscsco_+1,usedOrder_+2);
if (currentOrder_+1 >= nscsco_) {
beta_[0] = ST::one();
alpha_[0] = ST::one();
Scalar temp1 = hh_;
gamma_[0] = ST::zero();
for (int i=1;i<=currentOrder_;++i) {
Scalar temp2 = psi_[i-1];
psi_[i-1] = temp1;
beta_[i] = beta_[i-1]*psi_[i-1]/temp2;
temp1 = temp2 + hh_;
alpha_[i] = hh_/temp1;
gamma_[i] = gamma_[i-1]+alpha_[i-1]/hh_;
}
psi_[currentOrder_] = temp1;
}
alpha_s_ = ST::zero();
for (int i=0;i<currentOrder_;++i) {
alpha_s_ = alpha_s_ - Scalar(ST::one()/(i+ST::one()));
}
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
Teuchos::OSTab ostab(out,1,"updateCoeffs_");
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
for (int i=0;i<=maxOrder_;++i) {
*out << "alpha_[" << i << "] = " << alpha_[i] << std::endl;
*out << "beta_[" << i << "] = " << beta_[i] << std::endl;
*out << "gamma_[" << i << "] = " << gamma_[i] << std::endl;
*out << "psi_[" << i << "] = " << psi_[i] << std::endl;
*out << "alpha_s_ = " << alpha_s_ << std::endl;
}
//std::cout << "alpha_s_ = " << alpha_s_ << std::endl;
//for (int i=0;i<=maxOrder_;++i) {
// std::cout << " alpha_[" << i << "] = " << alpha_[i] << std::endl;
// std::cout << " beta_[" << i << "] = " << beta_[i] << std::endl;
// std::cout << " gamma_[" << i << "] = " << gamma_[i] << std::endl;
// std::cout << " psi_[" << i << "] = " << psi_[i] << std::endl;
//}
}
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::initialize_()
{
using Teuchos::as;
typedef Teuchos::ScalarTraits<Scalar> ST;
using Thyra::createMember;
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
const bool doTrace = (as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH));
Teuchos::OSTab ostab(out,1,"initialize_");
if (doTrace) {
*out
<< "\nEntering " << this->Teuchos::Describable::description()
<< "::initialize_()...\n";
}
TEUCHOS_TEST_FOR_EXCEPT(model_ == Teuchos::null);
TEUCHOS_TEST_FOR_EXCEPT(solver_ == Teuchos::null);
TEUCHOS_ASSERT(haveInitialCondition_);
// Initialize Parameter List if none provided.
if (parameterList_ == Teuchos::null) {
RCP<Teuchos::ParameterList> emptyParameterList =
Teuchos::rcp(new Teuchos::ParameterList);
this->setParameterList(emptyParameterList);
}
// Initialize StepControl
if (stepControl_ == Teuchos::null) {
RCP<ImplicitBDFStepperStepControl<Scalar> > implicitBDFStepperStepControl =
Teuchos::rcp(new ImplicitBDFStepperStepControl<Scalar>());
RCP<Teuchos::ParameterList> stepControlPL =
Teuchos::sublist(parameterList_, RythmosStepControlSettings_name);
implicitBDFStepperStepControl->setParameterList(stepControlPL);
this->setStepControlStrategy(implicitBDFStepperStepControl);
}
stepControl_->initialize(*this);
maxOrder_ = stepControl_->getMaxOrder(); // maximum order
TEUCHOS_TEST_FOR_EXCEPTION(
!((1 <= maxOrder_) && (maxOrder_ <= 5)), std::logic_error,
"Error, maxOrder returned from stepControl_->getMaxOrder() = "
<< maxOrder_ << " is outside range of [1,5]!\n");
Scalar zero = ST::zero();
currentOrder_ = 1; // Current order of integration
usedOrder_ = 1; // order used in current step (used after currentOrder_
// is updated)
usedStep_ = zero;
nscsco_ = 0;
LETvalue_ = zero;
alpha_.clear(); // $\alpha_j(n)=h_n/\psi_j(n)$ coefficient used in
// local error test
// note: $h_n$ = current step size, n = current time step
gamma_.clear(); // calculate time derivative of history array for predictor
beta_.clear(); // coefficients used to evaluate predictor from history array
psi_.clear(); // $\psi_j(n) = t_n-t_{n-j}$ intermediary variable used to
// compute $\beta_j(n):$
for (int i=0 ; i<=maxOrder_ ; ++i) {
alpha_.push_back(zero);
beta_.push_back(zero);
gamma_.push_back(zero);
psi_.push_back(zero);
}
alpha_s_=Scalar(-ST::one()); // $\alpha_s$ fixed-leading coefficient of
// this BDF method
hh_=zero;
numberOfSteps_=0; // number of total time integration steps taken
nef_ = 0;
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
*out << "alpha_s_ = " << alpha_s_ << std::endl;
for (int i=0 ; i<=maxOrder_ ; ++i) {
*out << "alpha_[" << i << "] = " << alpha_[i] << std::endl;
*out << "beta_[" << i << "] = " << beta_[i] << std::endl;
*out << "gamma_[" << i << "] = " << gamma_[i] << std::endl;
*out << "psi_[" << i << "] = " << psi_[i] << std::endl;
}
*out << "numberOfSteps_ = " << numberOfSteps_ << std::endl;
}
// setInitialCondition initialized xHistory with xn0, xpn0.
// Now we add the rest of the vectors. Store maxOrder_+1 vectors
for (int i=2 ; i<=maxOrder_ ; ++i) {
xHistory_.push_back(createMember(xn0_->space()));
V_S(xHistory_[i].ptr(),zero);
}
isInitialized_ = true;
if (doTrace) {
*out
<< "\nLeaving " << this->Teuchos::Describable::description()
<< "::initialize_()...\n";
}
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::completeStep_()
{
using Teuchos::as;
#ifdef HAVE_RYTHMOS_DEBUG
typedef Teuchos::ScalarTraits<Scalar> ST;
TEUCHOS_TEST_FOR_EXCEPT(ST::isnaninf(hh_));
#endif
numberOfSteps_ ++;
nef_ = 0;
usedStep_ = hh_;
usedOrder_ = currentOrder_;
time_ += hh_;
RCP<Teuchos::FancyOStream> out = this->getOStream();
Teuchos::EVerbosityLevel verbLevel = this->getVerbLevel();
Teuchos::OSTab ostab(out,1,"completeStep_");
if ( as<int>(verbLevel) >= as<int>(Teuchos::VERB_HIGH) ) {
*out << "numberOfSteps_ = " << numberOfSteps_ << std::endl;
*out << "time_ = " << time_ << std::endl;
}
// 03/22/04 tscoffe: Note that updating the history has nothing to do with
// the step-size and everything to do with the newton correction vectors.
updateHistory_();
}
template<class Scalar>
void ImplicitBDFStepper<Scalar>::setStepControlData(
const StepperBase<Scalar> & stepper)
{
if (!isInitialized_) {
initialize_();
}
stepControl_->setStepControlData(stepper);
}
template<class Scalar>
const Thyra::SolveStatus<Scalar>& ImplicitBDFStepper<Scalar>::getNonlinearSolveStatus() const
{
return nonlinearSolveStatus_;
}
//
// Explicit Instantiation macro
//
// Must be expanded from within the Rythmos namespace!
//
#define RYTHMOS_IMPLICITBDF_STEPPER_INSTANT(SCALAR) \
\
template class ImplicitBDFStepper< SCALAR >; \
\
template RCP< ImplicitBDFStepper< SCALAR > > \
implicitBDFStepper(); \
\
template RCP< ImplicitBDFStepper< SCALAR > > \
implicitBDFStepper( \
const RCP<Thyra::ModelEvaluator< SCALAR > >& model, \
const RCP<Thyra::NonlinearSolverBase< SCALAR > >& solver, \
const RCP<Teuchos::ParameterList>& parameterList \
); \
} // namespace Rythmos
#endif //Rythmos_IMPLICITBDF_STEPPER_DEF_H
|