PlayaBlockTriangularSolver.hpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                 Playa: Programmable Linear Algebra
00005 //                 Copyright 2012 Sandia Corporation
00006 // 
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00008 // the U.S. Government retains certain rights in this software.
00009 //
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu)
00038 // 
00039 
00040 /* @HEADER@ */
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     //    bool converged = false;
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

Site Contact