void
twoD_diffusion_problem<Scalar,MeshScalar,BasisScalar,LocalOrdinal,GlobalOrdinal,
Node>::
computeResponse(const Tpetra_Vector& x,
const Tpetra_Vector& p,
Tpetra_Vector& g)
{
// g = average of x
Teuchos::ArrayRCP<Scalar> g_view = g.get1dViewNonConst();
x.meanValue(g_view());
g_view[0] *= Scalar(x.getGlobalLength()) / Scalar(mesh.size());
}
void
Albany::SolutionAverageResponseFunction::
evaluateTangentT(const double alpha,
const double beta,
const double omega,
const double current_time,
bool sum_derivs,
const Tpetra_Vector* xdotT,
const Tpetra_Vector* xdotdotT,
const Tpetra_Vector& xT,
const Teuchos::Array<ParamVec>& p,
ParamVec* deriv_p,
const Tpetra_MultiVector* VxdotT,
const Tpetra_MultiVector* VxdotdotT,
const Tpetra_MultiVector* VxT,
const Tpetra_MultiVector* VpT,
Tpetra_Vector* gT,
Tpetra_MultiVector* gxT,
Tpetra_MultiVector* gpT)
{
// Evaluate response g
if (gT != NULL) {
ST mean = xT.meanValue();
Teuchos::ArrayRCP<ST> gT_nonconstView = gT->get1dViewNonConst();
gT_nonconstView[0] = mean;
}
// Evaluate tangent of g = dg/dx*Vx + dg/dxdot*Vxdot + dg/dp*Vp
// If Vx == NULL, Vx is the identity
if (gxT != NULL) {
Teuchos::ArrayRCP<ST> gxT_nonconstView;
if (VxT != NULL) {
Teuchos::Array<ST> means;
means.resize(VxT->getNumVectors());
VxT->meanValue(means());
for (int j=0; j<VxT->getNumVectors(); j++) {
gxT_nonconstView = gxT->getDataNonConst(j);
gxT_nonconstView[0] = means[j];
}
}
else {
gxT->putScalar(1.0/xT.getGlobalLength());
}
gxT->scale(alpha);
}
if (gpT != NULL)
gpT->putScalar(0.0);
}
void
Albany::SolutionMaxValueResponseFunction::
computeMaxValueT(const Tpetra_Vector& xT, double& global_max, int& global_index)
{
//The following is needed b/c Epetra_MaxDouble comes from Trilinos Epetra package.
double Tpetra_MaxDouble = 1.0E+100;
double my_max = -Tpetra_MaxDouble;
int my_index = -1, index;
Teuchos::ArrayRCP<const ST> xT_constView = xT.get1dView();
// Loop over nodes to find max value for equation eq
int num_my_nodes = xT.getLocalLength() / neq;
for (int node=0; node<num_my_nodes; node++) {
if (interleavedOrdering) index = node*neq+eq;
else index = node + eq*num_my_nodes;
if (xT_constView[index] > my_max) {
my_max = xT_constView[index];
my_index = index;
}
}
// Check remainder (AGS: NOT SURE HOW THIS CODE GETS CALLED?)
if (num_my_nodes*neq+eq < xT.getLocalLength()) {
if (interleavedOrdering) index = num_my_nodes*neq+eq;
else index = num_my_nodes + eq*num_my_nodes;
if (xT_constView[index] > my_max) {
my_max = xT_constView[index];
my_index = index;
}
}
Teuchos::RCP<const Teuchos::Comm<int> > commT = xT.getMap()->getComm();
// Get max value across all proc's
Teuchos::reduceAll(*commT, Teuchos::REDUCE_MAX, my_max, Teuchos::ptr(&global_max));
// Compute min of all global indices equal to max value
if (my_max == global_max)
my_index = xT.getMap()->getGlobalElement(my_index);
else
my_index = xT.getGlobalLength();
Teuchos::reduceAll(*commT, Teuchos::REDUCE_MIN, my_index, Teuchos::ptr(&global_index));
}
void
Albany::SolutionAverageResponseFunction::
evaluateGradientT(const double current_time,
const Tpetra_Vector* xdotT,
const Tpetra_Vector* xdotdotT,
const Tpetra_Vector& xT,
const Teuchos::Array<ParamVec>& p,
ParamVec* deriv_p,
Tpetra_Vector* gT,
Tpetra_MultiVector* dg_dxT,
Tpetra_MultiVector* dg_dxdotT,
Tpetra_MultiVector* dg_dxdotdotT,
Tpetra_MultiVector* dg_dpT)
{
// Evaluate response g
if (gT != NULL) {
ST mean = xT.meanValue();
Teuchos::ArrayRCP<ST> gT_nonconstView = gT->get1dViewNonConst();
gT_nonconstView[0] = mean;
}
// Evaluate dg/dx
if (dg_dxT != NULL)
dg_dxT->putScalar(1.0 / xT.getGlobalLength());
// Evaluate dg/dxdot
if (dg_dxdotT != NULL)
dg_dxdotT->putScalar(0.0);
if (dg_dxdotdotT != NULL)
dg_dxdotdotT->putScalar(0.0);
// Evaluate dg/dp
if (dg_dpT != NULL)
dg_dpT->putScalar(0.0);
}
