Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
00041
00042 #ifndef PLAYA_BLOCKTRIANGULARSOLVER_HPP
00043 #define PLAYA_BLOCKTRIANGULARSOLVER_HPP
00044
00045 #include "PlayaDefs.hpp"
00046 #include "PlayaLinearSolverDecl.hpp"
00047 #include "PlayaLinearCombinationDecl.hpp"
00048 #include "PlayaCommonOperatorsDecl.hpp"
00049
00050
00051 namespace Playa
00052 {
00053
00054 template <class Scalar>
00055 class BlockTriangularSolver : public LinearSolverBase<Scalar>,
00056 public Playa::Handleable<LinearSolverBase<Scalar> >
00057 {
00058 public:
00059
00060 BlockTriangularSolver(const LinearSolver<Scalar>& solver)
00061 : LinearSolverBase<Scalar>(ParameterList()), solvers_(tuple(solver)) {;}
00062
00063
00064 BlockTriangularSolver(const Array<LinearSolver<Scalar> >& solvers)
00065 : LinearSolverBase<Scalar>(ParameterList()), solvers_(solvers) {;}
00066
00067
00068 virtual ~BlockTriangularSolver(){;}
00069
00070
00071 virtual SolverState<Scalar> solve(const LinearOperator<Scalar>& op,
00072 const Vector<Scalar>& rhs,
00073 Vector<Scalar>& soln) const ;
00074
00075
00076 GET_RCP(LinearSolverBase<Scalar>);
00077 private:
00078 Array<LinearSolver<Scalar> > solvers_;
00079 };
00080
00081
00082 template <class Scalar> inline
00083 SolverState<Scalar> BlockTriangularSolver<Scalar>
00084 ::solve(const LinearOperator<Scalar>& op,
00085 const Vector<Scalar>& rhs,
00086 Vector<Scalar>& soln) const
00087 {
00088 int nRows = op.numBlockRows();
00089 int nCols = op.numBlockCols();
00090
00091 soln = op.domain().createMember();
00092
00093
00094 TEUCHOS_TEST_FOR_EXCEPTION(nRows != rhs.space().numBlocks(), std::runtime_error,
00095 "number of rows in operator " << op
00096 << " not equal to number of blocks on RHS "
00097 << rhs);
00098
00099 TEUCHOS_TEST_FOR_EXCEPTION(nRows != nCols, std::runtime_error,
00100 "nonsquare block structure in block triangular "
00101 "solver: nRows=" << nRows << " nCols=" << nCols);
00102
00103 bool isUpper = false;
00104 bool isLower = false;
00105
00106 for (int r=0; r<nRows; r++)
00107 {
00108 for (int c=0; c<nCols; c++)
00109 {
00110 if (op.getBlock(r,c).ptr().get() == 0 ||
00111 dynamic_cast<const SimpleZeroOp<Scalar>* >(op.getBlock(r,c).ptr().get()))
00112 {
00113 TEUCHOS_TEST_FOR_EXCEPTION(r==c, std::runtime_error,
00114 "zero diagonal block (" << r << ", " << c
00115 << " detected in block "
00116 "triangular solver. Operator is " << op);
00117 continue;
00118 }
00119 else
00120 {
00121 if (r < c) isUpper = true;
00122 if (c < r) isLower = true;
00123 }
00124 }
00125 }
00126
00127 TEUCHOS_TEST_FOR_EXCEPTION(isUpper && isLower, std::runtime_error,
00128 "block triangular solver detected non-triangular operator "
00129 << op);
00130
00131 bool oneSolverFitsAll = false;
00132 if ((int) solvers_.size() == 1 && nRows != 1)
00133 {
00134 oneSolverFitsAll = true;
00135 }
00136
00137 for (int i=0; i<nRows; i++)
00138 {
00139 int r = i;
00140 if (isUpper) r = nRows - 1 - i;
00141 Vector<Scalar> rhs_r = rhs.getBlock(r);
00142 for (int j=0; j<i; j++)
00143 {
00144 int c = j;
00145 if (isUpper) c = nCols - 1 - j;
00146 if (op.getBlock(r,c).ptr().get() != 0)
00147 {
00148 rhs_r = rhs_r - op.getBlock(r,c) * soln.getBlock(c);
00149 }
00150 }
00151
00152 SolverState<Scalar> state;
00153 Vector<Scalar> soln_r;
00154 if (oneSolverFitsAll)
00155 {
00156 state = solvers_[0].solve(op.getBlock(r,r), rhs_r, soln_r);
00157 }
00158 else
00159 {
00160 state = solvers_[r].solve(op.getBlock(r,r), rhs_r, soln_r);
00161 }
00162 if (nRows > 1) soln.setBlock(r, soln_r);
00163 else soln = soln_r;
00164 if (state.finalState() != SolveConverged)
00165 {
00166 return state;
00167 }
00168 }
00169
00170 return SolverState<Scalar>(SolveConverged, "block solves converged",
00171 0, ScalarTraits<Scalar>::zero());
00172 }
00173
00174 }
00175
00176 #endif